binary-orphans VS packer

Compare binary-orphans vs packer and see what are their differences.

binary-orphans

Orphan instances for binary (by haskellari)

packer

Fast serialization in haskell (by vincenthz)
Our great sponsors
  • SonarQube - Static code analysis for 29 languages.
  • InfluxDB - Access the most powerful time series database as a service
  • SaaSHub - Software Alternatives and Reviews
binary-orphans packer
0 0
12 13
- -
0.0 0.0
3 months ago about 3 years 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.

binary-orphans

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

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

packer

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

We haven't tracked posts mentioning packer yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing binary-orphans and packer you can also consider the following projects:

resource-pool - A high-performance striped resource pooling implementation for Haskell

refined - Refinement types with static checking

dependent-sum - Dependent sums and supporting typeclasses for comparing and displaying them

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

compendium-client - Mu (μ) is a purely functional framework for building micro services.

Frames - Data frames for tabular data.

critbit - A Haskell implementation of crit-bit trees.

binary-tagged - Tagged binary serialisation

MemoTrie - Trie-based memo functions

hashable - A class for types that can be converted to a hash value

dependent-map - Dependently-typed finite maps (partial dependent products)