Package ch.nolix.core.container.base

Klasse Container<E>

java.lang.Object
ch.nolix.core.container.base.Container<E>
Typparameter:
E - is the type of the elements of a Container.
Alle implementierten Schnittstellen:
IContainer<E>, IViewProviderContainer<E>, Mappable<E>, MultiSearchable<E>, ArrayMappable<E>, ICountingContainer<E>, IndexRequestable<E>, IStatisticalConainer<E>, IterableWithCopyableIterator<E>, SingleSearchable<E>, StoringRequestable<E>, StringMappable, EmptinessRequestable, MaterializationRequestable, Iterable<E>
Bekannte direkte Unterklassen:
ArrayList, ArrayView, CachingContainer, ContainerView, ContainerView, ImmutableList, IterableView, LinkedList, Matrix, MatrixColumn, MatrixRow, MultiContainerView
public abstract class Container<E> extends Object implements IContainer<E>
Version:
2016-01-01
Autor:
Silvan Wyss

  • Konstruktordetails

    • Container

      public Container()

  • Methodendetails

    • contains

      public final boolean contains(Object object)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      contains in Schnittstelle StoringRequestable<E>
      Parameter:
      object -
      Gibt zurück:
      true if the current StoringRequestable contains the given object, false otherwise.

    • containsAll

      public final boolean containsAll(Iterable<?> objects)
      The time complexity of this implementation is O(m*n) if: -The current Container contains m elements. -n objects are given.
      Angegeben von:
      containsAll in Schnittstelle StoringRequestable<E>
      Parameter:
      objects -
      Gibt zurück:
      true if the current StoringRequestable contains all of the given objects, false otherwise.

    • containsAll

      public final boolean containsAll(Object object, Object... objects)
      The time complexity of this implementation is O(m*n) if: -The current Container contains m elements. -n objects are given.
      Angegeben von:
      containsAll in Schnittstelle StoringRequestable<E>
      Parameter:
      object -
      objects -
      Gibt zurück:
      true if the current StoringRequestable contains the given object and all of the given objects, false otherwise.

    • containsAll

      public final boolean containsAll(Object[] objects)
      The time complexity of this implementation is O(m*n) if: -The current Container contains m elements. -n objects are given.
      Angegeben von:
      containsAll in Schnittstelle StoringRequestable<E>
      Parameter:
      objects -
      Gibt zurück:
      true if the current StoringRequestable contains all of the given objects, false otherwise.

    • containsAny

      public final boolean containsAny(Predicate<E> selector)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      containsAny in Schnittstelle StoringRequestable<E>
      Parameter:
      selector -
      Gibt zurück:
      true if the current StoringRequestable contains an element the given selector selects, false otherwise. Ignores null elements.

    • containsAny

      public final boolean containsAny(Object object, Object... objects)
      The time complexity of this implementation is O(m*n) if: -The current Container contains m elements. -n objects are given.
      Angegeben von:
      containsAny in Schnittstelle StoringRequestable<E>
      Parameter:
      object -
      objects -
      Gibt zurück:
      true if the current StoringRequestable contains the given object or one of the given objects, false otherwise.

    • containsAnyOf

      public final boolean containsAnyOf(Iterable<?> objects)
      The time complexity of this implementation is O(m*n) if: -The current Container contains m elements. -n objects are given.
      Angegeben von:
      containsAnyOf in Schnittstelle StoringRequestable<E>
      Parameter:
      objects -
      Gibt zurück:
      true if the current StoringRequestable contains any of the given objects, false otherwise.

    • containsAnyOf

      public final boolean containsAnyOf(Object[] objects)
      The time complexity of this implementation is O(m*n) if: -The current Container contains m elements. -n objects are given.
      Angegeben von:
      containsAnyOf in Schnittstelle StoringRequestable<E>
      Parameter:
      objects -
      Gibt zurück:
      true if the current StoringRequestable contains any of the given objects, false otherwise.

    • containsAsManyAs

      public final boolean containsAsManyAs(Iterable<?> iterable)
      The time complexity of this implementation is O(n) if the current container contains n elements.
      Angegeben von:
      containsAsManyAs in Schnittstelle StoringRequestable<E>
      Parameter:
      iterable -
      Gibt zurück:
      true if the current StoringRequestable contains as many elements as the given container, false otherwise.

    • containsEqualing

      public final boolean containsEqualing(Object element)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      containsEqualing in Schnittstelle StoringRequestable<E>
      Parameter:
      element -
      Gibt zurück:
      true if the current StoringRequestable contains an element that equals the given given element, false otherwise.

    • containsExactlyEqualingInSameOrder

      public final boolean containsExactlyEqualingInSameOrder(Iterable<?> iterable)
      The time complexity of this implementation is O(m*n) if: The current Container contains m elements. The given iterable contains n elements.
      Angegeben von:
      containsExactlyEqualingInSameOrder in Schnittstelle StoringRequestable<E>
      Parameter:
      iterable -
      Gibt zurück:
      true if the current StoringRequestable contains exactly elements that equal the elements of given iterable in the same order, false otherwise.

    • containsExactlyInSameOrder

      public final boolean containsExactlyInSameOrder(Iterable<?> iterable)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      containsExactlyInSameOrder in Schnittstelle StoringRequestable<E>
      Parameter:
      iterable -
      Gibt zurück:
      true if the current StoringRequestable contains exactly the elements of the given iterable in the same order, false otherwise.

    • containsLessThan

      public final boolean containsLessThan(Iterable<?> iterable)
      The time complexity of this implementation is O(n) if the given iterable contains n elements.
      Angegeben von:
      containsLessThan in Schnittstelle StoringRequestable<E>
      Parameter:
      iterable -
      Gibt zurück:
      true if the current StoringRequestable contains less elements than the given container, false otherwise

    • containsMoreThan

      public final boolean containsMoreThan(Iterable<?> iterable)
      The time complexity of this implementation is O(n) if the given iterable contains n elements.
      Angegeben von:
      containsMoreThan in Schnittstelle StoringRequestable<E>
      Parameter:
      iterable -
      Gibt zurück:
      true if the current StoringRequestable contains more elements than the given container, false otherwise.

    • containsNone

      public final boolean containsNone(Predicate<E> selector)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      containsNone in Schnittstelle StoringRequestable<E>
      Parameter:
      selector -
      Gibt zurück:
      true if the current StoringRequestable does not contain an element the given selector selects. Ignores null elements.

    • containsNone

      public final boolean containsNone(Object object, Object... objects)
      The time complexity of this implementation is O(m*n) if: -The current Container contains m elements. -n objects are given.
      Angegeben von:
      containsNone in Schnittstelle StoringRequestable<E>
      Parameter:
      object -
      objects -
      Gibt zurück:
      true if the current StoringRequestable does not contain the given object and none of the given objects, false otherwise.

    • containsNoneOf

      public final boolean containsNoneOf(Iterable<?> elements)
      The time complexity of this implementation is O(m*n) if: -The current Container contains m elements. -n objects are given.
      Angegeben von:
      containsNoneOf in Schnittstelle StoringRequestable<E>
      Parameter:
      elements -
      Gibt zurück:
      true if the current StoringRequestable does not contain any of the given objects.

    • containsOnce

      public final boolean containsOnce(Object object)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      containsOnce in Schnittstelle StoringRequestable<E>
      Parameter:
      object -
      Gibt zurück:
      true if the current StoringRequestable contains the given object exactly 1 time, false otherwise.

    • containsOne

      public final boolean containsOne()
      The time complexity of this implementation is O(1).
      Angegeben von:
      containsOne in Schnittstelle StoringRequestable<E>
      Gibt zurück:
      true if the current StoringRequestable contains exactly 1 element, false otherwise.

    • containsOne

      public final boolean containsOne(Predicate<E> selector)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      containsOne in Schnittstelle StoringRequestable<E>
      Parameter:
      selector -
      Gibt zurück:
      true if the current StoringRequestable contains exactly 1 element the given selector selects, false otherwise. Ignores null elements.

    • containsOneEqualing

      public final boolean containsOneEqualing(E object)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      containsOneEqualing in Schnittstelle StoringRequestable<E>
      Parameter:
      object -
      Gibt zurück:
      true if the current StoringRequestable contains exactly 1 element that equals the given object, false otherwise.

    • containsOnly

      public final boolean containsOnly(Predicate<E> selector)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      containsOnly in Schnittstelle StoringRequestable<E>
      Parameter:
      selector -
      Gibt zurück:
      true if the current StoringRequestable contains only elements the given selector selects. Null element are regarded as unselectable.

    • getAverage

      public final double getAverage(Function<E,Number> valueMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getAverage in Schnittstelle IStatisticalConainer<E>
      Parameter:
      valueMapper -
      Gibt zurück:
      the average of the values the given valueMapper maps from the elements of the current IStatisticalConainer. Maps null elements to 0.0.

    • getAverageOrZero

      public final double getAverageOrZero(Function<E,Number> mapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getAverageOrZero in Schnittstelle IStatisticalConainer<E>
      Parameter:
      mapper -
      Gibt zurück:
      the average of the values the given valueMapper maps from the elements of the current IStatisticalConainer if the current IStatisticalConainer contains any, 0.0 otherwise. Maps null elements to 0.0.

    • getCount

      public final int getCount(Predicate<E> selector)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getCount in Schnittstelle ICountingContainer<E>
      Parameter:
      selector -
      Gibt zurück:
      the number of elements the given selector selects from the current ICountingContainer. Ignores null elements.

    • getCountOf

      public final int getCountOf(Object element)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getCountOf in Schnittstelle ICountingContainer<E>
      Parameter:
      element -
      Gibt zurück:
      the number how many times the current ICountingContainer contains the given element.

    • get1BasedIndexOfFirst

      public final int get1BasedIndexOfFirst(Predicate<E> selector)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      get1BasedIndexOfFirst in Schnittstelle IndexRequestable<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.

    • get1BasedIndexOfFirstEqualElement

      public final int get1BasedIndexOfFirstEqualElement(Object object)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      get1BasedIndexOfFirstEqualElement in Schnittstelle IndexRequestable<E>
      Parameter:
      object -
      Gibt zurück:
      the 1-based index of the first element of the current IndexRequestable that equals the given object.

    • get1BasedIndexOfFirstOccurrenceOf

      public final int get1BasedIndexOfFirstOccurrenceOf(Object object)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      get1BasedIndexOfFirstOccurrenceOf in Schnittstelle IndexRequestable<E>
      Parameter:
      object -
      Gibt zurück:
      the 1-based index of the first occurrence of the given object in the current IndexRequestable.

    • getMax

      public final <C extends Comparable<C>> C getMax(Function<E,C> comparableMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getMax in Schnittstelle IStatisticalConainer<E>
      Typparameter:
      C - is the type of the Comparables the given comparableMapper maps from the elements of the current IStatisticalConainer.
      Parameter:
      comparableMapper -
      Gibt zurück:
      the biggest Comparable the given comparableMapper maps from the elements of the current IStatisticalConainer. Ignores null elements.

    • getMaxOrZero

      public final double getMaxOrZero(Function<E,Number> numberMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getMaxOrZero in Schnittstelle IStatisticalConainer<E>
      Parameter:
      numberMapper -
      Gibt zurück:
      the biggest number the given numberMapper maps from the non-null elements of the current IStatisticalConainer if the current IStatisticalConainer contains non-null elements, 0.0 otherwise.

    • getMedian

      public final double getMedian(Function<E,Number> numberMapper)
      The time complexity of this implementation is O(n*log(n)) if the current Container contains n elements.
      Angegeben von:
      getMedian in Schnittstelle IStatisticalConainer<E>
      Parameter:
      numberMapper -
      Gibt zurück:
      the median of the numbers the given numberMapper maps from the elements of the current IStatisticalConainer. Maps null elements to 0.0.

    • getMedianOrZero

      public final double getMedianOrZero(Function<E,Number> norm)
      The time complexity of this implementation is O(n*log(n)) if the current Container contains n elements.
      Angegeben von:
      getMedianOrZero in Schnittstelle IStatisticalConainer<E>
      Parameter:
      norm -
      Gibt zurück:
      the median of the numbers the given numberMapper maps from the elements of the current IStatisticalConainer if the current IStatisticalConainer is not empty, 0.0 otherwise. Maps null elements to 0.0.

    • getMin

      public final <C extends Comparable<C>> C getMin(Function<E,C> comparableMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getMin in Schnittstelle IStatisticalConainer<E>
      Typparameter:
      C - is the type of the Comparables the given comparableMapper maps from the elements of the current IStatisticalConainer.
      Parameter:
      comparableMapper -
      Gibt zurück:
      the smallest Comparable the given comparableMapper maps from the elements of the current IStatisticalConainer. Ignores null elements.

    • getMinOrZero

      public final double getMinOrZero(Function<E,Number> numberMapper)
      Angegeben von:
      getMinOrZero in Schnittstelle IStatisticalConainer<E>
      Parameter:
      numberMapper -
      Gibt zurück:
      the smallest number the given numberMapper maps from the non-null elements of the current IStatisticalConainer if the current IStatisticalConainer contains non-null elements, 0.0 otherwise.

    • getOptionalStoredFirst

      public final Optional<E> getOptionalStoredFirst()
      The time complexity of this implementation is O(1).
      Angegeben von:
      getOptionalStoredFirst in Schnittstelle SingleSearchable<E>
      Gibt zurück:
      a Optional with the first element of the current SingleSearchable if the current SingleSearchable is not empty and if the first element of the current SingleSearchable is not null, an empty Optional otherwise.

    • getOptionalStoredFirst

      public final Optional<E> getOptionalStoredFirst(Predicate<? super E> selector)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getOptionalStoredFirst in Schnittstelle SingleSearchable<E>
      Parameter:
      selector -
      Gibt zurück:
      a new Optional with the first element the given selector selects from the current SingleSearchable if the current SingleSearchable contains an element the given selector selects, an empty Optional otherwise. Ignores null elements.

    • getStoredByMax

      public final <C extends Comparable<C>> E getStoredByMax(Function<E,C> comparableMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getStoredByMax in Schnittstelle SingleSearchable<E>
      Typparameter:
      C - is the type of the Comparables the given comparableMapper maps from the elements of the current SingleSearchable.
      Parameter:
      comparableMapper -
      Gibt zurück:
      the element with the biggest Comparable the given comparableMapper maps from the elements of the current SingleSearchable. Ignores null elements.

    • getStoredByMin

      public final <C extends Comparable<C>> E getStoredByMin(Function<E,C> comparableMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getStoredByMin in Schnittstelle SingleSearchable<E>
      Typparameter:
      C - is the type of the Comparables the given comparableMapper maps from the elements of the current SingleSearchable.
      Parameter:
      comparableMapper -
      Gibt zurück:
      the element with the smallest Comparable the given comparableMapper maps from the elements of the current SingleSearchable. Ignores null elements.

    • getStoredFirst

      public final E getStoredFirst()
      The time complexity of this implementation is O(1).
      Angegeben von:
      getStoredFirst in Schnittstelle SingleSearchable<E>
      Gibt zurück:
      the first element of the current SingleSearchable. The element can be null.

    • getStoredFirst

      public final E getStoredFirst(Predicate<? super E> selector)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getStoredFirst in Schnittstelle SingleSearchable<E>
      Parameter:
      selector -
      Gibt zurück:
      the first element the given selector selects from the current SingleSearchable. Ignores null elements.

    • getStoredFirstOfType

      public final <E2 extends E> E2 getStoredFirstOfType(Class<E2> type)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getStoredFirstOfType in Schnittstelle SingleSearchable<E>
      Typparameter:
      E2 - is the given type.
      Parameter:
      type -
      Gibt zurück:
      the first element from the current SingleSearchable that is of the given type.

    • getStoredInGroups

      public final IContainer<? extends IContainer<E>> getStoredInGroups(Function<E,?> norm)
      The time complexity of this implementation is O(m*n) if: -The current Container contains m elements. -The given norm assignes the elements of the current Container in n groups.
      Angegeben von:
      getStoredInGroups in Schnittstelle MultiSearchable<E>
      Parameter:
      norm -
      Gibt zurück:
      a new IContainer with the elements of the current MultiSearchable grouped by the given norm. Ignores null elements.

    • getStoredLast

      public final E getStoredLast()
      The time complexity of this implementation is O(1) or O(n) if the current Container contains n elements.
      Angegeben von:
      getStoredLast in Schnittstelle SingleSearchable<E>
      Gibt zurück:
      the last element of the current SingleSearchable. The element can be null.

    • getStoredOfType

      public final <E2 extends E> IContainer<E2> getStoredOfType(Class<E2> type)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getStoredOfType in Schnittstelle MultiSearchable<E>
      Typparameter:
      E2 - is the type of the elements of the returned SingleSearchable.
      Parameter:
      type -
      Gibt zurück:
      a new IContainer with the elements from the current MultiSearchable that are of the given type.

    • getStoredOne

      public final E getStoredOne()
      The time complexity of this implementation is O(1).
      Angegeben von:
      getStoredOne in Schnittstelle SingleSearchable<E>
      Gibt zurück:
      the one element of the current SingleSearchable. The element can be null.

    • getStoredOne

      public final E getStoredOne(Predicate<? super E> selector)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getStoredOne in Schnittstelle SingleSearchable<E>
      Parameter:
      selector -
      Gibt zurück:
      the one element the given selector selects from the current SingleSearchable. Ignores null elements.

    • getStoredOthers

      public final IContainer<E> getStoredOthers(Predicate<E> selector)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getStoredOthers in Schnittstelle MultiSearchable<E>
      Parameter:
      selector -
      Gibt zurück:
      a new IContainer with the elements from the current MultiSearchable the given selector skips. Ignores null elements.

    • getStoredSelected

      public final IContainer<E> getStoredSelected(Predicate<? super E> selector)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getStoredSelected in Schnittstelle MultiSearchable<E>
      Parameter:
      selector -
      Gibt zurück:
      a new IContainer with the elements the given selector selects from the current MultiSearchable. Ignores null elements.

    • getStandardDeviation

      public final double getStandardDeviation(Function<E,Number> norm)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getStandardDeviation in Schnittstelle IStatisticalConainer<E>
      Parameter:
      norm -
      Gibt zurück:
      the standard deviation of the numbers the given numberMapper maps from the elements of the current IStatisticalConainer.

    • getSum

      public final BigDecimal getSum(Function<E,Number> valueMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getSum in Schnittstelle IStatisticalConainer<E>
      Parameter:
      valueMapper -
      Gibt zurück:
      the sum of the values the given valueMapper maps from the elements of the current IStatisticalConainer. Maps null elements to 0.0.

    • getSumOfInts

      public final BigInteger getSumOfInts(ToIntFunction<E> intMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getSumOfInts in Schnittstelle IStatisticalConainer<E>
      Parameter:
      intMapper -
      Gibt zurück:
      the sum of the ints the given intMapper maps from the elements of the current IStatisticalConainer. Maps null elements to 0.0.

    • getVariance

      public final double getVariance(Function<E,Number> numberMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      getVariance in Schnittstelle IStatisticalConainer<E>
      Parameter:
      numberMapper -
      Gibt zurück:
      the variance of the numbers the given numberMapper maps from the elements of the current IStatisticalConainer. Maps null elements to 0.0.

    • getViewFrom1BasedStartIndex

      public final IContainer<E> getViewFrom1BasedStartIndex(int param1BasedStartIndex)
      The time complexity of this implementation is O(1).
      Angegeben von:
      getViewFrom1BasedStartIndex in Schnittstelle IViewProviderContainer<E>
      Parameter:
      param1BasedStartIndex -
      Gibt zurück:
      a new view of the current IViewProviderContainer from the given param1BasedStartIndex.

    • getViewFrom1BasedStartIndexTo1BasedEndIndex

      public final IContainer<E> getViewFrom1BasedStartIndexTo1BasedEndIndex(int param1BasedStartIndex, int param1BasedEndIndex)
      The time complexity of this implementation is O(1).
      Angegeben von:
      getViewFrom1BasedStartIndexTo1BasedEndIndex in Schnittstelle IViewProviderContainer<E>
      Parameter:
      param1BasedStartIndex -
      param1BasedEndIndex -
      Gibt zurück:
      a new view of the current IViewProviderContainer from the given param1BasedStartIndex to the given param1BasedEndIndex.

    • getViewTo1BasedEndIndex

      public final IContainer<E> getViewTo1BasedEndIndex(int param1BasedEndIndex)
      The time complexity of this implementation is O(1).
      Angegeben von:
      getViewTo1BasedEndIndex in Schnittstelle IViewProviderContainer<E>
      Parameter:
      param1BasedEndIndex -
      Gibt zurück:
      a new view IContainer of the current IViewProviderContainer to the given param1BasedEndIndex.

    • getViewWithoutFirst

      public final IContainer<E> getViewWithoutFirst()
      The time complexity of this implementation is O(1).
      Angegeben von:
      getViewWithoutFirst in Schnittstelle IViewProviderContainer<E>
      Gibt zurück:
      a new view IContainer view of the current IViewProviderContainer without the first element.

    • getViewWithoutFirst

      public final IContainer<E> getViewWithoutFirst(int n)
      The time complexity of this implementation is O(1).
      Angegeben von:
      getViewWithoutFirst in Schnittstelle IViewProviderContainer<E>
      Parameter:
      n -
      Gibt zurück:
      a new view IContainer view of the current IViewProviderContainer without the first n elements.

    • getViewWithoutLast

      public final IContainer<E> getViewWithoutLast()
      The time complexity of this implementation is O(1).
      Angegeben von:
      getViewWithoutLast in Schnittstelle IViewProviderContainer<E>
      Gibt zurück:
      a new view IContainer view of the current IViewProviderContainer without the last element.

    • getViewWithoutLast

      public final IContainer<E> getViewWithoutLast(int n)
      The time complexity of this implementation is O(1).
      Angegeben von:
      getViewWithoutLast in Schnittstelle IViewProviderContainer<E>
      Parameter:
      n -
      Gibt zurück:
      a new view IContainer of the current IViewProviderContainer without 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:
      isEmpty in Schnittstelle EmptinessRequestable
      Gibt zurück:
      true if EmptinessRequestable does not contain an element.

    • to

      public final <E2> IContainer<E2> to(Function<E,E2> mapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      to in Schnittstelle Mappable<E>
      Typparameter:
      E2 - is the type of the elements the given mapper maps from the elements of the current Mappable.
      Parameter:
      mapper -
      Gibt zurück:
      a new IContainer with the elements the given mapper maps from the elements of the current Mappable.

    • toArray

      public final Object[] toArray()
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toArray in Schnittstelle ArrayMappable<E>
      Gibt zurück:
      a new array with the elements of the current ArrayMappable.

    • toByteArray

      public final byte[] toByteArray(Function<E,Byte> byteMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toByteArray in Schnittstelle ArrayMappable<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

      public final char[] toCharArray(Function<E,Character> charMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toCharArray in Schnittstelle ArrayMappable<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

      public final String toConcatenatedString()
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toConcatenatedString in Schnittstelle StringMappable
      Gibt zurück:
      a concatenation of the String representations of the elements of the current IContainer.

    • toDoubleArray

      public final double[] toDoubleArray(ToDoubleFunction<E> doubleMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toDoubleArray in Schnittstelle ArrayMappable<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

      public final int[] toIntArray(ToIntFunction<E> intMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toIntArray in Schnittstelle ArrayMappable<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

      public final long[] toLongArray(ToLongFunction<E> longMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toLongArray in Schnittstelle ArrayMappable<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.

    • toMultiple

      public final <E2> IContainer<E2> toMultiple(Function<E,IContainer<E2>> multipleMapper)
      The time complexity of this implementation is O(m*n) if: -The current * Container contains m elements. -On average, the given multipleMapper maps n elements from an element of the current Container.
      Angegeben von:
      toMultiple in Schnittstelle Mappable<E>
      Typparameter:
      E2 - is the type of the elements of the IContainers the given multipleMapper maps from the elements of the current Mappable.
      Parameter:
      multipleMapper -
      Gibt zurück:
      a new IContainer with the elements of the IContainers the given multipleMapper maps from the elements of the current Mappable.

    • toNumbers

      public <N extends Number> IContainer<N> toNumbers(Function<E,N> numberMapper)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toNumbers in Schnittstelle Mappable<E>
      Typparameter:
      N - is the type of the Numbers the given numberMapper maps from the elements of the current Mappable.
      Parameter:
      numberMapper -
      Gibt zurück:
      a new IContainer with the Numbers the given numberMapper maps from the elements of the current Mappable. Maps null elements to 0.0.

    • toReversedList

      public final IContainer<E> toReversedList()
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toReversedList in Schnittstelle IContainer<E>
      Gibt zurück:
      a new IContainer with the elements of the current IContainer in reversed order.

    • toStringArray

      public final String[] toStringArray()
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toStringArray in Schnittstelle ArrayMappable<E>
      Gibt zurück:
      a new array with the String representations of the elements of the current ArrayMappable.

    • toStrings

      public final IContainer<String> toStrings()
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toStrings in Schnittstelle Mappable<E>
      Gibt zurück:
      a new IContainer with the String representations of the elements of the current IContainer.

    • toStringWithSeparator

      public final String toStringWithSeparator(char separator)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toStringWithSeparator in Schnittstelle StringMappable
      Parameter:
      separator -
      Gibt zurück:
      a concatenation of the String representations of the elements of the current StringMappable with the given separator in between.

    • toStringWithSeparator

      public final String toStringWithSeparator(String separator)
      The time complexity of this implementation is O(n) if the current Container contains n elements.
      Angegeben von:
      toStringWithSeparator in Schnittstelle StringMappable
      Parameter:
      separator -
      Gibt zurück:
      a concatenation of the String representations of the elements of the current StringMappable with the given separator in between.

    • createEmptyMutableList

      protected abstract <E2> ILinkedList<E2> createEmptyMutableList(Marker<E2> marker)
      Typparameter:
      E2 - is the type of the elements the created ILinkedList can contain.
      Parameter:
      marker -
      Gibt zurück:
      a new empty ILinkedList.