binary-tagged VS packer

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

binary-tagged

Tagged binary serialisation (by phadej)

packer

Fast serialization in haskell (by vincenthz)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
binary-tagged packer
- -
5 13
- -
3.1 0.0
6 months ago almost 4 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-tagged

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

We haven't tracked posts mentioning binary-tagged 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-tagged and packer you can also consider the following projects:

binary-orphans - Orphan instances for binary

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

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

refined - Refinement types with static checking

Frames - Data frames for tabular data.

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

MemoTrie - Trie-based memo functions

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

critbit - A Haskell implementation of crit-bit trees.

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

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