Uses of Class io.vavr.collection.Queue (Vavr 0.10.3 API)

Packages that use Queue
Package	Description
io.vavr	Beside `API` the io.vavr package contains core types like (Checked)Functions and Tuples.
io.vavr.collection	Purely functional collections based on Traversable.

Uses of Queue in io.vavr

Methods in io.vavr that return Queue
Modifier and Type	Method and Description
`static <T> Queue<T>`	API.`Queue()` Alias for `empty()`
`static <T> Queue<T>`	API.`Queue(T... elements)` Alias for `of(Object...)`
`static <T> Queue<T>`	API.`Queue(T element)` Alias for `of(Object)`
`default Queue<T>`	Value.`toQueue()` Converts this to a `Queue`.

Uses of Queue in io.vavr.collection

Methods in io.vavr.collection that return Queue
Modifier and Type	Method and Description
`Queue<T>`	Queue.`append(T element)`
`Queue<T>`	Queue.`appendAll(Iterable<? extends T> elements)`
`Queue<T>`	Queue.`asJava(Consumer<? super List<T>> action)`
`Queue<T>`	Queue.`asJavaMutable(Consumer<? super List<T>> action)`
`<R> Queue<R>`	Queue.`collect(PartialFunction<? super T,? extends R> partialFunction)`
`Queue<Queue<T>>`	Queue.`combinations()`
`Queue<Queue<T>>`	Queue.`combinations(int k)`
`Queue<T>`	Queue.`distinct()`
`Queue<T>`	Queue.`distinctBy(Comparator<? super T> comparator)`
`<U> Queue<T>`	Queue.`distinctBy(Function<? super T,? extends U> keyExtractor)`
`Queue<T>`	Queue.`drop(int n)`
`Queue<T>`	Queue.`dropRight(int n)`
`Queue<T>`	Queue.`dropRightUntil(Predicate<? super T> predicate)`
`Queue<T>`	Queue.`dropRightWhile(Predicate<? super T> predicate)`
`Queue<T>`	Queue.`dropWhile(Predicate<? super T> predicate)`
`static <T> Queue<T>`	Queue.`empty()` Returns the empty Queue.
`Queue<T>`	Queue.`enqueue(T element)` Enqueues a new element.
`Queue<T>`	Queue.`enqueueAll(Iterable<? extends T> elements)` Enqueues the given elements.
`static <T> Queue<T>`	Queue.`fill(int n, Supplier<? extends T> s)` Returns a Queue containing `n` values supplied by a given Supplier `s`.
`static <T> Queue<T>`	Queue.`fill(int n, T element)` Returns a Queue containing `n` times the given `element`
`Queue<T>`	Queue.`filter(Predicate<? super T> predicate)`
`<U> Queue<U>`	Queue.`flatMap(Function<? super T,? extends Iterable<? extends U>> mapper)`
`Queue<T>`	Queue.`init()`
`Queue<T>`	Queue.`insert(int index, T element)`
`Queue<T>`	Queue.`insertAll(int index, Iterable<? extends T> elements)`
`Queue<T>`	Queue.`intersperse(T element)`
`Queue<T>`	Queue.`leftPadTo(int length, T element)`
`<U> Queue<U>`	Queue.`map(Function<? super T,? extends U> mapper)`
`static <T> Queue<T>`	Queue.`narrow(Queue<? extends T> queue)` Narrows a widened `Queue<? extends T>` to `Queue<T>` by performing a type-safe cast.
`static <T> Queue<T>`	Queue.`of(T... elements)` Creates a Queue of the given elements.
`static <T> Queue<T>`	Queue.`of(T element)` Returns a singleton `Queue`, i.e.
`static Queue<Boolean>`	Queue.`ofAll(boolean... elements)` Creates a Queue from boolean values.
`static Queue<Byte>`	Queue.`ofAll(byte... elements)` Creates a Queue from byte values.
`static Queue<Character>`	Queue.`ofAll(char... elements)` Creates a Queue from char values.
`static Queue<Double>`	Queue.`ofAll(double... elements)` Creates a Queue from double values.
`static Queue<Float>`	Queue.`ofAll(float... elements)` Creates a Queue from float values.
`static Queue<Integer>`	Queue.`ofAll(int... elements)` Creates a Queue from int values.
`static <T> Queue<T>`	Queue.`ofAll(Iterable<? extends T> elements)` Creates a Queue of the given elements.
`static Queue<Long>`	Queue.`ofAll(long... elements)` Creates a Queue from long values.
`static Queue<Short>`	Queue.`ofAll(short... elements)` Creates a Queue from short values.
`static <T> Queue<T>`	Queue.`ofAll(Stream<? extends T> javaStream)` Creates a Queue that contains the elements of the given `Stream`.
`Queue<T>`	Queue.`orElse(Iterable<? extends T> other)`
`Queue<T>`	Queue.`orElse(Supplier<? extends Iterable<? extends T>> supplier)`
`Queue<T>`	Queue.`padTo(int length, T element)`
`Queue<T>`	Queue.`patch(int from, Iterable<? extends T> that, int replaced)`
`Queue<Queue<T>>`	Queue.`permutations()`
`Queue<T>`	Queue.`prepend(T element)`
`Queue<T>`	Queue.`prependAll(Iterable<? extends T> elements)`
`static Queue<Character>`	Queue.`range(char from, char toExclusive)`
`static Queue<Integer>`	Queue.`range(int from, int toExclusive)` Creates a Queue of int numbers starting from `from`, extending to `toExclusive - 1`.
`static Queue<Long>`	Queue.`range(long from, long toExclusive)` Creates a Queue of long numbers starting from `from`, extending to `toExclusive - 1`.
`static Queue<Character>`	Queue.`rangeBy(char from, char toExclusive, int step)`
`static Queue<Double>`	Queue.`rangeBy(double from, double toExclusive, double step)`
`static Queue<Integer>`	Queue.`rangeBy(int from, int toExclusive, int step)` Creates a Queue of int numbers starting from `from`, extending to `toExclusive - 1`, with `step`.
`static Queue<Long>`	Queue.`rangeBy(long from, long toExclusive, long step)` Creates a Queue of long numbers starting from `from`, extending to `toExclusive - 1`, with `step`.
`static Queue<Character>`	Queue.`rangeClosed(char from, char toInclusive)`
`static Queue<Integer>`	Queue.`rangeClosed(int from, int toInclusive)` Creates a Queue of int numbers starting from `from`, extending to `toInclusive`.
`static Queue<Long>`	Queue.`rangeClosed(long from, long toInclusive)` Creates a Queue of long numbers starting from `from`, extending to `toInclusive`.
`static Queue<Character>`	Queue.`rangeClosedBy(char from, char toInclusive, int step)`
`static Queue<Double>`	Queue.`rangeClosedBy(double from, double toInclusive, double step)`
`static Queue<Integer>`	Queue.`rangeClosedBy(int from, int toInclusive, int step)` Creates a Queue of int numbers starting from `from`, extending to `toInclusive`, with `step`.
`static Queue<Long>`	Queue.`rangeClosedBy(long from, long toInclusive, long step)` Creates a Queue of long numbers starting from `from`, extending to `toInclusive`, with `step`.
`Queue<T>`	Queue.`remove(T element)`
`Queue<T>`	Queue.`removeAll(T element)`
`Queue<T>`	Queue.`removeAt(int index)`
`Queue<T>`	Queue.`removeFirst(Predicate<T> predicate)`
`Queue<T>`	Queue.`removeLast(Predicate<T> predicate)`
`Queue<T>`	Queue.`replace(T currentElement, T newElement)`
`Queue<T>`	Queue.`replaceAll(T currentElement, T newElement)`
`Queue<T>`	Queue.`reverse()`
`Queue<T>`	Queue.`rotateLeft(int n)`
`Queue<T>`	Queue.`rotateRight(int n)`
`Queue<T>`	Queue.`scan(T zero, BiFunction<? super T,? super T,? extends T> operation)`
`<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<T>`	Queue.`shuffle()`
`Queue<T>`	Queue.`slice(int beginIndex, int endIndex)`
`<U> Queue<T>`	Queue.`sortBy(Comparator<? super U> comparator, Function<? super T,? extends U> mapper)`
`<U extends Comparable<? super U>> Queue<T>`	Queue.`sortBy(Function<? super T,? extends U> mapper)`
`Queue<T>`	Queue.`sorted()`
`Queue<T>`	Queue.`sorted(Comparator<? super T> comparator)`
`Queue<T>`	Queue.`subSequence(int beginIndex)`
`Queue<T>`	Queue.`subSequence(int beginIndex, int endIndex)`
`static <T> Queue<T>`	Queue.`tabulate(int n, Function<? super Integer,? extends T> f)` Returns a Queue containing `n` values of a given Function `f` over a range of integer values from 0 to `n - 1`.
`Queue<T>`	Queue.`tail()`
`Queue<T>`	Queue.`take(int n)`
`Queue<T>`	Queue.`takeRight(int n)`
`Queue<T>`	Queue.`takeRightUntil(Predicate<? super T> predicate)`
`Queue<T>`	Queue.`takeRightWhile(Predicate<? super T> predicate)`
`Queue<T>`	Queue.`takeUntil(Predicate<? super T> predicate)`
`static <T> Queue<Queue<T>>`	Queue.`transpose(Queue<Queue<T>> matrix)` Transposes the rows and columns of a `Queue` matrix.
`static <T> Queue<T>`	Queue.`unfold(T seed, Function<? super T,Option<Tuple2<? extends T,? extends T>>> f)` 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.
`Queue<T>`	Queue.`update(int index, Function<? super T,? extends T> updater)`
`Queue<T>`	Queue.`update(int index, T element)`
`<U> Queue<Tuple2<T,U>>`	Queue.`zip(Iterable<? extends U> that)`
`<U> Queue<Tuple2<T,U>>`	Queue.`zipAll(Iterable<? extends U> that, T thisElem, U thatElem)`
`<U,R> Queue<R>`	Queue.`zipWith(Iterable<? extends U> that, BiFunction<? super T,? super U,? extends R> mapper)`
`Queue<Tuple2<T,Integer>>`	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 Queue
Modifier and Type	Method and Description
`static <T> Collector<T,ArrayList<T>,Queue<T>>`	Queue.`collector()` Returns a `Collector` which may be used in conjunction with `Stream.collect(java.util.stream.Collector)` to obtain a `Queue` .
`Queue<Queue<T>>`	Queue.`combinations()`
`Queue<Queue<T>>`	Queue.`combinations(int k)`
`Iterator<Queue<T>>`	Queue.`crossProduct(int power)`
`<C> Map<C,Queue<T>>`	Queue.`groupBy(Function<? super T,? extends C> classifier)`
`Iterator<Queue<T>>`	Queue.`grouped(int size)`
`Tuple2<Queue<T>,Queue<T>>`	Queue.`partition(Predicate<? super T> predicate)`
`Tuple2<Queue<T>,Queue<T>>`	Queue.`partition(Predicate<? super T> predicate)`
`Queue<Queue<T>>`	Queue.`permutations()`
`Iterator<Queue<T>>`	Queue.`slideBy(Function<? super T,?> classifier)`
`Iterator<Queue<T>>`	Queue.`sliding(int size)`
`Iterator<Queue<T>>`	Queue.`sliding(int size, int step)`
`Tuple2<Queue<T>,Queue<T>>`	Queue.`span(Predicate<? super T> predicate)`
`Tuple2<Queue<T>,Queue<T>>`	Queue.`span(Predicate<? super T> predicate)`
`Tuple2<Queue<T>,Queue<T>>`	Queue.`splitAt(int n)`
`Tuple2<Queue<T>,Queue<T>>`	Queue.`splitAt(int n)`
`Tuple2<Queue<T>,Queue<T>>`	Queue.`splitAt(Predicate<? super T> predicate)`
`Tuple2<Queue<T>,Queue<T>>`	Queue.`splitAt(Predicate<? super T> predicate)`
`Tuple2<Queue<T>,Queue<T>>`	Queue.`splitAtInclusive(Predicate<? super T> predicate)`
`Tuple2<Queue<T>,Queue<T>>`	Queue.`splitAtInclusive(Predicate<? super T> predicate)`
`static <T> Queue<Queue<T>>`	Queue.`transpose(Queue<Queue<T>> matrix)` Transposes the rows and columns of a `Queue` matrix.
`<T1,T2> Tuple2<Queue<T1>,Queue<T2>>`	Queue.`unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)`
`<T1,T2> Tuple2<Queue<T1>,Queue<T2>>`	Queue.`unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)`
`<T1,T2,T3> Tuple3<Queue<T1>,Queue<T2>,Queue<T3>>`	Queue.`unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)`
`<T1,T2,T3> Tuple3<Queue<T1>,Queue<T2>,Queue<T3>>`	Queue.`unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)`
`<T1,T2,T3> Tuple3<Queue<T1>,Queue<T2>,Queue<T3>>`	Queue.`unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)`

Methods in io.vavr.collection with parameters of type Queue
Modifier and Type	Method and Description
`static <T> Queue<T>`	Queue.`narrow(Queue<? extends T> queue)` Narrows a widened `Queue<? extends T>` to `Queue<T>` by performing a type-safe cast.
`static <T> Queue<Queue<T>>`	Queue.`transpose(Queue<Queue<T>> matrix)` Transposes the rows and columns of a `Queue` matrix.

Method parameters in io.vavr.collection with type arguments of type Queue
Modifier and Type	Method and Description
`<U> U`	Queue.`transform(Function<? super Queue<T>,? extends U> f)` Transforms this `Queue`.
`static <T> Queue<Queue<T>>`	Queue.`transpose(Queue<Queue<T>> matrix)` Transposes the rows and columns of a `Queue` matrix.

Uses of Classio.vavr.collection.Queue

Uses of Queue in io.vavr

Uses of Queue in io.vavr.collection

Uses of Class
io.vavr.collection.Queue