name: insert-ordered-containers
version: 0.2.5.2
synopsis:
Associative containers retaining insertion order for traversals.
description:
Associative containers retaining insertion order for traversals.
.
The implementation is based on `unordered-containers`.
category: Web
homepage: https://github.com/phadej/insert-ordered-containers#readme
bug-reports: https://github.com/phadej/insert-ordered-containers/issues
author: Oleg Grenrus <oleg.grenrus@iki.fi>
maintainer: Oleg Grenrus <oleg.grenrus@iki.fi>
license: BSD3
license-file: LICENSE
build-type: Simple
cabal-version: >=1.10
tested-with:
GHC ==8.0.2
|| ==8.2.2
|| ==8.4.4
|| ==8.6.5
|| ==8.8.4
|| ==8.10.7
|| ==9.0.2
|| ==9.2.7
|| ==9.4.5
|| ==9.6.1
extra-source-files:
CHANGELOG.md
README.md
source-repository head
type: git
location: https://github.com/phadej/insert-ordered-containers
library
default-language: Haskell2010
hs-source-dirs: src
ghc-options: -Wall
build-depends:
aeson >=1.4.2.0 && <1.6 || >=2.0.0.0 && <2.2
, base >=4.9 && <4.19
, deepseq >=1.4.2.0 && <1.5
, hashable >=1.2.6.1 && <1.5
, indexed-traversable >=0.1.1 && <0.2
, lens >=4.17 && <5.3
, optics-core >=0.2 && <0.5
, optics-extra >=0.2 && <0.5
, semigroupoids >=5.3.2 && <6.1
, text >=1.2.3.0 && <1.3 || >=2.0 && <2.1
, transformers >=0.5.2.0 && <0.7
, unordered-containers >=0.2.14.0 && <0.3
exposed-modules:
Data.HashMap.Strict.InsOrd
Data.HashSet.InsOrd
other-modules: Data.HashMap.InsOrd.Internal
test-suite ins-ord-containers-tests
default-language: Haskell2010
type: exitcode-stdio-1.0
main-is: Tests.hs
hs-source-dirs: test
ghc-options: -Wall
-- inherited from library
build-depends:
aeson
, base
, base-compat
, hashable
, insert-ordered-containers
, lens
, QuickCheck >=2.13.2 && <2.15
, semigroupoids
, tasty >=0.10.1.2 && <1.5
, tasty-quickcheck >=0.8.3.2 && <0.11
, text
, unordered-containers