minst-idx VS binary

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


Read and write data in the IDX format used in e.g. the MNIST database (by schrammc)


Efficient, pure binary serialisation using ByteStrings in Haskell. (by kolmodin)
Our great sponsors
  • InfluxDB - Collect and Analyze Billions of Data Points in Real Time
  • Onboard AI - Learn any GitHub repo in 59 seconds
  • SaaSHub - Software Alternatives and Reviews
minst-idx binary
0 2
9 102
- -
0.0 0.0
9 months ago 3 months ago
Haskell Haskell
GNU Lesser General Public License v3.0 only GNU General Public License v3.0 or later
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.


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.


Posts with mentions or reviews of binary. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-04-08.

What are some alternatives?

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

massiv - Efficient Haskell Arrays featuring Parallel computation

boring - Boring and Absurd types


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


binary-bits - Binary serialization at the bit level on top of the binary package

observable-sharing - Observable sharing for haskell

vcd - A small library for generating VCD files.

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

zm - Language independent, reproducible, absolute types.

caledon - higher order dependently typed logic programing

Boolean - Generalized booleans