IntervalMap VS treap

Compare IntervalMap vs treap and see what are their differences.

IntervalMap

Haskell interval collections (by bokesan)
Data Haskell haskell-library Interval Set Map Hackage Tree red-black-tree
Source Code
Suggest alternative
Edit details

treap

:leaves: :deciduous_tree: :fallen_leaf: Efficient implementation of the implicit treap data structure (by chshersh)
Data Structure Haskell Algorithms datastructure treap Tree Monoid homomorphism
Source Code
Suggest alternative
Edit details
InfluxDB
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
IntervalMap treap
- -
16 63
- -
2.3 1.8
11 months 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.

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:

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

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

flatbuffers - An implementation of the flatbuffers protocol in Haskell.

fibonacci - 🔢 Fibonacci Utilities

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

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

IntGraph - Dynamically sized graphs

C-structs - C-Struct Types for Haskell

fibonacci - Fast computation of Fibonacci numbers in Haskell

json-autotype - Automatic Haskell type inference from JSON input

IntervalMap vs hashable treap vs red-black-tree IntervalMap vs flatbuffers treap vs fibonacci IntervalMap vs bytestring-trie treap vs idx IntervalMap vs appendmap treap vs IntGraph IntervalMap vs C-structs treap vs fibonacci IntervalMap vs json-autotype