The Fortress Language Specification - CiteSeerX

40.6.4 opr nat m[r:RangeOfStaticSizeIndexInt, m] :
BinaryEndianLinearEndianSequence1,bigEndianBytes,bigEndianBits, m,bigEndianBits
throws { IndexOutOfBoundsException }
40.6.5 opr int a,nat m,int c[r: StaticRangea, m, c] :
BinaryEndianLinearEndianSequence1,bigEndianBytes,bigEndianBits, m,bigEndianBits
where { 0 ≤ a < 2 b , 0 ≤ a + m · c < 2 b }
Subscripting with a range of static size m returns the indicated subsequence of bits of this binary endian word. The
numbering of the bits is dictated by bigEndianBits . The result is a binary endian linear endian sequence of bits
whose sequence endianness is the same as the bit endianness of this binary endian word. Indexing is zero-origin;
an IndexOutOfBoundsException is thrown unless r ⊆ 0 #2 b . If the subscript is a static range, then its validity is
checked statically, and no exception will occur at run time. Element k of the result sequence is the same as the bit
that would be selected from this binary endian word by subscripting it with r.lowerBound + k × r.stride , for all
0 ≤ k < m .
40.6.6 opr [j: IndexInt] := (v: Bit):
BinaryEndianWordb,bigEndianBytes,bigEndianBits
throws { IndexOutOfBoundsException }
40.6.7 opr nat k[j: IntegerStatick] := (v:Bit):
BinaryEndianWordb,bigEndianBytes,bigEndianBits
where { k < 2 b }
After subscripted value object assignment, the bit that would be selected from this binary endian word by subscripting
it with j is the same as the given bit v , and all other bits are the same as before. Indexing is zero-origin; an
IndexOutOfBoundsException is thrown unless 0 ≤ j < 2 b . If the subscript is a static expression, then its validity
is checked statically, and no exception will occur at run time.
40.6.8 opr nat m[r:RangeOfStaticSizeIndexInt, m] := (v:BinaryLinearSequence1, m):
BinaryEndianWordb,bigEndianBytes,bigEndianBits
throws { IndexOutOfBoundsException }
40.6.9 opr int a,nat m,int c[r: StaticRangea, m, c] := (v:BinaryLinearSequence1, m):
BinaryEndianWordb,bigEndianBytes,bigEndianBits
where { 0 ≤ a < 2 b , 0 ≤ a + m · c < 2 b }
After subscripted value object assignment, bits that would be selected from this binary endian word by subscripting
it with r are the same as corresponding elements of v , and all other bits are the same as before; specifically, the bit
that would be selected from this binary endian word by subscripting it with r.lowerBound + k × r.stride is the same
as element k of v , for all 0 ≤ k < m . Indexing is zero-origin; an IndexOutOfBoundsException is thrown unless
r ⊆ 0 #2 b . If the subscript is a static range, then its validity is checked statically, and no exception will occur at run
time.
285