MONO_ARRAY2
signature
signature MONO_ARRAY2
(* OPTIONAL *)
structure Word8Array2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = Word8Vector.vector
where type elem = Word8.word
structure CharArray2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = CharVector.vector
where type elem = char
structure WideCharArray2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = WideCharVector.vector
where type elem = WideChar.char
structure BoolArray2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = BoolVector.vector
where type elem = bool
structure IntArray2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = IntVector.vector
where type elem = int
structure WordArray2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = WordVector.vector
where type elem = word
structure RealArray2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = RealVector.vector
where type elem = real
structure LargeIntArray2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = LargeIntVector.vector
where type elem = LargeInt.int
structure LargeWordArray2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = LargeWordVector.vector
where type elem = LargeWord.word
structure LargeRealArray2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = LargeRealVector.vector
where type elem = LargeReal.real
structure Int<N>Array2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = Int{N}Vector.vector
where type elem = Int{N}.int
structure Word<N>Array2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = Word{N}Vector.vector
where type elem = Word{N}.word
structure Real<N>Array2
:> MONO_ARRAY2 (* OPTIONAL *)
where type vector = Real{N}Vector.vector
where type elem = Real{N}.real
The MONO_ARRAY2
signature is a generic interface to mutable 2-dimensional arrays. As usual, arrays have the equality property that two arrays are equal only if they are the same array, i.e., created by the same call to a primitive array constructor such as array
, fromList
, etc.; otherwise they are not equal. This also holds for arrays of zero length.
The elements of 2-dimensional arrays are indexed by pair of integers (i,j)
where i
gives the row index, and i
gives the column index. As usual, indices start at 0, with increasing indices going from left to right and, in the case of rows, from top to bottom.
eqtype array
type elem
type vector
type region = {
base : array,
row : int,
col : int,
nrows : int option,
ncols : int option
}
datatype traversal = datatype Array2.traversal
val array : int * int * elem -> array
val fromList : elem list list -> array
val tabulate : traversal
-> int * int * (int * int -> elem)
-> array
val sub : array * int * int -> elem
val update : array * int * int * elem -> unit
val dimensions : array -> int * int
val nCols : array -> int
val nRows : array -> int
val row : array * int -> vector
val column : array * int -> vector
val copy : {
src : region,
dst : array,
dst_row : int,
dst_col : int
} -> unit
val appi : traversal
-> (int * int * elem -> unit)
-> region -> unit
val app : traversal -> (elem -> unit) -> array -> unit
val foldi : traversal
-> (int * int * elem * 'b -> 'b)
-> 'b -> region -> 'b
val fold : traversal
-> (elem * 'b -> 'b) -> 'b -> array -> 'b
val modifyi : traversal
-> (int * int * elem -> elem)
-> region -> unit
val modify : traversal -> (elem -> elem) -> array -> unit
type vector
type region = {
base : array,
row : int,
col : int,
nrows : int option,
ncols : int option
}
ncols = SOME
(w)
, the region includes only those elements in columns with indices in the range from w to col + (w - 1), inclusively. If ncols = NONE
, the region includes only those elements lying on or to the right of column col. A similar interpretation holds for the row
and nrows
fields. Thus, the region corresponds to all those elements with position (i,j) such that i lies in the specified range of rows and j lies in the specified range of columns.
A region reg is said to be valid if it denotes a legal subarray of its base array. More specifically, reg is valid if
0 <=when#row
reg <=nRows
(#base reg)
#nrows reg = NONE
, or
0 <=when#row
reg <= (#row
reg)+nr <=nRows
(#base reg)
#nrows reg = SOME(nr)
, and the analogous conditions hold for columns.
datatype traversal = datatype Array2.traversal
Array2.traversal
.
array (r, c, init)
Size
exception is raised.
fromList l
hd l
gives the first row, hd (tl l)
gives the second row, etc. It raises the Size
exception if the the resulting array size is too large, or if the lists in l do not all have the same length.
tabulate tr (r, c, f)
f (i,j)
. The elements are initialized in the traversal order specified by tr. If r < 0, c < 0 or the resulting array size is too large, the Size
exception is raised.
sub (arr, i, j)
nRows
arr <= i or nCols
arr <= j, then the Subscript
exception is raised.
update (arr, i, j, a)
nRows
arr <= i or nCols
arr <= j, then the Subscript
exception is raised.
dimensions arr
nCols arr
nRows arr
nCols
returns the number of columns, nRows
returns the number of rows and dimension
returns a pair containing the number of rows and columns of the array. The functions nRows
and nCols
are respectively equivalent to #1 o dimensions
and #2 o dimensions
row (arr, i)
Subscript
if i < 0 or nRows
arr <= i.
column (arr, j)
Subscript
if j < 0 or nCols
arr <= j.
copy {src, dst, dst_row, dst_col}
#row
src,#col
src)(th) element being copied into the destination array at position (dst_row,dst_col). If the source region is not valid, then the Subscript
exception is raised. Similarly, if the derived destination region (the source region src translated to (dst_row,dst_col)) is not valid in dst, then the Subscript
exception is raised.
Implementation note:
The
copy
function must correctly handle the case in which src and dst are equal, and the source and destination regions overlap.
appi tr f reg
app tr f arr
appi
function applies f to the elements of the region reg and supplies both the element and the element's coordinates in the base array to the function f. If reg is not valid, then the exception Subscript
is raised.
The function app
applies f to the whole array and does not supply the element's coordinates to f. Thus the expression app tr f arr
is equivalent to:
appi tr (f o #3) (arr, {row=0,col=0,nrows=NONE,ncols=NONE})
foldi tr f init reg
fold tr f init arr
foldi
function applies f to the elements of the region reg and supplies both the element and the element's coordinates in the base array to the function f. If reg is not valid, then the exception Subscript
is raised.
The function fold
applies f to the whole array and does not supply the element's coordinates to f. Thus the expression fold tr f init arr
is equivalent to:
foldi tr (fn (_,_,a,b) => f (a,b)) init (arr, {row=0, col=0, nrows=NONE, ncols=NONE})
modifyi tr f reg
modify tr f arr
modifyi
function applies f to the elements of the region reg and supplies both the element and the element's coordinates in the base array to the function f. If reg is not valid, then the exception Subscript
is raised.
The function modify
applies f to the whole array and does not supply the element's coordinates to f. Thus the expression modify f arr
is equivalent to:
modifyi (f o #3) (arr, {row=0,col=0,nrows=NONE,ncols=NONE})
Array2
If an implementation provides any structure matching MONO_ARRAY2
, it must also supply the structure Array2
and its signature ARRAY2
.
Note that the indices passed to argument functions in appi
, foldi
, and modifyi
are with respect to the underlying matrix and not based on the region. This is different from the convention for the analogous functions on 1-dimensional slices.
Implementation note:
Unlike one-dimensional types, the signature for 2-dimensional arrays does not specify any bounds on possible arrays. Implementations should support a total number of elements that is at least as large as the total number of elements in the corresponding single dimension array type.
Generated October 02, 2003
Last Modified May 21, 2000
Comments to John Reppy.
This document may be distributed freely over the internet as long as the copyright notice and license terms below are prominently displayed within every machine-readable copy.
Copyright © 2003 AT&T and Lucent Technologies. All rights reserved.
Permission is granted for internet users to make one paper copy for their
own personal use. Further hardcopy reproduction is strictly prohibited.
Permission to distribute the HTML document electronically on any medium
other than the internet must be requested from the copyright holders by
contacting the editors.
Printed versions of the SML Basis Manual are available from Cambridge
University Press.
To order, please visit
www.cup.org (North America) or
www.cup.cam.ac.uk (outside North America). |