Struct nvapi::PerformanceDecreaseReason
source · [−]pub struct PerformanceDecreaseReason { /* private fields */ }
Expand description
Bit masks for knowing the exact reason for performance decrease
Used in NvAPI_GPU_GetPerfDecreaseInfo
Implementations
sourceimpl PerformanceDecreaseReason
impl PerformanceDecreaseReason
pub const NONE: PerformanceDecreaseReason = Self{bits: 0,}
pub const THERMAL_PROTECTION: PerformanceDecreaseReason = Self{bits: 1,}
pub const POWER_CONTROL: PerformanceDecreaseReason = Self{bits: 2,}
pub const AC_BATTERY: PerformanceDecreaseReason = Self{bits: 4,}
pub const API_TRIGGERED: PerformanceDecreaseReason = Self{bits: 8,}
pub const INSUFFICIENT_POWER: PerformanceDecreaseReason = Self{bits: 16,}
pub const UNKNOWN: PerformanceDecreaseReason = Self{bits: 0,}
sourcepub const fn empty() -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
pub const fn empty() -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns an empty set of flags.
sourcepub const fn all() -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
pub const fn all() -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the set containing all flags.
sourcepub const fn from_bits(bits: u32) -> Option<PerformanceDecreaseReason>
pub const fn from_bits(bits: u32) -> Option<PerformanceDecreaseReason>
Convert from underlying bit representation, unless that representation contains bits that do not correspond to a flag.
sourcepub const fn from_bits_truncate(bits: u32) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
pub const fn from_bits_truncate(bits: u32) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Convert from underlying bit representation, dropping any bits that do not correspond to flags.
sourcepub const unsafe fn from_bits_unchecked(bits: u32) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
pub const unsafe fn from_bits_unchecked(bits: u32) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Convert from underlying bit representation, preserving all bits (even those not corresponding to a defined flag).
Safety
The caller of the bitflags!
macro can chose to allow or
disallow extra bits for their bitflags type.
The caller of from_bits_unchecked()
has to ensure that
all bits correspond to a defined flag or that extra bits
are valid for this bitflags type.
sourcepub const fn intersects(&self, other: PerformanceDecreaseReason) -> bool
pub const fn intersects(&self, other: PerformanceDecreaseReason) -> bool
Returns true
if there are flags common to both self
and other
.
sourcepub const fn contains(&self, other: PerformanceDecreaseReason) -> bool
pub const fn contains(&self, other: PerformanceDecreaseReason) -> bool
Returns true
if all of the flags in other
are contained within self
.
sourcepub fn insert(&mut self, other: PerformanceDecreaseReason)
pub fn insert(&mut self, other: PerformanceDecreaseReason)
Inserts the specified flags in-place.
sourcepub fn remove(&mut self, other: PerformanceDecreaseReason)
pub fn remove(&mut self, other: PerformanceDecreaseReason)
Removes the specified flags in-place.
sourcepub fn toggle(&mut self, other: PerformanceDecreaseReason)
pub fn toggle(&mut self, other: PerformanceDecreaseReason)
Toggles the specified flags in-place.
sourcepub fn set(&mut self, other: PerformanceDecreaseReason, value: bool)
pub fn set(&mut self, other: PerformanceDecreaseReason, value: bool)
Inserts or removes the specified flags depending on the passed value.
sourcepub const fn intersection(
self,
other: PerformanceDecreaseReason
) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
pub const fn intersection(
self,
other: PerformanceDecreaseReason
) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the intersection between the flags in self
and
other
.
Specifically, the returned set contains only the flags which are
present in both self
and other
.
This is equivalent to using the &
operator (e.g.
ops::BitAnd
), as in flags & other
.
sourcepub const fn union(
self,
other: PerformanceDecreaseReason
) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
pub const fn union(
self,
other: PerformanceDecreaseReason
) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the union of between the flags in self
and other
.
Specifically, the returned set contains all flags which are
present in either self
or other
, including any which are
present in both (see Self::symmetric_difference
if that
is undesirable).
This is equivalent to using the |
operator (e.g.
ops::BitOr
), as in flags | other
.
sourcepub const fn difference(
self,
other: PerformanceDecreaseReason
) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
pub const fn difference(
self,
other: PerformanceDecreaseReason
) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the difference between the flags in self
and other
.
Specifically, the returned set contains all flags present in
self
, except for the ones present in other
.
It is also conceptually equivalent to the “bit-clear” operation:
flags & !other
(and this syntax is also supported).
This is equivalent to using the -
operator (e.g.
ops::Sub
), as in flags - other
.
sourcepub const fn symmetric_difference(
self,
other: PerformanceDecreaseReason
) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
pub const fn symmetric_difference(
self,
other: PerformanceDecreaseReason
) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the symmetric difference between the flags
in self
and other
.
Specifically, the returned set contains the flags present which
are present in self
or other
, but that are not present in
both. Equivalently, it contains the flags present in exactly
one of the sets self
and other
.
This is equivalent to using the ^
operator (e.g.
ops::BitXor
), as in flags ^ other
.
sourcepub const fn complement(self) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
pub const fn complement(self) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the complement of this set of flags.
Specifically, the returned set contains all the flags which are
not set in self
, but which are allowed for this type.
Alternatively, it can be thought of as the set difference
between Self::all()
and self
(e.g. Self::all() - self
)
This is equivalent to using the !
operator (e.g.
ops::Not
), as in !flags
.
Trait Implementations
sourceimpl Binary for PerformanceDecreaseReason
impl Binary for PerformanceDecreaseReason
sourceimpl BitAnd<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl BitAnd<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn bitand(self, other: PerformanceDecreaseReason) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
fn bitand(self, other: PerformanceDecreaseReason) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the intersection between the two sets of flags.
type Output = PerformanceDecreaseReason
type Output = PerformanceDecreaseReason
The resulting type after applying the &
operator.
sourceimpl BitAndAssign<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl BitAndAssign<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn bitand_assign(&mut self, other: PerformanceDecreaseReason)
fn bitand_assign(&mut self, other: PerformanceDecreaseReason)
Disables all flags disabled in the set.
sourceimpl BitOr<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl BitOr<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn bitor(self, other: PerformanceDecreaseReason) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
fn bitor(self, other: PerformanceDecreaseReason) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the union of the two sets of flags.
type Output = PerformanceDecreaseReason
type Output = PerformanceDecreaseReason
The resulting type after applying the |
operator.
sourceimpl BitOrAssign<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl BitOrAssign<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn bitor_assign(&mut self, other: PerformanceDecreaseReason)
fn bitor_assign(&mut self, other: PerformanceDecreaseReason)
Adds the set of flags.
sourceimpl BitXor<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl BitXor<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn bitxor(self, other: PerformanceDecreaseReason) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
fn bitxor(self, other: PerformanceDecreaseReason) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the left flags, but with all the right flags toggled.
type Output = PerformanceDecreaseReason
type Output = PerformanceDecreaseReason
The resulting type after applying the ^
operator.
sourceimpl BitXorAssign<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl BitXorAssign<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn bitxor_assign(&mut self, other: PerformanceDecreaseReason)
fn bitxor_assign(&mut self, other: PerformanceDecreaseReason)
Toggles the set of flags.
sourceimpl Clone for PerformanceDecreaseReason
impl Clone for PerformanceDecreaseReason
sourcefn clone(&self) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
fn clone(&self) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl Debug for PerformanceDecreaseReason
impl Debug for PerformanceDecreaseReason
sourceimpl Default for PerformanceDecreaseReason
impl Default for PerformanceDecreaseReason
sourcefn default() -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
fn default() -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the “default value” for a type. Read more
sourceimpl<'de> Deserialize<'de> for PerformanceDecreaseReason
impl<'de> Deserialize<'de> for PerformanceDecreaseReason
sourcefn deserialize<__D>(
__deserializer: __D
) -> Result<PerformanceDecreaseReason, <__D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D
) -> Result<PerformanceDecreaseReason, <__D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
sourceimpl Extend<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl Extend<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = PerformanceDecreaseReason>,
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = PerformanceDecreaseReason>,
Extends a collection with the contents of an iterator. Read more
sourcefn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)Extends a collection with exactly one element.
sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
sourceimpl FromIterator<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl FromIterator<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn from_iter<T>(iterator: T) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
where
T: IntoIterator<Item = PerformanceDecreaseReason>,
fn from_iter<T>(iterator: T) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
where
T: IntoIterator<Item = PerformanceDecreaseReason>,
Creates a value from an iterator. Read more
sourceimpl Hash for PerformanceDecreaseReason
impl Hash for PerformanceDecreaseReason
sourceimpl Iterator for PerformanceDecreaseReason
impl Iterator for PerformanceDecreaseReason
type Item = PerformanceDecreaseReason
type Item = PerformanceDecreaseReason
The type of the elements being iterated over.
sourcefn next(&mut self) -> Option<<PerformanceDecreaseReason as Iterator>::Item>
fn next(&mut self) -> Option<<PerformanceDecreaseReason as Iterator>::Item>
Advances the iterator and returns the next value. Read more
1.0.0 · sourcefn size_hint(&self) -> (usize, Option<usize>)
fn size_hint(&self) -> (usize, Option<usize>)
Returns the bounds on the remaining length of the iterator. Read more
1.0.0 · sourcefn count(self) -> usize
fn count(self) -> usize
Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · sourcefn last(self) -> Option<Self::Item>
fn last(self) -> Option<Self::Item>
Consumes the iterator, returning the last element. Read more
sourcefn advance_by(&mut self, n: usize) -> Result<(), usize>
fn advance_by(&mut self, n: usize) -> Result<(), usize>
iter_advance_by
)Advances the iterator by n
elements. Read more
1.0.0 · sourcefn nth(&mut self, n: usize) -> Option<Self::Item>
fn nth(&mut self, n: usize) -> Option<Self::Item>
Returns the n
th element of the iterator. Read more
1.28.0 · sourcefn step_by(self, step: usize) -> StepBy<Self>
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
1.0.0 · sourcefn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
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
1.0.0 · sourcefn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
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
sourcefn intersperse(self, separator: Self::Item) -> Intersperse<Self> where
Self::Item: Clone,
fn intersperse(self, separator: Self::Item) -> Intersperse<Self> where
Self::Item: Clone,
iter_intersperse
)Creates a new iterator which places a copy of separator
between adjacent
items of the original iterator. Read more
sourcefn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> where
G: FnMut() -> Self::Item,
fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> where
G: FnMut() -> Self::Item,
iter_intersperse
)Creates a new iterator which places an item generated by separator
between adjacent items of the original iterator. Read more
1.0.0 · sourcefn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
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
1.21.0 · sourcefn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
Calls a closure on each element of an iterator. Read more
1.0.0 · sourcefn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: for<'_> FnMut(&Self::Item) -> bool,
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: for<'_> FnMut(&Self::Item) -> bool,
Creates an iterator which uses a closure to determine if an element should be yielded. Read more
1.0.0 · sourcefn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
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
1.0.0 · sourcefn enumerate(self) -> Enumerate<Self>
fn enumerate(self) -> Enumerate<Self>
Creates an iterator which gives the current iteration count as well as the next value. Read more
1.0.0 · sourcefn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: for<'_> FnMut(&Self::Item) -> bool,
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: for<'_> FnMut(&Self::Item) -> bool,
1.0.0 · sourcefn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: for<'_> FnMut(&Self::Item) -> bool,
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: for<'_> FnMut(&Self::Item) -> bool,
Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · sourcefn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where
P: FnMut(Self::Item) -> Option<B>,
fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where
P: FnMut(Self::Item) -> Option<B>,
Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · sourcefn skip(self, n: usize) -> Skip<Self>
fn skip(self, n: usize) -> Skip<Self>
Creates an iterator that skips the first n
elements. Read more
1.0.0 · sourcefn take(self, n: usize) -> Take<Self>
fn take(self, n: usize) -> Take<Self>
Creates an iterator that yields the first n
elements, or fewer
if the underlying iterator ends sooner. Read more
1.0.0 · sourcefn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: for<'_> FnMut(&mut St, Self::Item) -> Option<B>,
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: for<'_> FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0 · sourcefn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
U: IntoIterator,
F: FnMut(Self::Item) -> U,
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
U: IntoIterator,
F: FnMut(Self::Item) -> U,
Creates an iterator that works like map, but flattens nested structure. Read more
1.29.0 · sourcefn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
Creates an iterator that flattens nested structure. Read more
1.0.0 · sourcefn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: for<'_> FnMut(&Self::Item),
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: for<'_> FnMut(&Self::Item),
Does something with each element of an iterator, passing the value on. Read more
1.0.0 · sourcefn by_ref(&mut self) -> &mut Self
fn by_ref(&mut self) -> &mut Self
Borrows an iterator, rather than consuming it. Read more
1.0.0 · sourcefn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
Transforms an iterator into a collection. Read more
sourcefn try_collect<B>(
&mut self
) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType where
B: FromIterator<<Self::Item as Try>::Output>,
Self::Item: Try,
<Self::Item as Try>::Residual: Residual<B>,
fn try_collect<B>(
&mut self
) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType where
B: FromIterator<<Self::Item as Try>::Output>,
Self::Item: Try,
<Self::Item as Try>::Residual: Residual<B>,
iterator_try_collect
)Fallibly transforms an iterator into a collection, short circuiting if a failure is encountered. Read more
sourcefn collect_into<E>(self, collection: &mut E) -> &mut E where
E: Extend<Self::Item>,
fn collect_into<E>(self, collection: &mut E) -> &mut E where
E: Extend<Self::Item>,
iter_collect_into
)Collects all the items from an iterator into a collection. Read more
1.0.0 · sourcefn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: for<'_> FnMut(&Self::Item) -> bool,
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: for<'_> FnMut(&Self::Item) -> bool,
Consumes an iterator, creating two collections from it. Read more
sourcefn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
T: 'a,
Self: DoubleEndedIterator<Item = &'a mut T>,
P: for<'_> FnMut(&T) -> bool,
fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
T: 'a,
Self: DoubleEndedIterator<Item = &'a mut T>,
P: for<'_> FnMut(&T) -> bool,
iter_partition_in_place
)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
sourcefn is_partitioned<P>(self, predicate: P) -> bool where
P: FnMut(Self::Item) -> bool,
fn is_partitioned<P>(self, predicate: P) -> bool where
P: FnMut(Self::Item) -> bool,
iter_is_partitioned
)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
1.27.0 · sourcefn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Output = B>,
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Output = B>,
An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more
1.27.0 · sourcefn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Output = ()>,
fn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Output = ()>,
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
1.0.0 · sourcefn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
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
1.51.0 · sourcefn reduce<F>(self, f: F) -> Option<Self::Item> where
F: FnMut(Self::Item, Self::Item) -> Self::Item,
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
sourcefn try_reduce<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType where
F: FnMut(Self::Item, Self::Item) -> R,
R: Try<Output = Self::Item>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
fn try_reduce<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType where
F: FnMut(Self::Item, Self::Item) -> R,
R: Try<Output = Self::Item>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
iterator_try_reduce
)Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · sourcefn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
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
1.0.0 · sourcefn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
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
1.0.0 · sourcefn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: for<'_> FnMut(&Self::Item) -> bool,
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: for<'_> FnMut(&Self::Item) -> bool,
Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · sourcefn find_map<B, F>(&mut self, f: F) -> Option<B> where
F: FnMut(Self::Item) -> Option<B>,
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
sourcefn try_find<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType where
F: for<'_> FnMut(&Self::Item) -> R,
R: Try<Output = bool>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
fn try_find<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType where
F: for<'_> FnMut(&Self::Item) -> R,
R: Try<Output = bool>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
try_find
)Applies function to the elements of iterator and returns the first true result or the first error. Read more
1.0.0 · sourcefn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
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
1.0.0 · sourcefn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
Searches for an element in an iterator from the right, returning its index. Read more
1.0.0 · sourcefn max(self) -> Option<Self::Item> where
Self::Item: Ord,
fn max(self) -> Option<Self::Item> where
Self::Item: Ord,
Returns the maximum element of an iterator. Read more
1.0.0 · sourcefn min(self) -> Option<Self::Item> where
Self::Item: Ord,
fn min(self) -> Option<Self::Item> where
Self::Item: Ord,
Returns the minimum element of an iterator. Read more
1.6.0 · sourcefn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: for<'_> FnMut(&Self::Item) -> B,
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: for<'_> FnMut(&Self::Item) -> B,
Returns the element that gives the maximum value from the specified function. Read more
1.15.0 · sourcefn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: for<'_, '_> FnMut(&Self::Item, &Self::Item) -> Ordering,
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: for<'_, '_> FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
1.6.0 · sourcefn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: for<'_> FnMut(&Self::Item) -> B,
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: for<'_> FnMut(&Self::Item) -> B,
Returns the element that gives the minimum value from the specified function. Read more
1.15.0 · sourcefn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: for<'_, '_> FnMut(&Self::Item, &Self::Item) -> Ordering,
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: for<'_, '_> FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
1.0.0 · sourcefn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
Reverses an iterator’s direction. Read more
1.0.0 · sourcefn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · sourcefn copied<'a, T>(self) -> Copied<Self> where
T: 'a + Copy,
Self: Iterator<Item = &'a T>,
fn copied<'a, T>(self) -> Copied<Self> where
T: 'a + Copy,
Self: Iterator<Item = &'a T>,
Creates an iterator which copies all of its elements. Read more
1.0.0 · sourcefn cloned<'a, T>(self) -> Cloned<Self> where
T: 'a + Clone,
Self: Iterator<Item = &'a T>,
fn cloned<'a, T>(self) -> Cloned<Self> where
T: 'a + Clone,
Self: Iterator<Item = &'a T>,
1.0.0 · sourcefn cycle(self) -> Cycle<Self> where
Self: Clone,
fn cycle(self) -> Cycle<Self> where
Self: Clone,
Repeats an iterator endlessly. Read more
1.11.0 · sourcefn sum<S>(self) -> S where
S: Sum<Self::Item>,
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
Sums the elements of an iterator. Read more
1.11.0 · sourcefn product<P>(self) -> P where
P: Product<Self::Item>,
fn product<P>(self) -> P where
P: Product<Self::Item>,
Iterates over the entire iterator, multiplying all the elements Read more
1.5.0 · sourcefn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
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
sourcefn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
iter_order_by
)Lexicographically compares the elements of this Iterator
with those
of another with respect to the specified comparison function. Read more
1.5.0 · sourcefn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
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
sourcefn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
iter_order_by
)Lexicographically compares the elements of this Iterator
with those
of another with respect to the specified comparison function. Read more
1.5.0 · sourcefn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
sourcefn eq_by<I, F>(self, other: I, eq: F) -> bool where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
fn eq_by<I, F>(self, other: I, eq: F) -> bool where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
iter_order_by
)1.5.0 · sourcefn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0 · sourcefn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
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
1.5.0 · sourcefn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
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
1.5.0 · sourcefn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
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
1.5.0 · sourcefn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
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
sourcefn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,
fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,
is_sorted
)Checks if the elements of this iterator are sorted. Read more
sourcefn is_sorted_by<F>(self, compare: F) -> bool where
F: for<'_, '_> FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
fn is_sorted_by<F>(self, compare: F) -> bool where
F: for<'_, '_> FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
is_sorted
)Checks if the elements of this iterator are sorted using the given comparator function. Read more
sourcefn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
is_sorted
)Checks if the elements of this iterator are sorted using the given key extraction function. Read more
sourceimpl LowerHex for PerformanceDecreaseReason
impl LowerHex for PerformanceDecreaseReason
sourceimpl Not for PerformanceDecreaseReason
impl Not for PerformanceDecreaseReason
sourcefn not(self) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
fn not(self) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the complement of this set of flags.
type Output = PerformanceDecreaseReason
type Output = PerformanceDecreaseReason
The resulting type after applying the !
operator.
sourceimpl Octal for PerformanceDecreaseReason
impl Octal for PerformanceDecreaseReason
sourceimpl Ord for PerformanceDecreaseReason
impl Ord for PerformanceDecreaseReason
sourceimpl PartialEq<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl PartialEq<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn eq(&self, other: &PerformanceDecreaseReason) -> bool
fn eq(&self, other: &PerformanceDecreaseReason) -> bool
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
sourcefn ne(&self, other: &PerformanceDecreaseReason) -> bool
fn ne(&self, other: &PerformanceDecreaseReason) -> bool
This method tests for !=
.
sourceimpl PartialOrd<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl PartialOrd<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn partial_cmp(&self, other: &PerformanceDecreaseReason) -> Option<Ordering>
fn partial_cmp(&self, other: &PerformanceDecreaseReason) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
sourceimpl Serialize for PerformanceDecreaseReason
impl Serialize for PerformanceDecreaseReason
sourcefn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
__S: Serializer,
Serialize this value into the given Serde serializer. Read more
sourceimpl Sub<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl Sub<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn sub(self, other: PerformanceDecreaseReason) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
fn sub(self, other: PerformanceDecreaseReason) -> PerformanceDecreaseReasonⓘNotable traits for PerformanceDecreaseReasonimpl Iterator for PerformanceDecreaseReason type Item = PerformanceDecreaseReason;
Returns the set difference of the two sets of flags.
type Output = PerformanceDecreaseReason
type Output = PerformanceDecreaseReason
The resulting type after applying the -
operator.
sourceimpl SubAssign<PerformanceDecreaseReason> for PerformanceDecreaseReason
impl SubAssign<PerformanceDecreaseReason> for PerformanceDecreaseReason
sourcefn sub_assign(&mut self, other: PerformanceDecreaseReason)
fn sub_assign(&mut self, other: PerformanceDecreaseReason)
Disables all flags enabled in the set.
sourceimpl UpperHex for PerformanceDecreaseReason
impl UpperHex for PerformanceDecreaseReason
impl Copy for PerformanceDecreaseReason
impl Eq for PerformanceDecreaseReason
impl StructuralEq for PerformanceDecreaseReason
impl StructuralPartialEq for PerformanceDecreaseReason
Auto Trait Implementations
impl RefUnwindSafe for PerformanceDecreaseReason
impl Send for PerformanceDecreaseReason
impl Sync for PerformanceDecreaseReason
impl Unpin for PerformanceDecreaseReason
impl UnwindSafe for PerformanceDecreaseReason
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more