uuid-quasi VS ulid

Compare uuid-quasi vs ulid and see what are their differences.

uuid-quasi

Haskell library for constant UUIDs in source code using quasi quotation (by lpeterse)

ulid

Haskell implementation of ULIDs (Unique Lexicographically Sortable Identifiers) (by ad-si)
Our great sponsors
  • InfluxDB - Build time-series-based applications quickly and at scale.
  • SonarLint - Clean code begins in your IDE with SonarLint
  • SaaSHub - Software Alternatives and Reviews
uuid-quasi ulid
0 0
4 24
- -
0.0 4.1
about 5 years ago 9 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

uuid-quasi

Posts with mentions or reviews of uuid-quasi. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning uuid-quasi yet.
Tracking mentions began in Dec 2020.

ulid

Posts with mentions or reviews of ulid. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning ulid yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing uuid-quasi and ulid you can also consider the following projects:

uuid - A Haskell library for creating, printing and parsing UUIDs

primitive - This package provides various primitive memory-related operations.

semantic-source - Parsing, analyzing, and comparing source code across many languages

unordered-containers - Efficient hashing-based container types

hashable - A class for types that can be converted to a hash value

compendium-client - Mu (μ) is a purely functional framework for building micro services.

lens - Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens

critbit - A Haskell implementation of crit-bit trees.

alfred-margaret - Fast Aho-Corasick string searching

uuid-bytes

cassava - A CSV parsing and encoding library optimized for ease of use and high performance

binary - Efficient, pure binary serialisation using ByteStrings in Haskell.