Uses of Interface
org.javimmutable.collections.IDeque
Package
Description
-
Uses of IDeque in org.javimmutable.collections
Modifier and TypeInterfaceDescriptioninterface
IList<T>
Interface for containers that store items in list form with individual items available for get() and assign() using their indexes.Modifier and TypeMethodDescriptionstatic <T> IDeque
<T> Efficiently produces aIList
containing all of the values in source built atop a balanced binary tree.static <T> IDeque
<T> Efficiently produces aIList
containing all of the values in source built atop a balanced binary tree.Replaces the value at the specified index (which must be within current bounds of the list) with the new value.IDequeBuilder.build()
Builds and returns a collection containing all of the added values.IDeque.deleteAll()
IDeque.deleteFirst()
Removes the first value from the list and reduces size by 1.IDeque.deleteLast()
Removes the last value from the list and reduces size by 1.Adds a value to the end of the list.Adds the values to the end of the list in the same order they appear in the Iterable.Adds the values to the end of the list in the same order they appear in the Iterable.IDeque.insertAllFirst
(Iterable<? extends T> values) Adds the values to the beginning of the list in the same order they appear in the Iterable.IDeque.insertAllFirst
(Iterator<? extends T> values) Adds the values to the beginning of the list in the same order they appear in the Iterable.IDeque.insertAllLast
(Iterable<? extends T> values) Adds the values to the end of the list in the same order they appear in the Iterable.IDeque.insertAllLast
(Iterator<? extends T> values) Adds the values to the end of the list in the same order they appear in the Iterable.IDeque.insertFirst
(T value) Adds a value to the front of the list.IDeque.insertLast
(T value) Adds a value to the end of the list.IDeque.middle
(int offset, int limit) Return the (possibly empty) list containing the values starting at offset (inclusive) and including all remaining items up to but excluding the value at index limit.static <T> IDeque
<T> IDeques.of()
Produces an emptyIList
built atop a balanced binary tree.static <T> IDeque
<T> IDeques.of
(T... values) Efficiently produces aIList
containing all of the specified values built atop a balanced binary tree.IDeque.prefix
(int limit) Return the (possibly empty) list containing the first limit values.Returns a list of the same type as this containing all those elements for which predicate returns false.IDeque.reverse()
Returns a list containing the same elements as this list but with their order reversed so that first in this list is last in returned list etc.Returns a list of the same type as this containing only those elements for which predicate returns true.IDeque.suffix
(int offset) Return the (possibly empty) list containing the values starting at offset (inclusive) and including all remaining items.<A> IDeque
<A> Apply the transform function to all elements in iterator order and add each transformed value to a new collection of this type.<A> IDeque
<A> IDeque.transformSome
(Func1<T, Maybe<A>> transform) Apply the transform function to all elements in iterator order and add the contents of non-empty Holders to a new collection of this type.Modifier and TypeMethodDescriptionIDeque.dequeCollector()
Returns a Collector that creates a list of the same type as this containing all of the collected values inserted after whatever starting values this already contained.static <T> java.util.stream.Collector
<T, ?, IDeque<T>> ICollectors.toDeque()
Collects values into a IDeque. -
Uses of IDeque in org.javimmutable.collections.common
-
Uses of IDeque in org.javimmutable.collections.deque
-
Uses of IDeque in org.javimmutable.collections.list
-
Uses of IDeque in org.javimmutable.collections.serialization