SwitchTargetsIter in rustc_middle::mir - Rust (original) (raw)

Source§

Alternate elements from two iterators until both have run out. Read more

Source§

Alternate elements from two iterators until at least one of them has run out. Read more

Source§

An iterator adaptor to insert a particular value between each element of the adapted iterator. Read more

Source§

An iterator adaptor to insert a particular value created by a function between each element of the adapted iterator. Read more

Source§

Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of two optional elements. Read more

Source§

Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of elements. Read more

Source§

A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the next iterator element. Read more

Source§

Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned to the same group. Read more

Source§

Return an iterable that can chunk the iterator. Read more

Source§

Return an iterator over all contiguous windows producing tuples of a specific size (up to 12). Read more

Source§

Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the iterator, producing tuples of a specific size (up to 12). Read more

Source§

Return an iterator that groups the items in tuples of a specific size (up to 12). Read more

Source§

Split into an iterator pair that both yield all elements from the original iterator. Read more

Source§

👎Deprecated since 0.8.0: Use std .step_by() instead

Return an iterator adaptor that steps n elements in the base iterator for each iteration. Read more

Source§

Convert each item of the iterator using the Into trait. Read more

Source§

👎Deprecated since 0.10.0: Use .map_ok() instead

Source§

Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are unchanged. Read more

Source§

Return an iterator adaptor that filters every Result::Okvalue with the provided closure. Result::Err values are unchanged. Read more

Source§

Return an iterator adaptor that filters and transforms everyResult::Ok value with the provided closure. Result::Errvalues are unchanged. Read more

Source§

Return an iterator adaptor that flattens every Result::Ok value into a series of Result::Ok values. Result::Err values are unchanged. Read more

Source§

“Lift” a function of the values of the current iterator so as to process an iterator of Result values instead. Read more

Source§

Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the result is sorted. Read more

Source§

Return an iterator adaptor that merges the two base iterators in order. This is much like .merge() but allows for a custom ordering. Read more

Source§

Create an iterator that merges items from both this and the specified iterator in ascending order. Read more

Source§

Return an iterator adaptor that flattens an iterator of iterators by merging them in ascending order. Read more

Source§

Return an iterator adaptor that flattens an iterator of iterators by merging them according to the given closure. Read more

Source§

Return an iterator adaptor that iterates over the cartesian product of the element sets of two iterators self and J. Read more

Source§

Return an iterator adaptor that iterates over the cartesian product of all subiterators returned by meta-iterator self. Read more

Source§

Return an iterator adaptor that uses the passed-in closure to optionally merge together consecutive elements. Read more

Source§

Remove duplicates from sections of consecutive identical elements. If the iterator is sorted, all elements will be unique. Read more

Source§

Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. If the iterator is sorted, all elements will be unique. Read more

Source§

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. If the iterator is sorted, all elements will be unique. Read more

Source§

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. If the iterator is sorted, all elements will be unique. Read more

Source§

Return an iterator adaptor that produces elements that appear more than once during the iteration. Duplicates are detected using hash and equality. Read more

Source§

Return an iterator adaptor that produces elements that appear more than once during the iteration. Duplicates are detected using hash and equality. Read more

Source§

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates are detected using hash and equality. Read more

Source§

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Read more

Source§

Return an iterator adaptor that borrows from this iterator and takes items while the closure accept returns true. Read more

Source§

Return an iterator adaptor that borrows from a Clone-able iterator to only pick off elements while the predicate accept returns true. Read more

Source§

Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate first returned false. Read more

Source§

Return an iterator adaptor that filters Option<A> iterator elements and produces A. Stops on the first None encountered. Read more

Source§

Return an iterator adaptor that iterates over the combinations of the elements from an iterator. Read more

Source§

Return an iterator adaptor that iterates over the k-length combinations of the elements from an iterator. Read more

Source§

Return an iterator that iterates over the k-length combinations of the elements from an iterator, with replacement. Read more

Source§

Return an iterator adaptor that iterates over all k-permutations of the elements from an iterator. Read more

Source§

Return an iterator that iterates through the powerset of the elements from an iterator. Read more

Source§

Return an iterator adaptor that pads the sequence to a minimum length ofmin by filling missing elements using a closure f. Read more

Source§

Return an iterator adaptor that combines each element with a Position to ease special-case handling of the first or last elements. Read more

Source§

Return an iterator adaptor that yields the indices of all elements satisfying a predicate, counted from the start of the iterator. Read more

Source§

Return an iterator adaptor that applies a mutating function to each element before yielding it. Read more

Source§

Advances the iterator and returns the next items grouped in a tuple of a specific size (up to 12). Read more

Source§

Collects all items from the iterator into a tuple of a specific size (up to 12). Read more

Source§

