byte-order alternatives and similar packages

Based on the "Data" category.
Alternatively, view byte-order alternatives based on common mentions on social networks and blogs.

• semantic-source

  10.0 7.4 byte-order VS semantic-source

  Parsing, analyzing, and comparing source code across many languages
  

• lens

  10.0 6.6 byte-order VS lens

  Lenses, Folds, and Traversals - Join us on freenode #haskell-lens

Run Linux Software Faster and Safer than Linux with Unikernels

Promo github.com/nanovms



• hnix

  9.9 9.8 byte-order VS hnix

  A Haskell re-implementation of the Nix expression language
  

• code-builder

  9.8 0.0 byte-order VS code-builder

  Packages for defining APIs, running them, generating client code and documentation.
  

• text

  9.8 8.9 byte-order VS text

  Haskell library for space- and time-efficient operations over Unicode text.
  

• massiv

  9.7 8.4 byte-order VS massiv

  Efficient Haskell Arrays featuring Parallel computation

• Frames

  9.7 6.1 byte-order VS Frames

  Data frames for tabular data.

• cassava

  9.7 0.0 byte-order VS cassava

  A CSV parsing and encoding library optimized for ease of use and high performance
  

• unordered-containers

  9.7 3.3 byte-order VS unordered-containers

  Efficient hashing-based container types
  

• holmes

  9.6 0.4 byte-order VS holmes

  A reference library for constraint-solving with propagators and CDCL.

• compendium-client

  9.6 6.5 byte-order VS compendium-client

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

• higgledy

  9.5 2.4 byte-order VS higgledy

  Higher-kinded data via generics

• primitive

  9.5 5.7 byte-order VS primitive

  This package provides various primitive memory-related operations.
  

• hashable

  9.5 7.1 byte-order VS hashable

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

• refined

  9.5 2.8 byte-order VS refined

  Refinement types with static checking

• critbit

  9.5 0.0 byte-order VS critbit

  A Haskell implementation of crit-bit trees.
  

• jump

  9.5 0.0 byte-order VS jump

  Jump start your Haskell development
  

• resource-pool

  9.5 0.0 byte-order VS resource-pool

  A high-performance striped resource pooling implementation for Haskell

• alfred-margaret

  9.5 0.3 byte-order VS alfred-margaret

  Fast Aho-Corasick string searching
  

• binary

  9.5 3.2 byte-order VS binary

  Efficient, pure binary serialisation using ByteStrings in Haskell.

• dependent-map

  9.4 0.0 byte-order VS dependent-map

  Dependently-typed finite maps (partial dependent products)
  

• network-msgpack-rpc

  9.4 byte-order VS network-msgpack-rpc

  A MessagePack-RPC Implementation

• discrimination

  9.4 3.4 byte-order VS discrimination

  Fast linear time sorting and discrimination for a large class of data types

• caledon

  9.4 0.0 byte-order VS caledon

  higher order dependently typed logic programing

• data-msgpack

  9.4 byte-order VS data-msgpack

  A Haskell implementation of MessagePack

• IORefCAS

  9.4 1.2 byte-order VS IORefCAS

  A collection of different packages for CAS based data structures.

• json-autotype

  9.4 0.4 byte-order VS json-autotype

  Automatic Haskell type inference from JSON input
  

• aeson-qq

  9.4 0.0 byte-order VS aeson-qq

  JSON quasiquoter for Haskell

• dependent-sum

  9.4 0.6 byte-order VS dependent-sum

  Dependent sums and supporting typeclasses for comparing and displaying them
  

• hashtables

  9.4 1.0 byte-order VS hashtables

  Mutable hash tables for Haskell, in the ST monad

• reflection

  9.3 4.5 byte-order VS reflection

  Reifies arbitrary Haskell terms into types that can be reflected back into terms

• rei

  9.3 0.0 byte-order VS rei

  Process lists easily

• audiovisual

  9.3 4.8 byte-order VS audiovisual

  Extensible records, variants, structs, effects, tangles

• diskhash

  9.3 1.1 byte-order VS diskhash

  Diskbased (persistent) hashtable

• cereal

  9.3 0.0 byte-order VS cereal

  A binary serialization library
  

• stdio

  9.2 0.1 byte-order VS stdio

  Haskell Standard Input and Output
  

• certificate

  9.2 1.3 byte-order VS certificate

  Certificate and Key Reader/Writer in haskell

• bifunctors

  9.2 6.8 byte-order VS bifunctors

  Haskell 98 bifunctors, bifoldables and bitraversables

• orgmode-parse

  9.2 0.0 byte-order VS orgmode-parse

  Attoparsec parser combinators for parsing org-mode structured text!

• tables

  9.2 0.0 byte-order VS tables

  Deprecated because of

• avro

  9.2 4.0 byte-order VS avro

  Haskell Avro Encoding and Decoding Native Support (no RPC)
  

• streaming

  9.2 0.0 byte-order VS streaming

  An optimized general monad transformer for streaming applications, with a simple prelude of functions

• protobuf

  9.2 0.0 byte-order VS protobuf

  An implementation of Google's Protocol Buffers in Haskell.
  

• safecopy

  9.2 3.0 byte-order VS safecopy

  An extension to Data.Serialize with built-in version control
  

• witherable

  9.1 4.5 byte-order VS witherable

  Filter with effects

• text-icu

  9.1 1.6 byte-order VS text-icu

  This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.
  

• uuid-types

  9.1 3.7 byte-order VS uuid-types

  A Haskell library for creating, printing and parsing UUIDs
  

• typerep-map

  9.1 3.2 byte-order VS typerep-map

  ⚡️Efficient implementation of Map with types as keys
  

• uuid

  9.1 3.7 byte-order VS uuid

  A Haskell library for creating, printing and parsing UUIDs
  

• b-tree

  9.0 0.0 byte-order VS b-tree

  Haskell on-disk B* tree implementation

Do you think we are missing an alternative of byte-order or a related project?

Scout APM: A developer's best friend. Try free for 14-days sponsored scoutapm.com

Popular Comparisons

• CBOR
  vs
  protobuf
• radius
  vs
  network-address
• boring
  vs
  binary
• binary
  vs
  boring
• avro
  vs
  protobuf

SaaSHub - Software Alternatives and Reviews sponsored www.saashub.com