Popularity

9.7

Stable

Activity

8.4

Stars 220

Watchers 12

Forks 98

Last Commit 26 days ago

Monthly Downloads: 1,013

Programming language: Haskell

License: BSD 3-clause "New" or "Revised" License

Tags: Data

Latest version: v0.2.13.0

unordered-containers alternatives and similar packages

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

semantic-source

10.0 9.6 unordered-containers VS semantic-source

Parsing, analyzing, and comparing source code across many languages
lens

10.0 7.0 unordered-containers VS lens

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

Less time debugging, more time building

Scout APM allows you to find and fix performance issues with no hassle. Now with error monitoring and external services monitoring, Scout is a developer's best friend when it comes to application development.

Promo scoutapm.com

hnix

9.9 9.7 unordered-containers VS hnix

A Haskell re-implementation of the Nix expression language
text

9.8 8.5 unordered-containers VS text

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

9.8 0.0 unordered-containers VS code-builder

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

9.7 0.4 unordered-containers VS compendium-client

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

9.7 6.8 unordered-containers VS Frames

Data frames for tabular data.
cassava

9.7 4.5 unordered-containers VS cassava

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

9.7 5.6 unordered-containers VS massiv

Efficient Haskell Arrays featuring Parallel computation
hashable

9.6 5.1 unordered-containers VS hashable

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

9.6 1.0 unordered-containers VS holmes

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

9.5 1.0 unordered-containers VS binary

Efficient, pure binary serialisation using ByteStrings in Haskell.
alfred-margaret

9.5 9.1 unordered-containers VS alfred-margaret

Fast Aho-Corasick string searching
refined

9.5 4.7 unordered-containers VS refined

Refinement types with static checking
jump

9.5 0.0 unordered-containers VS jump

Jump start your Haskell development
primitive

9.5 5.7 unordered-containers VS primitive

This package provides various primitive memory-related operations.
critbit

9.5 0.0 unordered-containers VS critbit

A Haskell implementation of crit-bit trees.
resource-pool

9.5 0.0 unordered-containers VS resource-pool

A high-performance striped resource pooling implementation for Haskell
discrimination

9.4 2.3 unordered-containers VS discrimination

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

9.4 1.0 unordered-containers VS aeson-qq

JSON quasiquoter for Haskell
hashtables

9.4 4.9 unordered-containers VS hashtables

Mutable hash tables for Haskell, in the ST monad
caledon

9.4 0.0 unordered-containers VS caledon

higher order dependently typed logic programing
json-autotype

9.4 3.1 unordered-containers VS json-autotype

Automatic Haskell type inference from JSON input
higgledy

9.4 0.0 unordered-containers VS higgledy

Higher-kinded data via generics
network-msgpack-rpc

9.4 unordered-containers VS network-msgpack-rpc

A MessagePack-RPC Implementation
data-msgpack

9.4 unordered-containers VS data-msgpack

A Haskell implementation of MessagePack
diskhash

9.3 2.0 unordered-containers VS diskhash

Diskbased (persistent) hashtable
audiovisual

9.3 6.1 unordered-containers VS audiovisual

Extensible records, variants, structs, effects, tangles
rei

9.3 0.0 unordered-containers VS rei

Process lists easily
IORefCAS

9.3 0.0 unordered-containers VS IORefCAS

A collection of different packages for CAS based data structures.
reflection

9.3 3.2 unordered-containers VS reflection

Reifies arbitrary Haskell terms into types that can be reflected back into terms
dependent-map

9.3 0.0 unordered-containers VS dependent-map

Dependently-typed finite maps (partial dependent products)
cereal

9.3 1.8 unordered-containers VS cereal

A binary serialization library
certificate

9.3 4.0 unordered-containers VS certificate

Certificate and Key Reader/Writer in haskell
dependent-sum

9.3 4.0 unordered-containers VS dependent-sum

Dependent sums and supporting typeclasses for comparing and displaying them
avro

9.2 5.7 unordered-containers VS avro

Haskell Avro Encoding and Decoding Native Support (no RPC)
stdio

9.2 0.3 unordered-containers VS stdio

Haskell Standard Input and Output
safecopy

9.2 1.5 unordered-containers VS safecopy

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

9.2 4.6 unordered-containers VS bifunctors

Haskell 98 bifunctors, bifoldables and bitraversables
protobuf

9.2 2.2 unordered-containers VS protobuf

An implementation of Google's Protocol Buffers in Haskell.
orgmode-parse

9.2 1.6 unordered-containers VS orgmode-parse

Attoparsec parser combinators for parsing org-mode structured text!
streaming

9.2 0.0 unordered-containers VS streaming

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

9.2 0.0 unordered-containers VS tables

Deprecated because of
text-icu

9.1 8.3 unordered-containers VS text-icu

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

9.1 4.3 unordered-containers VS typerep-map

⚡️Efficient implementation of Map with types as keys
uuid

9.1 0.0 unordered-containers VS uuid

A Haskell library for creating, printing and parsing UUIDs
witherable

9.1 2.9 unordered-containers VS witherable

Filter with effects
scientific

9.1 0.0 unordered-containers VS scientific

Arbitrary-precision floating-point numbers represented using scientific notation
uuid-types

9.1 0.0 unordered-containers VS uuid-types

A Haskell library for creating, printing and parsing UUIDs
b-tree

9.0 1.4 unordered-containers VS b-tree

Haskell on-disk B* tree implementation

Do you think we are missing an alternative of unordered-containers or a related project?

Add another 'Data' Package

Popular Comparisons

README

unordered-containers

Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed.

The declared cost of each operation is either worst-case or amortized, but remains valid even if structures are shared.

For developer and contributor documentation see the [Developer Guide](docs/developer-guide.md).