IntervalMap VS appendmap

Compare IntervalMap vs appendmap 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

appendmap

A Data.Map wrapper with a Monoid instance that delegates to the individual keys (by koterpillar)
Data structures Haskell Monoid Semigroup Map Containers
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 appendmap
- -
16 2
- -
2.3 0.0
11 months ago about 3 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License 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.

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.

appendmap

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

We haven't tracked posts mentioning appendmap yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing IntervalMap and appendmap you can also consider the following projects:

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

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

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

map-exts

flatbuffers - An implementation of the flatbuffers protocol in Haskell.

map-classes

co-log - 📓 Flexible and configurable modern #Haskell logging framework

C-structs - C-Struct Types for Haskell

containers-verified - A package re-exporting the verified subset of containers

json-autotype - Automatic Haskell type inference from JSON input

unpacked-containers - Unpacked containers using backpack

IntervalMap vs hashable appendmap vs bytestring-trie IntervalMap vs treap appendmap vs map-exts IntervalMap vs flatbuffers appendmap vs map-classes IntervalMap vs bytestring-trie appendmap vs co-log IntervalMap vs C-structs appendmap vs containers-verified IntervalMap vs json-autotype appendmap vs unpacked-containers