data-forest VS IntervalMap

Compare data-forest vs IntervalMap and see what are their differences.

Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
data-forest IntervalMap
- -
1 16
- -
3.0 2.3
10 months ago 11 months ago
Haskell Haskell
Apache 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.

data-forest

Posts with mentions or reviews of data-forest. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning data-forest 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 data-forest and IntervalMap you can also consider the following projects:

data-r-tree - Haskell implementatio of R-Trees

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

data-clist - A purely functional ring data structure for Haskell.

treap - :leaves: :deciduous_tree: :fallen_leaf: Efficient implementation of the implicit treap data structure

data-stringmap - Haskell Project to convert the PrefixTree of the Holumbus into it's own Hackage Packet

flatbuffers - An implementation of the flatbuffers protocol in Haskell.

phptree - An implementation of tree data structure

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

slist - ♾️ Sized list

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

C-structs - C-Struct Types for Haskell

json-autotype - Automatic Haskell type inference from JSON input