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
|
Name: EdisonCore
Cabal-Version: >= 1.2
Build-Type: Simple
Version: 1.2.1.3
License: OtherLicense
License-File: COPYRIGHT
Author: Chris Okasaki
Maintainer: robdockins AT fastmail DOT fm
Synopsis: A library of efficent, purely-functional data structures (Core Implementations)
Category: Data Structures
Homepage: http://www.cs.princeton.edu/~rdockins/edison/home/
Stability: Stable
Description:
This package provides the core Edison data structure implementations,
including multiple sequence, set, bag, and finite map concrete
implementations with various performance characteristics. The
implementations in this package have no dependencies other than those
commonly bundled with Haskell compilers.
Library
Hs-Source-Dirs: src
Exposed-modules:
Data.Edison.Assoc.Defaults
Data.Edison.Assoc.AssocList
Data.Edison.Assoc.PatriciaLoMap
Data.Edison.Assoc.StandardMap
Data.Edison.Assoc.TernaryTrie
Data.Edison.Concrete.FingerTree
Data.Edison.Coll.Defaults
Data.Edison.Coll.LazyPairingHeap
Data.Edison.Coll.LeftistHeap
Data.Edison.Coll.MinHeap
Data.Edison.Coll.SkewHeap
Data.Edison.Coll.SplayHeap
Data.Edison.Coll.StandardSet
Data.Edison.Coll.EnumSet
Data.Edison.Coll.UnbalancedSet
Data.Edison.Seq.Defaults
Data.Edison.Seq.BankersQueue
Data.Edison.Seq.BinaryRandList
Data.Edison.Seq.BraunSeq
Data.Edison.Seq.FingerSeq
Data.Edison.Seq.JoinList
Data.Edison.Seq.MyersStack
Data.Edison.Seq.RandList
Data.Edison.Seq.RevSeq
Data.Edison.Seq.SimpleQueue
Data.Edison.Seq.SizedSeq
Build-Depends:
base, mtl,
QuickCheck >= 1.0 && < 2,
EdisonAPI == 1.2.1
if impl( ghc >= 6.8 )
Build-Depends:
containers, array
Extensions:
MultiParamTypeClasses
FunctionalDependencies
UndecidableInstances
CPP
Ghc-Options: -funbox-strict-fields -fwarn-incomplete-patterns -O2 -fglasgow-exts
|
