Uses of Interface
io.vavr.collection.Iterator
Packages that use Iterator
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 Iterator in io.vavr
Modifier and TypeMethodDescriptionstatic <T,U> Iterator <U> A shortcut forIterator.ofAll(ts).flatMap(f)which allows us to write real for-comprehensions usingFor(...).yield(...).Lazy.iterator()Value.iterator()Returns a richio.vavr.collection.Iterator.API.For1.yield()A shortcut foryield(Function.identity()).<R> Iterator<R> Yields a result for elements of the cross-product of the underlying Iterable.<R> Iterator<R> API.For2.yield(@NonNull BiFunction<? super T1, ? super T2, ? extends R> f) Yields a result for elements of the cross-product of the underlying Iterables.<R> Iterator<R> Yields a result for elements of the cross-product of the underlying Iterables.<R> Iterator<R> Yields a result for elements of the cross-product of the underlying Iterables.<R> Iterator<R> API.For5.yield(@NonNull Function5<? super T1, ? super T2, ? super T3, ? super T4, ? super T5, ? extends R> f) Yields a result for elements of the cross-product of the underlying Iterables.<R> Iterator<R> API.For6.yield(@NonNull Function6<? super T1, ? super T2, ? super T3, ? super T4, ? super T5, ? super T6, ? extends R> f) Yields a result for elements of the cross-product of the underlying Iterables.<R> Iterator<R> API.For7.yield(@NonNull Function7<? super T1, ? super T2, ? super T3, ? super T4, ? super T5, ? super T6, ? super T7, ? extends R> f) Yields a result for elements of the cross-product of the underlying Iterables.<R> Iterator<R> API.For8.yield(@NonNull Function8<? super T1, ? super T2, ? super T3, ? super T4, ? super T5, ? super T6, ? super T7, ? super T8, ? extends R> f) Yields a result for elements of the cross-product of the underlying Iterables. -
Uses of Iterator in io.vavr.collection
Classes in io.vavr.collection that implement IteratorModifier and TypeClassDescription(package private) classProvides a commonObject.toString()implementation.static classstatic classstatic final classstatic final classstatic final classstatic final classstatic final classstatic final classstatic final classFields in io.vavr.collection declared as IteratorModifier and TypeFieldDescriptionIteratorModule.ConcatIterator.currStreamModule.FlatMapIterator.inputsIteratorModule.ConcatIterator.Cell.itIteratorModule.CachedIterator.thatIteratorModule.DistinctIterator.thatIteratorModule.GroupedIterator.thatMethods in io.vavr.collection that return IteratorModifier and TypeMethodDescriptiondefault <R> Iterator<R> Iterator.collect(@NonNull PartialFunction<? super T, ? extends R> partialFunction) static <T> Iterator<T> Creates anIteratorthat iterates over all elements of the supplied sequence of iterables, in order.static <T> Iterator<T> Creates anIteratorthat traverses the elements of the provided iterables in sequence, as if they were concatenated.Returns a newIteratorthat yields the elements of this iterator followed by all elements of the specified iterator.static <T> Iterator<T> Iterator.continually(Supplier<? extends T> supplier) Returns an infiniteIteratorthat repeatedly generates values using the providedSupplier.static <T> Iterator<T> Iterator.continually(T t) Returns an infiniteIteratorthat endlessly yields the given element.Array.crossProduct(int power) CharSeq.crossProduct(int power) Collections.crossProduct(S empty, S seq, int power) Iterator<? extends IndexedSeq<T>> IndexedSeq.crossProduct(int power) LinearSeq.crossProduct(int power) List.crossProduct(int power) Queue.crossProduct(int power) Seq.crossProduct()Computes the Cartesian product of this sequence with itself, producing all pairs of elements (this × this).Seq.crossProduct(int power) Returns the n-ary Cartesian power (cross product) of this sequence.Seq.crossProduct(@NonNull Iterable<? extends U> that) Computes the Cartesian product of this sequence with another iterable, producing pairs of elements (this × that).Stream.crossProduct(int power) Vector.crossProduct(int power) Iterator.distinct()Iterator.distinctBy(@NonNull Comparator<? super T> comparator) Iterator.distinctBy(@NonNull Function<? super T, ? extends U> keyExtractor) Iterator.distinctByKeepLast(Comparator<? super T> comparator) Returns a newIteratorcontaining the elements of this instance without duplicates, keeping the last occurrence of each duplicate element, as determined by the givencomparator.Iterator.distinctByKeepLast(Function<? super T, ? extends U> keyExtractor) Returns a newIteratorcontaining the elements of this instance without duplicates, keeping the last occurrence of each duplicate element, based on keys extracted from elements usingkeyExtractor.Iterator.drop(int n) Removes up to n elements from this iterator.Iterator.dropRight(int n) static <T> Iterator<T> Iterator.empty()Returns an emptyIterator.(package private) static <T> Iterator<T> static <T> Iterator<T> Returns anIteratorover a sequence ofnelements supplied by the givenSupplier.static <T> Iterator<T> Iterator.fill(int n, T element) Returns anIteratorcontaining the givenelementrepeatedntimes.(package private) static <T> Iterator<T> Collections.fillObject(int n, T element) Returns an Iterator that contains elements that satisfy the givenpredicate.default <U> Iterator<U> FlatMaps the elements of this Iterator to Iterables, which are iterated in the order of occurrence.Iterator.from(int value) Returns an infiniteIteratorof int values starting fromvalue.Iterator.from(int value, int step) Returns an infiniteIteratorof int values starting fromvalueand advancing by the specifiedstep.Iterator.from(long value) Returns an infiniteIteratorof long values starting fromvalue.Iterator.from(long value, long step) Returns an infiniteIteratorof long values starting fromvalueand advancing by the specifiedstep.AbstractMultimap.grouped(int size) Array.grouped(int size) BitSet.grouped(int size) CharSeq.grouped(int size) HashMap.grouped(int size) HashSet.grouped(int size) Iterator<? extends IndexedSeq<T>> IndexedSeq.grouped(int size) Iterator.grouped(int size) LinearSeq.grouped(int size) LinkedHashMap.grouped(int size) LinkedHashSet.grouped(int size) List.grouped(int size) Map.grouped(int size) Maps.grouped(M map, Maps.OfEntries<K, V, M> ofEntries, int size) Multimap.grouped(int size) Iterator<? extends PriorityQueue<T>> PriorityQueue.grouped(int size) Queue.grouped(int size) Seq.grouped(int size) Set.grouped(int size) SortedMap.grouped(int size) Iterator<? extends SortedMultimap<K, V>> SortedMultimap.grouped(int size) SortedSet.grouped(int size) Stream.grouped(int size) Iterator<? extends Traversable<T>> Traversable.grouped(int size) Splits thisTraversableinto consecutive blocks of the given size.Tree.grouped(int size) TreeMap.grouped(int size) TreeSet.grouped(int size) Vector.grouped(int size) Iterator.init()Iterator.intersperse(T element) Returns a newIteratorwhere the specifiedelementis inserted between each element of this iterator.static <T> Iterator<T> Creates anIteratorthat repeatedly invokes the givenSupplieras long as it returns aSomevalue, terminating when it returnsNone.static <T> Iterator<T> Returns an infiniteIteratorthat generates values by repeatedly applying the given function to the previous value, starting withseed.AbstractMultimap.iterator()Array.iterator()BitMappedTrie.iterator()BitSetModule.AbstractBitSet.iterator()CharSeq.iterator()HashArrayMappedTrie.iterator()HashArrayMappedTrieModule.AbstractNode.iterator()HashMap.iterator()HashSet.iterator()Iterator.iterator()LinkedHashMap.iterator()LinkedHashSet.iterator()Map.iterator()default <U> Iterator<U> Map.iterator(@NonNull BiFunction<K, V, ? extends U> mapper) Iterates this Map sequentially, mapping the (key, value) pairs to elements.Multimap.iterator()default <U> Iterator<U> Multimap.iterator(@NonNull BiFunction<K, V, ? extends U> mapper) Iterates this Multimap sequentially, mapping the (key, value) pairs to elements.RedBlackTree.iterator()Returns an Iterator that iterates elements in the order induced by the underlying Comparator.Seq.iterator(int index) Returns an iterator over the elements of this sequence starting at the specified index.Set.iterator()Stream.Cons.iterator()Stream.Empty.iterator()Traversable.iterator()Returns an iterator over the elements of this Traversable, implemented viaTraversable.head()andTraversable.tail().Tree.iterator()Tree.iterator(Tree.Order order) Traverses this tree values in a specificTree.Order.TreeMap.iterator()TreeSet.iterator()Vector.iterator()HashArrayMappedTrie.keysIterator()Provide unboxed access to the keys in the trie.HashArrayMappedTrieModule.AbstractNode.keysIterator()HashMap.keysIterator()Map.keysIterator()Returns the keys contained in this map as an iterator.default <U> Iterator<U> Maps the elements of this Iterator lazily using the givenmapper.default <U> Iterator<U> Iterator.mapTo(U value) Iterator.mapToVoid()static <T> Iterator<T> Narrows anIterator<? extends T>toIterator<T>using a type-safe cast.(package private) Iterator<HashArrayMappedTrieModule.LeafNode<K, V>> HashArrayMappedTrieModule.AbstractNode.nodes()HashArrayMappedTrieModule.EmptyNode.nodes()HashArrayMappedTrieModule.LeafList.nodes()HashArrayMappedTrieModule.LeafSingleton.nodes()static <T> Iterator<T> Iterator.of(T element) Creates anIteratorthat yields exactly one element.static <T> Iterator<T> Iterator.of(T... elements) Creates anIteratorthat iterates over the provided elements.Iterator.ofAll(boolean... elements) Creates anIteratorover the given boolean values.Iterator.ofAll(byte... elements) Creates anIteratorover the given byte values.Iterator.ofAll(char... elements) Creates anIteratorover the given char values.Iterator.ofAll(double... elements) Creates anIteratorover the given double values.Iterator.ofAll(float... elements) Creates anIteratorover the given float values.Iterator.ofAll(int... elements) Creates anIteratorover the given int values.Iterator.ofAll(long... elements) Creates anIteratorover the given long values.Iterator.ofAll(short... elements) Creates anIteratorover the given short values.static <T> Iterator<T> Creates anIteratorfrom the providedIterable.static <T> Iterator<T> Iterator.range(char from, char toExclusive) Creates anIteratorof characters starting fromfrom(inclusive) up totoExclusive(exclusive).Iterator.range(int from, int toExclusive) Creates anIteratorof int values starting fromfrom(inclusive) up totoExclusive(exclusive).Iterator.range(long from, long toExclusive) Creates anIteratorof long values starting fromfrom(inclusive) up totoExclusive(exclusive).Iterator.rangeBy(char from, char toExclusive, int step) Creates anIteratorof characters starting fromfrom(inclusive) up totoExclusive(exclusive), advancing by the specifiedstep.Iterator.rangeBy(double from, double toExclusive, double step) Creates anIteratorof double values starting fromfrom(inclusive) up totoExclusive(exclusive), advancing by the specifiedstep.Iterator.rangeBy(int from, int toExclusive, int step) Creates anIteratorof int values starting fromfrom(inclusive) up totoExclusive(exclusive), advancing by the specifiedstep.Iterator.rangeBy(long from, long toExclusive, long step) Creates anIteratorof long values starting fromfrom(inclusive) up totoExclusive(exclusive), advancing by the specifiedstep.static Iterator<BigDecimal> Iterator.rangeBy(BigDecimal from, BigDecimal toExclusive, BigDecimal step) Creates anIteratorofBigDecimalvalues starting fromfrom(inclusive) up totoExclusive(exclusive), advancing by the specifiedstep.Iterator.rangeClosed(char from, char toInclusive) Creates anIteratorof characters starting fromfrom(inclusive) up totoInclusive(inclusive).Iterator.rangeClosed(int from, int toInclusive) Creates anIteratorof int values starting fromfrom(inclusive) up totoInclusive(inclusive).Iterator.rangeClosed(long from, long toInclusive) Creates anIteratorof long values starting fromfrom(inclusive) up totoInclusive(inclusive).Iterator.rangeClosedBy(char from, char toInclusive, int step) Creates anIteratorof characters starting fromfrom(inclusive) up totoInclusive(inclusive), advancing by the specifiedstep.Iterator.rangeClosedBy(double from, double toInclusive, double step) Creates anIteratorof double values starting fromfrom(inclusive) up totoInclusive(inclusive), advancing by the specifiedstep.Iterator.rangeClosedBy(int from, int toInclusive, int step) Creates anIteratorof int values starting fromfrom(inclusive) up totoInclusive(inclusive), advancing by the specifiedstep.Iterator.rangeClosedBy(long from, long toInclusive, long step) Creates anIteratorof long values starting fromfrom(inclusive) up totoInclusive(inclusive), advancing by the specifiedstep.Iterator.replaceAll(T currentElement, T newElement) (package private) static <T> Iterator<T> Collections.reverseIterator(Iterable<T> iterable) IndexedSeq.reverseIterator()LinearSeq.reverseIterator()Seq.reverseIterator()Returns an iterator that yields elements of this sequence in reversed order.private static <T> Iterator<T> Collections.reverseListIterator(List<T> list) default <U> Iterator<U> Iterator.scanLeft(U zero, @NonNull BiFunction<? super U, ? super T, ? extends U> operation) default <U> Iterator<U> Iterator.scanRight(U zero, @NonNull BiFunction<? super T, ? super U, ? extends U> operation) Iterator<? extends IndexedSeq<T>> Maps.slideBy(M map, Maps.OfEntries<K, V, M> ofEntries, Function<? super Tuple2<K, V>, ?> classifier) Iterator<? extends PriorityQueue<T>> Iterator<? extends SortedMultimap<K, V>> Iterator<? extends Traversable<T>> Partitions thisTraversableinto consecutive non-overlapping windows according to a classification function.AbstractMultimap.sliding(int size) AbstractMultimap.sliding(int size, int step) Array.sliding(int size) Array.sliding(int size, int step) BitSet.sliding(int size) BitSet.sliding(int size, int step) BitSetModule.AbstractBitSet.sliding(int size, int step) CharSeq.sliding(int size) CharSeq.sliding(int size, int step) HashMap.sliding(int size) HashMap.sliding(int size, int step) HashSet.sliding(int size) HashSet.sliding(int size, int step) Iterator<? extends IndexedSeq<T>> IndexedSeq.sliding(int size) Iterator<? extends IndexedSeq<T>> IndexedSeq.sliding(int size, int step) Iterator.sliding(int size) Iterator.sliding(int size, int step) LinearSeq.sliding(int size) LinearSeq.sliding(int size, int step) LinkedHashMap.sliding(int size) LinkedHashMap.sliding(int size, int step) LinkedHashSet.sliding(int size) LinkedHashSet.sliding(int size, int step) List.sliding(int size) List.sliding(int size, int step) Map.sliding(int size) Map.sliding(int size, int step) Maps.sliding(M map, Maps.OfEntries<K, V, M> ofEntries, int size) Maps.sliding(M map, Maps.OfEntries<K, V, M> ofEntries, int size, int step) Multimap.sliding(int size) Multimap.sliding(int size, int step) Iterator<? extends PriorityQueue<T>> PriorityQueue.sliding(int size) Iterator<? extends PriorityQueue<T>> PriorityQueue.sliding(int size, int step) Queue.sliding(int size) Queue.sliding(int size, int step) Seq.sliding(int size) Seq.sliding(int size, int step) Set.sliding(int size) Set.sliding(int size, int step) SortedMap.sliding(int size) SortedMap.sliding(int size, int step) Iterator<? extends SortedMultimap<K, V>> SortedMultimap.sliding(int size) Iterator<? extends SortedMultimap<K, V>> SortedMultimap.sliding(int size, int step) SortedSet.sliding(int size) SortedSet.sliding(int size, int step) Stream.sliding(int size) Stream.sliding(int size, int step) Iterator<? extends Traversable<T>> Traversable.sliding(int size) Slides a window of a givensizeover thisTraversablewith a step size of 1.Iterator<? extends Traversable<T>> Traversable.sliding(int size, int step) Slides a window of a specificsizewith a givenstepover thisTraversable.Tree.sliding(int size) Tree.sliding(int size, int step) TreeMap.sliding(int size) TreeMap.sliding(int size, int step) TreeSet.sliding(int size) TreeSet.sliding(int size, int step) Vector.sliding(int size) Vector.sliding(int size, int step) (package private) static <T> Iterator<T> static <T> Iterator<T> Returns anIteratorover a sequence ofnelements, where each element is computed by the given functionfapplied to its index.Iterator.tail()Iterator.take(int n) Take the first n elements from this iterator.Iterator.takeRight(int n) static <T> Iterator<T> Creates anIteratorby repeatedly applying a function to a seed value.static <T,U> Iterator <U> Iterator.unfoldLeft(T seed, Function<? super T, Option<Tuple2<? extends T, ? extends U>>> f) Creates anIteratorby repeatedly applying a function to a seed value, generating elements in a left-to-right order.static <T,U> Iterator <U> Iterator.unfoldRight(T seed, Function<? super T, Option<Tuple2<? extends U, ? extends T>>> f) Creates anIteratorby repeatedly applying a function to a seed value, generating elements in a right-to-left order.HashArrayMappedTrie.valuesIterator()Provide unboxed access to the values in the trie.HashArrayMappedTrieModule.AbstractNode.valuesIterator()HashMap.valuesIterator()Map.valuesIterator()Returns the values in this map.default <U,R> Iterator <R> Iterator.zipWith(@NonNull Iterable<? extends U> that, BiFunction<? super T, ? super U, ? extends R> mapper) Iterator.zipWithIndex()default <U> Iterator<U> Iterator.zipWithIndex(@NonNull BiFunction<? super T, ? super Integer, ? extends U> mapper) Methods in io.vavr.collection that return types with arguments of type IteratorModifier and TypeMethodDescriptionCreates two new iterators that both iterates over the same elements as this iterator and in the same order.Creates two new iterators that both iterates over the same elements as this iterator and in the same order.Iterator.initOption()Iterator.tailOption()Iterator.unzip3(@NonNull Function<? super T, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Iterator.unzip3(@NonNull Function<? super T, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Iterator.unzip3(@NonNull Function<? super T, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Methods in io.vavr.collection with parameters of type IteratorModifier and TypeMethodDescription(package private) IteratorModule.ConcatIterator.Cell<T> private static voidCreates two new iterators that both iterates over the same elements as this iterator and in the same order.static <T> Iterator<T> Narrows anIterator<? extends T>toIterator<T>using a type-safe cast.(package private) static <T> IteratorModule.ConcatIterator.Cell<T> private static Object[]Method parameters in io.vavr.collection with type arguments of type IteratorModifier and TypeMethodDescription(package private) static <K,V, M extends Map<K, V>>
MMaps.scan(M map, Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation, Function<Iterator<Tuple2<K, V>>, Traversable<Tuple2<K, V>>> finisher) (package private) static <T,U, R extends Traversable<U>>
RCollections.scanLeft(Traversable<? extends T> source, U zero, BiFunction<? super U, ? super T, ? extends U> operation, Function<Iterator<U>, R> finisher) (package private) static <T,U, R extends Traversable<U>>
RCollections.scanRight(Traversable<? extends T> source, U zero, BiFunction<? super T, ? super U, ? extends U> operation, Function<Iterator<U>, R> finisher) default <U> UApplies a transformation function to thisIteratorand returns the result.Constructors in io.vavr.collection with parameters of type IteratorModifierConstructorDescription(package private)CachedIterator(Iterator<T> that) (package private)DistinctIterator(Iterator<? extends T> that, Set<U> set, Function<? super T, ? extends U> keyExtractor) (package private)FlatMapIterator(Iterator<? extends T> inputs, Function<? super T, ? extends Iterable<? extends U>> mapper) (package private)GroupedIterator(Iterator<T> that, int size, int step) -
Uses of Iterator in io.vavr.concurrent
Methods in io.vavr.concurrent that return Iterator -
Uses of Iterator in io.vavr.control
Methods in io.vavr.control that return Iterator