type-indexed-queues VS type-level-sets

Compare type-indexed-queues vs type-level-sets and see what are their differences.

type-indexed-queues

Queues with verified and unverified versions (by oisdk)

type-level-sets

Type-level sets for Haskell (with value-level counterparts and various operations) (by dorchard)
Our great sponsors
  • SonarLint - Deliver Cleaner and Safer Code - Right in Your IDE of Choice!
  • Scout APM - Less time debugging, more time building
  • JetBrains - Developer Ecosystem Survey 2022
type-indexed-queues type-level-sets
0 0
8 63
- -
0.0 5.5
about 5 years ago 5 months ago
Haskell Haskell
MIT 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.

type-indexed-queues

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

We haven't tracked posts mentioning type-indexed-queues 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 type-indexed-queues and type-level-sets you can also consider the following projects:

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

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

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

distributive - Dual Traversable

EdisonAPI - Edison: A Library of Efficient Data Structures

perfect-hash-generator - Perfect minimal hashing implementation in native Haskell

permutation - git import of patrick perry permutations lib from darcs

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

adjunctions - Simple adjunctions

representable-functors - representable functors

psqueues - Priority Search Queues in three different flavors for Haskell