abstract class AbstractListShortList extends AbstractCollectionShortCollection implements ShortList
Constructor and Description |
---|
AbstractListShortList() |
Modifier and Type | Method and Description |
---|---|
void |
add(int index,
short element)
Inserts the specified element at the specified position
(optional operation).
|
boolean |
addAll(int index,
ShortCollection collection)
Inserts all of the elements in the specified collection into me,
at the specified position (optional operation).
|
boolean |
equals(java.lang.Object obj)
Returns
true iff that is an ShortList
that contains the same elements in the same order as me. |
short |
get(int index)
Returns the value of the element at the specified position
within me.
|
protected java.util.Collection |
getCollection() |
protected abstract java.util.List |
getList() |
int |
hashCode()
Returns my hash code.
|
int |
indexOf(short element)
Returns the index of the first occurrence
of the specified element within me,
or
-1 if I do not contain
the element. |
int |
lastIndexOf(short element)
Returns the index of the last occurrence
of the specified element within me,
or -1 if I do not contain the element.
|
ShortListIterator |
listIterator()
|
ShortListIterator |
listIterator(int index)
|
short |
removeElementAt(int index)
Removes the element at the specified position in
(optional operation).
|
short |
set(int index,
short element)
Replaces the element at the specified
position in me with the specified element
(optional operation).
|
ShortList |
subList(int fromIndex,
int toIndex)
Returns a view of the elements within me
between the specified fromIndex, inclusive, and
toIndex, exclusive.
|
add, addAll, clear, contains, containsAll, isEmpty, iterator, removeAll, removeElement, retainAll, size, toArray, toArray, toString
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
addAll, clear, contains, containsAll, isEmpty, removeAll, removeElement, retainAll, size, toArray, toArray
public void add(int index, short element)
ShortList
public boolean addAll(int index, ShortCollection collection)
ShortList
iterator
.addAll
in interface ShortList
index
- the index at which to insert the first element from
the specified collectioncollection
- the ShortCollection
of elements to addtrue
iff I changed as a result of this callpublic short get(int index)
ShortList
public int indexOf(short element)
ShortList
-1
if I do not contain
the element.public int lastIndexOf(short element)
ShortList
lastIndexOf
in interface ShortList
element
- the element to search for-1
if no such matching element can be foundpublic ShortListIterator listIterator()
listIterator
in interface ShortList
public ShortListIterator listIterator(int index)
listIterator
in interface ShortList
public short removeElementAt(int index)
ShortList
removeElementAt
in interface ShortList
index
- the index of the element to removepublic short set(int index, short element)
ShortList
public ShortList subList(int fromIndex, int toIndex)
ShortList
ShortList
is backed by me, so that any changes in
the returned list are reflected in me, and vice-versa.
The returned list supports all of the optional operations
that I support.
Note that when fromIndex == toIndex
,
the returned list is initially empty, and when
fromIndex == 0 && toIndex == size()
the returned list is my "improper" sublist, containing all my elements.
The semantics of the returned list become undefined
if I am structurally modified in any way other than
via the returned list.public boolean equals(java.lang.Object obj)
ShortList
true
iff that is an ShortList
that contains the same elements in the same order as me.
In other words, returns true
iff that is
an ShortList
that has the same size
as me,
and for which the elements returned by its
iterator
are equal (==
) to
the corresponding elements within me.
(This contract ensures that this method works properly across
different implementations of the ShortList
interface.)public int hashCode()
ShortList
ShortList
is defined to be the
result of the following calculation:
int hash = 1; for(ShortIterator iter = iterator(); iter.hasNext(); ) { short value = iter.next(); hash = 31*hash + (int)(value ^ (value >>> 32)); }This contract ensures that this method is consistent with
equals
and with the
hashCode
method of a List
of Short
s.protected final java.util.Collection getCollection()
getCollection
in class AbstractCollectionShortCollection
protected abstract java.util.List getList()
Copyright (c) 2002-2003 - Apache Software Foundation