Struct rayon::collections::btree_map::IntoIter [] [src]

pub struct IntoIter<K: Ord + Send, V: Send> { /* fields omitted */ }

Parallel iterator over a B-Tree map

Trait Implementations

impl<K: Debug + Ord + Send, V: Debug + Send> Debug for IntoIter<K, V>
[src]

[src]

Formats the value using the given formatter. Read more

impl<K: Ord + Send, V: Send> ParallelIterator for IntoIter<K, V>
[src]

The type of item that this parallel iterator produces. For example, if you use the [for_each] method, this is the type of item that your closure will be invoked with. Read more

[src]

Internal method used to define the behavior of this parallel iterator. You should not need to call this directly. Read more

[src]

Internal method used to define the behavior of this parallel iterator. You should not need to call this directly. Read more

[src]

Executes OP on each item produced by the iterator, in parallel. Read more

[src]

Executes OP on the given init value with each item produced by the iterator, in parallel. Read more

[src]

Counts the number of items in this parallel iterator. Read more

[src]

Applies map_op to each item of this iterator, producing a new iterator with the results. Read more

[src]

Applies map_op to the given init value with each item of this iterator, producing a new iterator with the results. Read more

[src]

Creates an iterator which clones all of its elements. This may be useful when you have an iterator over &T, but you need T. Read more

[src]

Applies inspect_op to a reference to each item of this iterator, producing a new iterator passing through the original items. This is often useful for debugging to see what's happening in iterator stages. Read more

[src]

Mutates each item of this iterator before yielding it. Read more

[src]

Applies filter_op to each item of this iterator, producing a new iterator with only the items that gave true results. Read more

[src]

Applies filter_op to each item of this iterator to get an Option, producing a new iterator with only the items from Some results. Read more

[src]

Applies map_op to each item of this iterator to get nested iterators, producing a new iterator that flattens these back into one. Read more

[src]

An adaptor that flattens iterable Items into one large iterator Read more

[src]

Reduces the items in the iterator into one item using op. The argument identity should be a closure that can produce "identity" value which may be inserted into the sequence as needed to create opportunities for parallel execution. So, for example, if you are doing a summation, then identity() ought to produce something that represents the zero for your type (but consider just calling sum() in that case). Read more

[src]

Reduces the items in the iterator into one item using op. If the iterator is empty, None is returned; otherwise, Some is returned. Read more

[src]

Parallel fold is similar to sequential fold except that the sequence of items may be subdivided before it is folded. Consider a list of numbers like 22 3 77 89 46. If you used sequential fold to add them (fold(0, |a,b| a+b), you would wind up first adding 0 + 22, then 22 + 3, then 25 + 77, and so forth. The parallel fold works similarly except that it first breaks up your list into sublists, and hence instead of yielding up a single sum at the end, it yields up multiple sums. The number of results is nondeterministic, as is the point where the breaks occur. Read more

[src]

Applies fold_op to the given init value with each item of this iterator, finally producing the value for further use. Read more

[src]

Sums up the items in the iterator. Read more

[src]

Multiplies all the items in the iterator. Read more

[src]

Computes the minimum of all the items in the iterator. If the iterator is empty, None is returned; otherwise, Some(min) is returned. Read more

[src]

Computes the minimum of all the items in the iterator with respect to the given comparison function. If the iterator is empty, None is returned; otherwise, Some(min) is returned. Read more

[src]

Computes the item that yields the minimum value for the given function. If the iterator is empty, None is returned; otherwise, Some(item) is returned. Read more

[src]

Computes the maximum of all the items in the iterator. If the iterator is empty, None is returned; otherwise, Some(max) is returned. Read more

[src]

Computes the maximum of all the items in the iterator with respect to the given comparison function. If the iterator is empty, None is returned; otherwise, Some(min) is returned. Read more

[src]

Computes the item that yields the maximum value for the given function. If the iterator is empty, None is returned; otherwise, Some(item) is returned. Read more

[src]

Takes two iterators and creates a new iterator over both. Read more

[src]

Searches for some item in the parallel iterator that matches the given predicate and returns it. This operation is similar to [find on sequential iterators][find] but the item returned may not be the first one in the parallel sequence which matches, since we search the entire sequence in parallel. Read more

[src]

Searches for the sequentially first item in the parallel iterator that matches the given predicate and returns it. Read more

[src]

Searches for the sequentially last item in the parallel iterator that matches the given predicate and returns it. Read more

[src]

Searches for some item in the parallel iterator that matches the given predicate, and if so returns true. Once a match is found, we'll attempt to stop process the rest of the items. Proving that there's no match, returning false, does require visiting every item. Read more

[src]

Tests that every item in the parallel iterator matches the given predicate, and if so returns true. If a counter-example is found, we'll attempt to stop processing more items, then return false. Read more

[src]

Creates an iterator over the Some items of this iterator, halting as soon as any None is found. Read more

[src]

Create a fresh collection containing all the element produced by this parallel iterator. Read more

[src]

Unzips the items of a parallel iterator into a pair of arbitrary ParallelExtend containers. Read more

[src]

Partitions the items of a parallel iterator into a pair of arbitrary ParallelExtend containers. Items for which the predicate returns true go into the first container, and the rest go into the second. Read more

[src]

Partitions and maps the items of a parallel iterator into a pair of arbitrary ParallelExtend containers. Either::Left items go into the first container, and Either::Right items go into the second. Read more

[src]

Intersperses clones of an element between items of this iterator. Read more

Auto Trait Implementations

impl<K, V> Send for IntoIter<K, V>

impl<K, V> Sync for IntoIter<K, V> where
    K: Sync,
    V: Sync