Alice Project

The VectorSlice structure

________ Synopsis ____________________________________________________

    signature VECTOR_SLICE
    structure VectorSlice : VECTOR_SLICE

An extended version of the Standard ML Basis' VectorSlice structure.

See also: Vector, VectorPair, ArraySlice, MONO_VECTOR_SLICE

________ Import ______________________________________________________

Imported implicitly.

________ Interface ___________________________________________________

    signature VECTOR_SLICE =
	type 'a slice
	type 'a t = 'a slice

	val full :        'a vector -> 'a slice
	val slice :       'a vector * int * int option -> 'a slice
	val subslice :    'a slice * int * int option -> 'a slice
	val vector :      'a slice -> 'a vector
	val toVector :    'a slice -> 'a vector
	val toList :      'a slice -> 'a list

	val length :      'a slice -> int
	val isEmpty :     'a slice -> bool
	val base :        'a slice -> 'a vector * int * int
	val sub :         'a slice * int -> 'a
	val getItem :     'a slice -> ('a * 'a slice) option

	val triml :       int -> 'a slice -> 'a slice
	val trimr :       int -> 'a slice -> 'a slice
	val splitAt :     'a slice * int -> 'a slice * 'a slice
	val splitl :      ('a -> bool) -> 'a slice -> 'a slice * 'a slice
	val splitr :      ('a -> bool) -> 'a slice -> 'a slice * 'a slice
	val dropl :       ('a -> bool) -> 'a slice -> 'a slice
	val dropr :       ('a -> bool) -> 'a slice -> 'a slice
	val takel :       ('a -> bool) -> 'a slice -> 'a slice
	val taker :       ('a -> bool) -> 'a slice -> 'a slice

	val concat :      'a slice list -> 'a vector
	val rev :         'a slice -> 'a vector

	val app :         ('a -> unit) -> 'a slice -> unit
	val appr :        ('a -> unit) -> 'a slice -> unit
	val map :         ('a -> 'b) -> 'a slice -> 'b vector
	val foldl :       ('a * 'b -> 'b) -> 'b -> 'a slice -> 'b
	val foldr :       ('a * 'b -> 'b) -> 'b -> 'a slice -> 'b
	val all :         ('a -> bool) -> 'a slice -> bool
	val exists :      ('a -> bool) -> 'a slice -> bool
	val find :        ('a -> bool) -> 'a slice -> 'a option

	val appi :        (int * 'a -> unit) -> 'a slice -> unit
	val appri :       (int * 'a -> unit) -> 'a slice -> unit
	val mapi :        (int * 'a -> 'b) -> 'a slice -> 'b vector
	val foldli :      (int * 'a * 'b -> 'b) -> 'b -> 'a slice -> 'b
	val foldri :      (int * 'a * 'b -> 'b) -> 'b -> 'a slice -> 'b
	val alli :        (int * 'a -> bool) -> 'a slice -> bool
	val existsi :     (int * 'a -> bool) -> 'a slice -> bool
	val findi :       (int * 'a -> bool) -> 'a slice -> (int * 'a) option

	val contains :    ''a slice -> ''a -> bool
	val notContains : ''a slice -> ''a -> bool

	val equal :       ('a * 'a -> bool) -> 'a slice * 'a slice -> bool
	val collate :     ('a * 'a -> order) -> 'a slice * 'a slice -> order

	val isSorted :    ('a * 'a -> order) -> 'a slice -> bool
	val sort :        ('a * 'a -> order) -> 'a slice -> 'a vector

________ Description _________________________________________________

Items not described here are as in the Standard ML Basis' VectorSlice structure.

type t = slice

A local synonym for type slice.

toVector sl

Creates a vector of the elements of sl. Equivalent to vector sl.

toList sl

Creates a list of the elements of sl in order of increasing indices. Equivalent to Vector.toList (toVector sl).

rev sl

Returns a vector that contains the elements of sl in reverse order. Equivalent to Vector.rev (toVector sl).

triml k sl
trimr k sl

These functions remove k elements from the left (respectively, right) of the slice sl. If k is greater than the size of the slice, an empty slice is returned. Specifically, for a slice sl = slice(vec,i,j) and kj, we have:

        triml k sl = slice(vec, i+k, j-k)
        trimr k sl = slice(vec, i, j-k)

The exception Subscript is raised if k < 0. This exception is raised when triml k or trimr k is evaluated.

splitAt (sl, i)

Returns the pair of slices (sl1, sl2), where sl1 contains the first i characters of sl and sl2 contains the rest, assuming 0 ≤ isize sl. Otherwise, it raises Subscript.

splitl f sl
splitr f sl

These functions scan sl from left to right (respectively, right to left) looking for the first element that does not satisfy the predicate f. They return the pair (sl1, sl2) giving the split of the slice into the span up to that element and the rest. The slice sl1 is the left side of the split, sl2the right side.

dropl f sl
dropl f sl
takel f sl
taker f sl

These routines scan the slice sl for the first element not satisfying the predicate f. The functions dropl and takel scan left to right (i.e., increasing indices), while dropr and taker scan from the right. The drop functions drop the maximal subslice consisting of elements satisfying the predicate, while the take functions return the maximal such subslice. These can be defined in terms of the split operations:

        takel f sl = #1(splitl f sl)
        dropl f sl = #2(splitl f sl)
        taker f sl = #2(splitr f sl)
        dropr f sl = #1(splitr f sl)
appr f sl
appri f sl

Like app and appi, but apply f in right to left order (i.e., decreasing indices). The expression appr f sl is equivalent to:

        appri (f o #2) sl
alli f sl
existsi f sl

Indexed versions of the functions all and exists. The index of each element is passed to f as an additional argument. The following equivalences hold:

        all f sl    = alli (f o #2) sl
        exists f sl = existsi (f o #2) sl
contains sl a

Returns true if the element a occurs in the slice sl; otherwise false.

notContains sl a

Returns true if the element a does not occur in the slice sl; otherwise false. Equivalent to not(contains sl a).

equal eq (sl1, sl2)

Creates an equality function on slices given an equality on the element type.

isSorted f sl

Returns true iff the elements in sl are sorted with respect to the ordering function f.

sort f sl

Returns a vector that contains the same elements as sl, but sorted with respect to the ordering function f. Sorting may be unstable with respect to equal elements.

last modified 2007/Mar/30 17:10