bitset VS functor-friends

Compare bitset vs functor-friends and see what are their differences.

bitset

A compact functional set data structure (by lambda-llama)

functor-friends

Friendly helpers for your recursion schemes. (by matt-noonan)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
bitset functor-friends
0 0
12 3
- -
0.0 0.0
almost 3 years ago over 6 years 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.

bitset

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

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

functor-friends

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

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

What are some alternatives?

When comparing bitset and functor-friends you can also consider the following projects:

btree-concurrent - A backend agnostic, concurrent BTree written in Haskell

monadic-arrays - MArray instances for monad transformers

nonempty-containers - Efficient non-empty variants of containers data types, with full API

DrIFT - A mirror of DrIFT.

containers - Assorted concrete container types

justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.

claferIG - Support for reasoning on Clafer models by instantiation and counter example generation.

heaps - Asymptotically optimal Brodal/Okasaki heaps

repa-array - High performance, regular, shape polymorphic parallel arrays.

naperian - Efficient representable functors

distributive - Dual Traversable

void - Provides Data.Void, which is in base since ghc 7.8 or so