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 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195

(*
* ExtList  additional and modified functions for lists.
* Copyright (C) 2005 Richard W.M. Jones (rich @ annexia.org)
*
* 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.1 of the License, or (at your option) any later version,
* with the special exception on linking described in file 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 021111307 USA
*)
module Array = struct
#if OCAML < 408
type 'a t = 'a array
#endif
include Array
let rev_in_place xs =
let n = length xs in
let j = ref (n1) in
for i = 0 to n/21 do
let c = xs.(i) in
xs.(i) < xs.(!j);
xs.(!j) < c;
decr j
done
let rev xs =
let ys = Array.copy xs in
rev_in_place ys;
ys
#if OCAML < 403
let for_all p xs =
let n = length xs in
let rec loop i =
if i = n then true
else if p xs.(i) then loop (succ i)
else false
in
loop 0
exception Exists
let exists p xs =
try
for i = 0 to Array.length xs  1 do
if p xs.(i) then raise Exists
done; false
with Exists > true
let mem a xs =
let n = length xs in
let rec loop i =
if i = n then false
else if a = xs.(i) then true
else loop (succ i)
in
loop 0
let memq a xs =
let n = length xs in
let rec loop i =
if i = n then false
else if a == xs.(i) then true
else loop (succ i)
in
loop 0
#endif
let findi p xs =
let n = length xs in
let rec loop i =
if i = n then raise Not_found
else if p xs.(i) then i
else loop (succ i)
in
loop 0
let find p xs = xs.(findi p xs)
(* Use of BitSet suggested by Brian Hurt. *)
let filter p xs =
let n = length xs in
(* Use a bitset to store which elements will be in the final array. *)
let bs = BitSet.create n in
for i = 0 to n1 do
if p xs.(i) then BitSet.set bs i
done;
(* Allocate the final array and copy elements into it. *)
let n' = BitSet.count bs in
let j = ref 0 in
let xs' = init n'
(fun _ >
(* Find the next set bit in the BitSet. *)
while not (BitSet.is_set bs !j) do incr j done;
let r = xs.(!j) in
incr j;
r) in
xs'
let find_all = filter
let partition p xs =
let n = length xs in
(* Use a bitset to store which elements will be in which final array. *)
let bs = BitSet.create n in
for i = 0 to n1 do
if p xs.(i) then BitSet.set bs i
done;
(* Allocate the final arrays and copy elements into them. *)
let n1 = BitSet.count bs in
let n2 = n  n1 in
let j = ref 0 in
let xs1 = init n1
(fun _ >
(* Find the next set bit in the BitSet. *)
while not (BitSet.is_set bs !j) do incr j done;
let r = xs.(!j) in
incr j;
r) in
let j = ref 0 in
let xs2 = init n2
(fun _ >
(* Find the next clear bit in the BitSet. *)
while BitSet.is_set bs !j do incr j done;
let r = xs.(!j) in
incr j;
r) in
xs1, xs2
let enum xs =
let rec make start xs =
let n = length xs in
Enum.make
~next:(fun () >
if !start < n then (
let r = xs.(!start) in
incr start;
r
) else
raise Enum.No_more_elements)
~count:(fun () >
n  !start)
~clone:(fun () >
let xs' = Array.sub xs !start (n  !start) in
make (ref 0) xs')
in
make (ref 0) xs
let of_enum e =
let n = Enum.count e in
(* This assumes, reasonably, that init traverses the array in order. *)
Array.init n
(fun i >
match Enum.get e with
 Some x > x
 None > assert false)
#if OCAML < 403
let iter2 f a1 a2 =
if Array.length a1 <> Array.length a2
then raise (Invalid_argument "Array.iter2");
for i = 0 to Array.length a1  1 do
f a1.(i) a2.(i);
done
let map2 f a1 a2 =
if Array.length a1 <> Array.length a2
then raise (Invalid_argument "Array.map2");
Array.init (Array.length a1) (fun i > f a1.(i) a2.(i))
#endif
#if OCAML >= 403
#else
#if OCAML >= 402
let create_float = make_float
#else
let make_float n = make n 0.
let create_float = make_float
#endif
#endif
end
