public final class EqHashTable.Values extends Object implements XTable.Values<K,V>
| Modifier and Type | Class and Description |
|---|---|
class |
EqHashTable.Values.OldValues |
XDecreasingList.Creator<E>XProcessingList.Factory<E>XIterable.Executor<E>| Constructor and Description |
|---|
Values() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
applies(Predicate<? super V> predicate)
Tests each element of the collection on the given predicate.
|
V |
at(long index) |
void |
clear()
Clears all elements from the collection while leaving the capacity as it is.
|
long |
consolidate()
Consolidates the internal storage of this collection by discarding all elements of the internal storage that
have become obsolete or otherwise unneeded anymore.
|
boolean |
contains(V value)
Checks if the given element is contained in the collection.
|
boolean |
containsAll(XGettingCollection<? extends V> values) |
boolean |
containsId(V value)
Special version of contains() that guarantees to use identity comparison (" == ") when searching for the
given element regardless of the collection's internal logic.
This method has the same behavior as XGettingCollection.containsSearched(Predicate) with a Predicate implementation
that checks for object identity. |
boolean |
containsSearched(Predicate<? super V> predicate) |
XList<V> |
copy()
Creates a true copy of this collection which references the same elements as this collection does
at the time the method is called.
|
<T extends Consumer<? super V>> |
copySelection(T target,
long... indices)
Iterates through all the elements of the given indices and calls the
Consumer.accept(Object) on the target Consumer. |
<T extends Consumer<? super V>> |
copyTo(T target)
Calls
Consumer.accept(Object) on the target Consumer for all the elements of this collection. |
long |
count(V value)
Count how many times this element matches another element in the collection
using the
Equalator. |
long |
countBy(Predicate<? super V> predicate)
Count how many matches are found using the given predicate on each element of the collection.
|
<T extends Consumer<? super V>> |
distinct(T target)
Calls
Consumer.accept(Object) on the target Consumer for all the unique/distinct
elements of this collection. |
<T extends Consumer<? super V>> |
distinct(T target,
Equalator<? super V> equalator)
Calls
Consumer.accept(Object) on the target Consumer for all the unique/distinct
elements of this collection. |
Equalator<? super V> |
equality() |
boolean |
equals(XGettingCollection<? extends V> samples,
Equalator<? super V> equalator) |
boolean |
equalsContent(XGettingCollection<? extends V> samples,
Equalator<? super V> equalator)
Returns
true if all elements of this list and the passed list are sequentially equal as defined
by the passed equalator. |
<T extends Consumer<? super V>> |
except(XGettingCollection<? extends V> other,
Equalator<? super V> equalator,
T target)
Calls
Consumer.accept(Object) on the target Consumer for each
element of this collection that is not contained in the other collection (through the given equalator). |
V |
fetch() |
EqHashTable.Values |
fill(long offset,
long length,
V value)
Fills all slots from the offset to the offset+length with the given element,
regardless of whether or not a slot is
null. |
<T extends Consumer<? super V>> |
filterTo(T target,
Predicate<? super V> predicate)
Calls
Consumer.accept(Object) on the target Consumer for all the elements of this collection
which test true on the given predicate. |
V |
first()
Gets first element or throws
IndexOutOfBoundsException if the collection is empty. |
V |
get()
Gets one element from the collection.
|
boolean |
hasVolatileElements()
Tells if this collection contains volatile elements.
An element is volatile, if it can become no longer reachable by the collection without being removed from the collection. |
XImmutableList<V> |
immure()
Provides an instance of an immutable collection type with equal behavior and data as this instance.
|
long |
indexBy(Predicate<? super V> predicate)
Iterates forwards through the collection and returns the index of the first element that the passed {link Predicate}
applies to immediately.
Stops iterating on the first element that the predicate applies to. |
long |
indexOf(V value) |
<T extends Consumer<? super V>> |
intersect(XGettingCollection<? extends V> other,
Equalator<? super V> equalator,
T target)
Tests equality between each element of the two lists and calls
Consumer.accept(Object) on the target Consumer for the
equal elements.Therefore it effectively creates a mathematical intersection between the two collections. |
boolean |
isEmpty() |
boolean |
isFull() |
boolean |
isSorted(Comparator<? super V> comparator)
Tests if the collection is sorted according to the given comparator.
|
<P extends Consumer<? super V>> |
iterate(P procedure)
Executes the given procedure for each element of the
XIterable
until all elements have been processed or the action throws an
exception. |
<P extends IndexedAcceptor<? super V>> |
iterateIndexed(P procedure)
Iterates over elements with the
IndexedAcceptor to use
not only the element itself but also its coherent index. |
Iterator<V> |
iterator() |
<A> A |
join(BiConsumer<? super V,? super A> joiner,
A aggregate)
Iterates over all elements of the collections and calls the joiner
with each element and the aggregate.
|
V |
last()
Gets last element or throws
IndexOutOfBoundsException if the collection is empty. |
long |
lastIndexBy(Predicate<? super V> predicate)
Iterates backwards through the collection and returns the index of the last element that the passed
Predicate
applies to immediately.Stops iterating on the first element that the predicate applies to. |
long |
lastIndexOf(V value) |
ListIterator<V> |
listIterator() |
ListIterator<V> |
listIterator(long index) |
V |
max(Comparator<? super V> comparator) |
long |
maximumCapacity()
Returns the maximum amount of elements this carrier instance can contain.
The actual value may be depend on the configuration of the concrete instance or may depend only on the implementation of the carrier (meaning it is constant for all instances of the implementation, e.g. |
long |
maxIndex(Comparator<? super V> comparator) |
V |
min(Comparator<? super V> comparator) |
long |
minIndex(Comparator<? super V> comparator) |
<C extends Consumer<? super V>> |
moveSelection(C target,
long... indices) |
<C extends Consumer<? super V>> |
moveTo(C target,
Predicate<? super V> predicate) |
boolean |
nullAllowed()
Defines if null-elements are allowed inside the collection or not.
|
boolean |
nullContained() |
long |
nullRemove() |
EqHashTable.Values.OldValues |
old() |
long |
optimize()
Optimizes internal memory usage by rebuilding the storage to only occupy as much memory as needed to store
the currently contained elements in terms of the collection's current memory usage configuration
(e.g.
|
EqHashTable<K,V> |
parent() |
V |
peek()
Gets last element or null if the collection is empty.
|
V |
pick() |
V |
pinch() |
V |
poll()
Gets first element or null if the collection is empty.
|
V |
pop() |
<P extends Consumer<? super V>> |
process(P procedure) |
SubListProcessor<V> |
range(long fromIndex,
long toIndex) |
long |
remainingCapacity() |
long |
remove(V value) |
long |
removeAll(XGettingCollection<? extends V> values) |
V |
removeAt(long index) |
long |
removeBy(Predicate<? super V> predicate) |
long |
removeDuplicates() |
long |
removeDuplicates(Equalator<? super V> equalator) |
boolean |
removeOne(V element) |
EqHashTable.Values |
removeRange(long startIndex,
long length) |
long |
removeSelection(long[] indices) |
long |
replace(Predicate<? super V> predicate,
V substitute) |
long |
replace(V value,
V replacement) |
long |
replaceAll(XGettingCollection<? extends V> values,
V replacement) |
boolean |
replaceOne(Predicate<? super V> predicate,
V substitute) |
boolean |
replaceOne(V value,
V replacement)
Replaces the first element that is equal to the given element
with the replacement and then returns true.
|
long |
retainAll(XGettingCollection<? extends V> values)
Removing all elements except the ones contained in the given elements-collection.
|
EqHashTable.Values |
retainRange(long startIndex,
long length)
Removing all elements but the ones from the offset (basically start index)
to the offset+length (end index).
|
V |
retrieve(V value) |
V |
retrieveBy(Predicate<? super V> predicate) |
EqHashTable.Values |
reverse()
Reverses the order of its own elements and returns itself.
|
long |
scan(Predicate<? super V> predicate)
Iterates through the collection and returns the index of the last element that the passed
Predicate
applied to ("scanning"). |
V |
search(Predicate<? super V> predicate)
Returns the first contained element matching the passed predicate.
|
V |
seek(V sample)
Returns the first contained element matching the passed sample as defined by the collection's equality logic
or null, if no fitting element is contained.
|
boolean |
set(long index,
V value) |
EqHashTable.Values |
set(long offset,
V[] src,
int srcIndex,
int srcLength) |
EqHashTable.Values |
set(long offset,
XGettingSequence<? extends V> values,
long valuesOffset,
long valuesLength) |
EqHashTable.Values |
setAll(long offset,
V... values) |
void |
setFirst(V value) |
V |
setGet(long index,
V value) |
void |
setLast(V value) |
EqHashTable.Values |
shiftBy(long sourceIndex,
long distance)
Moves the element from the sourceIndex in the sequence to a higher index position.
All other elements are possibly moved to create the empty slot for the shifting element. |
EqHashTable.Values |
shiftBy(long sourceIndex,
long distance,
long length)
Moves multiple elements from the sourceIndex in the sequence to a higher index position.
All other elements are possibly moved to create the empty slot for the shifting elements. |
EqHashTable.Values |
shiftTo(long sourceIndex,
long targetIndex)
Moves the element from the sourceIndex in the sequence to the targetIndex.
All other elements are possibly moved to create the empty slot for the shifting element. |
EqHashTable.Values |
shiftTo(long sourceIndex,
long targetIndex,
long length)
Moves multiple elements from the sourceIndex in the sequence to the targetIndex.
All other elements are possibly moved to create the empty slot for the shifting element. |
long |
size() |
EqHashTable.Values |
sort(Comparator<? super V> comparator)
Sorts this collection according to the given comparator
and returns itself.
|
long |
substitute(Function<? super V,? extends V> mapper) |
long |
substitute(Predicate<? super V> predicate,
Function<V,V> mapper) |
EqHashTable.Values |
swap(long indexA,
long indexB) |
EqHashTable.Values |
swap(long indexA,
long indexB,
long length) |
Object[] |
toArray()
Returns an array containing all of the elements in this collection.
|
V[] |
toArray(Class<V> type)
Returns a typed array containing all of the elements in this collection.
|
EqHashTable.Values |
toReversed()
Creates a new
XGettingSequence with the reversed order of elements. |
String |
toString() |
void |
truncate()
Clears (and reinitializes if needed) this collection in the fastest possible way, i.e.
|
<T extends Consumer<? super V>> |
union(XGettingCollection<? extends V> other,
Equalator<? super V> equalator,
T target)
Calls
Consumer.accept(Object) on the target Consumer for all the elements of this collection. |
ListView<V> |
view()
Creates a view of this collection and returns it.
|
SubListView<V> |
view(long fromIndex,
long toIndex)
Creates a sub-view of this collection and returns it.
|
public final Equalator<? super V> equality()
equality in interface XGettingCollection<V>public final XList<V> copy()
XGettingCollectioncopy in interface XBasicTable.Values<K,V>copy in interface XDecreasingList<V>copy in interface XDecreasingSequence<V>copy in interface XGettingBag<V>copy in interface XGettingCollection<V>copy in interface XGettingList<V>copy in interface XGettingSequence<V>copy in interface XGettingTable.Values<K,V>copy in interface XMap.Values<K,V>copy in interface XProcessingBag<V>copy in interface XProcessingList<V>copy in interface XReplacingBag<V>copy in interface XSettingList<V>copy in interface XSettingSequence<V>copy in interface XSortableSequence<V>copy in interface XTable.Values<K,V>copy in interface Copyablepublic final <P extends Consumer<? super V>> P iterate(P procedure)
XIterableXIterable
until all elements have been processed or the action throws an
exception. Unless otherwise specified by the implementing class,
procedures are performed in the order of iteration (if an iteration order
is specified). Exceptions thrown by the procedure are relayed to the
caller.Iterable.forEach(Consumer).iterate in interface XGettingTable.Values<K,V>iterate in interface XIterable<V>iterate in interface XProcessingCollection<V>P - type of procedureprocedure - The procedure to be performed for each elementpublic final <A> A join(BiConsumer<? super V,? super A> joiner, A aggregate)
XJoinablepublic final <P extends IndexedAcceptor<? super V>> P iterateIndexed(P procedure)
XIndexIterableIndexedAcceptor to use
not only the element itself but also its coherent index.iterateIndexed in interface XIndexIterable<V>P - type of procedureprocedure - which is executed when iteratingpublic final EqHashTable.Values toReversed()
XGettingSequenceXGettingSequence with the reversed order of elements.
This method creates a new collection and does not change the existing collection.
toReversed in interface XDecreasingList<V>toReversed in interface XDecreasingSequence<V>toReversed in interface XGettingList<V>toReversed in interface XGettingSequence<V>toReversed in interface XProcessingList<V>toReversed in interface XProcessingSequence<V>toReversed in interface XSettingList<V>toReversed in interface XSettingSequence<V>toReversed in interface XSortableSequence<V>public final boolean containsSearched(Predicate<? super V> predicate)
containsSearched in interface XGettingCollection<V>public final boolean applies(Predicate<? super V> predicate)
XGettingCollectionapplies in interface XGettingCollection<V>predicate - that's tested on each element.public final boolean contains(V value)
XGettingCollectionXGettingCollection.containsId(Object) method, this method
uses the internal Equalator defined by the collection itself.contains in interface XGettingCollection<V>value - to be searched in the collectionEqualator.public final boolean containsAll(XGettingCollection<? extends V> values)
containsAll in interface XGettingCollection<V>values - to be searched in the collection.Equalator.public final boolean containsId(V value)
XGettingCollectionXGettingCollection.containsSearched(Predicate) with a Predicate implementation
that checks for object identity. The only difference is a performance and usability advantagecontainsId in interface XGettingCollection<V>value - the element to be searched in the collection by identity.public final <T extends Consumer<? super V>> T copyTo(T target)
XGettingCollectionConsumer.accept(Object) on the target Consumer for all the elements of this collection.
Since all MicroStream Collections implement the Consumer interface,
new collections can be used as target.
Example:
BulkList<Integer> collection1 = BulkList.New(1,2,3); BulkList<Integer> copiedCollection = collection1.copyTo(BulkList.New());Results in
copiedCollection containing 1, 2 and 3.copyTo in interface XGettingCollection<V>T - type of the targettarget - on which the Consumer.accept(Object) is called for all elements of this collection.public final <T extends Consumer<? super V>> T filterTo(T target, Predicate<? super V> predicate)
XGettingCollectionConsumer.accept(Object) on the target Consumer for all the elements of this collection
which test true on the given predicate.
Since all MicroStream Collections implement the Consumer interface,
new collections can be used as target.
Example:
BulkList<Integer> collection1 = BulkList.New(1,2,3); BulkList<Integer> filteredCollection = collection1.filterTo(BulkList.New(), e-> e % 2 == 0);Results in
filteredCollection containing 2.filterTo in interface XGettingCollection<V>T - type of the targettarget - on which the Consumer.accept(Object) is called for elements that test true.predicate - on which to test all elements.public final long count(V value)
XGettingCollectionEqualator.count in interface XGettingCollection<V>value - to countpublic final long countBy(Predicate<? super V> predicate)
XGettingCollectioncountBy in interface XGettingCollection<V>predicate - defines which elements are counted and which are notpublic final <T extends Consumer<? super V>> T distinct(T target)
XGettingCollectionConsumer.accept(Object) on the target Consumer for all the unique/distinct
elements of this collection. This means the elements are not equal to each other.Equalator.
Since all MicroStream Collections implement the Consumer interface,
new collections can be used as target.
Example:
BulkList<Integer> collection1 = BulkList.New(1,2,2,3);
BulkList<Integer> distinctCollection = collection1.distinct(BulkList.New());
Results in distinctCollection containing 1, 2 and 3.
distinct in interface XGettingCollection<V>T - type of the targettarget - on which the Consumer.accept(Object) is called for every distinct element of this collection.public final <T extends Consumer<? super V>> T distinct(T target, Equalator<? super V> equalator)
XGettingCollectionConsumer.accept(Object) on the target Consumer for all the unique/distinct
elements of this collection. This means the elements are not equal to each other.Equalator.
Since all MicroStream Collections implement the Consumer interface,
new collections can be used as target.
Example:
BulkList<Integer> collection1 = BulkList.New(1,2,2,3); BulkList<Integer> distinctCollection = collection1.distinct(BulkList.New(), Equalator.identity());Results in
distinctCollection containing 1, 2 and 3.distinct in interface XGettingCollection<V>T - type of the targettarget - on which the Consumer.accept(Object) is called for every distinct element of this collection.equalator - defines what distinct means (which elements are equal to one another)public final boolean equals(XGettingCollection<? extends V> samples, Equalator<? super V> equalator)
equals in interface XGettingCollection<V>samples - is the collection which is checked for equalityequalator - is used to check the equality of the collectionstrue if the passed collection is of the same type as this collection and
this.equalsContent(list, equalator) yields truepublic final boolean equalsContent(XGettingCollection<? extends V> samples, Equalator<? super V> equalator)
XGettingCollectiontrue if all elements of this list and the passed list are sequentially equal as defined
by the passed equalator.
Note that for colletion types that don't have a defined order of elements, this method is hardly usable
(as is XGettingCollection.equals(Object) for them as defined in Collection). The core problem of comparing
collections that have no defined order is that they aren't really reliably comparable to any other collection.
equalsContent in interface XGettingCollection<V>samples - is the collection which is checked for equalityequalator - the equalator to use to determine the equality of each elementtrue if this list is equal to the passed list, false otherwisepublic final <T extends Consumer<? super V>> T except(XGettingCollection<? extends V> other, Equalator<? super V> equalator, T target)
XGettingCollectionConsumer.accept(Object) on the target Consumer for each
element of this collection that is not contained in the other collection (through the given equalator).
Since all MicroStream Collections implement the Consumer interface,
new collections can be used as target.
Example:
BulkList<Integer> collection1 = BulkList.New(1,2,3); BulkList<Integer> collection2 = BulkList.New(2,3,4); BulkList<Integer> exceptCollection = collection1.except(collection2, Equalator.identity(), BulkList.New());Results in
exceptCollection containing 1.except in interface XGettingCollection<V>T - type of the targetother - collection whose elements are excluded from the target.equalator - which is used for the equal-tests.target - on which the Consumer.accept(Object) is called for elements not contained in the other collection.public final boolean hasVolatileElements()
ExtendedCollectionWeakReference of SoftReference or implementations of collection entries
that remove the element contained in an entry by some means outside the collection.WeakReference instances that are added to a a simple (non-volatile) implementation of a
collection do not make the collection volatile, as the elements themselves (the reference instances) are still
strongly referenced.hasVolatileElements in interface ExtendedCollection<V>hasVolatileElements in interface XGettingCollection<V>true if the collection contains volatile elements.public final <T extends Consumer<? super V>> T intersect(XGettingCollection<? extends V> other, Equalator<? super V> equalator, T target)
XGettingCollectionConsumer.accept(Object) on the target Consumer for the
equal elements.
Since all MicroStream Collections implement the Consumer interface,
new collections can be used as target.
Example:
BulkList<Integer> collection1 = BulkList.New(1,2,3); BulkList<Integer> collection2 = BulkList.New(2,3,4); BulkList<Integer> intersection = collection1.intersect(collection2, Equalator.identity(), BulkList.New());Results in
intersection containing 2 and 3.intersect in interface XGettingCollection<V>T - type of the targetother - collection to intersect with.equalator - which is used for the equal-tests.target - on which the Consumer.accept(Object) is called for equal elements.public final V max(Comparator<? super V> comparator)
max in interface XGettingCollection<V>public final V min(Comparator<? super V> comparator)
min in interface XGettingCollection<V>public final boolean nullAllowed()
ExtendedCollectionnullAllowed in interface ExtendedCollection<V>true if null is allowed inside the collection; false if notpublic final boolean nullContained()
nullContained in interface XGettingCollection<V>public final EqHashTable.Values.OldValues old()
old in interface XGettingCollection<V>old in interface XGettingList<V>public final V seek(V sample)
XGettingCollectionXGettingCollection.contains(Object) with a different return type. For collections with data-dependant equality,
the returned element might be the same as the passed one or a data-wise equal one, depending on the content
of the collection)seek in interface XGettingCollection<V>sample - to seek in the collectionpublic final V search(Predicate<? super V> predicate)
XGettingCollectionsearch in interface XGettingCollection<V>predicate - defines which element is searchedpublic final long size()
size in interface Sizedsize in interface XGettingCollection<V>public final long maximumCapacity()
CapacityCarryingInteger.MAX_VALUE)maximumCapacity in interface CapacityCarryingpublic final boolean isFull()
isFull in interface CapacityCarryingpublic final long remainingCapacity()
remainingCapacity in interface CapacityCarryingpublic final Object[] toArray()
XGettingCollectionThe returned array will be "safe" in that no references to it are maintained by this list. (In other words, this method must allocate a new array). The caller is thus free to modify the returned array.
This method acts as bridge between MicroStream-based collections and Java-native-based APIs.
toArray in interface XGettingCollection<V>public final V[] toArray(Class<V> type)
XGettingCollectionThe returned array will be "safe" in that no references to it are maintained by this list. (In other words, this method must allocate a new array). The caller is thus free to modify the returned array.
This method acts as bridge between MicroStream-based collections and Java-native-based APIs.
toArray in interface XGettingCollection<V>type - the Class representing type E at runtime.public final <T extends Consumer<? super V>> T union(XGettingCollection<? extends V> other, Equalator<? super V> equalator, T target)
XGettingCollectionConsumer.accept(Object) on the target Consumer for all the elements of this collection.
And calls it for all elements of the other collection, that are not already in this collection
(defined by the given Equalator)
Since all MicroStream Collections implement the Consumer interface,
new collections can be used as target.
Example:
BulkList<Integer> collection1 = BulkList.New(1,2,3); BulkList<Integer> collection2 = BulkList.New(2,3,4); BulkList<Integer> union = collection1.union(collection2, Equalator.identity(), BulkList.New());Results in
union containing 1, 2, 3 and 4.union in interface XGettingCollection<V>T - type of the targetother - collection to build a union with.equalator - which is used for the equal-tests.target - on which the Consumer.accept(Object) is called for all unified elements.public final EqHashTable<K,V> parent()
parent in interface XBasicTable.Values<K,V>parent in interface XGettingMap.Satellite<K,V>parent in interface XGettingTable.Satellite<K,V>parent in interface XGettingTable.Values<K,V>parent in interface XMap.Satellite<K,V>parent in interface XTable.Values<K,V>public final SubListView<V> view(long fromIndex, long toIndex)
XGettingSequence
A view is different from immutable collection (XGettingCollection.immure())
in the way, that changes in this collection are still affecting the view.
The immutable collection on the other hand has no reference to this collection
and changes therefore do not affect the immutable collection.
view in interface XGettingList<V>view in interface XGettingSequence<V>view in interface XProcessingSequence<V>fromIndex - defines lower boundary for the view of the collection.toIndex - defines higher boundary for the view of the collection.public final ListIterator<V> listIterator()
listIterator in interface XGettingList<V>public final ListIterator<V> listIterator(long index)
listIterator in interface XGettingList<V>public final SubListProcessor<V> range(long fromIndex, long toIndex)
range in interface XDecreasingList<V>range in interface XDecreasingSequence<V>range in interface XGettingList<V>range in interface XGettingSequence<V>range in interface XSettingList<V>range in interface XSettingSequence<V>public final XImmutableList<V> immure()
XGettingCollectionIf this instance already is of an immutable collection type, it returns itself.
immure in interface XGettingBag<V>immure in interface XGettingCollection<V>immure in interface XGettingList<V>immure in interface XGettingSequence<V>immure in interface XProcessingBag<V>public final ListView<V> view()
XGettingCollection
A view is different from immutable collection (XGettingCollection.immure())
in the way, that changes in this collection are still affecting the view.
The immutable collection on the other hand has no reference to this collection
and changes therefore do not affect the immutable collection.
view in interface XBasicTable.Values<K,V>view in interface XGettingBag<V>view in interface XGettingCollection<V>view in interface XGettingList<V>view in interface XGettingSequence<V>view in interface XProcessingBag<V>public final <T extends Consumer<? super V>> T copySelection(T target, long... indices)
XGettingSequenceConsumer.accept(Object) on the target Consumer.copySelection in interface XGettingSequence<V>T - type of the targettarget - on which the Consumer.accept(Object) is calledindices - of the elements which are copiedpublic final V at(long index)
at in interface XGettingSequence<V>public final V get()
XGettingCollectionXGettingSequence, then it is
undefined which element is returned. If the collection is ordered, the element at index 0 is returned.get in interface XGettingCollection<V>get in interface XGettingSequence<V>XGettingSequence.at(long),
XGettingSequence.first(),
XGettingSequence.last()public final V first()
XGettingSequenceIndexOutOfBoundsException if the collection is empty.
Is an alias for XGettingSequence.get().
first in interface XGettingSequence<V>public final V last()
XGettingSequenceIndexOutOfBoundsException if the collection is empty.last in interface XGettingSequence<V>public final V poll()
XGettingSequencepoll in interface XGettingSequence<V>public final V peek()
XGettingSequencepeek in interface XGettingSequence<V>public final long indexOf(V value)
indexOf in interface XGettingSequence<V>public final long indexBy(Predicate<? super V> predicate)
XGettingSequence
Basically the opposite of XGettingSequence.lastIndexBy(Predicate)
indexBy in interface XGettingSequence<V>predicate - to define a valid elementpublic final boolean isSorted(Comparator<? super V> comparator)
XGettingSequenceisSorted in interface XGettingSequence<V>comparator - defines if elements are sortedpublic final long lastIndexOf(V value)
lastIndexOf in interface XGettingSequence<V>public final long lastIndexBy(Predicate<? super V> predicate)
XGettingSequencePredicate
applies to immediately.
Basically the opposite of XGettingSequence.indexBy(Predicate).
Similar but not the same as XGettingSequence.scan(Predicate), since scan iterates through all elements.
lastIndexBy in interface XGettingSequence<V>predicate - to define a valid elementpublic final long maxIndex(Comparator<? super V> comparator)
maxIndex in interface XGettingSequence<V>public final long minIndex(Comparator<? super V> comparator)
minIndex in interface XGettingSequence<V>public final long scan(Predicate<? super V> predicate)
XGettingSequencePredicate
applied to ("scanning").
In order to find the last element, this method must iterate over all elements of the collection
(opposed to XGettingSequence.indexBy(Predicate) and XGettingSequence.lastIndexBy(Predicate)).
Iteration can be safely canceled with a ThrowBreak (X.BREAK)
scan in interface XGettingSequence<V>predicate - to define a valid elementpublic final <C extends Consumer<? super V>> C moveSelection(C target, long... indices)
moveSelection in interface XProcessingSequence<V>public final V removeAt(long index)
removeAt in interface XProcessingSequence<V>public final V fetch()
fetch in interface XProcessingCollection<V>public final V pop()
pop in interface XProcessingSequence<V>public final V pinch()
pinch in interface XProcessingCollection<V>public final V pick()
pick in interface XProcessingSequence<V>public final V retrieve(V value)
retrieve in interface XProcessingCollection<V>public final V retrieveBy(Predicate<? super V> predicate)
retrieveBy in interface XProcessingCollection<V>public final boolean removeOne(V element)
removeOne in interface XRemovingCollection<V>public final EqHashTable.Values removeRange(long startIndex, long length)
removeRange in interface XRemovingSequence<V>public final EqHashTable.Values retainRange(long startIndex, long length)
XRemovingSequenceretainRange in interface XRemovingSequence<V>startIndex - is the index of the first element to retainlength - is the amount of elements to retainpublic final long removeSelection(long[] indices)
removeSelection in interface XRemovingSequence<V>public final void clear()
XRemovingCollectionclear in interface XRemovingCollection<V>clear in interface Clearablepublic final long consolidate()
ConsolidatableCollectionWeakReference entries whose reference has
been cleared).consolidate in interface ConsolidatableCollectionconsolidate in interface XRemovingCollection<V>public final <C extends Consumer<? super V>> C moveTo(C target, Predicate<? super V> predicate)
moveTo in interface XProcessingCollection<V>public final long nullRemove()
nullRemove in interface XRemovingCollection<V>public final long optimize()
XRemovingCollectionIf this is not possible or not needed in the concreate implementation, this method does nothing.
Note that this method can consume a considerable amount of time depending on the implementation and should only be called intentionally and accurately when reducing occupied memory is needed.
optimize in interface OptimizableCollectionoptimize in interface XRemovingCollection<V>public final <P extends Consumer<? super V>> P process(P procedure)
process in interface Processable<V>public final long removeBy(Predicate<? super V> predicate)
removeBy in interface XProcessingCollection<V>public final long remove(V value)
remove in interface XRemovingCollection<V>public final long removeAll(XGettingCollection<? extends V> values)
removeAll in interface XRemovingCollection<V>public final long removeDuplicates()
removeDuplicates in interface XRemovingCollection<V>public final long removeDuplicates(Equalator<? super V> equalator)
removeDuplicates in interface XProcessingCollection<V>public final long retainAll(XGettingCollection<? extends V> values)
XRemovingCollectionBasically intersect this collection with the given collection and only keeping the resulting elements.
retainAll in interface XRemovingCollection<V>values - to retainpublic final void truncate()
XRemovingCollectiontruncate in interface Truncateabletruncate in interface XRemovingCollection<V>public final EqHashTable.Values fill(long offset, long length, V value)
XSettingListnull.fill in interface XDecreasingList<V>fill in interface XSettingList<V>offset - from the start of the collection (start index)length - of how many slots should be filledvalue - to use for filling of slotspublic final long replace(V value, V replacement)
replace in interface XReplacingBag<V>public final long replaceAll(XGettingCollection<? extends V> values, V replacement)
replaceAll in interface XReplacingBag<V>public final long substitute(Function<? super V,? extends V> mapper)
substitute in interface XReplacingCollection<V>public final long substitute(Predicate<? super V> predicate, Function<V,V> mapper)
substitute in interface XReplacingBag<V>public final boolean replaceOne(V value, V replacement)
XReplacingBagreplaceOne in interface XReplacingBag<V>value - to replacereplacement - for the found elementtrue if element is found, false if notpublic final EqHashTable.Values reverse()
XSortableSequence
Unlike the XSortableSequence.toReversed() method, this method does not create a new collection,
but changes the order of its own elements.
reverse in interface XDecreasingList<V>reverse in interface XDecreasingSequence<V>reverse in interface XOrderingSequence<V>reverse in interface XSettingList<V>reverse in interface XSettingSequence<V>reverse in interface XSortableSequence<V>public final boolean set(long index,
V value)
set in interface XSettingSequence<V>public final V setGet(long index, V value)
setGet in interface XSettingSequence<V>public final EqHashTable.Values setAll(long offset, V... values)
setAll in interface XDecreasingList<V>setAll in interface XDecreasingSequence<V>setAll in interface XSettingList<V>setAll in interface XSettingSequence<V>public final EqHashTable.Values set(long offset, V[] src, int srcIndex, int srcLength)
set in interface XDecreasingList<V>set in interface XDecreasingSequence<V>set in interface XSettingList<V>set in interface XSettingSequence<V>public final EqHashTable.Values set(long offset, XGettingSequence<? extends V> values, long valuesOffset, long valuesLength)
set in interface XDecreasingList<V>set in interface XDecreasingSequence<V>set in interface XSettingList<V>set in interface XSettingSequence<V>public final void setFirst(V value)
setFirst in interface XSettingSequence<V>public final void setLast(V value)
setLast in interface XSettingSequence<V>public final EqHashTable.Values sort(Comparator<? super V> comparator)
Sortablesort in interface Sortable<V>sort in interface XDecreasingList<V>sort in interface XDecreasingSequence<V>sort in interface XSettingList<V>sort in interface XSettingSequence<V>sort in interface XSortableSequence<V>comparator - to sort this collectionpublic final long replace(Predicate<? super V> predicate, V substitute)
replace in interface XReplacingBag<V>public final boolean replaceOne(Predicate<? super V> predicate, V substitute)
replaceOne in interface XReplacingBag<V>public final EqHashTable.Values shiftTo(long sourceIndex, long targetIndex)
XOrderingSequenceDoes not expand or shrink the capacity of the sequence.
Throws a IndexExceededException if sourceIndex or targetIndex are
greater than the size of the sequence.
shiftTo in interface XOrderingSequence<V>shiftTo in interface XSortableSequence<V>sourceIndex - points to the source element; Index of the source elementtargetIndex - points to the target element; Index of the target elementpublic final EqHashTable.Values shiftTo(long sourceIndex, long targetIndex, long length)
XOrderingSequenceDoes not expand or shrink the capacity of the sequence.
Throws a IndexExceededException if sourceIndex or targetIndex
exceed the size of the sequence.
shiftTo in interface XOrderingSequence<V>shiftTo in interface XSortableSequence<V>sourceIndex - points to the source element; Index of the source elementtargetIndex - points to the target element; Index of the target elementlength - Amount of moved elements.public final EqHashTable.Values shiftBy(long sourceIndex, long distance)
XOrderingSequenceDoes not expand or shrink the capacity of the sequence.
Throws a IndexExceededException if sourceIndex or targetIndex
(sourceIndex+distance) exceed the size of the sequence.
shiftBy in interface XOrderingSequence<V>shiftBy in interface XSortableSequence<V>sourceIndex - points to the source element; Index of the source elementdistance - of how far the element should be moved.
Example: 1 moves the element from position 21 to position 22public final EqHashTable.Values shiftBy(long sourceIndex, long distance, long length)
XOrderingSequenceDoes not expand or shrink the capacity of the sequence.
Throws a IndexExceededException if sourceIndex or targetIndex
(sourceIndex+distance+length) exceed the size of the sequence.
shiftBy in interface XOrderingSequence<V>shiftBy in interface XSortableSequence<V>sourceIndex - points to the source element; Index of the source elementdistance - of how far the element should be moved.
Example: 1 moves the element from position 21 to position 22length - Amount of moved elements.public final EqHashTable.Values swap(long indexA, long indexB)
swap in interface XDecreasingList<V>swap in interface XDecreasingSequence<V>swap in interface XOrderingSequence<V>swap in interface XSettingList<V>swap in interface XSettingSequence<V>swap in interface XSortableSequence<V>public final EqHashTable.Values swap(long indexA, long indexB, long length)
swap in interface XDecreasingList<V>swap in interface XDecreasingSequence<V>swap in interface XOrderingSequence<V>swap in interface XSettingList<V>swap in interface XSettingSequence<V>swap in interface XSortableSequence<V>Copyright © 2022 MicroStream Software. All rights reserved.