public static class ObjectLists.SynchronizedList<K> extends ObjectCollections.SynchronizedCollection<K> implements ObjectList<K>, Serializable
| Modifier and Type | Method and Description |
|---|---|
void |
add(int i,
K k)
Inserts the specified element at the specified position in this list
(optional operation).
|
boolean |
addAll(int index,
Collection<? extends K> c)
Inserts all of the elements in the specified collection into this
list at the specified position (optional operation).
|
void |
addElements(int index,
K[] a)
Add (hopefully quickly) elements to this type-specific list.
|
void |
addElements(int index,
K[] a,
int offset,
int length)
Add (hopefully quickly) elements to this type-specific list.
|
int |
compareTo(List<? extends K> o)
Compares this object with the specified object for order.
|
boolean |
equals(Object o)
Indicates whether some other object is "equal to" this one.
|
K |
get(int i)
Returns the element at the specified position in this list.
|
void |
getElements(int from,
Object[] a,
int offset,
int length)
Copies (hopefully quickly) elements of this type-specific list into the
given array.
|
int |
hashCode()
Returns a hash code value for the object.
|
int |
indexOf(Object k)
Returns the index of the first occurrence of the specified element
in this list, or -1 if this list does not contain the element.
|
ObjectListIterator<K> |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
int |
lastIndexOf(Object k)
Returns the index of the last occurrence of the specified element
in this list, or -1 if this list does not contain the element.
|
ObjectListIterator<K> |
listIterator()
Returns a type-specific list iterator on the list.
|
ObjectListIterator<K> |
listIterator(int i)
Returns a type-specific list iterator on the list starting at a given
index.
|
K |
remove(int i)
Removes the element at the specified position in this list (optional
operation).
|
void |
removeElements(int from,
int to)
Removes (hopefully quickly) elements of this type-specific list.
|
K |
set(int i,
K k)
Replaces the element at the specified position in this list with the
specified element (optional operation).
|
void |
size(int size)
Sets the size of this list.
|
ObjectList<K> |
subList(int from,
int to)
Returns a type-specific view of the portion of this list from the index
from, inclusive, to the index to, exclusive. |
add, addAll, clear, contains, containsAll, isEmpty, remove, removeAll, retainAll, size, toArray, toArray, toStringadd, addAll, clear, contains, containsAll, isEmpty, remove, removeAll, replaceAll, retainAll, size, sort, spliterator, toArray, toArrayparallelStream, removeIf, streampublic K get(int i)
java.util.Listpublic K set(int i, K k)
java.util.Listpublic void add(int i,
K k)
java.util.Listpublic K remove(int i)
java.util.Listpublic int indexOf(Object k)
java.util.Listpublic int lastIndexOf(Object k)
java.util.ListlastIndexOf in interface List<K>k - element to search forpublic boolean addAll(int index,
Collection<? extends K> c)
java.util.Listpublic void getElements(int from,
Object[] a,
int offset,
int length)
ObjectListgetElements in interface ObjectList<K>from - the start index (inclusive).a - the destination array.offset - the offset into the destination array where to store the first
element copied.length - the number of elements to be copied.public void removeElements(int from,
int to)
ObjectListremoveElements in interface ObjectList<K>from - the start index (inclusive).to - the end index (exclusive).public void addElements(int index,
K[] a,
int offset,
int length)
ObjectListaddElements in interface ObjectList<K>index - the index at which to add elements.a - the array containing the elements.offset - the offset of the first element to add.length - the number of elements to add.public void addElements(int index,
K[] a)
ObjectListaddElements in interface ObjectList<K>index - the index at which to add elements.a - the array containing the elements.public void size(int size)
ObjectList
If the specified size is smaller than the current size, the last elements
are discarded. Otherwise, they are filled with
0/null/false.
size in interface ObjectList<K>size - the new size.public ObjectListIterator<K> listIterator()
ObjectListlistIterator in interface ObjectList<K>listIterator in interface List<K>List.listIterator()public ObjectListIterator<K> iterator()
ObjectCollection
Note that this specification strengthens the one given in
Iterable.iterator(), which was already strengthened in
the corresponding type-specific class, but was weakened by the fact that
this interface extends Collection.
iterator in interface ObjectCollection<K>iterator in interface ObjectIterable<K>iterator in interface ObjectList<K>iterator in interface Iterable<K>iterator in interface Collection<K>iterator in interface List<K>iterator in class ObjectCollections.SynchronizedCollection<K>Iterable.iterator()public ObjectListIterator<K> listIterator(int i)
ObjectListlistIterator in interface ObjectList<K>listIterator in interface List<K>i - index of the first element to be returned from the
list iterator (by a call to next)List.listIterator(int)public ObjectList<K> subList(int from, int to)
ObjectListfrom, inclusive, to the index to, exclusive.
Note that this specification strengthens the one given in
List.subList(int,int).
subList in interface ObjectList<K>subList in interface List<K>from - low endpoint (inclusive) of the subListto - high endpoint (exclusive) of the subListList.subList(int,int)public boolean equals(Object o)
java.lang.Object
The equals method implements an equivalence relation
on non-null object references:
x, x.equals(x) should return
true.
x and y, x.equals(y)
should return true if and only if
y.equals(x) returns true.
x, y, and z, if
x.equals(y) returns true and
y.equals(z) returns true, then
x.equals(z) should return true.
x and y, multiple invocations of
x.equals(y) consistently return true
or consistently return false, provided no
information used in equals comparisons on the
objects is modified.
x,
x.equals(null) should return false.
The equals method for class Object implements
the most discriminating possible equivalence relation on objects;
that is, for any non-null reference values x and
y, this method returns true if and only
if x and y refer to the same object
(x == y has the value true).
Note that it is generally necessary to override the hashCode
method whenever this method is overridden, so as to maintain the
general contract for the hashCode method, which states
that equal objects must have equal hash codes.
equals in interface Collection<K>equals in interface List<K>equals in class ObjectCollections.SynchronizedCollection<K>o - the reference object with which to compare.true if this object is the same as the obj
argument; false otherwise.Object.hashCode(),
HashMappublic int hashCode()
java.lang.ObjectHashMap.
The general contract of hashCode is:
hashCode method
must consistently return the same integer, provided no information
used in equals comparisons on the object is modified.
This integer need not remain consistent from one execution of an
application to another execution of the same application.
equals(Object)
method, then calling the hashCode method on each of
the two objects must produce the same integer result.
Object.equals(java.lang.Object)
method, then calling the hashCode method on each of the
two objects must produce distinct integer results. However, the
programmer should be aware that producing distinct integer results
for unequal objects may improve the performance of hash tables.
As much as is reasonably practical, the hashCode method defined by
class Object does return distinct integers for distinct
objects. (This is typically implemented by converting the internal
address of the object into an integer, but this implementation
technique is not required by the
Java™ programming language.)
hashCode in interface Collection<K>hashCode in interface List<K>hashCode in class ObjectCollections.SynchronizedCollection<K>Object.equals(java.lang.Object),
System.identityHashCode(java.lang.Object)public int compareTo(List<? extends K> o)
java.lang.ComparableThe implementor must ensure sgn(x.compareTo(y)) == -sgn(y.compareTo(x)) for all x and y. (This implies that x.compareTo(y) must throw an exception iff y.compareTo(x) throws an exception.)
The implementor must also ensure that the relation is transitive: (x.compareTo(y)>0 && y.compareTo(z)>0) implies x.compareTo(z)>0.
Finally, the implementor must ensure that x.compareTo(y)==0 implies that sgn(x.compareTo(z)) == sgn(y.compareTo(z)), for all z.
It is strongly recommended, but not strictly required that (x.compareTo(y)==0) == (x.equals(y)). Generally speaking, any class that implements the Comparable interface and violates this condition should clearly indicate this fact. The recommended language is "Note: this class has a natural ordering that is inconsistent with equals."
In the foregoing description, the notation sgn(expression) designates the mathematical signum function, which is defined to return one of -1, 0, or 1 according to whether the value of expression is negative, zero or positive.
compareTo in interface Comparable<List<? extends K>>o - the object to be compared.