summaryrefslogtreecommitdiff
blob: f17879fb0804c14662a049538641d4034257d04b (plain)
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
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE pkgmetadata SYSTEM "https://www.gentoo.org/dtd/metadata.dtd">
<pkgmetadata>
	<maintainer type="project">
		<email>haskell@gentoo.org</email>
		<name>Gentoo Haskell</name>
	</maintainer>
	<longdescription>
		An efficient implementation of Int-indexed arrays (both mutable
		and immutable), with a powerful loop optimisation 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.

		Each module has a @Safe@ version with is marked as @Trustworthy@
		(see &lt;http://hackage.haskell.org/trac/ghc/wiki/SafeHaskell&gt;).

		There is also a (draft) tutorial on common uses of vector.

		* &lt;http://haskell.org/haskellwiki/Numeric_Haskell:_A_Vector_Tutorial&gt;

		Please use the project trac to submit bug reports and feature
		requests.

		* &lt;http://trac.haskell.org/vector&gt;

		Changes in version 0.9

		* 'MonadPlus' instance for boxed vectors

		* Export more @construct@ and @constructN@ from @Safe@ modules

		* Require @primitive-0.4.0.1@

		Changes in version 0.8

		* New functions: @constructN@, @constructrN@

		* Support for GHC 7.2 array copying primitives

		* New fixity for @(!)@

		* Safe Haskell support (contributed by David Terei)

		* 'Functor', 'Monad', 'Applicative', 'Alternative', 'Foldable' and
		'Traversable' instances for boxed vectors
		(/WARNING: they tend to be slow and are only provided for completeness/)

		* 'Show' instances for immutable vectors follow containers conventions

		* 'Read' instances for all immutable vector types

		* Performance improvements
	</longdescription>
	<use>
		<flag name="boundschecks">Enable bounds checking</flag>
		<flag name="internalchecks">Enable internal consistency checks at the cost of a significant performance penalty</flag>
		<flag name="unsafechecks">Enable bounds checking in unsafe operations at the cost of a significant performance penalty</flag>
	</use>
	<upstream>
		<remote-id type="github">haskell/vector</remote-id>
	</upstream>
</pkgmetadata>