treap
:leaves: :deciduous_tree: :fallen_leaf: Efficient implementation of the implicit treap data structure (by chshersh)
idx
maps, sets and vectors with on-demand secondary indexes. (by wotbrew)
| treap | idx | |
|---|---|---|
| - | 1 | |
| 63 | 78 | |
| - | - | |
| 1.8 | 0.0 | |
| over 3 years ago | over 4 years ago | |
| Haskell | Clojure | |
| Mozilla Public License 2.0 | MIT 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.
treap
Posts with mentions or reviews of treap.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning treap yet.
Tracking mentions began in Dec 2020.
idx
Posts with mentions or reviews of idx.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-04-17.
-
Doxa - a simple db that copies the functionality of datascript, using meander as a query tool
You might be able to use my library: https://github.com/wotbrew/idx. Would add a tiny cost for the pulls but you should be able to beat data-script on many queries (by using hash indexes directly to entry vs btree indexes to eid).
What are some alternatives?
When comparing treap and idx you can also consider the following projects:
red-black-tree - Red Black Trees implemented in Haskell
staticvec - Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.
IntervalMap - Haskell interval collections
portion - portion, a Python library providing data structure and operations for intervals.
fibonacci - 🔢 Fibonacci Utilities
hypopg - Hypothetical Indexes for PostgreSQL