Struct alloc::btree_map::Keys1.0.0 [] [src]

pub struct Keys<'a, K: 'a, V: 'a> { /* fields omitted */ }

An iterator over the keys of a BTreeMap.

This struct is created by the keys method on BTreeMap. See its documentation for more.

Trait Implementations

impl<'a, K: 'a + Debug, V: 'a> Debug for Keys<'a, K, V>
1.17.0
[src]

Formats the value using the given formatter. Read more

impl<'a, K, V> Iterator for Keys<'a, K, V>
[src]

The type of the elements being iterated over.

Advances the iterator and returns the next value. Read more

Returns the bounds on the remaining length of the iterator. Read more

Consumes the iterator, counting the number of iterations and returning it. Read more

Consumes the iterator, returning the last element. Read more

Returns the nth element of the iterator. Read more

Important traits for StepBy<I>

🔬 This is a nightly-only experimental API. (iterator_step_by #27741)

unstable replacement of Range::step_by

Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more

Important traits for Chain<A, B>

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

Important traits for Zip<A, B>

'Zips up' two iterators into a single iterator of pairs. Read more

Important traits for Map<I, F>

Takes a closure and creates an iterator which calls that closure on each element. Read more

Calls a closure on each element of an iterator. Read more

Important traits for Filter<I, P>

Creates an iterator which uses a closure to determine if an element should be yielded. Read more

Important traits for FilterMap<I, F>

Creates an iterator that both filters and maps. Read more

Important traits for Enumerate<I>

Creates an iterator which gives the current iteration count as well as the next value. Read more

Important traits for Peekable<I>

Creates an iterator which can use peek to look at the next element of the iterator without consuming it. Read more

Important traits for SkipWhile<I, P>

Creates an iterator that [skip]s elements based on a predicate. Read more

Important traits for TakeWhile<I, P>

Creates an iterator that yields elements based on a predicate. Read more

Important traits for Skip<I>

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

Important traits for Take<I>

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

Important traits for Scan<I, St, F>

An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

Important traits for FlatMap<I, U, F>

Creates an iterator that works like map, but flattens nested structure. Read more

Important traits for Flatten<I>

🔬 This is a nightly-only experimental API. (iterator_flatten #48213)

Creates an iterator that flattens nested structure. Read more

Important traits for Fuse<I>

Creates an iterator which ends after the first [None]. Read more

Important traits for Inspect<I, F>

Do something with each element of an iterator, passing the value on. Read more

Borrows an iterator, rather than consuming it. Read more

Transforms an iterator into a collection. Read more

Consumes an iterator, creating two collections from it. Read more

🔬 This is a nightly-only experimental API. (iterator_try_fold #45594)

An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more

🔬 This is a nightly-only experimental API. (iterator_try_fold #45594)

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error. Read more

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

Tests if every element of the iterator matches a predicate. Read more

Tests if any element of the iterator matches a predicate. Read more

Searches for an element of an iterator that satisfies a predicate. Read more

Searches for an element in an iterator, returning its index. Read more

Searches for an element in an iterator from the right, returning its index. Read more

Returns the maximum element of an iterator. Read more

Returns the minimum element of an iterator. Read more

Returns the element that gives the maximum value from the specified function. Read more

Returns the element that gives the maximum value with respect to the specified comparison function. Read more

Returns the element that gives the minimum value from the specified function. Read more

Returns the element that gives the minimum value with respect to the specified comparison function. Read more

Important traits for Rev<I>

Reverses an iterator's direction. Read more

Converts an iterator of pairs into a pair of containers. Read more

Important traits for Cloned<I>

Creates an iterator which [clone]s all of its elements. Read more

Important traits for Cycle<I>

Repeats an iterator endlessly. Read more

Sums the elements of an iterator. Read more

Iterates over the entire iterator, multiplying all the elements Read more

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

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

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

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

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

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

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

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more

impl<'a, K, V> DoubleEndedIterator for Keys<'a, K, V>
[src]

Removes and returns an element from the end of the iterator. Read more

🔬 This is a nightly-only experimental API. (iterator_try_fold #45594)

This is the reverse version of [try_fold()]: it takes elements starting from the back of the iterator. Read more

🔬 This is a nightly-only experimental API. (iter_rfold #44705)

An iterator method that reduces the iterator's elements to a single, final value, starting from the back. Read more

🔬 This is a nightly-only experimental API. (iter_rfind #39480)

Searches for an element of an iterator from the right that satisfies a predicate. Read more

impl<'a, K, V> ExactSizeIterator for Keys<'a, K, V>
[src]

Returns the exact number of times the iterator will iterate. Read more

🔬 This is a nightly-only experimental API. (exact_size_is_empty #35428)

Returns whether the iterator is empty. Read more

impl<'a, K, V> FusedIterator for Keys<'a, K, V>
1.26.0
[src]

impl<'a, K, V> Clone for Keys<'a, K, V>
[src]

Important traits for Keys<'a, K, V>

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

Auto Trait Implementations

impl<'a, K, V> Send for Keys<'a, K, V> where
    K: Sync,
    V: Sync

impl<'a, K, V> Sync for Keys<'a, K, V> where
    K: Sync,
    V: Sync