tree-diff VS IntervalMap

Compare tree-diff vs IntervalMap and see what are their differences.

tree-diff

Diffing of (expression) trees. (by haskellari)
Data Tree
Source Code
Suggest alternative
Edit details

IntervalMap

Haskell interval collections (by bokesan)
Data Haskell haskell-library Interval Set Map Hackage Tree red-black-tree
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
tree-diff IntervalMap
- -
73 16
- -
4.2 2.3
2 months ago 11 months ago
Haskell Haskell
GNU General Public License v3.0 only 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.

tree-diff

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

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

tree-traversals - Functions and newtype wrappers for traversing Trees

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

tree-render-text

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

semantic-source - Parsing, analyzing, and comparing source code across many languages

flatbuffers - An implementation of the flatbuffers protocol in Haskell.

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

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

tree-diff vs tree-traversals IntervalMap vs hashable tree-diff vs tree-render-text IntervalMap vs treap tree-diff vs semantic-source IntervalMap vs flatbuffers IntervalMap vs bytestring-trie IntervalMap vs appendmap IntervalMap vs C-structs IntervalMap vs json-autotype