Struct rayon::collections::binary_heap::Iter [] [src]

pub struct Iter<'a, T: Ord + Sync + 'a> { /* fields omitted */ }

Parallel iterator over an immutable reference to a binary heap

Trait Implementations

impl<'a, T: Debug + Ord + Sync + 'a> Debug for Iter<'a, T>
[src]

[src]

Formats the value using the given formatter.

impl<'a, T: Ord + Sync> Clone for Iter<'a, T>
[src]

[src]

Returns a copy of the value. Read more

1.0.0
[src]

Performs copy-assignment from source. Read more

impl<'a, T: Ord + Sync + 'a> ParallelIterator for Iter<'a, T>
[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

impl<'a, T: Ord + Sync + 'a> IndexedParallelIterator for Iter<'a, T>
[src]

[src]

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

[src]

Produces an exact count of how many items this iterator will produce, presuming no panic occurs. 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]

Collects the results of the iterator into the specified vector. The vector is always truncated before execution begins. If possible, reusing the vector across calls can lead to better performance since it reuses the same backing buffer. Read more

[src]

Unzips the results of the iterator into the specified vectors. The vectors are always truncated before execution begins. If possible, reusing the vectors across calls can lead to better performance since they reuse the same backing buffer. Read more

[src]

Iterate over tuples (A, B), where the items A are from this iterator and B are from the iterator given as argument. Like the zip method on ordinary iterators, if the two iterators are of unequal length, you only get the items they have in common. Read more

[src]

The same as Zip, but requires that both iterators have the same length. Read more

[src]

Interleave elements of this iterator and the other given iterator. Alternately yields elements from this iterator and the given iterator, until both are exhausted. If one iterator is exhausted before the other, the last elements are provided from the other. Read more

[src]

Interleave elements of this iterator and the other given iterator, until one is exhausted. Read more

[src]

Split an iterator up into fixed-size chunks. Read more

[src]

Lexicographically compares the elements of this ParallelIterator with those of another. Read more

[src]

Lexicographically compares the elements of this ParallelIterator with those of another. Read more

[src]

Determines if the elements of this ParallelIterator are equal to those of another Read more

[src]

Determines if the elements of this ParallelIterator are unequal to those of another Read more

[src]

Determines if the elements of this ParallelIterator are lexicographically less than those of another. Read more

[src]

Determines if the elements of this ParallelIterator are less or equal to those of another. Read more

[src]

Determines if the elements of this ParallelIterator are lexicographically greater than those of another. Read more

[src]

Determines if the elements of this ParallelIterator are less or equal to those of another. Read more

[src]

Yields an index along with each item. Read more

[src]

Creates an iterator that skips the first n elements. Read more

[src]

Creates an iterator that yields the first n elements. Read more

[src]

Searches for some item in the parallel iterator that matches the given predicate, and returns its index. Like ParallelIterator::find_any, the parallel search will not necessarily find the first match, and once a match is found we'll attempt to stop processing any more. Read more

[src]

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

[src]

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

[src]

Produces a new iterator with the elements of this iterator in reverse order. Read more

[src]

Sets the minimum length of iterators desired to process in each thread. Rayon will not split any smaller than this length, but of course an iterator could already be smaller to begin with. Read more

[src]

Sets the maximum length of iterators desired to process in each thread. Rayon will try to split at least below this length, unless that would put it below the length from with_min_len(). For example, given min=10 and max=15, a length of 16 will not be split any further. Read more