Struct tauri::http::header::ValueDrain

x3A;:header::ValueDrain,

pub struct ValueDrain<'a, T> { /* fields omitted */ }

Expand description

An drain iterator of all values associated with a single header name.

Trait Implementations#

impl<'a, T> Debug for ValueDrain<'a, T> where T: Debug,[src]#

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>[src]#

Formats the value using the given formatter. Read more

impl<'a, T> Drop for ValueDrain<'a, T>[src]#

pub fn drop(&mut self)[src]#

Executes the destructor for this type. Read more

impl<'a, T> Iterator for ValueDrain<'a, T>[src]#

type Item = T#

The type of the elements being iterated over.

pub fn next(&mut self) -> Option<T>[src]#

Advances the iterator and returns the next value. Read more

pub fn size_hint(&self) -> (usize, Option<usize>)[src]#

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

fn count(self) -> usize1.0.0[src]#

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

fn last(self) -> Option<Self::Item>1.0.0[src]#

Consumes the iterator, returning the last element. Read more

fn advance_by(&mut self, n: usize) -> Result<(), usize>[src]#

🔬 This is a nightly-only experimental API. (iter_advance_by)

recently added

Advances the iterator by n elements. Read more

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0[src]#

Returns the nth element of the iterator. Read more

fn step_by(self, step: usize) -> StepBy<Self>1.28.0[src]#

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

fn chain(self, other: U) -> Chain<Self, ::IntoIter> where U: IntoIterator<Item = Self::Item>,1.0.0[src]#

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

fn zip(self, other: U) -> Zip<Self, ::IntoIter> where U: IntoIterator,1.0.0[src]#

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

fn intersperse(self, separator: Self::Item) -> Intersperse<Self> where Self::Item: Clone,[src]#

🔬 This is a nightly-only experimental API. (iter_intersperse)

recently added

Creates a new iterator which places a copy of separator between adjacent items of the original iterator. Read more

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> where G: FnMut() -> Self::Item,[src]#

🔬 This is a nightly-only experimental API. (iter_intersperse)

recently added

Creates a new iterator which places an item generated by separator between adjacent items of the original iterator. Read more

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B,1.0.0[src]#

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

fn for_each<F>(self, f: F) where F: FnMut(Self::Item),1.21.0[src]#

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

