minst-idx VS b-tree

Compare minst-idx vs b-tree and see what are their differences.

minst-idx

Read and write data in the IDX format used in e.g. the MNIST database (by schrammc)
Data
Source Code
Suggest alternative
Edit details

b-tree

Haskell on-disk B* tree implementation (by bgamari)
Data
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
minst-idx b-tree
- -
9 116
- -
0.0 1.8
about 1 year ago over 2 years ago
Haskell Haskell
GNU Lesser General Public License v3.0 only 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.

minst-idx

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

We haven't tracked posts mentioning minst-idx yet.
Tracking mentions began in Dec 2020.

b-tree

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

We haven't tracked posts mentioning b-tree yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing minst-idx and b-tree you can also consider the following projects:

massiv - Efficient Haskell Arrays featuring Parallel computation

hnix - A Haskell re-implementation of the Nix expression language

lens - Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens

hashmap - This package is deprecated in favor of unordered-containers.

audiovisual - Extensible records, variants, structs, effects, tangles

llrbtree - Left-leaning red-black trees

certificate - Certificate and Key Reader/Writer in haskell

elf - Parser for ELF object format.

binary - Efficient, pure binary serialisation using ByteStrings in Haskell.

hebrew-time - Hebrew dates and prayer times.

caledon - higher order dependently typed logic programing

cudd - Haskell bindings to the CUDD binary decision diagram library

minst-idx vs massiv b-tree vs hnix minst-idx vs lens b-tree vs hashmap minst-idx vs audiovisual b-tree vs llrbtree minst-idx vs certificate b-tree vs elf minst-idx vs binary b-tree vs hebrew-time minst-idx vs caledon b-tree vs cudd