Package ch.nolix.core.container.base
Klasse AbstractContainer<E>
java.lang.Object
ch.nolix.core.container.base.AbstractContainer<E>
- Typparameter:
E- is the type of the elements of aAbstractContainer.
- Alle implementierten Schnittstellen:
Filterable<E>,Groupable<E>,IContainer<E>,IFilteringContainerViewProvider<E>,IIntervallContainerViewProvider<E>,IMappingContainerViewProvider<E>,Mappable<E>,AggregationRequestable<E>,ArrayMappable<E>,CountRequestable<E>,IndexRequestable<E>,IterableWithCopyableIterator<E>,SingleSearchable<E>,StoringRequestable<E>,StringMappable,EmptinessRequestable,MaterializationRequestable,Iterable<E>
- Bekannte direkte Unterklassen:
AbstractExtendedContainer
- Version:
- 2016-01-01
- Autor:
- Silvan Wyss
-
Konstruktorübersicht
Konstruktoren -
Methodenübersicht
Modifizierer und TypMethodeBeschreibungfinal booleanThe time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final booleancontainsAll(Iterable<?> objects) The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements.final booleancontainsAll(Object[] objects) The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements.final booleancontainsAll(Object object, Object... objects) The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements.final booleancontainsAny(Object object, Object... objects) The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements.final booleancontainsAny(Predicate<E> selector) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final booleancontainsAnyOf(Iterable<?> objects) The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements.final booleancontainsAnyOf(Object[] objects) The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements.final booleancontainsAsManyAs(Iterable<?> iterable) The time complexity of this implementation is O(n) if the current container contains n elements.final booleancontainsEqualing(Object element) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final booleancontainsExactlyEqualingInSameOrder(Iterable<?> iterable) The time complexity of this implementation is O(m*n) if: The currentAbstractContainercontains m elements.final booleancontainsExactlyInSameOrder(Iterable<?> iterable) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final booleancontainsLessThan(Iterable<?> iterable) The time complexity of this implementation is O(n) if the given iterable contains n elements.final booleancontainsMoreThan(Iterable<?> iterable) The time complexity of this implementation is O(n) if the given iterable contains n elements.final booleancontainsNone(Object object, Object... objects) The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements.final booleancontainsNone(Predicate<E> selector) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final booleancontainsNoneOf(Iterable<?> elements) The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements.final booleancontainsOnce(Object object) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final booleanThe time complexity of this implementation is O(1).final booleancontainsOne(Predicate<E> selector) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final booleancontainsOneEqualing(E object) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final booleancontainsOnly(Predicate<E> selector) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.protected abstract <E2> IArrayList<E2> createEmptyMutableList(Marker<E2> marker) final doublegetAverage(Function<E, Number> valueMapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final doublegetAverageOrZero(Function<E, Number> mapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final intThe time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final intgetCountOf(Object element) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final <C extends Comparable<C>>
CThe time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final doublegetMaxOrZero(Function<E, Number> numberMapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final doubleThe time complexity of this implementation is O(n*log(n)) if the currentAbstractContainercontains n elements.final doublegetMedianOrZero(Function<E, Number> norm) The time complexity of this implementation is O(n*log(n)) if the currentAbstractContainercontains n elements.final <C extends Comparable<C>>
CThe time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final doublegetMinOrZero(Function<E, Number> numberMapper) final intgetOneBasedIndexOfFirst(Predicate<E> selector) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final intThe time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final intThe time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.The time complexity of this implementation is O(1).getOptionalStoredFirst(Predicate<? super E> selector) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final doublegetStandardDeviation(Function<E, Number> norm) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final <C extends Comparable<C>>
EgetStoredByMax(Function<E, C> comparableMapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final <C extends Comparable<C>>
EgetStoredByMin(Function<E, C> comparableMapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final EThe time complexity of this implementation is O(1).final EgetStoredFirst(Predicate<? super E> selector) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final <E2 extends E>
E2getStoredFirstOfType(Class<E2> type) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final IContainer<? extends IContainer<E>> getStoredInGroups(Function<E, ?> norm) The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements.final EThe time complexity of this implementation is O(1) or O(n) if the currentAbstractContainercontains n elements.final <E2 extends E>
IContainer<E2> getStoredOfType(Class<E2> type) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final EThe time complexity of this implementation is O(1).final EgetStoredOne(Predicate<? super E> selector) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final IContainer<E> getStoredOthers(Predicate<E> selector) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final IContainer<E> getStoredSelected(Predicate<? super E> selector) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final BigDecimalThe time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final BigIntegergetSumOfInts(ToIntFunction<E> intMapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final doublegetVariance(Function<E, Number> numberMapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final IContainer<E> getViewFromOneBasedStartIndex(int oneBasedStartIndex) The time complexity of this implementation is O(1).<T> IContainer<T> The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final IContainer<E> getViewToOneBasedEndIndex(int oneBasedEndIndex) The time complexity of this implementation is O(1).final IContainer<E> The time complexity of this implementation is O(1).final IContainer<E> getViewWithoutFirst(int n) The time complexity of this implementation is O(1).final IContainer<E> The time complexity of this implementation is O(1).final IContainer<E> getViewWithoutLast(int n) The time complexity of this implementation is O(1).final booleanisEmpty()The time complexity of this implementation is O(1) if the current Container does not contain null elements.final <E2> IContainer<E2> The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final Object[]toArray()The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final byte[]toByteArray(Function<E, Byte> byteMapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final char[]toCharArray(Function<E, Character> charMapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final StringThe time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final double[]toDoubleArray(ToDoubleFunction<E> doubleMapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final int[]toIntArray(ToIntFunction<E> intMapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final long[]toLongArray(ToLongFunction<E> longMapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final <E2> IContainer<E2> toMultiples(Function<E, IContainer<E2>> multipleMapper) The time complexity of this implementation is O(m*n) if: -The current *AbstractContainercontains m elements.<N extends Number>
IContainer<N> The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final IContainer<E> The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final String[]The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final IContainer<String> The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final StringtoStringWithSeparator(char separator) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final StringtoStringWithSeparator(String separator) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.final <E2> IContainer<E2> toWithOneBasedIndex(BiFunction<Integer, E, E2> mapper) The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.Von Klasse geerbte Methoden java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitVon Schnittstelle geerbte Methoden ch.nolix.coreapi.container.commoncontainer.CountRequestable
getCountVon Schnittstelle geerbte Methoden ch.nolix.coreapi.state.staterequest.EmptinessRequestable
containsAnyVon Schnittstelle geerbte Methoden ch.nolix.coreapi.container.base.IContainer
toOrderedListVon Schnittstelle geerbte Methoden ch.nolix.coreapi.container.base.IFilteringContainerViewProvider
getViewOfStoredSelectedVon Schnittstelle geerbte Methoden ch.nolix.coreapi.container.base.IIntervallContainerViewProvider
getViewFromOneBasedStartIndexToOneBasedEndIndexVon Schnittstelle geerbte Methoden java.lang.Iterable
forEach, spliteratorVon Schnittstelle geerbte Methoden ch.nolix.coreapi.container.commoncontainer.IterableWithCopyableIterator
iteratorVon Schnittstelle geerbte Methoden ch.nolix.coreapi.state.staterequest.MaterializationRequestable
isMaterialized, isViewVon Schnittstelle geerbte Methoden ch.nolix.coreapi.container.commoncontainer.SingleSearchable
getStoredAtOneBasedIndex
-
Konstruktordetails
-
AbstractContainer
public AbstractContainer()
-
-
Methodendetails
-
contains
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
containsin SchnittstelleStoringRequestable<E>- Parameter:
object-- Gibt zurück:
- true if the current
StoringRequestablecontains the given object, false otherwise.
-
containsAll
The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements. -n objects are given.- Angegeben von:
containsAllin SchnittstelleStoringRequestable<E>- Parameter:
objects-- Gibt zurück:
- true if the current
StoringRequestablecontains all of the given objects, false otherwise.
-
containsAll
The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements. -n objects are given.- Angegeben von:
containsAllin SchnittstelleStoringRequestable<E>- Parameter:
object-objects-- Gibt zurück:
- true if the current
StoringRequestablecontains the given object and all of the given objects, false otherwise.
-
containsAll
The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements. -n objects are given.- Angegeben von:
containsAllin SchnittstelleStoringRequestable<E>- Parameter:
objects-- Gibt zurück:
- true if the current
StoringRequestablecontains all of the given objects, false otherwise.
-
containsAny
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
containsAnyin SchnittstelleStoringRequestable<E>- Parameter:
selector-- Gibt zurück:
- true if the current
StoringRequestablecontains an element the given selector selects, false otherwise. Ignores null elements.
-
containsAny
The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements. -n objects are given.- Angegeben von:
containsAnyin SchnittstelleStoringRequestable<E>- Parameter:
object-objects-- Gibt zurück:
- true if the current
StoringRequestablecontains the given object or one of the given objects, false otherwise.
-
containsAnyOf
The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements. -n objects are given.- Angegeben von:
containsAnyOfin SchnittstelleStoringRequestable<E>- Parameter:
objects-- Gibt zurück:
- true if the current
StoringRequestablecontains any of the given objects, false otherwise.
-
containsAnyOf
The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements. -n objects are given.- Angegeben von:
containsAnyOfin SchnittstelleStoringRequestable<E>- Parameter:
objects-- Gibt zurück:
- true if the current
StoringRequestablecontains any of the given objects, false otherwise.
-
containsAsManyAs
The time complexity of this implementation is O(n) if the current container contains n elements.- Angegeben von:
containsAsManyAsin SchnittstelleStoringRequestable<E>- Parameter:
iterable-- Gibt zurück:
- true if the current
StoringRequestablecontains as many elements as the given container, false otherwise.
-
containsEqualing
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
containsEqualingin SchnittstelleStoringRequestable<E>- Parameter:
element-- Gibt zurück:
- true if the current
StoringRequestablecontains an element that equals the given given element, false otherwise.
-
containsExactlyEqualingInSameOrder
The time complexity of this implementation is O(m*n) if: The currentAbstractContainercontains m elements. The given iterable contains n elements.- Angegeben von:
containsExactlyEqualingInSameOrderin SchnittstelleStoringRequestable<E>- Parameter:
iterable-- Gibt zurück:
- true if the current
StoringRequestablecontains exactly elements that equal the elements of given iterable in the same order, false otherwise.
-
containsExactlyInSameOrder
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
containsExactlyInSameOrderin SchnittstelleStoringRequestable<E>- Parameter:
iterable-- Gibt zurück:
- true if the current
StoringRequestablecontains exactly the elements of the given iterable in the same order, false otherwise.
-
containsLessThan
The time complexity of this implementation is O(n) if the given iterable contains n elements.- Angegeben von:
containsLessThanin SchnittstelleStoringRequestable<E>- Parameter:
iterable-- Gibt zurück:
- true if the current
StoringRequestablecontains less elements than the given container, false otherwise
-
containsMoreThan
The time complexity of this implementation is O(n) if the given iterable contains n elements.- Angegeben von:
containsMoreThanin SchnittstelleStoringRequestable<E>- Parameter:
iterable-- Gibt zurück:
- true if the current
StoringRequestablecontains more elements than the given container, false otherwise.
-
containsNone
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
containsNonein SchnittstelleStoringRequestable<E>- Parameter:
selector-- Gibt zurück:
- true if the current
StoringRequestabledoes not contain an element the given selector selects. Ignores null elements.
-
containsNone
The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements. -n objects are given.- Angegeben von:
containsNonein SchnittstelleStoringRequestable<E>- Parameter:
object-objects-- Gibt zurück:
- true if the current
StoringRequestabledoes not contain the given object and none of the given objects, false otherwise.
-
containsNoneOf
The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements. -n objects are given.- Angegeben von:
containsNoneOfin SchnittstelleStoringRequestable<E>- Parameter:
elements-- Gibt zurück:
- true if the current
StoringRequestabledoes not contain any of the given objects.
-
containsOnce
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
containsOncein SchnittstelleStoringRequestable<E>- Parameter:
object-- Gibt zurück:
- true if the current
StoringRequestablecontains the given object exactly 1 time, false otherwise.
-
containsOne
public final boolean containsOne()The time complexity of this implementation is O(1).- Angegeben von:
containsOnein SchnittstelleStoringRequestable<E>- Gibt zurück:
- true if the current
StoringRequestablecontains exactly 1 element, false otherwise.
-
containsOne
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
containsOnein SchnittstelleStoringRequestable<E>- Parameter:
selector-- Gibt zurück:
- true if the current
StoringRequestablecontains exactly 1 element the given selector selects, false otherwise. Ignores null elements.
-
containsOneEqualing
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
containsOneEqualingin SchnittstelleStoringRequestable<E>- Parameter:
object-- Gibt zurück:
- true if the current
StoringRequestablecontains exactly 1 element that equals the given object, false otherwise.
-
containsOnly
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
containsOnlyin SchnittstelleStoringRequestable<E>- Parameter:
selector-- Gibt zurück:
- true if the current
StoringRequestablecontains only elements the given selector selects. Null element are regarded as unselectable.
-
getAverage
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getAveragein SchnittstelleAggregationRequestable<E>- Parameter:
valueMapper-- Gibt zurück:
- the average of the values the given valueMapper maps from the
elements of the current
AggregationRequestable. Maps null elements to 0.0.
-
getAverageOrZero
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getAverageOrZeroin SchnittstelleAggregationRequestable<E>- Parameter:
mapper-- Gibt zurück:
- the average of the values the given valueMapper maps from the
elements of the current
AggregationRequestableif the currentAggregationRequestablecontains any, 0.0 otherwise. Maps null elements to 0.0.
-
getCount
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getCountin SchnittstelleCountRequestable<E>- Parameter:
selector-- Gibt zurück:
- the number of elements the given selector selects from the current
CountRequestable. Ignores null elements.
-
getCountOf
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getCountOfin SchnittstelleCountRequestable<E>- Parameter:
element-- Gibt zurück:
- the number how many times the current
CountRequestablecontains the given element.
-
getOneBasedIndexOfFirst
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getOneBasedIndexOfFirstin SchnittstelleIndexRequestable<E>- Parameter:
selector-- Gibt zurück:
- the 1-based index of the first element the given selector selects
from the current
IndexRequestable. Ignores null elements.
-
getOneBasedIndexOfFirstEqualElement
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getOneBasedIndexOfFirstEqualElementin SchnittstelleIndexRequestable<E>- Parameter:
object-- Gibt zurück:
- the 1-based index of the first element of the current
IndexRequestablethat equals the given object.
-
getOneBasedIndexOfFirstOccurrenceOf
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getOneBasedIndexOfFirstOccurrenceOfin SchnittstelleIndexRequestable<E>- Parameter:
object-- Gibt zurück:
- the 1-based index of the first occurrence of the given object in the
current
IndexRequestable.
-
getMax
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getMaxin SchnittstelleAggregationRequestable<E>- Typparameter:
C- is the type of theComparables the given comparableMapper maps from the elements of the currentAggregationRequestable.- Parameter:
comparableMapper-- Gibt zurück:
- the biggest
Comparablethe given comparableMapper maps from the elements of the currentAggregationRequestable. Ignores null elements.
-
getMaxOrZero
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getMaxOrZeroin SchnittstelleAggregationRequestable<E>- Parameter:
numberMapper-- Gibt zurück:
- the biggest number the given numberMapper maps from the non-null
elements of the current
AggregationRequestableif the currentAggregationRequestablecontains non-null elements, 0.0 otherwise.
-
getMedian
The time complexity of this implementation is O(n*log(n)) if the currentAbstractContainercontains n elements.- Angegeben von:
getMedianin SchnittstelleAggregationRequestable<E>- Parameter:
numberMapper-- Gibt zurück:
- the median of the numbers the given numberMapper maps from the
elements of the current
AggregationRequestable. Maps null elements to 0.0.
-
getMedianOrZero
The time complexity of this implementation is O(n*log(n)) if the currentAbstractContainercontains n elements.- Angegeben von:
getMedianOrZeroin SchnittstelleAggregationRequestable<E>- Parameter:
norm-- Gibt zurück:
- the median of the numbers the given numberMapper maps from the
elements of the current
AggregationRequestableif the currentAggregationRequestableis not empty, 0.0 otherwise. Maps null elements to 0.0.
-
getMin
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getMinin SchnittstelleAggregationRequestable<E>- Typparameter:
C- is the type of theComparables the given comparableMapper maps from the elements of the currentAggregationRequestable.- Parameter:
comparableMapper-- Gibt zurück:
- the smallest
Comparablethe given comparableMapper maps from the elements of the currentAggregationRequestable. Ignores null elements.
-
getMinOrZero
- Angegeben von:
getMinOrZeroin SchnittstelleAggregationRequestable<E>- Parameter:
numberMapper-- Gibt zurück:
- the smallest number the given numberMapper maps from the non-null
elements of the current
AggregationRequestableif the currentAggregationRequestablecontains non-null elements, 0.0 otherwise.
-
getOptionalStoredFirst
The time complexity of this implementation is O(1).- Angegeben von:
getOptionalStoredFirstin SchnittstelleSingleSearchable<E>- Gibt zurück:
- a
Optionalwith the first element of the currentSingleSearchableif the currentSingleSearchableis not empty and if the first element of the currentSingleSearchableis not null, an emptyOptionalotherwise.
-
getOptionalStoredFirst
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getOptionalStoredFirstin SchnittstelleSingleSearchable<E>- Parameter:
selector-- Gibt zurück:
- a new
Optionalwith the first element the given selector selects from the currentSingleSearchableif the currentSingleSearchablecontains an element the given selector selects, an emptyOptionalotherwise. Ignores null elements.
-
getStandardDeviation
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getStandardDeviationin SchnittstelleAggregationRequestable<E>- Parameter:
norm-- Gibt zurück:
- the standard deviation of the numbers the given numberMapper maps
from the elements of the current
AggregationRequestable.
-
getStoredByMax
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getStoredByMaxin SchnittstelleSingleSearchable<E>- Typparameter:
C- is the type of theComparables the given comparableMapper maps from the elements of the currentSingleSearchable.- Parameter:
comparableMapper-- Gibt zurück:
- the element with the biggest
Comparablethe given comparableMapper maps from the elements of the currentSingleSearchable. Ignores null elements.
-
getStoredByMin
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getStoredByMinin SchnittstelleSingleSearchable<E>- Typparameter:
C- is the type of theComparables the given comparableMapper maps from the elements of the currentSingleSearchable.- Parameter:
comparableMapper-- Gibt zurück:
- the element with the smallest
Comparablethe given comparableMapper maps from the elements of the currentSingleSearchable. Ignores null elements.
-
getStoredFirst
The time complexity of this implementation is O(1).- Angegeben von:
getStoredFirstin SchnittstelleSingleSearchable<E>- Gibt zurück:
- the first element of the current
SingleSearchable. The element can be null.
-
getStoredFirst
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getStoredFirstin SchnittstelleSingleSearchable<E>- Parameter:
selector-- Gibt zurück:
- the first element the given selector selects from the current
SingleSearchable. Ignores null elements.
-
getStoredFirstOfType
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getStoredFirstOfTypein SchnittstelleSingleSearchable<E>- Typparameter:
E2- is the given type.- Parameter:
type-- Gibt zurück:
- the first element from the current
SingleSearchablethat is of the given type.
-
getStoredInGroups
The time complexity of this implementation is O(m*n) if: -The currentAbstractContainercontains m elements. -The given norm assignes the elements of the currentAbstractContainerin n groups.- Angegeben von:
getStoredInGroupsin SchnittstelleGroupable<E>- Parameter:
norm-- Gibt zurück:
- a new
IContainerwith the elements of the currentGroupablegrouped by the given norm. Ignores null elements.
-
getStoredLast
The time complexity of this implementation is O(1) or O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getStoredLastin SchnittstelleSingleSearchable<E>- Gibt zurück:
- the last element of the current
SingleSearchable. The element can be null.
-
getStoredOfType
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getStoredOfTypein SchnittstelleFilterable<E>- Typparameter:
E2- is the type of the elements of the returnedIContainer.- Parameter:
type-- Gibt zurück:
- a new
IContainerwith the elements from the currentFilterablethat are of the given type. Ignores null elements.
-
getStoredOne
The time complexity of this implementation is O(1).- Angegeben von:
getStoredOnein SchnittstelleSingleSearchable<E>- Gibt zurück:
- the one element of the current
SingleSearchable. The element can be null.
-
getStoredOne
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getStoredOnein SchnittstelleSingleSearchable<E>- Parameter:
selector-- Gibt zurück:
- the one element the given selector selects from the current
SingleSearchable. Ignores null elements.
-
getStoredOthers
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getStoredOthersin SchnittstelleFilterable<E>- Parameter:
selector-- Gibt zurück:
- a new
IContainerwith the elements from the currentFilterablethe given selector skips. Ignores null elements.
-
getStoredSelected
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getStoredSelectedin SchnittstelleFilterable<E>- Parameter:
selector-- Gibt zurück:
- a new
IContainerwith the elements the given selector selects from the currentFilterable. Ignores null elements.
-
getSum
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getSumin SchnittstelleAggregationRequestable<E>- Parameter:
valueMapper-- Gibt zurück:
- the sum of the values the given valueMapper maps from the elements of
the current
AggregationRequestable. Maps null elements to 0.0.
-
getSumOfInts
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getSumOfIntsin SchnittstelleAggregationRequestable<E>- Parameter:
intMapper-- Gibt zurück:
- the sum of the ints the given intMapper maps from the elements of the
current
AggregationRequestable. Maps null elements to 0.0.
-
getVariance
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getVariancein SchnittstelleAggregationRequestable<E>- Parameter:
numberMapper-- Gibt zurück:
- the variance of the numbers the given numberMapper maps from the
elements of the current
AggregationRequestable. Maps null elements to 0.0.
-
getViewOf
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
getViewOfin SchnittstelleIMappingContainerViewProvider<E>- Typparameter:
T- is the type of the elements the given mapper maps from the elements of the currentIMappingContainerViewProvider.- Parameter:
mapper-- Gibt zurück:
- a new
IContainerwith the elements the given mapper maps from the elements of the currentIMappingContainerViewProvider.
-
getViewFromOneBasedStartIndex
The time complexity of this implementation is O(1).- Angegeben von:
getViewFromOneBasedStartIndexin SchnittstelleIIntervallContainerViewProvider<E>- Parameter:
oneBasedStartIndex-- Gibt zurück:
- a new view of the current
IIntervallContainerViewProviderfrom the given oneBasedStartIndex.
-
getViewToOneBasedEndIndex
The time complexity of this implementation is O(1).- Angegeben von:
getViewToOneBasedEndIndexin SchnittstelleIIntervallContainerViewProvider<E>- Parameter:
oneBasedEndIndex-- Gibt zurück:
- a new view
IContainerof the currentIIntervallContainerViewProviderto the given oneBasedEndIndex.
-
getViewWithoutFirst
The time complexity of this implementation is O(1).- Angegeben von:
getViewWithoutFirstin SchnittstelleIIntervallContainerViewProvider<E>- Gibt zurück:
- a new view
IContainerview of the currentIIntervallContainerViewProviderwithout the first element.
-
getViewWithoutFirst
The time complexity of this implementation is O(1).- Angegeben von:
getViewWithoutFirstin SchnittstelleIIntervallContainerViewProvider<E>- Parameter:
n-- Gibt zurück:
- a new view
IContainerview of the currentIIntervallContainerViewProviderwithout the first n elements.
-
getViewWithoutLast
The time complexity of this implementation is O(1).- Angegeben von:
getViewWithoutLastin SchnittstelleIIntervallContainerViewProvider<E>- Gibt zurück:
- a new view
IContainerview of the currentIIntervallContainerViewProviderwithout the last element.
-
getViewWithoutLast
The time complexity of this implementation is O(1).- Angegeben von:
getViewWithoutLastin SchnittstelleIIntervallContainerViewProvider<E>- Parameter:
n-- Gibt zurück:
- a new view
IContainerof the currentIIntervallContainerViewProviderwithout the last n elements.
-
isEmpty
public final boolean isEmpty()The time complexity of this implementation is O(1) if the current Container does not contain null elements. The time complexity of this implementation is O(n) if the current Container contains null elements and if the current Container contains n elements.- Angegeben von:
isEmptyin SchnittstelleEmptinessRequestable- Gibt zurück:
- true if
EmptinessRequestabledoes not contain an element.
-
to
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements. -
toArray
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toArrayin SchnittstelleArrayMappable<E>- Gibt zurück:
- a new array with the elements of the current
ArrayMappable.
-
toByteArray
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toByteArrayin SchnittstelleArrayMappable<E>- Parameter:
byteMapper-- Gibt zurück:
- a new array with the bytes the given byteMapper maps from the
elements of the current
ArrayMappable. Maps null elements to 0.
-
toCharArray
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toCharArrayin SchnittstelleArrayMappable<E>- Parameter:
charMapper-- Gibt zurück:
- a new array with the chars the given charMapper maps from the
elements of the current
ArrayMappable. Maps null elements to a space.
-
toConcatenatedString
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toConcatenatedStringin SchnittstelleStringMappable- Gibt zurück:
- a concatenation of the
Stringrepresentations of the elements of the currentStringMappable.
-
toDoubleArray
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toDoubleArrayin SchnittstelleArrayMappable<E>- Parameter:
doubleMapper-- Gibt zurück:
- a new array with the doubles the given doubleMapper maps from the
elements of the current
ArrayMappable. Maps null elements to 0.0.
-
toIntArray
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toIntArrayin SchnittstelleArrayMappable<E>- Parameter:
intMapper-- Gibt zurück:
- a new array with the ints the given intMapper maps from the elements
of the current
ArrayMappable. Maps null elements to 0. Maps null elements to 0.
-
toLongArray
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toLongArrayin SchnittstelleArrayMappable<E>- Parameter:
longMapper-- Gibt zurück:
- a new array with the longs the given longMapper maps from the
elements of the current
ArrayMappable. Maps null elements to 0.
-
toMultiples
The time complexity of this implementation is O(m*n) if: -The current *AbstractContainercontains m elements. -On average, the given multipleMapper maps n elements from an element of the currentAbstractContainer.- Angegeben von:
toMultiplesin SchnittstelleMappable<E>- Typparameter:
E2- is the type of the elements of theIContainers the given multipleMapper maps from the elements of the currentMappable.- Parameter:
multipleMapper-- Gibt zurück:
- a new
IContainerwith the elements of theIContainers the given multipleMapper maps from the elements of the currentMappable.
-
toNumbers
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toNumbersin SchnittstelleMappable<E>- Typparameter:
N- is the type of theNumbers the given numberMapper maps from the elements of the currentMappable.- Parameter:
numberMapper-- Gibt zurück:
- a new
IContainerwith theNumbers the given numberMapper maps from the elements of the currentMappable. Maps null elements to 0.0.
-
toReversedList
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toReversedListin SchnittstelleIContainer<E>- Gibt zurück:
- a new
IContainerwith the elements of the currentIContainerin reversed order.
-
toStringArray
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toStringArrayin SchnittstelleArrayMappable<E>- Gibt zurück:
- a new array with the
Stringrepresentations of the elements of the currentArrayMappable.
-
toStrings
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toStringsin SchnittstelleMappable<E>- Gibt zurück:
- a new
IContainerwith theStringrepresentations of the elements of the currentIContainer.
-
toStringWithSeparator
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toStringWithSeparatorin SchnittstelleStringMappable- Parameter:
separator-- Gibt zurück:
- a concatenation of the
Stringrepresentations of the elements of the currentStringMappablewith the given separator in between.
-
toStringWithSeparator
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toStringWithSeparatorin SchnittstelleStringMappable- Parameter:
separator-- Gibt zurück:
- a concatenation of the
Stringrepresentations of the elements of the currentStringMappablewith the given separator in between.
-
toWithOneBasedIndex
The time complexity of this implementation is O(n) if the currentAbstractContainercontains n elements.- Angegeben von:
toWithOneBasedIndexin SchnittstelleMappable<E>- Typparameter:
E2- is the type of the elements the given mapper maps from the elements of the currentMappableand from the one-based index of these elements.- Parameter:
mapper-- Gibt zurück:
- a new
IContainerwith the elements the given mapper maps from the elements of the currentMappableand from the one-based index of these elements.
-
createEmptyMutableList
- Typparameter:
E2- is the type of the elements the createdILinkedListcan contain.- Parameter:
marker-- Gibt zurück:
- a new empty
ILinkedList.
-