Skip to main content

Struct tauri::api::assets::phf::ordered_set::Iter

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

An iterator over the values in a OrderedSet.

Trait Implementations#

DoubleEndedIterator#

impl<'a, T> DoubleEndedIterator for Iter<'a, T>

Defined in: ordered_set.rs:140-145

next_back#

pub fn next_back(&mut self) -> Option<&'a T>

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

Defined in: ordered_set.rs:142

advance_back_by#

pub fn advance_back_by(&mut self, n: usize) -> Result<(), usize>

Defined in: double_ended.rs:130

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

recently added

Advances the iterator from the back by n elements. Read more

nth_back#

pub fn nth_back(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element from the end of the iterator. Read more

Defined in: double_ended.rs:180

try_rfold#

pub fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, Self::Item) -> R,
    R: Try<Ok = B>, 

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

Defined in: double_ended.rs:217-221

rfold#

pub fn rfold<B, F>(self, init: B, f: F) -> B where
    F: FnMut(B, Self::Item) -> B, 

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

Defined in: double_ended.rs:281-284

rfind#

pub fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool, 

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

Defined in: double_ended.rs:336-339

ExactSizeIterator#

impl<'a, T> ExactSizeIterator for Iter<'a, T>

Defined in: ordered_set.rs:147

len#

pub fn len(&self) -> usize

Returns the exact length of the iterator. Read more

Defined in: exact_size.rs:103

is_empty#

pub fn is_empty(&self) -> bool

Defined in: exact_size.rs:135

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

Returns true if the iterator is empty. Read more

Iterator#

impl<'a, T> Iterator for Iter<'a, T>

Defined in: ordered_set.rs:126-138

type Item = &'aT#

The type of the elements being iterated over.

next#

pub fn next(&mut self) -> Option<&'a T>

Advances the iterator and returns the next value. Read more

Defined in: ordered_set.rs:130

size_hint#

pub fn size_hint(&self) -> (usize, Option<usize>)

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

Defined in: ordered_set.rs:135

count#

pub fn count(self) -> usize

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

Defined in: iterator.rs:242-244

last#

pub fn last(self) -> Option<Self::Item>

Consumes the iterator, returning the last element. Read more

Defined in: iterator.rs:272-274

advance_by#

pub fn advance_by(&mut self, n: usize) -> Result<(), usize>

Defined in: iterator.rs:315

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

recently added

Advances the iterator by n elements. Read more

nth#

pub fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more

Defined in: iterator.rs:363

step_by#

pub fn step_by(self, step: usize) -> StepBy<Self>

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

Defined in: iterator.rs:414-416

chain#

pub fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator<Item = Self::Item>, 

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

Defined in: iterator.rs:485-488

zip#

pub fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator, 

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

Defined in: iterator.rs:561-564

intersperse#

pub fn intersperse(self, separator: Self::Item) -> Intersperse<Self> where
    Self::Item: Clone, 

Defined in: iterator.rs:603-606

🔬 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

intersperse_with#

pub fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> where
    G: FnMut() -> Self::Item, 

Defined in: iterator.rs:661-664

🔬 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

map#

pub fn map<B, F>(self, f: F) -> Map<Self, F> where
    F: FnMut(Self::Item) -> B, 

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

Defined in: iterator.rs:720-723

for_each#

pub fn for_each<F>(self, f: F) where
    F: FnMut(Self::Item), 

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

Defined in: iterator.rs:765-768

filter#

pub fn filter<P>(self, predicate: P) -> Filter<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

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

Defined in: iterator.rs:840-843

filter_map#

pub fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
    F: FnMut(Self::Item) -> Option<B>, 

Creates an iterator that both filters and maps. Read more

Defined in: iterator.rs:885-888

enumerate#

pub fn enumerate(self) -> Enumerate<Self>

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

Defined in: iterator.rs:932-934

peekable#

pub fn peekable(self) -> Peekable<Self>

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

Defined in: iterator.rs:981-983

skip_while#

pub fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

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

Defined in: iterator.rs:1045-1048

take_while#

pub fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

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

Defined in: iterator.rs:1126-1129

map_while#

pub fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where
    P: FnMut(Self::Item) -> Option<B>, 

Defined in: iterator.rs:1221-1224

🔬 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

skip#

pub fn skip(self, n: usize) -> Skip<Self>

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

Defined in: iterator.rs:1248-1250

take#

pub fn take(self, n: usize) -> Take<Self>

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

Defined in: iterator.rs:1294-1296

scan#

pub fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
    F: FnMut(&mut St, Self::Item) -> Option<B>, 

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

Defined in: iterator.rs:1338-1341

flat_map#

pub fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
    F: FnMut(Self::Item) -> U,
    U: IntoIterator, 

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

