primitive
This package provides various primitive memory-related operations. (by haskell)
sequential-index
[Haskell] Sequential index numbers between 0.0 and 1.0 that allow arbitrarily inserting new numbers in between (for special containers). (by aristidb)
primitive | sequential-index | |
---|---|---|
- | - | |
117 | 2 | |
0.0% | - | |
5.2 | 0.0 | |
4 months ago | over 12 years ago | |
Haskell | Haskell | |
GNU General Public License v3.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.
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.
primitive
Posts with mentions or reviews of primitive.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning primitive yet.
Tracking mentions began in Dec 2020.
sequential-index
Posts with mentions or reviews of sequential-index.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning sequential-index yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing primitive and sequential-index you can also consider the following projects:
CTRex - Open records for Haskell
tables - Deprecated because of
llrbtree - Left-leaning red-black trees
reflection - Reifies arbitrary Haskell terms into types that can be reflected back into terms
thyme
unordered-containers - Efficient hashing-based container types