Nat and Fin

fin alternatives and similar packages

Based on the "Data" category

• lens

  10.0 7.9 fin VS lens

  Lenses, Folds and Traversals

• hnix

  9.9 9.1 fin VS hnix

  Haskell implementation of the Nix language

• code-builder

  9.8 0.4 fin VS code-builder

  Simple system for generating code.

• cassava

  9.7 0.3 fin VS cassava

  A CSV parsing and encoding library

• Frames

  9.7 5.4 fin VS Frames

  Data frames For working with tabular data files

• text

  9.7 5.8 fin VS text

  An efficient packed Unicode text type.

• massiv

  9.6 9.2 fin VS massiv

  Massiv (Массив) is an Array Library.

• unordered-containers

  9.6 4.2 fin VS unordered-containers

  Efficient hashing-based container types

• jump

  9.5 0.0 fin VS jump

  Nothing to see here, move along

• reedsolomon

  9.5 0.0 fin VS reedsolomon

  Reed-Solomon Erasure Coding in Haskell

• critbit

  9.5 0.0 fin VS critbit

  Crit-bit maps and sets

• binary

  9.4 5.8 fin VS binary

  Binary serialisation for Haskell values using lazy ByteStrings

• primitive

  9.4 7.3 fin VS primitive

  Primitive memory-related operations

• data-msgpack

  9.4 2.7 fin VS data-msgpack

  A Haskell implementation of MessagePack

• aeson-qq

  9.4 0.0 fin VS aeson-qq

  JSON quasiquoter for Haskell

• hashable

  9.4 6.5 fin VS hashable

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

• hashtables

  9.4 6.2 fin VS hashtables

  Mutable hash tables in the ST monad

• network-msgpack-rpc

  9.4 2.6 fin VS network-msgpack-rpc

  A MessagePack-RPC Implementation

• discrimination

  9.4 2.7 fin VS discrimination

  Fast generic linear-time sorting, joins and container construction.

• resource-pool

  9.3 0.0 fin VS resource-pool

  A high-performance striped resource pooling implementation

• rei

  9.3 0.0 fin VS rei

  Process lists easily

• cereal

  9.3 3.5 fin VS cereal

  A binary serialization library

• caledon

  9.3 0.4 fin VS caledon

  a logic programming language based on the calculus of constructions

• IORefCAS

  9.3 3.3 fin VS IORefCAS

  Atomic compare and swap for IORefs and STRefs.

• reflection

  9.3 5.0 fin VS reflection

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

• protobuf

  9.2 0.0 fin VS protobuf

  Google Protocol Buffers via GHC.Generics

• certificate

  9.2 5.8 fin VS certificate

  Certificates and Key Reader/Writer

• audiovisual

  9.2 6.9 fin VS audiovisual

  A battery-included audiovisual framework

• tables

  9.2 0.0 fin VS tables

  In-memory storage with multiple keys using lenses and traversals

• streaming

  9.2 0.0 fin VS streaming

  an elementary streaming prelude and general stream type.

• bifunctors

  9.1 5.2 fin VS bifunctors

  Bifunctors

• refined

  9.1 7.2 fin VS refined

  Refinement types with static and runtime checking

• json-autotype

  9.1 7.1 fin VS json-autotype

  Automatic type declaration for JSON input data

• safecopy

  9.1 5.6 fin VS safecopy

  Binary serialization with version control.

• avro

  9.0 7.8 fin VS avro

  Avro serialization support for Haskell

• orgmode-parse

  9.0 3.0 fin VS orgmode-parse

  A collection of Attoparsec combinators for parsing org-mode flavored documents.

• aig

  9.0 3.3 fin VS aig

  And-inverter graphs in Haskell.

• diskhash

  8.9 0.0 fin VS diskhash

  Disk-based hash table

• structures

  8.9 0.0 fin VS structures

  "Advanced" Data Structures

• scientific

  8.8 0.0 fin VS scientific

  Numbers represented using scientific notation

• netlist-to-vhdl

  8.8 0.1 fin VS netlist-to-vhdl

  Convert a Netlist AST to VHDL

• text-icu

  8.8 0.0 fin VS text-icu

  Bindings to the ICU library

• b-tree

  8.8 0.6 fin VS b-tree

  Immutable disk-based B* trees

• abcBridge

  8.8 5.1 fin VS abcBridge

  Bindings for ABC, A System for Sequential Synthesis and Verification

• uuid-types

  8.7 1.5 fin VS uuid-types

  Type definitions for Universally Unique Identifiers

• thyme

  8.7 0.0 fin VS thyme

  A faster time library

• packman

  8.7 0.3 L1 fin VS packman

  Serialization library for GHC

• bloomfilter

  8.7 0.0 fin VS bloomfilter

  Pure and impure Bloom Filter implementations.

• tagged

  8.7 3.8 fin VS tagged

  Haskell 98 phantom types to avoid unsafely passing dummy arguments

• compact

  8.7 0.6 fin VS compact

  Non-GC'd, contiguous storage for immutable data structures

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.

Do you think we are missing an alternative of fin or a related project?

Monitor and correlate metrics, traces, and logs in one platform. Free 14-day trial. More from our partner

Popular Comparisons

• radius
  vs
  network-address
• boring
  vs
  binary
• base58string
  vs
  json-autotype
• json-autotype
  vs
  CBOR
• safecopy
  vs
  boring

SaaSHub - Software Alternatives and Reviews More from our team