-
Notifications
You must be signed in to change notification settings - Fork 3
/
data-inttrie.cabal
39 lines (35 loc) · 1.42 KB
/
data-inttrie.cabal
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
-- Initial data-inttrie.cabal generated by cabal init. For further
-- documentation, see http:https://haskell.org/cabal/users-guide/
name: data-inttrie
version: 0.1.4
synopsis: A simple lazy, infinite trie from integers
-- description:
homepage: https://github.com/luqui/data-inttrie
license: BSD3
license-file: LICENSE
author: Luke Palmer
maintainer: [email protected]
copyright: (c) Luke Palmer 2010
category: Data
build-type: Simple
cabal-version: >=1.10
tested-with: GHC == 7.0.4, GHC == 7.4.2, GHC == 7.6.3, GHC == 7.8.4, GHC == 7.10.3
, GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.1
description:
This library provides a minimal infinite, lazy trie for integral types. It
intentionally leaves out ideas such as delete and emptiness so that it can be
used lazily, eg. as the target of an infinite foldr. Essentially its purpose
is to be an efficient implementation of a function from integral type, given
point-at-a-time modifications.
source-repository head
type: git
location: https://github.com/luqui/data-inttrie
library
exposed-modules: Data.IntTrie
-- other-modules:
-- other-extensions:
build-depends: base >=4.9 && <5.0
-- hs-source-dirs:
default-language: Haskell2010
if (impl(ghc < 8))
build-depends: semigroups