tree-diff VS IntervalMap

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

tree-diff

Diffing of (expression) trees. (by haskellari)
Our great sponsors
  • SonarQube - Static code analysis for 29 languages.
  • Scout APM - Truly a developer’s best friend
  • Zigi - Workflow assistant built for devs & their teams
  • InfluxDB - Build time-series-based applications quickly and at scale.
tree-diff IntervalMap
0 0
68 13
- -
1.7 0.0
4 months ago about 2 years ago
Haskell Haskell
GNU General Public License v2.0 or later 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:

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

tree-traversals - Functions and newtype wrappers for traversing Trees

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

tree-render-text

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