Uses of Class
io.vavr.collection.Queue
Packages that use Queue
Package
Description
Beside
API
the io.vavr package contains core types like (Checked)Functions and Tuples.Purely functional collections based on Traversable.
This package contains basic building blocks for creating fast, asynchronous, non-blocking parallel code.
-
Uses of Queue in io.vavr
-
Uses of Queue in io.vavr.collection
Fields in io.vavr.collection declared as QueueModifier and TypeFieldDescriptionprivate static final Queue
<?> Queue.EMPTY
LinkedHashMap.list
StreamModule.AppendElements.queue
Methods in io.vavr.collection that return QueueModifier and TypeMethodDescriptionQueue.asJavaMutable
(Consumer<? super List<T>> action) <R> Queue
<R> Queue.collect
(PartialFunction<? super T, ? extends R> partialFunction) Queue.combinations()
Queue.combinations
(int k) Queue.distinct()
Queue.distinctBy
(Comparator<? super T> comparator) Queue.distinctBy
(Function<? super T, ? extends U> keyExtractor) Queue.drop
(int n) Queue.dropRight
(int n) Queue.dropRightUntil
(Predicate<? super T> predicate) Queue.dropRightWhile
(Predicate<? super T> predicate) static <T> Queue
<T> Queue.empty()
Returns the empty Queue.Enqueues a new element.Queue.enqueueAll
(Iterable<? extends T> elements) Enqueues the given elements.static <T> Queue
<T> Returns a Queue containingn
values supplied by a given Suppliers
.static <T> Queue
<T> Queue.fill
(int n, T element) Returns a Queue containingn
times the givenelement
<U> Queue
<U> Queue.init()
Queue.intersperse
(T element) <U> Queue
<U> static <T> Queue
<T> Narrows a widenedQueue<? extends T>
toQueue<T>
by performing a type-safe cast.static <T> Queue
<T> Queue.of
(T element) Returns a singletonQueue
, i.e.static <T> Queue
<T> Queue.of
(T... elements) Creates a Queue of the given elements.Queue.ofAll
(boolean... elements) Creates a Queue from boolean values.Queue.ofAll
(byte... elements) Creates a Queue from byte values.Queue.ofAll
(char... elements) Creates a Queue from char values.Queue.ofAll
(double... elements) Creates a Queue from double values.Queue.ofAll
(float... elements) Creates a Queue from float values.Queue.ofAll
(int... elements) Creates a Queue from int values.Queue.ofAll
(long... elements) Creates a Queue from long values.Queue.ofAll
(short... elements) Creates a Queue from short values.static <T> Queue
<T> Creates a Queue of the given elements.static <T> Queue
<T> Creates a Queue that contains the elements of the givenStream
.Queue.permutations()
Queue.prependAll
(Iterable<? extends T> elements) Queue.range
(char from, char toExclusive) Queue.range
(int from, int toExclusive) Creates a Queue of int numbers starting fromfrom
, extending totoExclusive - 1
.Queue.range
(long from, long toExclusive) Creates a Queue of long numbers starting fromfrom
, extending totoExclusive - 1
.Queue.rangeBy
(char from, char toExclusive, int step) Queue.rangeBy
(double from, double toExclusive, double step) Queue.rangeBy
(int from, int toExclusive, int step) Creates a Queue of int numbers starting fromfrom
, extending totoExclusive - 1
, withstep
.Queue.rangeBy
(long from, long toExclusive, long step) Creates a Queue of long numbers starting fromfrom
, extending totoExclusive - 1
, withstep
.Queue.rangeClosed
(char from, char toInclusive) Queue.rangeClosed
(int from, int toInclusive) Creates a Queue of int numbers starting fromfrom
, extending totoInclusive
.Queue.rangeClosed
(long from, long toInclusive) Creates a Queue of long numbers starting fromfrom
, extending totoInclusive
.Queue.rangeClosedBy
(char from, char toInclusive, int step) Queue.rangeClosedBy
(double from, double toInclusive, double step) Queue.rangeClosedBy
(int from, int toInclusive, int step) Creates a Queue of int numbers starting fromfrom
, extending totoInclusive
, withstep
.Queue.rangeClosedBy
(long from, long toInclusive, long step) Creates a Queue of long numbers starting fromfrom
, extending totoInclusive
, withstep
.Queue.removeAt
(int index) Queue.removeFirst
(Predicate<T> predicate) Queue.removeLast
(Predicate<T> predicate) Queue.replaceAll
(T currentElement, T newElement) Queue.reverse()
Queue.rotateLeft
(int n) Queue.rotateRight
(int n) <U> Queue
<U> Queue.scanLeft
(U zero, BiFunction<? super U, ? super T, ? extends U> operation) <U> Queue
<U> Queue.scanRight
(U zero, BiFunction<? super T, ? super U, ? extends U> operation) Queue.shuffle()
Queue.slice
(int beginIndex, int endIndex) Queue.sortBy
(Comparator<? super U> comparator, Function<? super T, ? extends U> mapper) <U extends Comparable<? super U>>
Queue<T> Queue.sorted()
Queue.sorted
(Comparator<? super T> comparator) Queue.subSequence
(int beginIndex) Queue.subSequence
(int beginIndex, int endIndex) static <T> Queue
<T> Returns a Queue containingn
values of a given Functionf
over a range of integer values from 0 ton - 1
.Queue.tail()
Queue.take
(int n) Queue.takeRight
(int n) Queue.takeRightUntil
(Predicate<? super T> predicate) Queue.takeRightWhile
(Predicate<? super T> predicate) Transposes the rows and columns of aQueue
matrix.static <T> Queue
<T> Creates a Queue from a seed value and a function.static <T,
U> Queue <U> Queue.unfoldLeft
(T seed, Function<? super T, Option<Tuple2<? extends T, ? extends U>>> f) Creates a Queue from a seed value and a function.static <T,
U> Queue <U> Queue.unfoldRight
(T seed, Function<? super T, Option<Tuple2<? extends U, ? extends T>>> f) Creates a Queue from a seed value and a function.<U,
R> Queue <R> Queue.zipWith
(Iterable<? extends U> that, BiFunction<? super T, ? super U, ? extends R> mapper) Queue.zipWithIndex()
<U> Queue
<U> Queue.zipWithIndex
(BiFunction<? super T, ? super Integer, ? extends U> mapper) Methods in io.vavr.collection that return types with arguments of type QueueModifier and TypeMethodDescriptionQueue.collector()
Returns aCollector
which may be used in conjunction withStream.collect(java.util.stream.Collector)
to obtain aQueue
.Queue.combinations()
Queue.combinations
(int k) Queue.crossProduct
(int power) Queue.grouped
(int size) Queue.permutations()
Queue.sliding
(int size) Queue.sliding
(int size, int step) Queue.splitAt
(int n) Queue.splitAt
(int n) Queue.splitAtInclusive
(Predicate<? super T> predicate) Queue.splitAtInclusive
(Predicate<? super T> predicate) Transposes the rows and columns of aQueue
matrix.Methods in io.vavr.collection with parameters of type QueueModifier and TypeMethodDescriptionstatic <T> Queue
<T> Narrows a widenedQueue<? extends T>
toQueue<T>
by performing a type-safe cast.Transposes the rows and columns of aQueue
matrix.private static <K,
V> LinkedHashMap <K, V> Construct Map with given values and key order.private static <K,
V> LinkedHashMap <K, V> LinkedHashMap.wrapNonUnique
(Queue<Tuple2<K, V>> list, HashMap<K, V> map) Construct Map with given values and key order.Method parameters in io.vavr.collection with type arguments of type QueueModifier and TypeMethodDescription<U> U
Transforms thisQueue
.Transposes the rows and columns of aQueue
matrix.Constructors in io.vavr.collection with parameters of type Queue -
Uses of Queue in io.vavr.concurrent
Fields in io.vavr.concurrent declared as QueueModifier and TypeFieldDescriptionFutureImpl.actions
The queue of actions is filled when calling onComplete() before the Future is completed or cancelled.FutureImpl.waiters
The queue of waiters is filled when calling await() before the Future is completed or cancelled.Constructors in io.vavr.concurrent with parameters of type Queue