Defined in: iterator.rs:1378-1382

flatten#

pub fn flatten(self) -> Flatten<Self> where
    Self::Item: IntoIterator, 

Creates an iterator that flattens nested structure. Read more

Defined in: iterator.rs:1450-1453

fuse#

pub fn fuse(self) -> Fuse<Self>

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

Defined in: iterator.rs:1513-1515

inspect#

pub fn inspect<F>(self, f: F) -> Inspect<Self, F> where
    F: FnMut(&Self::Item), 

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

Defined in: iterator.rs:1597-1600

by_ref#

pub fn by_ref(&mut self) -> &mut Self

Borrows an iterator, rather than consuming it. Read more

Defined in: iterator.rs:1642-1644

collect#

#[must_use =
  "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]

pub fn collect<B>(self) -> B where
    B: FromIterator<Self::Item>, 

Transforms an iterator into a collection. Read more

Defined in: iterator.rs:1760-1762

partition#

pub fn partition<B, F>(self, f: F) -> (B, B) where
    F: FnMut(&Self::Item) -> bool,
    B: Default + Extend<Self::Item>, 

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

Defined in: iterator.rs:1793-1797

partition_in_place#

pub fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
    Self: DoubleEndedIterator<Item = &'a mut T>,
    T: 'a,
    P: FnMut(&T) -> bool, 

Defined in: iterator.rs:1848-1851

🔬 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

is_partitioned#

pub fn is_partitioned<P>(self, predicate: P) -> bool where
    P: FnMut(Self::Item) -> bool, 

Defined in: iterator.rs:1905-1908

🔬 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

try_fold#

pub fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, Self::Item) -> R,
    R: Try<Ok = B>, 

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

Defined in: iterator.rs:1974-1978

try_for_each#

pub fn try_for_each<F, R>(&mut self, f: F) -> R where
    F: FnMut(Self::Item) -> R,
    R: Try<Ok = ()>, 

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

Defined in: iterator.rs:2016-2020

fold#

pub fn fold<B, F>(self, init: B, f: F) -> B where
    F: FnMut(B, Self::Item) -> B, 

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

Defined in: iterator.rs:2116-2119

reduce#

pub fn reduce<F>(self, f: F) -> Option<Self::Item> where
    F: FnMut(Self::Item, Self::Item) -> Self::Item, 

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

Defined in: iterator.rs:2161-2164

all#

pub fn all<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

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

Defined in: iterator.rs:2210-2213

any#

pub fn any<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

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

Defined in: iterator.rs:2263-2266

find#

pub fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool, 

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

Defined in: iterator.rs:2323-2326

find_map#

pub fn find_map<B, F>(&mut self, f: F) -> Option<B> where
    F: FnMut(Self::Item) -> Option<B>, 

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

Defined in: iterator.rs:2354-2357

try_find#

pub fn try_find<F, R>(
    &mut self, 
    f: F
) -> Result<Option<Self::Item>, <R as Try>::Error> where
    F: FnMut(&Self::Item) -> R,
    R: Try<Ok = bool>, 

Defined in: iterator.rs:2392-2396

🔬 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

position#

pub fn position<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool, 

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

Defined in: iterator.rs:2468-2471

rposition#

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

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

Defined in: iterator.rs:2525-2528

max#

pub fn max(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the maximum element of an iterator. Read more

Defined in: iterator.rs:2564-2567

min#

pub fn min(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the minimum element of an iterator. Read more

Defined in: iterator.rs:2590-2593

max_by_key#

pub fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item) -> B,
    B: Ord, 

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

Defined in: iterator.rs:2612-2615

max_by#

pub fn max_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

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

Defined in: iterator.rs:2645-2648

min_by_key#

pub fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item) -> B,
    B: Ord, 

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

Defined in: iterator.rs:2672-2675

min_by#

pub fn min_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

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

Defined in: iterator.rs:2705-2708

rev#

pub fn rev(self) -> Rev<Self> where
    Self: DoubleEndedIterator, 

Reverses an iterator’s direction. Read more

Defined in: iterator.rs:2742-2744

unzip#

pub fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
    Self: Iterator<Item = (A, B)>,
    FromA: Default + Extend<A>,
    FromB: Default + Extend<B>, 

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

Defined in: iterator.rs:2772-2776

copied#

pub fn copied<'a, T>(self) -> Copied<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Copy, 

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

Defined in: iterator.rs:2823-2826

cloned#

pub fn cloned<'a, T>(self) -> Cloned<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Clone, 

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

Defined in: iterator.rs:2854-2857

cycle#

pub fn cycle(self) -> Cycle<Self> where
    Self: Clone, 

Repeats an iterator endlessly. Read more

Defined in: iterator.rs:2887-2889

sum#

