The Fortress Language Specification - CiteSeerX

40.1.12 update(j:IndexInt, v: T): LinearSequenceT, n throws { IndexOutOfBoundsException }
40.1.13 updatenat k(j:IntegerStatick, v: T):LinearSequenceT, n where { k < n }
This is a functional version of subscripted value object assignment: element j of the result is the same as the given
value v , and all other elements are the same as before. Indexing is zero-origin; an IndexOutOfBoundsException is
thrown unless 0 ≤ j < n , where n is the length of the linear sequence. If the subscript is a static expression, then its
validity is checked statically, and no exception will occur at run time.
40.1.14 updatenat m(r:RangeOfStaticSizeIndexInt, m, v:LinearSequenceT, m):
LinearSequenceT, n
throws { IndexOutOfBoundsException } where { m ≤ n }
40.1.15 updateint a,nat m,int c(r:StaticRangea, m, c, v:LinearSequenceT, m):
LinearSequenceT, n
where { 0 ≤ a < n, 0 ≤ a + m · c < n }
This is a functional version of subscripted value object assignment: elements of the result selected by r are the same as
corresponding elements of v , and all other elements are the same as before; specifically, element r.lowerBound + k × r.stride
of the result is the same as element k of v , for all 0 ≤ k < m . Indexing is zero-origin; an IndexOutOfBoundsException
is thrown unless 0 ≤ j < n , where n is the length of the linear sequence. If the subscript is a static range, then its
validity is checked statically, and no exception will occur at run time.
40.1.16 opr ‖ nat m(self,other: LinearSequenceT, m):LinearSequenceT, n + m
The result is a linear sequence whose length is equal to the sum of the lengths of this linear sequence and the other
linear sequence. Element k of the result is the same as element k of this linear sequence if 0 ≤ k < n , and is the
same as element k − n of the other linear sequence if n ≤ k < n + m .
40.1.17 getter reverse():LinearSequenceT, n
The result is a linear sequence such that element k of the result is the same as element n − 1 − k of this linear
sequence, for all 0 ≤ k < n .
40.1.18 getter littleEndiannat b():BinaryLinearEndianSequenceb, n,false
where { T extends BinaryWordb }
40.1.19 getter bigEndiannat b():BinaryLinearEndianSequenceb, n,true
where { T extends BinaryWordb }
40.1.20 getter littleEndiannat b,bool bigEndianBytes,bool bigEndianBits():
BinaryEndianLinearEndianSequenceb,bigEndianBytes,bigEndianBits, n,false
where { T extends BinaryEndianWordb,bigEndianBytes,bigEndianBits }
40.1.21 getter bigEndiannat b,bool bigEndianBytes,bool bigEndianBits():
BinaryEndianLinearEndianSequenceb,bigEndianBytes,bigEndianBits, n,true
where { T extends BinaryEndianWordb,bigEndianBytes,bigEndianBits }
These conversion getters allow a linear sequence of (possibly endian) binary words to be treated as a specifically
little-endian or specifically big-endian linear sequence. This is especially useful just before invoking an endiannessdependent
method, for example s.littleEndian.countLeadingZeroBits() .
275