hashmap alternatives and similar packages
Based on the "Data" category.
Alternatively, view hashmap alternatives based on common mentions on social networks and blogs.
-
semantic-source
Parsing, analyzing, and comparing source code across many languages -
lens
Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens -
code-builder
Packages for defining APIs, running them, generating client code and documentation. -
text
Haskell library for space- and time-efficient operations over Unicode text. -
compendium-client
Mu (μ) is a purely functional framework for building micro services. -
unordered-containers
Efficient hashing-based container types -
cassava
A CSV parsing and encoding library optimized for ease of use and high performance -
holmes
A reference library for constraint-solving with propagators and CDCL. -
resource-pool
A high-performance striped resource pooling implementation for Haskell -
primitive
This package provides various primitive memory-related operations. -
discrimination
Fast linear time sorting and discrimination for a large class of data types -
reflection
Reifies arbitrary Haskell terms into types that can be reflected back into terms -
dependent-sum
Dependent sums and supporting typeclasses for comparing and displaying them -
dependent-map
Dependently-typed finite maps (partial dependent products) -
IORefCAS
A collection of different packages for CAS based data structures. -
streaming
An optimized general monad transformer for streaming applications, with a simple prelude of functions -
orgmode-parse
Attoparsec parser combinators for parsing org-mode structured text! -
scientific
Arbitrary-precision floating-point numbers represented using scientific notation -
text-icu
This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.
WorkOS - The modern identity platform for B2B SaaS
Do you think we are missing an alternative of hashmap or a related project?
Popular Comparisons
README
hashmap
:warning: Deprecated in favor of unordered-containers
An implementation of persistent Map
and Set
containers based on hashing. The implementation is build on top of Data.IntMap.IntMap
and Data.IntSet.IntSet
, with very similar API. It uses Hashable
class from the hashable
package for hashing.
This package can be used as a drop-in replacement for Data.Map
and Data.Set
modules.
The Map key value
is an Data.IntMap.IntMap
indexed by the hash value, containing either one (key
, value
) or a Data.Map.Map key value
for all keys with the same hash value.
The Set elem
is an Data.IntMap.IntMap
indexed by the hash value, containing either one elem
or Data.Set.Set elem
for all elements with the same hash value.
*Note that all licence references and agreements mentioned in the hashmap README section above
are relevant to that project's source code only.