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
155
156
|
Name: vector
Version: 0.6.0.1
License: BSD3
License-File: LICENSE
Author: Roman Leshchinskiy <rl@cse.unsw.edu.au>
Maintainer: Roman Leshchinskiy <rl@cse.unsw.edu.au>
Copyright: (c) Roman Leshchinskiy 2008-2010
Homepage: http://code.haskell.org/vector
Bug-Reports: http://trac.haskell.org/vector
Category: Data, Data Structures
Synopsis: Efficient Arrays
Description:
.
An efficient implementation of Int-indexed arrays (both mutable
and immutable), with a powerful loop fusion optimization framework .
.
It is structured as follows:
.
[@Data.Vector@] Boxed vectors of arbitrary types.
.
[@Data.Vector.Unboxed@] Unboxed vectors with an adaptive
representation based on data type families.
.
[@Data.Vector.Storable@] Unboxed vectors of 'Storable' types.
.
[@Data.Vector.Primitive@] Unboxed vectors of primitive types as
defined by the @primitive@ package. @Data.Vector.Unboxed@ is more
flexible at no performance cost.
.
[@Data.Vector.Generic@] Generic interface to the vector types.
.
There is also a (draft) tutorial on common uses of vector.
.
* <http://haskell.org/haskellwiki/Numeric_Haskell:_A_Vector_Tutorial>
.
Please use the project trac to submit bug reports and feature
requests.
.
* <http://trac.haskell.org/vector>
.
Changes since version 0.6
.
* Improved documentation
.
Changes since version 0.5
.
* More efficient representation of @Storable@ vectors
.
* Block copy operations used when possible
.
* @Typeable@ and @Data@ instances
.
* Monadic combinators (@replicateM@, @mapM@ etc.)
.
* Better support for recycling (see @create@ and @modify@)
.
* Performance improvements
.
Cabal-Version: >= 1.2.3
Build-Type: Simple
Extra-Source-Files:
tests/vector-tests.cabal
tests/LICENSE
tests/Setup.hs
tests/Main.hs
tests/Boilerplater.hs
tests/Utilities.hs
tests/Tests/Stream.hs
tests/Tests/Vector.hs
benchmarks/vector-benchmarks.cabal
benchmarks/LICENSE
benchmarks/Setup.hs
benchmarks/Main.hs
benchmarks/Algo/AwShCC.hs
benchmarks/Algo/HybCC.hs
benchmarks/Algo/Leaffix.hs
benchmarks/Algo/ListRank.hs
benchmarks/Algo/Quickhull.hs
benchmarks/Algo/Rootfix.hs
benchmarks/Algo/Spectral.hs
benchmarks/Algo/Tridiag.hs
benchmarks/TestData/Graph.hs
benchmarks/TestData/ParenTree.hs
benchmarks/TestData/Random.hs
internal/GenUnboxTuple.hs
internal/unbox-tuple-instances
Changelog
Flag BoundsChecks
Description: Enable bounds checking
Default: True
Flag UnsafeChecks
Description: Enable bounds checking in unsafe operations at the cost of a
significant performance penalty
Default: False
Flag InternalChecks
Description: Enable internal consistency checks at the cost of a
significant performance penalty
Default: False
Library
Extensions: CPP, DeriveDataTypeable
Exposed-Modules:
Data.Vector.Internal.Check
Data.Vector.Fusion.Util
Data.Vector.Fusion.Stream.Size
Data.Vector.Fusion.Stream.Monadic
Data.Vector.Fusion.Stream
Data.Vector.Generic.Mutable
Data.Vector.Generic.Base
Data.Vector.Generic.New
Data.Vector.Generic
Data.Vector.Primitive.Mutable
Data.Vector.Primitive
Data.Vector.Storable.Internal
Data.Vector.Storable.Mutable
Data.Vector.Storable
Data.Vector.Unboxed.Base
Data.Vector.Unboxed.Mutable
Data.Vector.Unboxed
Data.Vector.Mutable
Data.Vector
Include-Dirs:
include, internal
Install-Includes:
vector.h
Build-Depends: base >= 4 && < 5, ghc >= 6.9, primitive >= 0.3 && < 0.4
if impl(ghc<6.13)
Ghc-Options: -finline-if-enough-args -fno-method-sharing
Ghc-Options: -O2
if flag(BoundsChecks)
cpp-options: -DVECTOR_BOUNDS_CHECKS
if flag(UnsafeChecks)
cpp-options: -DVECTOR_UNSAFE_CHECKS
if flag(InternalChecks)
cpp-options: -DVECTOR_INTERNAL_CHECKS
|
