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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
(* hash-array.sml
*
* COPYRIGHT (c) 2015 The Fellowship of SML/NJ (http://www.smlnj.org)
* All rights reserved.
*
* Dynamic (sparse) array that uses hashing
*
* -- Allen
*)
structure HashArray : sig
include ARRAY
val array' : int * (int -> 'a) -> 'a array
val array'': int * (int -> 'a) -> 'a array
val clear : 'a array -> unit
val remove : 'a array * int -> unit
val dom : 'a array -> int list
val copy_array : 'a array -> 'a array
end = struct
structure A = Array
datatype 'a default = V of 'a | F of int -> 'a | U of int -> 'a
datatype 'a array =
ARRAY of (int * 'a) list A.array ref * 'a default * int ref * int ref
type 'a vector = 'a Vector.vector
val maxLen = A.maxLen
fun array(n,d) = ARRAY(ref(A.array(16,[])),V d,ref n,ref 0)
fun array'(n,f) = ARRAY(ref(A.array(16,[])),F f,ref n,ref 0)
fun array''(n,f) = ARRAY(ref(A.array(16,[])),U f,ref n,ref 0)
fun clear(ARRAY(r,d,n,c)) = (r := A.array(16,[]); n := 0; c := 0)
fun roundsize n =
let fun loop i = if i >= n then i else loop(i+i)
in loop 1 end
fun copy_array(ARRAY(ref a,d,ref n,ref c)) =
let val a' = A.array(n,[])
val _ = A.copy{src=a,dst=a',di=0}
in ARRAY(ref a',d,ref n,ref c)
end
val itow = Word.fromInt
val wtoi = Word.toIntX
fun index(a, i) = wtoi(Word.andb(itow i, itow(Array.length a - 1)))
fun tabulate(n,f) =
let val N = n*n+1
val N = if N < 16 then 16 else roundsize N
val a = A.array(N,[])
fun ins i =
let val pos = index(a, i)
val x = f i
in A.update(a,pos,(i,x)::A.sub(a,pos)); x
end
fun insert 0 = ins 0
| insert i = (ins i; insert(i-1))
in if n < 0 then
ARRAY(ref a,F(fn _ => raise Subscript),ref 0,ref 0)
else
ARRAY(ref a,V(insert(n-1)),ref n,ref n)
end
fun fromList l =
let val n = length l
val N = n*n+1
val N = if N < 16 then 16 else roundsize N
val a = A.array(N,[])
fun ins(i,x) =
let val pos = index(a,i)
in A.update(a,pos,(i,x)::A.sub(a,pos)); x
end
fun insert(i,[]) = F(fn _ => raise Subscript)
| insert(i,[x]) = V(ins(i,x))
| insert(i,x::l) = (ins(i,x); insert(i+1,l))
in ARRAY(ref a,insert(0,l),ref n,ref n)
end
fun length(ARRAY(_,_,ref n,_)) = n
fun sub(a' as ARRAY(ref a,d,_,_),i) =
let val pos = index(a,i)
fun search [] = (case d of
V d => d
| F f => f i
| U f => let val x = f i
in update(a',i,x); x end
)
| search ((j,x)::l) = if i = j then x else search l
in search(A.sub(a,pos)) end
and update(a' as ARRAY(ref a,_,n,s as ref size),i,x) =
let val N = A.length a
val pos = index(a,i)
fun change([],l) =
if size+size >= N then grow(a',i,x)
else (s := size + 1; A.update(a,pos,(i,x)::l))
| change((y as (j,_))::l',l) =
if j = i then A.update(a,pos,(i,x)::l'@l)
else change(l',y::l)
in
change(A.sub(a,pos),[]);
if i >= !n then n := i+1 else ()
end
and grow(ARRAY(a' as ref a,_,_,_),i,x) =
let val N = A.length a
val N' = N+N
val a'' = A.array(N',[])
fun insert(i,x) =
let val pos = index(a'',i)
in A.update(a'',pos,(i,x)::A.sub(a'',pos)) end
in
A.app (List.app insert) a;
insert(i,x);
a' := a''
end
fun remove(a' as ARRAY(ref a,_,n,s as ref size),i) =
let val N = A.length a
val pos = index(a,i)
fun change([],_) = ()
| change((y as (j,_))::l',l) =
if j = i then (s := size - 1; A.update(a,pos,l'@l))
else change(l',y::l)
in change(A.sub(a,pos),[])
end
(* These seem bogus since they do not run in order *)
fun appi f (ARRAY(ref a,_,ref n,_)) = A.app (List.app f) a
fun app f (ARRAY(ref a,_,_,_)) = A.app (List.app (fn (_,x) => f x)) a
fun copy { src, dst, di } =
appi (fn (i, x) => update (dst, i, x)) src
fun copyVec { src, dst, di } =
Vector.appi (fn (i, x) => update (dst, di + i, x)) src
(* These seem bogus since they do not run in order *)
fun foldli f e (ARRAY(ref a,_,_,_)) =
A.foldl (fn (l, e) => List.foldl (fn ((i,x),e) => f (i,x,e)) e l) e a
fun foldri f e (ARRAY(ref a,_,_,_)) =
A.foldr (fn (l, e) => List.foldr (fn ((i,x),e) => f (i,x,e)) e l) e a
fun foldl f e (ARRAY(ref a,_,_,_)) =
A.foldl (fn (l,e) => List.foldl (fn ((_,x),e) => f(x,e)) e l) e a
fun foldr f e (ARRAY(ref a,_,_,_)) =
A.foldr (fn (l,e) => List.foldr (fn ((_,x),e) => f(x,e)) e l) e a
fun modifyi f (ARRAY(ref a,_,_,_)) =
A.modify (List.map (fn (i,x) => (i, f (i, x)))) a
fun modify f (ARRAY(ref a,_,_,_)) =
A.modify (List.map (fn (i,x) => (i,f x))) a
fun dom(ARRAY(ref a,_,_,_)) =
A.foldl (fn (e,l) => List.foldr (fn ((i,_),l) => i::l) l e) [] a
fun findi p (ARRAY(ref a,_,_,_)) = let
val len = A.length a
fun fnd i =
if i >= len then NONE
else case List.find p (A.sub (a, i)) of
NONE => fnd (i + 1)
| some => some
in
fnd 0
end
fun find p (ARRAY(ref a,_,_,_)) = let
val len = A.length a
fun fnd i =
if i >= len then NONE
else case List.find (p o #2) (A.sub (a, i)) of
NONE => fnd (i + 1)
| SOME (_, x) => SOME x
in
fnd 0
end
fun exists p arr = isSome (find p arr)
fun all p arr = not (isSome (find (not o p) arr))
fun collate _ _ = raise Fail "HashArray.collate unimplemented"
fun vector arr = Vector.fromList (rev (foldl op :: [] arr))
(* additional operations from Basis Library proposal 2015-003 *)
fun toList arr = foldr (op ::) [] arr
fun fromVector v = let
val n = Vector.length v
val N = n*n+1
val N = if N < 16 then 16 else roundsize N
val a = A.array(N, [])
fun ins (i, x) = let
val pos = index(a, i)
in
A.update(a, pos, (i,x)::A.sub(a, pos)); x
end
fun lp i = if (i < n)
then (ins (i, Vector.sub(v, i)); lp(i+1))
else if (i = 0)
then F(fn _ => raise Subscript)
else V(Vector.sub(v, i-1))
in
ARRAY(ref a, lp 0, ref n, ref n)
end
val toVector = vector
end
|
