treap
:leaves: :deciduous_tree: :fallen_leaf: Efficient implementation of the implicit treap data structure (by chshersh)
IntervalMap
Haskell interval collections (by bokesan)
| treap | IntervalMap | |
|---|---|---|
| - | - | |
| 63 | 17 | |
| - | - | |
| 1.8 | 2.3 | |
| over 3 years ago | almost 2 years ago | |
| Haskell | Haskell | |
| Mozilla Public License 2.0 | 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.
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.
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.
IntervalMap
Posts with mentions or reviews of IntervalMap.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning IntervalMap yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing treap and IntervalMap you can also consider the following projects:
red-black-tree - Red Black Trees implemented in Haskell
bytestring-trie - An efficient finite map from (byte)strings to values.
fibonacci - 🔢 Fibonacci Utilities
hashable - A class for types that can be converted to a hash value
idx - maps, sets and vectors with on-demand secondary indexes.
appendmap - A Data.Map wrapper with a Monoid instance that delegates to the individual keys