IntervalMap VS treap

Compare IntervalMap vs treap and see what are their differences.

treap

:leaves: :deciduous_tree: :fallen_leaf: Efficient implementation of the implicit treap data structure (by chshersh)
Our great sponsors
  • Mergify - Updating dependencies is time-consuming.
  • InfluxDB - Collect and Analyze Billions of Data Points in Real Time
  • SonarQube - Static code analysis for 29 languages.
IntervalMap treap
0 0
15 63
- -
0.0 1.9
4 months ago about 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.

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.

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 IntervalMap and treap you can also consider the following projects:

red-black-tree - Red Black Trees implemented in Haskell

hashable - A class for types that can be converted to a hash value

fibonacci - 🔢 Fibonacci Utilities

flatbuffers - An implementation of the flatbuffers protocol in Haskell.

bytestring-trie - An efficient finite map from (byte)strings to values.

fibonacci - Fast computation of Fibonacci numbers in Haskell

appendmap - A Data.Map wrapper with a Monoid instance that delegates to the individual keys

idx - maps, sets and vectors with on-demand secondary indexes.

C-structs - C-Struct Types for Haskell

IntGraph - Dynamically sized graphs

json-autotype - Automatic Haskell type inference from JSON input