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
|
(** XArray : extensible arrays *)
(* Copyright (C) 2002, 2003 Yamagata Yoriyuki. *)
(* This library is free software; you can redistribute it and/or *)
(* modify it under the terms of the GNU Lesser General Public License *)
(* as published by the Free Software Foundation; either version 2 of *)
(* the License, or (at your option) any later version. *)
(* As a special exception to the GNU Library General Public License, you *)
(* may link, statically or dynamically, a "work that uses this library" *)
(* with a publicly distributed version of this library to produce an *)
(* executable file containing portions of this library, and distribute *)
(* that executable file under terms of your choice, without any of the *)
(* additional requirements listed in clause 6 of the GNU Library General *)
(* Public License. By "a publicly distributed version of this library", *)
(* we mean either the unmodified Library as distributed by the authors, *)
(* or a modified version of this library that is distributed under the *)
(* conditions defined in clause 3 of the GNU Library General Public *)
(* License. This exception does not however invalidate any other reasons *)
(* why the executable file might be covered by the GNU Library General *)
(* Public License . *)
(* This library is distributed in the hope that it will be useful, *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *)
(* Lesser General Public License for more details. *)
(* You should have received a copy of the GNU Lesser General Public *)
(* License along with this library; if not, write to the Free Software *)
(* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 *)
(* USA *)
(* You can contact the authour by sending email to *)
(* yori@users.sourceforge.net *)
(** XArray will be replaced by Dynarray in future. *)
type 'a xarray
type 'a t = 'a xarray
(* init ~bufsize len default f :
* returned xarray has length [len], its nth-element is [f n],
* its default value is [default]. The size of the internal buffer
* is initially ~bufsize. However, accessible elements are only up to [len].
* [f] is called with integers [0 ... len - 1], only once for each integer.
* The call is in the increasing order f 0, f1, f2, ... *)
val init : ?bufsize:int -> int -> 'a -> (int -> 'a) -> 'a xarray
(* make ~bufsize len default :
* returns xarray filled with [default], whose default value is [default],
* size of the internal buffer is [bufsize]. *)
val make : ?bufsize:int -> int -> 'a -> 'a xarray
val length : 'a xarray -> int
val get : 'a xarray -> int -> 'a
(* set x i e :
* set the [i]-th element of [x] to [e].
* The length of [x] is automatically extended to [i], and
* intermediate elements are set to the default value of [x] *)
val set : 'a xarray -> int -> 'a -> unit
type index
val nth : 'a xarray -> int -> index
val first : 'a xarray -> index
val last : 'a xarray -> index
val look : 'a xarray -> index -> 'a
(* next x i, prev x i :
* operation is valid if [i] points the valid element, i.e.
* returned value may point the location beyond valid elements by one.
* If [i] does not point a valid element, the results are unspecified. *)
val next : 'a t -> index -> index
val prev : 'a t -> index -> index
val move : 'a t -> index -> int -> index
(* test whether the given index points the valid element. *)
val out_of_range : 'a xarray -> index -> bool
val compare_index : 'a xarray -> index -> index -> int
(* semantics of these functions are similar to equivalents of
* Array or Buffer. *)
val clear : 'a xarray -> unit
val reset : 'a xarray -> unit
val copy : 'a xarray -> 'a xarray
val sub : 'a xarray -> int -> int -> 'a xarray
val add_element : 'a xarray -> 'a -> unit
val add_array : 'a xarray -> 'a array -> unit
val add_xarray : 'a xarray -> 'a xarray -> unit
val append : 'a xarray -> 'a xarray -> 'a xarray
val iter : ('a -> unit) -> 'a xarray -> unit
val array_of : 'a xarray -> 'a array
(* shrink x len : reduce the length of [x] to [len].
* If there is an element beyond [len], such elements are discarded. *)
val shrink : 'a xarray -> int -> unit
|
