perfect-hash-generator VS type-level-sets

Compare perfect-hash-generator vs type-level-sets and see what are their differences.

perfect-hash-generator

Perfect minimal hashing implementation in native Haskell (by kostmo)

type-level-sets

Type-level sets for Haskell (with value-level counterparts and various operations) (by dorchard)
Our great sponsors
  • SonarLint - Clean code begins in your IDE with SonarLint
  • Zigi - The context switching struggle is real
  • InfluxDB - Build time-series-based applications quickly and at scale.
  • Scout APM - Truly a developer’s best friend
perfect-hash-generator type-level-sets
0 0
2 64
- -
0.0 2.3
5 months ago 4 months ago
Haskell Haskell
Apache License 2.0 BSD 2-clause "Simplified" 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.

perfect-hash-generator

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

We haven't tracked posts mentioning perfect-hash-generator yet.
Tracking mentions began in Dec 2020.

type-level-sets

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

We haven't tracked posts mentioning type-level-sets yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing perfect-hash-generator and type-level-sets you can also consider the following projects:

type-level-bst - Type-Level Binary Search Tree in Haskell

EdisonAPI - Edison: A Library of Efficient Data Structures

miso - :ramen: A tasty Haskell front-end framework

distributive - Dual Traversable

type-indexed-queues - Queues with verified and unverified versions

selections - Haskell Package for operating with selections over an underlying functor

adjunctions - Simple adjunctions

permutation - git import of patrick perry permutations lib from darcs

psqueues - Priority Search Queues in three different flavors for Haskell

fgl - A Functional Graph Library for Haskell

graph-wrapper - A wrapper around the standard Data.Graph with a less awkward interface

containers - Assorted concrete container types