fn filter(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool,1.0.0[src]#

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

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option,1.0.0[src]#

Creates an iterator that both filters and maps. Read more

fn enumerate(self) -> Enumerate<Self>1.0.0[src]#

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

fn peekable(self) -> Peekable<Self>1.0.0[src]#

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information. Read more

fn skip_while(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool,1.0.0[src]#

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

fn take_while(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool,1.0.0[src]#

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

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where P: FnMut(Self::Item) -> Option,[src]#

🔬 This is a nightly-only experimental API. (iter_map_while)

recently added

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

fn skip(self, n: usize) -> Skip<Self>1.0.0[src]#

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

fn take(self, n: usize) -> Take<Self>1.0.0[src]#

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner. Read more

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mutSt, Self::Item) -> Option,1.0.0[src]#

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

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator,1.0.0[src]#

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

fn flatten(self) -> Flatten<Self> where Self::Item: IntoIterator,1.29.0[src]#

Creates an iterator that flattens nested structure. Read more

fn fuse(self) -> Fuse<Self>1.0.0[src]#

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

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item),1.0.0[src]#

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

fn by_ref(&mut self) -> &mutSelf1.0.0[src]#

Borrows an iterator, rather than consuming it. Read more

#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]fn collect(self) -> B where B: FromIterator<Self::Item>,1.0.0[src]#

Transforms an iterator into a collection. Read more

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>,1.0.0[src]#

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

fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where Self: DoubleEndedIterator<Item = &'a mutT>, T: 'a, P: FnMut(&T) -> bool,[src]#

🔬 This is a nightly-only experimental API. (iter_partition_in_place)

new API

Reorders the elements of this iterator in-place according to the given predicate, such that all those that return true precede all those that return false. Returns the number of true elements found. Read more

fn is_partitioned(self, predicate: P) -> bool where P: FnMut(Self::Item) -> bool,[src]#

🔬 This is a nightly-only experimental API. (iter_is_partitioned)

new API

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false. Read more

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where R: Try<Output = B>, F: FnMut(B, Self::Item) -> R,1.27.0[src]#

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

fn try_for_each<F, R>(&mut self, f: F) -> R where R: Try<Output = ()>, F: FnMut(Self::Item) -> R,1.27.0[src]#

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

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B,1.0.0[src]#

Folds every element into an accumulator by applying an operation, returning the final result. Read more

fn reduce<F>(self, f: F) -> Option<Self::Item> where F: FnMut(Self::Item, Self::Item) -> Self::Item,1.51.0[src]#

Reduces the elements to a single one, by repeatedly applying a reducing operation. Read more

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool,1.0.0[src]#

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

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool,1.0.0[src]#

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

fn find(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool,1.0.0[src]#

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

fn find_map<B, F>(&mut self, f: F) -> Option where F: FnMut(Self::Item) -> Option,1.30.0[src]#

Applies function to the elements of iterator and returns the first non-none result. Read more

fn try_find<F, R, E>(&mut self, f: F) -> Result<Option<Self::Item>, E> where R: Try<Output = bool, Residual = Result<Infallible, E>> + Try, F: FnMut(&Self::Item) -> R,[src]#

🔬 This is a nightly-only experimental API. (try_find)

new API

Applies function to the elements of iterator and returns the first true result or the first error. Read more

fn position(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool,1.0.0[src]#

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

fn rposition(&mut self, predicate: P) -> Option<usize> where Self: ExactSizeIterator + DoubleEndedIterator, P: FnMut(Self::Item) -> bool,1.0.0[src]#

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

fn max(self) -> Option<Self::Item> where Self::Item: Ord,1.0.0[src]#

Returns the maximum element of an iterator. Read more

fn min(self) -> Option<Self::Item> where Self::Item: Ord,1.0.0[src]#

Returns the minimum element of an iterator. Read more

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord,1.6.0[src]#

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

fn max_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,1.15.0[src]#

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

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord,1.6.0[src]#

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

fn min_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,1.15.0[src]#

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

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator,1.0.0[src]#

Reverses an iterator’s direction. Read more

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where Self: Iterator<Item = (A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend,1.0.0[src]#

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

fn copied<'a, T>(self) -> Copied<Self> where Self: Iterator<Item = &'aT>, T: 'a + Copy,1.36.0[src]#

Creates an iterator which copies all of its elements. Read more

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item = &'aT>, T: 'a + Clone,1.0.0[src]#

Creates an iterator which clones all of its elements. Read more

fn cycle(self) -> Cycle<Self> where Self: Clone,1.0.0[src]#

Repeats an iterator endlessly. Read more

fn sum<S>(self) -> S where S: Sum<Self::Item>,1.11.0[src]#

Sums the elements of an iterator. Read more

fn product(self) -> P where P: Product<Self::Item>,1.11.0[src]#

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

fn cmp(self, other: I) -> Ordering where I: IntoIterator<Item = Self::Item>, Self::Item: Ord,1.5.0[src]#

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

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where F: FnMut(Self::Item, ::Item) -> Ordering, I: IntoIterator,[src]#

🔬 This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function. Read more

fn partial_cmp(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<::Item>,1.5.0[src]#

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

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where F: FnMut(Self::Item, ::Item) -> Option<Ordering>, I: IntoIterator,[src]#

🔬 This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function. Read more

fn eq(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<::Item>,1.5.0[src]#

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

fn eq_by<I, F>(self, other: I, eq: F) -> bool where F: FnMut(Self::Item, ::Item) -> bool, I: IntoIterator,[src]#

🔬 This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function. Read more

fn ne(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<::Item>,1.5.0[src]#

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

fn lt(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,1.5.0[src]#

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

fn le(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,1.5.0[src]#

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

fn gt(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,1.5.0[src]#

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

fn ge(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,1.5.0[src]#

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

fn is_sorted(self) -> bool where Self::Item: PartialOrd<Self::Item>,[src]#

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted. Read more

fn is_sorted_by<F>(self, compare: F) -> bool where F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,[src]#

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted using the given comparator function. Read more

fn is_sorted_by_key<F, K>(self, f: F) -> bool where F: FnMut(Self::Item) -> K, K: PartialOrd<K>,[src]#

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted using the given key extraction function. Read more

Auto Trait Implementations#

impl<'a, T> RefUnwindSafe for ValueDrain<'a, T> where T: RefUnwindSafe,#

impl<'a, T> Unpin for ValueDrain<'a, T> where T: Unpin,#

impl<'a, T> \!UnwindSafe for ValueDrain<'a, T>#

Blanket Implementations#

impl<T> Any for T where T: 'static + ?Sized,[src]#

pub fn type_id(&self) -> TypeId [src]#

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T where T: ?Sized,[src]#

pub fn borrow(&self) -> &T[src]#

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T where T: ?Sized,[src]#

pub fn borrow_mut(&mut self) -> &mutT[src]#

Mutably borrows from an owned value. Read more

impl ElementIterator for I where I: Iterator<Item = NodeDataRef<ElementData>>,#

fn select(self, selectors: &str) -> Result<Select<Self, Selectors>, ()>#

Filter this element iterator to elements maching the given selectors.

impl<T> From<T> for T[src]#

pub fn from(t: T) -> T[src]#

Performs the conversion.

impl<T, U> Into for T where U: From<T>,[src]#

pub fn into(self) -> U[src]#

Performs the conversion.

impl IntoIterator for I where I: Iterator,[src]#

type Item = ::Item #

The type of the elements being iterated over.

type IntoIter = I#

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> I[src]#

Creates an iterator from a value. Read more

impl IteratorRandom for I where I: Iterator,[src]#

fn choose<R>(self, rng: &mutR) -> Option<Self::Item> where R: Rng + ?Sized,[src]#

Choose one element at random from the iterator. Read more

fn choose_stable<R>(self, rng: &mutR) -> Option<Self::Item> where R: Rng + ?Sized,[src]#

Choose one element at random from the iterator. Read more

fn choose_multiple_fill<R>(self, rng: &mutR, buf: &mut [Self::Item ]) -> usize where R: Rng + ?Sized,[src]#

Collects values at random from the iterator into a supplied buffer until that buffer is filled. Read more

fn choose_multiple<R>( self, rng: &mutR, amount: usize ) -> Vec<Self::Item, Global> where R: Rng + ?Sized,[src]#

Collects amount values at random from the iterator into a vector. Read more

impl NodeIterator for I where I: Iterator<Item = NodeRef>,#

fn elements(self) -> Elements<Self>#

Filter this element iterator to elements.

fn text_nodes(self) -> TextNodes<Self>#

Filter this node iterator to text nodes.

fn comments(self) -> Comments<Self>#

Filter this node iterator to comment nodes.

fn select( self, selectors: &str ) -> Result<Select<Elements<Self>, Selectors>, ()>#

Filter this node iterator to elements maching the given selectors.

impl<T, U> TryFrom for T where U: Into<T>,[src]#

type Error = Infallible #

The type returned in the event of a conversion error.

pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>[src]#

Performs the conversion.

impl<T, U> TryInto for T where U: TryFrom<T>,[src]#

type Error = >::Error #

The type returned in the event of a conversion error.

pub fn try_into(self) -> Result<U, >::Error>[src]#

Performs the conversion.

impl UnicodeNormalization for I where I: Iterator<Item = char>,#

pub fn nfd(self) -> Decompositions#

Returns an iterator over the string in Unicode Normalization Form D (canonical decomposition). Read more

pub fn nfkd(self) -> Decompositions#

Returns an iterator over the string in Unicode Normalization Form KD (compatibility decomposition). Read more

pub fn nfc(self) -> Recompositions#

An Iterator over the string in Unicode Normalization Form C (canonical decomposition followed by canonical composition). Read more

pub fn nfkc(self) -> Recompositions#

An Iterator over the string in Unicode Normalization Form KC (compatibility decomposition followed by canonical composition). Read more

pub fn cjk_compat_variants(self) -> Replacements#

A transformation which replaces CJK Compatibility Ideograph codepoints with normal forms using Standardized Variation Sequences. This is not part of the canonical or compatibility decomposition algorithms, but performing it before those algorithms produces normalized output which better preserves the intent of the original text. Read more

pub fn stream_safe(self) -> StreamSafe#

An Iterator over the string with Conjoining Grapheme Joiner characters inserted according to the Stream-Safe Text Process (UAX15-D4) Read more

Trait Implementations#

impl<'a, T> Debug for ValueDrain<'a, T> where T: Debug,[src]#

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>[src]#

impl<'a, T> Drop for ValueDrain<'a, T>[src]#

pub fn drop(&mut self)[src]#

impl<'a, T> Iterator for ValueDrain<'a, T>[src]#

type Item = T#

pub fn next(&mut self) -> Option<T>[src]#

pub fn size_hint(&self) -> (usize, Option<usize>)[src]#

fn count(self) -> usize1.0.0[src]#

fn last(self) -> Option<Self::Item>1.0.0[src]#

fn advance_by(&mut self, n: usize) -> Result<(), usize>[src]#

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0[src]#

fn step_by(self, step: usize) -> StepBy<Self>1.28.0[src]#

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where U: IntoIterator<Item = Self::Item>,1.0.0[src]#

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where U: IntoIterator,1.0.0[src]#

fn intersperse(self, separator: Self::Item) -> Intersperse<Self> where Self::Item: Clone,[src]#

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> where G: FnMut() -> Self::Item,[src]#

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B,1.0.0[src]#

fn for_each<F>(self, f: F) where F: FnMut(Self::Item),1.21.0[src]#

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool,1.0.0[src]#

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>,1.0.0[src]#

fn enumerate(self) -> Enumerate<Self>1.0.0[src]#

fn peekable(self) -> Peekable<Self>1.0.0[src]#

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool,1.0.0[src]#

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool,1.0.0[src]#

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where P: FnMut(Self::Item) -> Option<B>,[src]#

fn skip(self, n: usize) -> Skip<Self>1.0.0[src]#

fn take(self, n: usize) -> Take<Self>1.0.0[src]#

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mutSt, Self::Item) -> Option<B>,1.0.0[src]#

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator,1.0.0[src]#

fn flatten(self) -> Flatten<Self> where Self::Item: IntoIterator,1.29.0[src]#

fn fuse(self) -> Fuse<Self>1.0.0[src]#

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item),1.0.0[src]#

fn by_ref(&mut self) -> &mutSelf1.0.0[src]#

#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]fn collect<B>(self) -> B where B: FromIterator<Self::Item>,1.0.0[src]#

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>,1.0.0[src]#

fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where Self: DoubleEndedIterator<Item = &'a mutT>, T: 'a, P: FnMut(&T) -> bool,[src]#

fn is_partitioned<P>(self, predicate: P) -> bool where P: FnMut(Self::Item) -> bool,[src]#

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where R: Try<Output = B>, F: FnMut(B, Self::Item) -> R,1.27.0[src]#

fn try_for_each<F, R>(&mut self, f: F) -> R where R: Try<Output = ()>, F: FnMut(Self::Item) -> R,1.27.0[src]#

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B,1.0.0[src]#

fn reduce<F>(self, f: F) -> Option<Self::Item> where F: FnMut(Self::Item, Self::Item) -> Self::Item,1.51.0[src]#

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool,1.0.0[src]#

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool,1.0.0[src]#

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool,1.0.0[src]#

fn find_map<B, F>(&mut self, f: F) -> Option<B> where F: FnMut(Self::Item) -> Option<B>,1.30.0[src]#

fn try_find<F, R, E>(&mut self, f: F) -> Result<Option<Self::Item>, E> where R: Try<Output = bool, Residual = Result<Infallible, E>> + Try, F: FnMut(&Self::Item) -> R,[src]#

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool,1.0.0[src]#

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where Self: ExactSizeIterator + DoubleEndedIterator, P: FnMut(Self::Item) -> bool,1.0.0[src]#

fn max(self) -> Option<Self::Item> where Self::Item: Ord,1.0.0[src]#

fn min(self) -> Option<Self::Item> where Self::Item: Ord,1.0.0[src]#

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord,1.6.0[src]#

fn max_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,1.15.0[src]#

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord,1.6.0[src]#

fn min_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,1.15.0[src]#

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator,1.0.0[src]#

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where Self: Iterator<Item = (A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>,1.0.0[src]#

fn copied<'a, T>(self) -> Copied<Self> where Self: Iterator<Item = &'aT>, T: 'a + Copy,1.36.0[src]#

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item = &'aT>, T: 'a + Clone,1.0.0[src]#

fn cycle(self) -> Cycle<Self> where Self: Clone,1.0.0[src]#

fn sum<S>(self) -> S where S: Sum<Self::Item>,1.11.0[src]#

fn product<P>(self) -> P where P: Product<Self::Item>,1.11.0[src]#

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item = Self::Item>, Self::Item: Ord,1.5.0[src]#

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering, I: IntoIterator,[src]#

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>,1.5.0[src]#

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>, I: IntoIterator,[src]#

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>,1.5.0[src]#

fn eq_by<I, F>(self, other: I, eq: F) -> bool where F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool, I: IntoIterator,[src]#

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>,1.5.0[src]#

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>,1.5.0[src]#

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>,1.5.0[src]#

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>,1.5.0[src]#

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>,1.5.0[src]#

fn is_sorted(self) -> bool where Self::Item: PartialOrd<Self::Item>,[src]#

fn is_sorted_by<F>(self, compare: F) -> bool where F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,[src]#

fn is_sorted_by_key<F, K>(self, f: F) -> bool where F: FnMut(Self::Item) -> K, K: PartialOrd<K>,[src]#

impl<'a, T> FusedIterator for ValueDrain<'a, T>#

impl<'a, T> Send for ValueDrain<'a, T> where T: Send,#

impl<'a, T> Sync for ValueDrain<'a, T> where T: Sync,#

pub fn type_id(&self) -> TypeId [src]#

type Item = <I as Iterator>::Item #

fn choose_multiple_fill<R>(self, rng: &mutR, buf: &mut [Self::Item ]) -> usize where R: Rng + ?Sized,[src]#

type Error = Infallible #

type Error = <U as TryFrom<T>>::Error #