Find the position and value of the first element satisfying a predicate. Read more

Source§

Find the value of the first element satisfying a predicate or return the last element, if any. Read more

Source§

Find the value of the first element satisfying a predicate or return the first element, if any. Read more

Source§

Returns true if the given item is present in this iterator. Read more

Source§

Check whether all elements compare equal. Read more

Source§

If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first two non-equal elements found. Read more

Source§

Check whether all elements are unique (non equal). Read more

Source§

Consume the first n elements from the iterator eagerly, and return the same iterator again. Read more

Source§

Consume the last n elements from the iterator eagerly, and return the same iterator again. Read more

Source§

👎Deprecated since 0.8.0: Use .for_each() instead

Run the closure f eagerly on each element of the iterator. Read more

Source§

Combine all an iterator’s elements into one element by using Extend. Read more

Source§

.collect_vec() is simply a type specialization of Iterator::collect, for convenience.

Source§

.try_collect() is more convenient way of writing.collect::<Result<_, _>>() Read more

Source§

Assign to each reference in self from the from iterator, stopping at the shortest of the two iterators. Read more

Source§

Combine all iterator elements into one String, separated by sep. Read more

Source§

Format all iterator elements, separated by sep. Read more

Source§

Format all iterator elements, separated by sep. Read more

Source§

👎Deprecated since 0.10.0: Use .fold_ok() instead

Source§

Fold Result values from an iterator. Read more

Source§

Fold Option values from an iterator. Read more

Source§

👎Deprecated since 0.10.2: Use Iterator::reduce instead

Accumulator of the elements in the iterator. Read more

Source§

Accumulate the elements in the iterator in a tree-like manner. Read more

Source§

An iterator method that applies a function, producing a single, final value. Read more

Source§

Iterate over the entire iterator and add all the elements. Read more

Source§

Iterate over the entire iterator and multiply all the elements. Read more

Source§

Sort all iterator elements into a new iterator in ascending order. Read more

Source§

Sort all iterator elements into a new iterator in ascending order. Read more

Source§

Sort all iterator elements into a new iterator in ascending order. Read more

Source§

Sort all iterator elements into a new iterator in ascending order. Read more

Source§

Sort all iterator elements into a new iterator in ascending order. Read more

Source§

Sort all iterator elements into a new iterator in ascending order. Read more

Source§

Sort all iterator elements into a new iterator in ascending order. The key function is called exactly once per key. Read more

Source§

Sort the k smallest elements into a new iterator, in ascending order. Read more

Source§

Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may have a distinct type. Read more

Source§

Partition a sequence of Results into one list of all the Ok elements and another list of all the Err elements. Read more

Source§

Return a HashMap of keys mapped to Vecs of values. Keys and values are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

Source§

Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified in the closure. Read more

Source§

Constructs a GroupingMap to be used later with one of the efficient group-and-fold operations it allows to perform. Read more

Source§

Constructs a GroupingMap to be used later with one of the efficient group-and-fold operations it allows to perform. Read more

Source§

Return all minimum elements of an iterator. Read more

Source§

Return all minimum elements of an iterator, as determined by the specified function. Read more

Source§

Return all minimum elements of an iterator, as determined by the specified function. Read more

Source§

Return all maximum elements of an iterator. Read more

Source§

Return all maximum elements of an iterator, as determined by the specified function. Read more

Source§

Return all maximum elements of an iterator, as determined by the specified function. Read more

Source§

Return the minimum and maximum elements in the iterator. Read more

Source§

Return the minimum and maximum element of an iterator, as determined by the specified function. Read more

Source§

Return the minimum and maximum element of an iterator, as determined by the specified comparison function. Read more

Source§

Return the position of the maximum element in the iterator. Read more

Source§

Return the position of the maximum element in the iterator, as determined by the specified function. Read more

Source§

Return the position of the maximum element in the iterator, as determined by the specified comparison function. Read more

Source§

Return the position of the minimum element in the iterator. Read more

Source§

Return the position of the minimum element in the iterator, as determined by the specified function. Read more

Source§

Return the position of the minimum element in the iterator, as determined by the specified comparison function. Read more

Source§

Return the positions of the minimum and maximum elements in the iterator. Read more

Source§

Return the postions of the minimum and maximum elements of an iterator, as determined by the specified function. Read more

Source§

Return the postions of the minimum and maximum elements of an iterator, as determined by the specified comparison function. Read more

Source§

If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input iterator. Read more

Source§

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input iterator. Read more

Source§

An iterator adaptor that allows the user to peek at multiple .next()values without advancing the base iterator. Read more

Source§

Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears. Read more

Source§

Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, determining identity using a keying function. Read more

Source§

Converts an iterator of tuples into a tuple of containers. Read more

Source§

Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more