blob: 901004de92821d392d23cb6706c9df8263606a42 (
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
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
|
(***********************************************************************)
(* *)
(* Objective Caml *)
(* *)
(* Xavier Leroy, projet Cristal, INRIA Rocquencourt *)
(* *)
(* Copyright 1996 Institut National de Recherche en Informatique et *)
(* Automatique. Distributed only by permission. *)
(* *)
(***********************************************************************)
(* $Id$ *)
(* Array operations *)
external length : 'a array -> int = "%array_length"
external get: 'a array -> int -> 'a = "%array_safe_get"
external set: 'a array -> int -> 'a -> unit = "%array_safe_set"
external unsafe_get: 'a array -> int -> 'a = "%array_unsafe_get"
external unsafe_set: 'a array -> int -> 'a -> unit = "%array_unsafe_set"
external create: int -> 'a -> 'a array = "make_vect"
let create_matrix sx sy init =
let res = create sx [||] in
for x = 0 to pred sx do
unsafe_set res x (create sy init)
done;
res
let copy a =
let l = length a in
if l = 0 then [||] else begin
let r = create l (unsafe_get a 0) in
for i = 1 to l-1 do
unsafe_set r i (unsafe_get a i)
done;
r
end
let append a1 a2 =
let l1 = length a1 and l2 = length a2 in
if l1 = 0 & l2 = 0 then [||] else begin
let r = create (l1 + l2) (unsafe_get (if l1 > 0 then a1 else a2) 0) in
for i = 0 to l1 - 1 do unsafe_set r i (unsafe_get a1 i) done;
for i = 0 to l2 - 1 do unsafe_set r (i + l1) (unsafe_get a2 i) done;
r
end
let concat_aux init al =
let size = List.fold_left (fun sz a -> sz + length a) 0 al in
let res = create size init in
let pos = ref 0 in
List.iter
(fun a ->
for i = 0 to length a - 1 do
unsafe_set res !pos (unsafe_get a i);
incr pos
done)
al;
res
let concat al =
let rec find_init = function
[] -> [||]
| a :: rem ->
if length a > 0 then concat_aux (unsafe_get a 0) al else find_init rem
in find_init al
let sub a ofs len =
if ofs < 0 or len < 0 or ofs + len > length a then invalid_arg "Array.sub"
else if len = 0 then [||]
else begin
let r = create len (unsafe_get a ofs) in
for i = 1 to len - 1 do unsafe_set r i (unsafe_get a (ofs + i)) done;
r
end
let fill a ofs len v =
if ofs < 0 or len < 0 or ofs + len > length a
then invalid_arg "Array.fill"
else for i = ofs to ofs + len - 1 do unsafe_set a i v done
let blit a1 ofs1 a2 ofs2 len =
if len < 0 or ofs1 < 0 or ofs1 + len > length a1
or ofs2 < 0 or ofs2 + len > length a2
then invalid_arg "Array.blit"
else if ofs1 < ofs2 then
(* Top-down copy *)
for i = len - 1 downto 0 do
unsafe_set a2 (ofs2 + i) (unsafe_get a1 (ofs1 + i))
done
else
(* Bottom-up copy *)
for i = 0 to len - 1 do
unsafe_set a2 (ofs2 + i) (unsafe_get a1 (ofs1 + i))
done
let iter f a =
for i = 0 to length a - 1 do f(unsafe_get a i) done
let map f a =
let l = length a in
if l = 0 then [||] else begin
let r = create l (f(unsafe_get a 0)) in
for i = 1 to l - 1 do
unsafe_set r i (f(unsafe_get a i))
done;
r
end
let to_list a =
let rec tolist i res =
if i < 0 then res else tolist (i - 1) (unsafe_get a i :: res) in
tolist (length a - 1) []
let of_list = function
[] -> [||]
| hd::tl ->
let a = create (List.length tl + 1) hd in
let rec fill i = function
[] -> a
| hd::tl -> unsafe_set a i hd; fill (i+1) tl in
fill 1 tl
|
