-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathradix-tree.cabal
154 lines (119 loc) · 5.07 KB
/
radix-tree.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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
name: radix-tree
version: 1.1.0.0
category: Data Structures
synopsis: Radix trees
description: Radix and PATRICIA trees, both spine-strict and spine-lazy.
See the <https://github.com/sergv/radix-tree/blob/master/README.md README>
for a brief overview of the data structures included in this package.
license: BSD3
license-file: LICENSE
author: Sergey Vinokurov, Oleksii Divak
maintainer: Oleksii Divak <[email protected]>
copyright: (c) 2018 Sergey Vinokurov
cabal-version: 2.0
build-type: Simple
homepage: https://github.com/sergv/radix-tree
extra-doc-files: CHANGELOG.md
README.md
source-repository head
type: git
location: https://github.com/sergv/radix-tree.git
library
exposed-modules: Data.Patricia.Word.Lazy
Data.Patricia.Word.Lazy.Debug
Data.Patricia.Word.Lazy.TH
Data.Patricia.Word.Lazy.Unsafe
Data.Patricia.Word.Strict
Data.Patricia.Word.Strict.Debug
Data.Patricia.Word.Strict.TH
Data.Patricia.Word.Strict.Unsafe
Data.RadixTree.Word8.Key
Data.RadixTree.Word8.Key.Unsafe
Data.RadixTree.Word8.Lazy
Data.RadixTree.Word8.Lazy.Debug
Data.RadixTree.Word8.Lazy.TH
Data.RadixTree.Word8.Lazy.Unsafe
Data.RadixTree.Word8.Strict
Data.RadixTree.Word8.Strict.Debug
Data.RadixTree.Word8.Strict.Pointer
Data.RadixTree.Word8.Strict.TH
Data.RadixTree.Word8.Strict.Unsafe
Data.Radix1Tree.Word8.Key
Data.Radix1Tree.Word8.Key.Unsafe
Data.Radix1Tree.Word8.Lazy
Data.Radix1Tree.Word8.Lazy.Debug
Data.Radix1Tree.Word8.Lazy.TH
Data.Radix1Tree.Word8.Lazy.Unsafe
Data.Radix1Tree.Word8.Lazy.Zipper
Data.Radix1Tree.Word8.Strict
Data.Radix1Tree.Word8.Strict.Debug
Data.Radix1Tree.Word8.Strict.Pointer
Data.Radix1Tree.Word8.Strict.TH
Data.Radix1Tree.Word8.Strict.Unsafe
Data.Radix1Tree.Word8.Strict.Zipper
Data.Zebra.Word
Data.Zebra.Word.Debug
Data.Zebra.Word.Unsafe
other-modules: Data.ByteArray.NonEmpty
Data.Patricia.Word.Common
Data.Patricia.Word.Conversion
Data.Patricia.Word.Debug
Data.Patricia.Word.Lazy.Internal
Data.Patricia.Word.Strict.Internal
Data.RadixNTree.Word8.Common
Data.RadixNTree.Word8.Conversion
Data.RadixNTree.Word8.Debug
Data.RadixNTree.Word8.Key
Data.RadixNTree.Word8.Lazy
Data.RadixNTree.Word8.Lazy.Debug
Data.RadixNTree.Word8.Lazy.TH
Data.RadixNTree.Word8.Strict
Data.RadixNTree.Word8.Strict.Debug
Data.RadixNTree.Word8.Strict.Pointer
Data.RadixNTree.Word8.Strict.TH
Data.Zebra.Word.Internal
Numeric.Long
Radix.Common
Radix.Exception
Radix.Word8.Debug
Radix.Word8.Foundation
Radix.Word.Common
Radix.Word.Debug
Radix.Word.Foundation
hs-source-dirs: src
build-depends: base >= 4.15 && < 5
, bytestring >= 0.10.4 && < 0.13
, deepseq >= 1.4.3 && < 1.6
, primitive >= 0.7 && < 0.10
, template-haskell >= 2.17 && < 3
, text >= 2.0 && < 2.2
default-language: Haskell2010
ghc-options: -Wall
test-suite properties
type: exitcode-stdio-1.0
main-is: Main.hs
other-modules: No.Set.Word
No.Tree
Test.Kit
Test.Patricia.Word.Lazy
Test.Patricia.Word.Sample
Test.Patricia.Word.Strict
Test.RadixNTree.Word8.Key
Test.RadixNTree.Word8.Sample
Test.RadixTree.Word8.Lazy
Test.RadixTree.Word8.Strict
Test.Random
Test.Zebra.Word
Test.Zebra.Word.Sample
hs-source-dirs: no
, test/properties
ghc-options: -Wall
build-depends: base
, bytestring
, containers >= 0.5 && < 0.8
, hspec >= 2 && < 3
, primitive
, radix-tree
, random >= 1.2.0 && < 1.3
, text
default-language: Haskell2010