Package0.3.0Web
insert-ordered-containers
Associative containers retaining insertion order for traversals.
- Version0.3.0
- CategoryWeb
- LicenceBSD-3-Clause
- AuthorOleg Grenrus <oleg.grenrus@iki.fi>
- MaintainerErik de Castro Lopo <erikd@mega-nerd.com>, Oleg Grenrus <oleg.grenrus@iki.fi>
- Homepagegithub.com/erikd/insert-ordered-containers#readme
- Pinned byhackage insert-ordered-containers 0.3.0
- Sourcehackage.haskell.org/package/insert-ordered-containers-0.3.0
Modules
2 modules- Data.HashMap.Strict.InsOrd50InsOrdHashMap is like HashMap, but it folds and traverses in insertion order. This module interface mimics Data.HashMap.Strict, with some…
- Data.HashSet.InsOrd19InsOrdHashSet is like HashSet, but it folds in insertion order. This module interface mimics Data.HashSet, with some additions.
Description
Associative containers retaining insertion order for traversals.
The implementation is based on `unordered-containers`.
Depends on
11 packages- aeson-2.3.2.0in this set
- base-4.22.0.0with GHC
- deepseq-1.5.1.0with GHC
- hashable-1.5.1.0in this set
- indexed-traversable-0.1.5in this set
- lens-5.3.6in this set
- optics-core-0.4.2in this set
- optics-extra-0.4.2.1in this set
- semigroupoids-6.0.2in this set
- transformers-0.6.1.2with GHC
- unordered-containers-0.2.21in this set