unordered-containers VS llrbtree

Compare unordered-containers vs llrbtree and see what are their differences.


Efficient hashing-based container types (by haskell-unordered-containers)


Left-leaning red-black trees (by kazu-yamamoto)
Our great sponsors
  • Onboard AI - Learn any GitHub repo in 59 seconds
  • InfluxDB - Collect and Analyze Billions of Data Points in Real Time
  • SaaSHub - Software Alternatives and Reviews
unordered-containers llrbtree
1 0
224 48
0.9% -
0.0 0.0
about 2 months ago over 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 unordered-containers. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-09-11.


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 unordered-containers 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

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

dublincore-xml-conduit - XML streaming parser/renderer for the Dublin Core Metadata Element Set

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

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

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

refined - Refinement types with static checking

diskhash - Diskbased (persistent) hashtable

critbit - A Haskell implementation of crit-bit trees.

bson - Haskell representation and serialization of BSON documents (version 1.0) as defined at

compact - Compact regions library for Haskell