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
|
Name: fingertree
Version: 0.1.5.0
Cabal-Version: 1.18
Copyright: (c) 2006 Ross Paterson, Ralf Hinze
License: BSD3
License-File: LICENSE
Maintainer: Ross Paterson <R.Paterson@city.ac.uk>
bug-reports: http://hub.darcs.net/ross/fingertree/issues
Category: Data Structures
Synopsis: Generic finger-tree structure, with example instances
Description:
A general sequence representation with arbitrary
annotations, for use as a base for implementations of
various collection types, with examples, as described
in section 4 of
.
* Ralf Hinze and Ross Paterson,
\"Finger trees: a simple general-purpose data structure\",
/Journal of Functional Programming/ 16:2 (2006) pp 197-217.
<http://staff.city.ac.uk/~ross/papers/FingerTree.html>
.
For a tuned sequence type, see @Data.Sequence@ in the
@containers@ package, which is a specialization of
this structure.
Build-Type: Simple
Extra-Source-Files:
changelog
Extra-Doc-Files:
images/search.svg
Source-Repository head
Type: darcs
Location: http://hub.darcs.net/ross/fingertree
Library
Build-Depends: base < 6
Default-Language: Haskell2010
Other-Extensions:
MultiParamTypeClasses
FunctionalDependencies
FlexibleInstances
UndecidableInstances
Exposed-Modules:
Data.FingerTree
Data.IntervalMap.FingerTree
Data.PriorityQueue.FingerTree
Test-suite ft-properties
type: exitcode-stdio-1.0
main-is: tests/ft-properties.hs
cpp-options: -DTESTING
default-language: Haskell2010
build-depends:
base >= 4.2 && < 6,
HUnit,
QuickCheck,
test-framework,
test-framework-hunit,
test-framework-quickcheck2
|
