homepage: http://happstack.com
changelog-type: ''
hash: b51a990fef4f8e82b0f508765a4a19b124df6cb320e64e841f9fc51d58b7ff74
test-bench-deps:
  Cabal: ! '>=1.10'
  base: -any
  ixset: -any
  HUnit: -any
  containers: -any
  random: -any
  QuickCheck: -any
maintainer: Happstack team <happs@googlegroups.com>
synopsis: Efficient relational queries on Haskell sets.
changelog: ''
basic-deps:
  base: ! '>=4.7 && <5'
  syb: -any
  containers: ! '>=0.5.5.1'
  syb-with-class: ! '>=0.6.1'
  safecopy: -any
  template-haskell: -any
all-versions:
- 1.0.0
- 1.0.1
- 1.0.2
- 1.0.3
- 1.0.4
- 1.0.5
- 1.0.6
- 1.0.6.1
- 1.0.7
- '1.1'
- 1.1.1
author: Happstack team, HAppS LLC
latest: 1.1.1
description-type: haddock
description: Create and query sets that are indexed by multiple indices.
license-name: BSD-3-Clause

homepage: http://happstack.com
changelog-type: ''
hash: be27159a55e8a81b7b50a27a6ca5bb56a145296877ae4551a43c06b75256103a
test-bench-deps:
  Cabal: ! '>=1.10'
  base: -any
  ixset: -any
  HUnit: -any
  containers: -any
  random: -any
  QuickCheck: -any
maintainer: Happstack team <happs@googlegroups.com>
synopsis: Efficient relational queries on Haskell sets.
changelog: ''
basic-deps:
  base: ! '>=4.7 && <5'
  syb: -any
  containers: ! '>=0.5.5.1'
  syb-with-class: ! '>=0.6.1'
  safecopy: -any
  template-haskell: -any
all-versions:
- 1.0.0
- 1.0.1
- 1.0.2
- 1.0.3
- 1.0.4
- 1.0.5
- 1.0.6
- 1.0.6.1
- 1.0.7
- '1.1'
- 1.1.1
- 1.1.1.1
author: Happstack team, HAppS LLC
latest: 1.1.1.1
description-type: haddock
description: Create and query sets that are indexed by multiple indices.
license-name: BSD-3-Clause

Update from Hackage at 2019-12-09T00:09:58Z
Update from Hackage at 2019-12-09T00:09:58Z
