linkedhashmap

Persistent LinkedHashMap data structure

Source Code Changelog

Suggest Changes

Popularity

1.7

Stable

Activity

0.0

Stable

Stars 2

Watchers 1

Forks 2

Last Commit over 1 year ago

Monthly Downloads: 22

Programming language: Haskell

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

Tags: Data

linkedhashmap alternatives and similar packages

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

semantic-source

10.0 9.1 linkedhashmap VS semantic-source

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

10.0 6.8 linkedhashmap VS lens

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

InfluxDB - Power Real-Time Data Analytics at Scale

Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

Promo www.influxdata.com

hnix

9.9 6.8 linkedhashmap VS hnix

A Haskell re-implementation of the Nix expression language
code-builder

9.8 0.0 linkedhashmap VS code-builder

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

9.8 8.4 linkedhashmap VS text

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

9.7 0.0 linkedhashmap VS compendium-client

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

9.7 5.0 linkedhashmap VS unordered-containers

Efficient hashing-based container types
Frames

9.7 6.1 linkedhashmap VS Frames

Data frames for tabular data.
massiv

9.7 5.9 linkedhashmap VS massiv

Efficient Haskell Arrays featuring Parallel computation
cassava

9.7 5.9 linkedhashmap VS cassava

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

9.6 0.0 linkedhashmap VS holmes

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

9.5 0.0 linkedhashmap VS resource-pool

A high-performance striped resource pooling implementation for Haskell
hashable

9.5 5.7 linkedhashmap VS hashable

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

9.5 3.5 linkedhashmap VS alfred-margaret

Fast Aho-Corasick string searching
refined

9.5 1.5 linkedhashmap VS refined

Refinement types with static checking
critbit

9.5 0.0 linkedhashmap VS critbit

A Haskell implementation of crit-bit trees.
primitive

9.5 5.9 linkedhashmap VS primitive

This package provides various primitive memory-related operations.
binary

9.5 4.3 linkedhashmap VS binary

Efficient, pure binary serialisation using ByteStrings in Haskell.
higgledy

9.4 2.2 linkedhashmap VS higgledy

Higher-kinded data via generics
data-msgpack

9.4 linkedhashmap VS data-msgpack

A Haskell implementation of MessagePack
caledon

9.4 0.0 linkedhashmap VS caledon

higher order dependently typed logic programing
jump

9.4 0.0 linkedhashmap VS jump

Jump start your Haskell development
discrimination

9.4 3.1 linkedhashmap VS discrimination

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

9.4 0.0 linkedhashmap VS json-autotype

Automatic Haskell type inference from JSON input
network-msgpack-rpc

9.4 linkedhashmap VS network-msgpack-rpc

A MessagePack-RPC Implementation
aeson-qq

9.4 3.6 linkedhashmap VS aeson-qq

JSON quasiquoter for Haskell
diskhash

9.4 0.0 linkedhashmap VS diskhash

Diskbased (persistent) hashtable
hashtables

9.4 1.0 linkedhashmap VS hashtables

Mutable hash tables for Haskell, in the ST monad
audiovisual

9.3 3.5 linkedhashmap VS audiovisual

Extensible records, variants, structs, effects, tangles
reflection

9.3 4.8 linkedhashmap VS reflection

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

9.3 4.3 linkedhashmap VS dependent-sum

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

9.3 0.0 linkedhashmap VS dependent-map

Dependently-typed finite maps (partial dependent products)
cereal

9.3 0.0 linkedhashmap VS cereal

A binary serialization library
IORefCAS

9.3 3.5 linkedhashmap VS IORefCAS

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

9.3 0.0 linkedhashmap VS certificate

Certificate and Key Reader/Writer in haskell
protobuf

9.2 2.6 linkedhashmap VS protobuf

An implementation of Google's Protocol Buffers in Haskell.
safecopy

9.2 3.1 linkedhashmap VS safecopy

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

9.2 0.0 linkedhashmap VS streaming

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

9.2 0.0 linkedhashmap VS rei

Process lists easily
bifunctors

9.2 5.6 linkedhashmap VS bifunctors

Haskell 98 bifunctors, bifoldables and bitraversables
orgmode-parse

9.2 0.0 linkedhashmap VS orgmode-parse

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

9.2 4.2 linkedhashmap VS avro

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

9.2 0.0 linkedhashmap VS scientific

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

9.1 2.9 linkedhashmap VS uuid

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

9.1 1.8 linkedhashmap VS b-tree

Haskell on-disk B* tree implementation
uuid-types

9.1 2.9 linkedhashmap VS uuid-types

A Haskell library for creating, printing and parsing UUIDs
text-icu

9.1 6.1 linkedhashmap VS text-icu

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

9.1 6.4 linkedhashmap VS witherable

Filter with effects
stdio

9.1 1.8 linkedhashmap VS stdio

Haskell Standard Input and Output
tables

9.1 0.0 linkedhashmap VS tables

Deprecated because of

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

Add another 'Data' Package

Popular Comparisons

README

Persistent LinkedHashMap

Haskell implementation of Java LinkedHashMap.

Underlying HashMap is based on Data.HashMap.Strict.

Two different implementations are based on Data.Sequence and Data.IntMap.Strict to keep keys in the order of insertion.

Criterion report: https://cdn.rawgit.com/abasko/linkedhashmap/68de7332e80db673e024906321ad2e14c2baa4d1/benchmarks/report.html

Do not miss the trending, packages, news and articles with our weekly report.

Awesome Haskell is part of the LibHunt network. Terms. Privacy Policy.