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
|
(*
* Copyright (C) 2006-2009 Citrix Systems Inc.
*
* This program 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; version 2.1 only. with the special
* exception on linking described in file LICENSE.
*
* This program 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.
*)
module Array = struct include Array
(* Useful for vector addition. *)
let map2 f a b =
let len = length a in
if len <> length b then invalid_arg "map2";
init len (fun i -> f a.(i) b.(i))
(* Useful for vector dot product. *)
let fold_left2 f x a b =
let len = length a in
if len <> length b then invalid_arg "fold_left2";
let r = ref x in
for i = 0 to len - 1 do
r := f !r a.(i) b.(i)
done;
!r
(* Useful for vector dot product. *)
let fold_right2 f a b x =
let len = length a in
if len <> length b then invalid_arg "fold_right2";
let r = ref x in
for i = len - 1 downto 0 do
r := f a.(i) b.(i) !r
done;
!r
let index e a =
let len = length a in
let rec check i =
if len <= i then -1
else if get a i = e then i
else check (i + 1)
in check 0
let inner fold_left2 base f l1 l2 g =
fold_left2 (fun accu e1 e2 -> g accu (f e1 e2)) base l1 l2
let mem e a =
index e a <> -1
let remove n a =
append (sub a 0 n) (sub a (n+1) (length a - n - 1))
end
|
