IntervalMap
Haskell interval collections (by bokesan)
hashable
A class for types that can be converted to a hash value (by tibbe)
Our great sponsors
| IntervalMap | hashable | |
|---|---|---|
| - | - | |
| 16 | 99 | |
| - | - | |
| 2.3 | 5.7 | |
| 11 months ago | 20 days 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.
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.
hashable
Posts with mentions or reviews of hashable.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning hashable yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing IntervalMap and hashable you can also consider the following projects:
treap - :leaves: :deciduous_tree: :fallen_leaf: Efficient implementation of the implicit treap data structure
hnix - A Haskell re-implementation of the Nix expression language