|
AlgART Home | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface UpdatableShortArray extends ShortArray, UpdatablePIntegerArray
AlgART array of short values, read/write access, no resizing.
AlgART Laboratory 2007-2013
| Modifier and Type | Method and Description |
|---|---|
UpdatableShortArray |
asUnresizable()
Returns an unresizable view of this array. |
UpdatableShortArray |
fill(long position,
long count,
short value)
Fills count elements of this array, starting from position index, by the specified value. |
UpdatableShortArray |
fill(short value)
Fills all elements of this array by the specified value. |
void |
setShort(long index,
short value)
Sets the element #index to specified value. |
UpdatableShortArray |
subArr(long position,
long count)
Equivalent to subArray(position, position + count). |
UpdatableShortArray |
subArray(long fromIndex,
long toIndex)
Returns a view of the portion of this array between fromIndex, inclusive, and toIndex, exclusive. |
| Methods inherited from interface net.algart.arrays.ShortArray |
|---|
asImmutable, asTrustedImmutable, buffer, buffer, buffer, buffer, getShort, indexOf, lastIndexOf, mutableClone, mutableType, type, updatableClone, updatableType |
| Methods inherited from interface net.algart.arrays.PFixedArray |
|---|
getInt, getLong, indexOf, lastIndexOf, maxPossibleValue, minPossibleValue |
| Methods inherited from interface net.algart.arrays.UpdatablePArray |
|---|
fill, fill, fill, fill, setDouble, setInt, setLong |
| Methods inherited from interface net.algart.arrays.PArray |
|---|
bitsPerElement, getDouble, indexOf, isZeroFilled, lastIndexOf, maxPossibleValue, minPossibleValue |
| Methods inherited from interface net.algart.arrays.UpdatableArray |
|---|
asCopyOnNextWrite, copy, copy, copy, setData, setData, setElement, setNonNew, shallowClone, swap, swap, swap |
| Methods inherited from interface net.algart.arrays.Array |
|---|
byteOrder, capacity, checkUnallowedMutation, elementType, equals, flushResources, flushResources, freeResources, freeResources, getData, getData, getElement, hashCode, isCopyOnNextWrite, isImmutable, isLazy, isNew, isNewReadOnlyView, isUnresizable, length, loadResources, newJavaArray, toString |
| Method Detail |
|---|
void setShort(long index,
short value)
index - index of element to replace.value - element to be stored at the specified position.java.lang.IndexOutOfBoundsException - if index is out of range 0..length()-1.UpdatableShortArray fill(short value)
fill(0, thisArray.length(), value).
value - the value to be stored in all elements of the array.fill(long, long, short),
Arrays.zeroFill(UpdatableArray)
UpdatableShortArray fill(long position,
long count,
short value)
for (long k = 0; k < count; k++) {
setShort(position + k, value);
}
but works much faster and checks indexes
(and throws possible IndexOutOfBoundsException) in the very beginning.
position - start index (inclusive) to be filled.count - number of filled elements.value - the value to be stored in the elements of the array.java.lang.IndexOutOfBoundsException - for illegal position and count
(position < 0 || count < 0 || position + count > length()).fill(short),
Arrays.zeroFill(UpdatableArray)
UpdatableShortArray subArray(long fromIndex,
long toIndex)
ArrayArray.capacity() method) will be
equal to the its length (returned by Array.length(), that is toIndex-fromIndex.
type of elements of the returned array is the same
as the type of elements of this array.immutable,
trusted immutable or
copy-on-next-write, if, and only if,
this array is immutable, trusted immutable or copy-on-next-write correspondingly.UpdatableArray interface,
then the returned array also implements it.
If (and only if) this array implements DirectAccessible interface,
then the returned array also implements it.
The returned array never implements MutableArray interface;
it is always unresizable.Like List.subList method, this method eliminates the need
for explicit range operations.
For example, you may use Arrays.sort(UpdatableArray, ArrayComparator)
method for sorting a fragment of the array.
Unlike List.subList, the semantics of the array returned
by this method is well-defined in any case, even in case of
resizing of the source array.
Namely, if the internal storage of this or returned array is reallocated,
then the returned array will cease to be a view of this array.
The only possible reasons for reallocation are the following:
calling MutableArray.length(long),
MutableArray.ensureCapacity(long) or MutableArray.trim() methods
for this array, or any modification of this or returned array in a case when
this array is copy-on-next-write.
Also, if the length of this array will be reduced,
it can lead to clearing some elements in returned array:
see comments to MutableArray.length(long) method.
subArray in interface ArraysubArray in interface UpdatableArraysubArray in interface UpdatablePArraysubArray in interface UpdatablePFixedArraysubArray in interface UpdatablePIntegerArrayfromIndex - low endpoint (inclusive) of the subarray.toIndex - high endpoint (exclusive) of the subarray.Array.subArr(long, long)
UpdatableShortArray subArr(long position,
long count)
ArraysubArray(position, position + count).
The only possible difference is other exception messages.
If position+count>Long.MAX_VALUE (overflow),
an exception message is allowed to be not fully correct
(maximal speed is more important than absolutely correct exception messages for such exotic situations).
subArr in interface ArraysubArr in interface UpdatableArraysubArr in interface UpdatablePArraysubArr in interface UpdatablePFixedArraysubArr in interface UpdatablePIntegerArrayposition - start position (inclusive) of the subarray.count - number of elements in the subarray.Array.subArray(long, long)UpdatableShortArray asUnresizable()
UpdatableArrayThe returned view (when it is not a reference to this object) contains the same elements
as this array, but independent length, start offset, capacity, copy-on-next-write and
possible other information about array characteristics besides its elements,
as for UpdatableArray.shallowClone() method.
If modifications of this or returned array characteristics lead to reallocation
of the internal storage, then the returned array ceases to be a view of this array.
The only possible reasons for reallocation are the following:
calling MutableArray.length(long),
MutableArray.ensureCapacity(long) or MutableArray.trim() methods
for this array, or any modification of this or returned array in a case when
this array is copy-on-next-write.
Resizable arrays, created by this package, implement full MutableArray
interface, but unresizable ones implement only its UpdatableArray superinterface.
asUnresizable in interface UpdatableArrayasUnresizable in interface UpdatablePArrayasUnresizable in interface UpdatablePFixedArrayasUnresizable in interface UpdatablePIntegerArrayArray.isUnresizable()
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||