treap VS IntervalMap

Compare treap vs IntervalMap 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
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
treap IntervalMap
- -
63 16
- -
1.8 2.3
over 2 years ago 11 months 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.

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

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.

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

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

IntGraph - Dynamically sized graphs

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

fibonacci - Fast computation of Fibonacci numbers in Haskell

C-structs - C-Struct Types for Haskell

json-autotype - Automatic Haskell type inference from JSON input