red-black-tree
Red Black Trees implemented in Haskell (by GAumala)
treap
:leaves: :deciduous_tree: :fallen_leaf: Efficient implementation of the implicit treap data structure (by chshersh)
Our great sponsors
| red-black-tree | treap | |
|---|---|---|
| - | - | |
| 5 | 63 | |
| - | - | |
| 0.0 | 1.8 | |
| almost 3 years ago | over 2 years ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | Mozilla Public License 2.0 |
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.
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.
red-black-tree
Posts with mentions or reviews of red-black-tree.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning red-black-tree yet.
Tracking mentions began in Dec 2020.
treap
Posts with mentions or reviews of treap.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning treap yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing red-black-tree and treap you can also consider the following projects:
IntGraph - Dynamically sized graphs
fibonacci - 🔢 Fibonacci Utilities
immutable-js - Immutable persistent data collections for Javascript which increase efficiency and simplicity.
IntervalMap - Haskell interval collections
Immer - Create the next immutable state by mutating the current one
idx - maps, sets and vectors with on-demand secondary indexes.
fibonacci - Fast computation of Fibonacci numbers in Haskell