|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.apache.commons.collections.primitives.AbstractByteCollection
org.apache.commons.collections.primitives.RandomAccessByteList
Abstract base class for ByteLists backed
by random access structures like arrays.
get(int)
and size(). Mutable subclasses
should also override set(int, byte). Variably-sized
subclasses should also override add(int, byte)
and removeElementAt(int). All other methods
have at least some base implementation derived from
these. Subclasses may choose to override these methods
to provide a more efficient implementation.
| Nested Class Summary | |
private static class |
RandomAccessByteList.ComodChecker
|
protected static class |
RandomAccessByteList.RandomAccessByteListIterator
|
protected static class |
RandomAccessByteList.RandomAccessByteSubList
|
| Field Summary | |
private int |
_modCount
|
| Constructor Summary | |
protected |
RandomAccessByteList()
Constructs an empty list. |
| Method Summary | |
boolean |
add(byte element)
Appends the specified element to the end of me (optional operation). |
void |
add(int index,
byte element)
Unsupported in this implementation. |
boolean |
addAll(int index,
ByteCollection collection)
Inserts all of the elements in the specified collection into me, at the specified position (optional operation). |
boolean |
equals(java.lang.Object that)
Returns true iff that is an ByteList
that contains the same elements in the same order as me. |
abstract byte |
get(int index)
Returns the value of the element at the specified position within me. |
protected int |
getModCount()
Get my count of structural modifications. |
int |
hashCode()
Returns my hash code. |
protected void |
incrModCount()
Increment my count of structural modifications. |
int |
indexOf(byte element)
Returns the index of the first occurrence of the specified element within me, or -1 if I do not contain
the element. |
ByteIterator |
iterator()
Returns an iterator over all my elements,
in the appropriate sequence. |
int |
lastIndexOf(byte element)
Returns the index of the last occurrence of the specified element within me, or -1 if I do not contain the element. |
ByteListIterator |
listIterator()
Returns a bidirectional iterator
over all my elements, in the appropriate sequence. |
ByteListIterator |
listIterator(int index)
Returns a bidirectional iterator
over all my elements, in the appropriate sequence,
starting at the specified position. |
byte |
removeElementAt(int index)
Unsupported in this implementation. |
byte |
set(int index,
byte element)
Unsupported in this implementation. |
abstract int |
size()
Returns the number of elements I contain. |
ByteList |
subList(int fromIndex,
int toIndex)
Returns a view of the elements within me between the specified fromIndex, inclusive, and toIndex, exclusive. |
java.lang.String |
toString()
|
| Methods inherited from class org.apache.commons.collections.primitives.AbstractByteCollection |
addAll, clear, contains, containsAll, isEmpty, removeAll, removeElement, retainAll, toArray, toArray |
| Methods inherited from class java.lang.Object |
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface org.apache.commons.collections.primitives.ByteCollection |
addAll, clear, contains, containsAll, isEmpty, removeAll, removeElement, retainAll, toArray, toArray |
| Field Detail |
private int _modCount
| Constructor Detail |
protected RandomAccessByteList()
| Method Detail |
public abstract byte get(int index)
ByteList
get in interface ByteListindex - the index of the element to return
public abstract int size()
ByteCollection
size in interface ByteCollectionsize in class AbstractByteCollectionpublic byte removeElementAt(int index)
removeElementAt in interface ByteListindex - the index of the element to remove
java.lang.UnsupportedOperationException - since this method is not supported
public byte set(int index,
byte element)
set in interface ByteListindex - the index of the element to changeelement - the value to be stored at the specified position
java.lang.UnsupportedOperationException - since this method is not supported
public void add(int index,
byte element)
add in interface ByteListindex - the index at which to insert the elementelement - the value to insert
java.lang.UnsupportedOperationException - since this method is not supportedpublic boolean add(byte element)
ByteListtrue
iff I changed as a result of this call.
If a collection refuses to add the specified
element for any reason other than that it already contains
the element, it must throw an exception (rather than
simply returning false). This preserves the invariant
that a collection always contains the specified element after
this call returns.
add in interface ByteListadd in class AbstractByteCollection
public boolean addAll(int index,
ByteCollection collection)
ByteListiterator.
addAll in interface ByteListindex - the index at which to insert the first element from
the specified collectioncollection - the ByteCollection of elements to add
true iff I changed as a result of this callpublic int indexOf(byte element)
ByteList-1 if I do not contain
the element.
indexOf in interface ByteListelement - the element to search for
-1 if no such matching element can be foundpublic int lastIndexOf(byte element)
ByteList
lastIndexOf in interface ByteListelement - the element to search for
-1 if no such matching element can be foundpublic ByteIterator iterator()
ByteListiterator over all my elements,
in the appropriate sequence.
iterator in interface ByteListiterator in class AbstractByteCollectionpublic ByteListIterator listIterator()
ByteListbidirectional iterator
over all my elements, in the appropriate sequence.
listIterator in interface ByteListpublic ByteListIterator listIterator(int index)
ByteListbidirectional iterator
over all my elements, in the appropriate sequence,
starting at the specified position. The
specified index indicates the first
element that would be returned by an initial
call to the
next
method. An initial call to the
previous
method would return the element with the specified
index minus one.
listIterator in interface ByteList
public ByteList subList(int fromIndex,
int toIndex)
ByteListByteList
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.
subList in interface ByteListfromIndex - the smallest index (inclusive) in me that appears in
the returned listtoIndex - the largest index (exclusive) in me that appears in the
returned list
public boolean equals(java.lang.Object that)
ByteListtrue iff that is an ByteList
that contains the same elements in the same order as me.
In other words, returns true iff that is
an ByteList 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 ByteList interface.)
equals in interface ByteListpublic int hashCode()
ByteListByteList is defined to be the
result of the following calculation:
int hash = 1;
for(ByteIterator iter = iterator(); iter.hasNext(); ) {
byte 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 Bytes.
hashCode in interface ByteListpublic java.lang.String toString()
protected int getModCount()
protected void incrModCount()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||