1Float.ArrayLabels(3) OCaml library Float.ArrayLabels(3)
2
3
4
6 Float.ArrayLabels - Float arrays with packed representation (labeled
7 functions).
8
10 Module Float.ArrayLabels
11
13 Module ArrayLabels
14 : sig end
15
16
17 Float arrays with packed representation (labeled functions).
18
19
20
21
22
23 type t = floatarray
24
25
26 The type of float arrays with packed representation.
27
28
29 Since 4.08.0
30
31
32
33 val length : t -> int
34
35 Return the length (number of elements) of the given floatarray.
36
37
38
39 val get : t -> int -> float
40
41
42 get a n returns the element number n of floatarray a .
43
44
45 Raises Invalid_argument if n is outside the range 0 to (length a - 1) .
46
47
48
49 val set : t -> int -> float -> unit
50
51
52 set a n x modifies floatarray a in place, replacing element number n
53 with x .
54
55
56 Raises Invalid_argument if n is outside the range 0 to (length a - 1) .
57
58
59
60 val make : int -> float -> t
61
62
63 make n x returns a fresh floatarray of length n , initialized with x .
64
65
66 Raises Invalid_argument if n < 0 or n > Sys.max_floatarray_length .
67
68
69
70 val create : int -> t
71
72
73 create n returns a fresh floatarray of length n , with uninitialized
74 data.
75
76
77 Raises Invalid_argument if n < 0 or n > Sys.max_floatarray_length .
78
79
80
81 val init : int -> f:(int -> float) -> t
82
83
84 init n ~f returns a fresh floatarray of length n , with element number
85 i initialized to the result of f i . In other terms, init n ~f tabu‐
86 lates the results of f applied to the integers 0 to n-1 .
87
88
89 Raises Invalid_argument if n < 0 or n > Sys.max_floatarray_length .
90
91
92
93 val append : t -> t -> t
94
95
96 append v1 v2 returns a fresh floatarray containing the concatenation of
97 the floatarrays v1 and v2 .
98
99
100 Raises Invalid_argument if length v1 + length v2 > Sys.max_floatar‐
101 ray_length .
102
103
104
105 val concat : t list -> t
106
107 Same as Float.ArrayLabels.append , but concatenates a list of floatar‐
108 rays.
109
110
111
112 val sub : t -> pos:int -> len:int -> t
113
114
115 sub a ~pos ~len returns a fresh floatarray of length len , containing
116 the elements number pos to pos + len - 1 of floatarray a .
117
118
119 Raises Invalid_argument if pos and len do not designate a valid subar‐
120 ray of a ; that is, if pos < 0 , or len < 0 , or pos + len > length a .
121
122
123
124 val copy : t -> t
125
126
127 copy a returns a copy of a , that is, a fresh floatarray containing the
128 same elements as a .
129
130
131
132 val fill : t -> pos:int -> len:int -> float -> unit
133
134
135 fill a ~pos ~len x modifies the floatarray a in place, storing x in el‐
136 ements number pos to pos + len - 1 .
137
138
139 Raises Invalid_argument if pos and len do not designate a valid subar‐
140 ray of a .
141
142
143
144 val blit : src:t -> src_pos:int -> dst:t -> dst_pos:int -> len:int ->
145 unit
146
147
148 blit ~src ~src_pos ~dst ~dst_pos ~len copies len elements from floatar‐
149 ray src , starting at element number src_pos , to floatarray dst ,
150 starting at element number dst_pos . It works correctly even if src
151 and dst are the same floatarray, and the source and destination chunks
152 overlap.
153
154
155 Raises Invalid_argument if src_pos and len do not designate a valid
156 subarray of src , or if dst_pos and len do not designate a valid subar‐
157 ray of dst .
158
159
160
161 val to_list : t -> float list
162
163
164 to_list a returns the list of all the elements of a .
165
166
167
168 val of_list : float list -> t
169
170
171 of_list l returns a fresh floatarray containing the elements of l .
172
173
174 Raises Invalid_argument if the length of l is greater than
175 Sys.max_floatarray_length .
176
177
178
179
180 Iterators
181 val iter : f:(float -> unit) -> t -> unit
182
183
184 iter ~f a applies function f in turn to all the elements of a . It is
185 equivalent to f a.(0); f a.(1); ...; f a.(length a - 1); () .
186
187
188
189 val iteri : f:(int -> float -> unit) -> t -> unit
190
191 Same as Float.ArrayLabels.iter , but the function is applied with the
192 index of the element as first argument, and the element itself as sec‐
193 ond argument.
194
195
196
197 val map : f:(float -> float) -> t -> t
198
199
200 map ~f a applies function f to all the elements of a , and builds a
201 floatarray with the results returned by f .
202
203
204
205 val mapi : f:(int -> float -> float) -> t -> t
206
207 Same as Float.ArrayLabels.map , but the function is applied to the in‐
208 dex of the element as first argument, and the element itself as second
209 argument.
210
211
212
213 val fold_left : f:('a -> float -> 'a) -> init:'a -> t -> 'a
214
215
216 fold_left ~f x ~init computes f (... (f (f x init.(0)) init.(1)) ...)
217 init.(n-1) , where n is the length of the floatarray init .
218
219
220
221 val fold_right : f:(float -> 'a -> 'a) -> t -> init:'a -> 'a
222
223
224 fold_right f a init computes f a.(0) (f a.(1) ( ... (f a.(n-1) init)
225 ...)) , where n is the length of the floatarray a .
226
227
228
229
230 Iterators on two arrays
231 val iter2 : f:(float -> float -> unit) -> t -> t -> unit
232
233
234 Array.iter2 ~f a b applies function f to all the elements of a and b .
235
236
237 Raises Invalid_argument if the floatarrays are not the same size.
238
239
240
241 val map2 : f:(float -> float -> float) -> t -> t -> t
242
243
244 map2 ~f a b applies function f to all the elements of a and b , and
245 builds a floatarray with the results returned by f : [| f a.(0) b.(0);
246 ...; f a.(length a - 1) b.(length b - 1)|] .
247
248
249 Raises Invalid_argument if the floatarrays are not the same size.
250
251
252
253
254 Array scanning
255 val for_all : f:(float -> bool) -> t -> bool
256
257
258 for_all ~f [|a1; ...; an|] checks if all elements of the floatarray
259 satisfy the predicate f . That is, it returns (f a1) && (f a2) && ...
260 && (f an) .
261
262
263
264 val exists : f:(float -> bool) -> t -> bool
265
266
267 exists f [|a1; ...; an|] checks if at least one element of the floatar‐
268 ray satisfies the predicate f . That is, it returns (f a1) || (f a2) ||
269 ... || (f an) .
270
271
272
273 val mem : float -> set:t -> bool
274
275
276 mem a ~set is true if and only if there is an element of set that is
277 structurally equal to a , i.e. there is an x in set such that compare a
278 x = 0 .
279
280
281
282 val mem_ieee : float -> set:t -> bool
283
284 Same as Float.ArrayLabels.mem , but uses IEEE equality instead of
285 structural equality.
286
287
288
289
290 Sorting
291 val sort : cmp:(float -> float -> int) -> t -> unit
292
293 Sort a floatarray in increasing order according to a comparison func‐
294 tion. The comparison function must return 0 if its arguments compare
295 as equal, a positive integer if the first is greater, and a negative
296 integer if the first is smaller (see below for a complete specifica‐
297 tion). For example, compare is a suitable comparison function. After
298 calling sort , the array is sorted in place in increasing order. sort
299 is guaranteed to run in constant heap space and (at most) logarithmic
300 stack space.
301
302 The current implementation uses Heap Sort. It runs in constant stack
303 space.
304
305 Specification of the comparison function: Let a be the floatarray and
306 cmp the comparison function. The following must be true for all x , y ,
307 z in a :
308
309 - cmp x y > 0 if and only if cmp y x < 0
310
311 - if cmp x y >= 0 and cmp y z >= 0 then cmp x z >= 0
312
313 When sort returns, a contains the same elements as before, reordered in
314 such a way that for all i and j valid indices of a :
315
316 - cmp a.(i) a.(j) >= 0 if and only if i >= j
317
318
319
320
321 val stable_sort : cmp:(float -> float -> int) -> t -> unit
322
323 Same as Float.ArrayLabels.sort , but the sorting algorithm is stable
324 (i.e. elements that compare equal are kept in their original order)
325 and not guaranteed to run in constant heap space.
326
327 The current implementation uses Merge Sort. It uses a temporary
328 floatarray of length n/2 , where n is the length of the floatarray. It
329 is usually faster than the current implementation of Float.ArrayLa‐
330 bels.sort .
331
332
333
334 val fast_sort : cmp:(float -> float -> int) -> t -> unit
335
336 Same as Float.ArrayLabels.sort or Float.ArrayLabels.stable_sort ,
337 whichever is faster on typical input.
338
339
340
341
342 Iterators
343 val to_seq : t -> float Seq.t
344
345 Iterate on the floatarray, in increasing order. Modifications of the
346 floatarray during iteration will be reflected in the iterator.
347
348
349
350 val to_seqi : t -> (int * float) Seq.t
351
352 Iterate on the floatarray, in increasing order, yielding indices along
353 elements. Modifications of the floatarray during iteration will be re‐
354 flected in the iterator.
355
356
357
358 val of_seq : float Seq.t -> t
359
360 Create an array from the generator.
361
362
363
364 val map_to_array : f:(float -> 'a) -> t -> 'a array
365
366
367 map_to_array ~f a applies function f to all the elements of a , and
368 builds an array with the results returned by f : [| f a.(0); f a.(1);
369 ...; f a.(length a - 1) |] .
370
371
372
373 val map_from_array : f:('a -> float) -> 'a array -> t
374
375
376 map_from_array ~f a applies function f to all the elements of a , and
377 builds a floatarray with the results returned by f .
378
379
380
381
382
383OCamldoc 2021-07-22 Float.ArrayLabels(3)