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
|
2006-11-22: Updated OCamlMakefile.
2005-12-26: Fixed a build problem.
2005-10-24: Added sof_list.
2004-04-11: Removed use of unsafe external function that depends on
current CVS-version.
2004-01-28: Renamed external function for compatibility with most recent
OCaml-version.
Updated OCamlMakefile.
2003-04-09: Updated OCamlMakefile.
Fixed an installation problem.
2003-01-07: Updated OCamlMakefile to make use of "findlib".
2002-09-23: Fixed a bug in "remove_n" (arguments not fully checked).
Slightly improved efficiency.
2002-09-11: Updated OCamlMakefile and license.
Documented all modules for ocamldoc.
Changed module Res for better accessibility.
Made resizable weak arrays conform to module Weak again.
2002-05-04: Revised the whole installation procedure. See INSTALL for
details.
2002-04-30: Updated OcamlMakefile: it does not ask for confirmation
during installation anymore!
2001-06-30: Removed "Printexc.catch" from stupid_ga-example: is going
to be deprecated in upcoming OCaml-release.
2001-06-24: Added special module for resizable integer arrays (again),
because it is faster on many operations.
2001-01-30: Made Makefile more general (allows simpler addition of
further examples).
2001-01-26: Made use of the new OCaml-keyword "include" for module
inclusion. This makes the file "lib/res.ml" significantly
shorter. This change requires an OCaml-version higher
than 3.00.
2001-01-24: Updated OcamlMakefile
2000-06-24: Updated OcamlMakefile
2000-06-13: Updated OcamlMakefile
2000-06-11: Updated OcamlMakefile
2000-06-08: Added installation routine + updated OcamlMakefile again:
This upgrade makes installation much easier! Read the
updated INSTALL-file!
2000-06-07: Upgraded to new OcamlMakefile.
2000-04-28: Fixed *critical* bug:
Filling and blitting accidently truncated the array if the last
index of the operation was smaller than the one of the target
array.
Resizable bit-vectors should be *much* more efficient now
(blitting, resizing, etc. about 30 (60) times faster, depending on
your architecture!):
I took the new implementation of Jean-Christophe Filliatre's
bitv-library, which uses some very clever algorithms for efficient
blitting. In the near (?) future I'll also add his functions for
common logical, efficient operations on bit-strings (unless
somebody wants to volunteer... ;-)
2000-03-23: Removed special module for resizable integer arrays:
Integer arrays are not unboxed and won't be in the (near?)
future: this would cause generic polymorphic functions such as
equality, hashing and output_value to produce wrong results.
Therefore, use the parameterized version instead. It is
equally fast.
2000-03-08: New function (in all implementations):
find_index - takes a predicate, a resizable array and a
start index and returns the index of the
first element that satisfies the predicate -
see interface documentation for details.
Fixed documentation of interfaces: in some cases the wrong
name for possibly raised exceptions was provided.
2000-01-10: Added functions for converting standard arrays to resizable
ones and strings to buffers.
Added "create" and "screate" to the interface of parameterized
arrays. This makes it easier to use it in place of the
standard array.
Removed "make" and "smake" from resizable weak arrays -
not useful there.
Updated documentation on how to use the index operators with
the resizable datastructures and how to easily replace the
standard arrays/strings with the resizable ones in large
sources.
1999-12-25: Added support for weak arrays + small example
1999-11-04: Added support for bit-vectors
(peeked at Jean-Christophe Filliatre's bitv-library for this).
Added new example:
stupid_ga.ml (a brain-dead genetic algorithm using bit-vectors)
We now have a TODO-list ;-)
1999-10-23: Added three new functions:
remove_range - removes a range of elements within a resizable
array
pos - returns the index of the first logically equal element
posq - returns the index of the first physically equal element
1999-10-13: First release.
|
