forked from wrengr/bytestring-trie
-
Notifications
You must be signed in to change notification settings - Fork 6
/
text-trie.cabal
108 lines (98 loc) · 4.27 KB
/
text-trie.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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
------------------------------------------------------------
-- michael j. klein <[email protected]> ~ 2019.04.11
------------------------------------------------------------
-- By and large Cabal >=1.2 is fine; but
-- * >=1.6 gives tested-with: and source-repository:
-- * >=1.8 allows executables to build-depends: on the library
-- * >=1.9.2 allows Test-Suite
Cabal-Version: >= 1.9.2
Build-Type: Simple
Name: text-trie
Version: 0.2.5.0
Stability: provisional
Homepage: http://github.com/michaeljklein/text-trie
Author: wren gayle romano, michael j. klein
Maintainer: [email protected]
Copyright: Copyright (c) 2008--2019 wren gayle romano, 2019 michael j. klein
License: BSD3
License-File: LICENSE
Category: Data, Data Structures
Synopsis: An efficient finite map from Text to values, based on bytestring-trie.
Description: An efficient finite map from Text to values, based on bytestring-trie.
.
The implementation is based on big-endian patricia
trees, like "Data.IntMap". We first trie on the
elements of "Data.ByteString" and then trie on the
big-endian bit representation of those elements.
Patricia trees have efficient algorithms for union
and other merging operations, but they're also quick
for lookups and insertions.
.
If you are only interested in being able to associate
strings to values, then you may prefer the @hashmap@
package which is faster for those only needing a
map-like structure. This package is intended for
those who need the extra capabilities that a trie-like
structure can offer (e.g., structure sharing to
reduce memory costs for highly redundant keys,
taking the submap of all keys with a given prefix,
contextual mapping, extracting the minimum and
maximum keys, etc.)
Extra-source-files:
AUTHORS, CHANGELOG, README.md
-- Tested-With:
-- GHC ==7.4.1, GHC ==7.4.2,
-- GHC ==7.6.1, GHC ==7.6.2, GHC ==7.6.3,
-- GHC ==7.8.1, GHC ==7.8.2, GHC ==7.8.3, GHC ==7.8.4,
-- GHC ==7.10.1, GHC ==7.10.2, GHC ==7.10.3,
-- GHC ==8.0.1, GHC ==8.0.2,
-- GHC ==8.2.1, GHC ==8.2.2,
-- GHC ==8.4.1, GHC ==8.4.2, GHC ==8.4.3,
-- GHC ==8.6.1, GHC ==8.6.2,
-- GHC ==9.0.2,
-- GHC ==9.2.5, GHC ==9.2.6
-- GHC ==9.4.5
Source-Repository head
Type: git
Location: https://github.com/michaeljklein/text-trie.git
------------------------------------------------------------
Library
Hs-Source-Dirs: src
Exposed-Modules: Data.Trie.Text
, Data.Trie.Text.Internal
, Data.Trie.Text.Convenience
, Data.Trie.TextInternal
, Data.Text.Internal.Word
Other-Modules: Data.Trie.Text.BitTwiddle
, Data.Trie.Errors
-- The lower bounds are more restrictive than necessary.
-- But then, we don't maintain any CI tests for older
-- versions, so these are the lowest bounds we've verified.
Build-Depends: base >= 4.5 && < 4.18
, text >= 1.2.3 && < 2.1
, binary >= 0.5.1 && < 0.8.10
------------------------------------------------------------
Test-Suite test-text-trie
type: exitcode-stdio-1.0
Hs-Source-Dirs: test
main-is: test-text-trie.hs
ghc-options: -fno-warn-orphans
Other-Modules: Data.Trie.TextInternal.Test
, Data.Trie.Text.Test
, FromListBench
, FromListBench.Text
, FromListBench.Text.Encode
, TrieFile.Text
build-depends: text-trie
, base
, bytestring >= 0.9.2 && < 0.12
, text
, binary
, QuickCheck
, HUnit
, smallcheck
, microbench
, bytestring-trie >= 0.2.5 && < 0.2.8
, silently >= 1.2.5 && < 1.2.6
------------------------------------------------------------
------------------------------------------------------- fin.