pub fn sum<S>(self) -> S where
    S: Sum<Self::Item>, 

Sums the elements of an iterator. Read more

Defined in: iterator.rs:2917-2920

product#

pub fn product<P>(self) -> P where
    P: Product<Self::Item>, 

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

Defined in: iterator.rs:2946-2949

cmp#

pub fn cmp<I>(self, other: I) -> Ordering where
    I: IntoIterator<Item = Self::Item>,
    Self::Item: Ord, 

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

Defined in: iterator.rs:2967-2971

cmp_by#

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

Defined in: iterator.rs:2996-3000

🔬 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

partial_cmp#

pub fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

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

Defined in: iterator.rs:3043-3047

partial_cmp_by#

pub 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, 

Defined in: iterator.rs:3081-3085

🔬 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

eq#

pub fn eq<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

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

Defined in: iterator.rs:3123-3127

eq_by#

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

Defined in: iterator.rs:3148-3152

🔬 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

ne#

pub fn ne<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

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

Defined in: iterator.rs:3183-3187

lt#

pub fn lt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

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

Defined in: iterator.rs:3204-3208

le#

pub fn le<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

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

Defined in: iterator.rs:3225-3229

gt#

pub fn gt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

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

Defined in: iterator.rs:3246-3250

ge#

pub fn ge<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

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

Defined in: iterator.rs:3267-3271

is_sorted#

pub fn is_sorted(self) -> bool where
    Self::Item: PartialOrd<Self::Item>, 

Defined in: iterator.rs:3298-3301

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

new API

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

is_sorted_by#

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

Defined in: iterator.rs:3326-3329

🔬 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

is_sorted_by_key#

pub fn is_sorted_by_key<F, K>(self, f: F) -> bool where
    F: FnMut(Self::Item) -> K,
    K: PartialOrd<K>, 

Defined in: iterator.rs:3372-3376

🔬 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 Iter<'a, T> where T: RefUnwindSafe,#

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

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

impl<'a, T> Unpin for Iter<'a, T>#

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

Blanket Implementations#

Any#

impl<T> Any for T where
    T: 'static + ?Sized, 

Defined in: any.rs:131-135

type_id#

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Defined in: any.rs:132

Borrow#

impl<T> Borrow<T> for T where
    T: ?Sized, 

Defined in: borrow.rs:208-213

borrow#

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Defined in: borrow.rs:210

BorrowMut#

impl<T> BorrowMut<T> for T where
    T: ?Sized, 

Defined in: borrow.rs:216-220

borrow_mut#

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Defined in: borrow.rs:217

From#

impl<T> From<T> for T

Defined in: mod.rs:544-548

from#

pub fn from(t: T) -> T

Performs the conversion.

Defined in: mod.rs:545

Into#

impl<T, U> Into<U> for T where
    U: From<T>, 

Defined in: mod.rs:533-540

into#

pub fn into(self) -> U

Performs the conversion.

Defined in: mod.rs:537

IntoIterator#

impl<I> IntoIterator for I where
    I: Iterator, 

Defined in: collect.rs:236-243

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

The type of the elements being iterated over.

type IntoIter = I#

Which kind of iterator are we turning this into?

into_iter#

pub fn into_iter(self) -> I

Creates an iterator from a value. Read more

Defined in: collect.rs:240

IteratorRandom#

impl<I> IteratorRandom for I where
    I: Iterator, 

Defined in: mod.rs:615

choose#

pub fn choose<R>(self, rng: &mut R) -> Option<Self::Item> where
    R: Rng + ?Sized, 

Choose one element at random from the iterator. Read more

Defined in: mod.rs:304-305

choose_stable#

pub fn choose_stable<R>(self, rng: &mut R) -> Option<Self::Item> where
    R: Rng + ?Sized, 

Choose one element at random from the iterator. Read more

Defined in: mod.rs:373-374

choose_multiple_fill#

pub fn choose_multiple_fill<R>(
    self, 
    rng: &mut R, 
    buf: &mut [Self::Item]


) -> usize where
    R: Rng + ?Sized, 

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

Defined in: mod.rs:426-427

choose_multiple#

pub fn choose_multiple<R>(
    self, 
    rng: &mut R, 
    amount: usize
) -> Vec<Self::Item, Global> where
    R: Rng + ?Sized, 

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

Defined in: mod.rs:466-467

TryFrom#

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 

Defined in: mod.rs:581-590

type Error = Infallible#

The type returned in the event of a conversion error.

try_from#

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

Performs the conversion.

Defined in: mod.rs:587

TryInto#

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 

Defined in: mod.rs:567-576

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

The type returned in the event of a conversion error.

try_into#

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

Defined in: mod.rs:573

impl<V, T> VZip<V> for T where V: MultiLane<T>,#

pub fn vzip(self) -> V#