cereal VS llrbtree

Compare cereal vs llrbtree and see what are their differences.


Left-leaning red-black trees (by kazu-yamamoto)
Our great sponsors
  • SonarLint - Clean code begins in your IDE with SonarLint
  • InfluxDB - Access the most powerful time series database as a service
  • SaaSHub - Software Alternatives and Reviews
cereal llrbtree
1 0
75 48
- -
3.9 0.0
4 months ago almost 11 years 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.


Posts with mentions or reviews of cereal. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-11-13.


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

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

What are some alternatives?

When comparing cereal and llrbtree you can also consider the following projects:

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

massiv - Efficient Haskell Arrays featuring Parallel computation

between - Function combinator "between" and derived combinators.

encode-string - String encoding and decoding in Haskell

CTRex - Open records for Haskell

audiovisual - Extensible records, variants, structs, effects, tangles

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

cereal-time - Serialize instances for types from `time` package.

b-tree - Haskell on-disk B* tree implementation

aig - Provides an interface for AIGs and word-level operations on them

critbit - A Haskell implementation of crit-bit trees.