Struct nvapi_hi::sys::gpu::display::DisplayIdsFlags

pub struct DisplayIdsFlags { /* fields omitted */ }

Bitfield in NV_GPU_DISPLAYIDS

Methods

impl DisplayIdsFlags

pub const DYNAMIC: DisplayIdsFlags

DYNAMIC: DisplayIdsFlags = DisplayIdsFlags{bits: 1,}

This display is part of MST topology and it's a dynamic

pub const MST_ROOT_NODE: DisplayIdsFlags

MST_ROOT_NODE: DisplayIdsFlags = DisplayIdsFlags{bits: 2,}

This displayID belongs to a multi stream enabled connector(root node). Note that when multi stream is enabled and a single multi stream capable monitor is connected to it, the monitor will share the display id with the RootNode.

pub const ACTIVE: DisplayIdsFlags

ACTIVE: DisplayIdsFlags = DisplayIdsFlags{bits: 4,}

This display is being actively driven

pub const CLUSTER: DisplayIdsFlags

CLUSTER: DisplayIdsFlags = DisplayIdsFlags{bits: 8,}

This display is the representative display

pub const OS_VISIBLE: DisplayIdsFlags

OS_VISIBLE: DisplayIdsFlags = DisplayIdsFlags{bits: 16,}

This display is reported to the OS

pub const WIRELESS: DisplayIdsFlags

WIRELESS: DisplayIdsFlags = DisplayIdsFlags{bits: 32,}

This display is wireless

pub const CONNECTED: DisplayIdsFlags

CONNECTED: DisplayIdsFlags = DisplayIdsFlags{bits: 64,}

This display is connected

pub const RESERVED_INTERNAL: DisplayIdsFlags

RESERVED_INTERNAL: DisplayIdsFlags = DisplayIdsFlags{bits: 130944,}

Do not use

pub const PHYSICALLY_CONNECTED: DisplayIdsFlags

PHYSICALLY_CONNECTED: DisplayIdsFlags = DisplayIdsFlags{bits: 131072,}

this display is a phycially connected display; Valid only when is Connected bit is set

pub const RESERVED: DisplayIdsFlags

RESERVED: DisplayIdsFlags = DisplayIdsFlags{bits: 4294705152u32,}

must be zero

Important traits for DisplayIdsFlags

impl Iterator for DisplayIdsFlags type Item = DisplayIdsFlags;

pub fn empty() -> DisplayIdsFlags

Returns an empty set of flags.

Important traits for DisplayIdsFlags

impl Iterator for DisplayIdsFlags type Item = DisplayIdsFlags;

pub fn all() -> DisplayIdsFlags

Returns the set containing all flags.

pub fn bits(&self) -> u32

Returns the raw value of the flags currently stored.

pub fn from_bits(bits: u32) -> Option<DisplayIdsFlags>

Convert from underlying bit representation, unless that representation contains bits that do not correspond to a flag.

Important traits for DisplayIdsFlags

impl Iterator for DisplayIdsFlags type Item = DisplayIdsFlags;

pub fn from_bits_truncate(bits: u32) -> DisplayIdsFlags

Convert from underlying bit representation, dropping any bits that do not correspond to flags.

pub fn is_empty(&self) -> bool

Returns true if no flags are currently stored.

pub fn is_all(&self) -> bool

Returns true if all flags are currently set.

pub fn intersects(&self, other: DisplayIdsFlags) -> bool

Returns true if there are flags common to both self and other.

pub fn contains(&self, other: DisplayIdsFlags) -> bool

Returns true all of the flags in other are contained within self.

pub fn insert(&mut self, other: DisplayIdsFlags)

Inserts the specified flags in-place.

pub fn remove(&mut self, other: DisplayIdsFlags)

Removes the specified flags in-place.

pub fn toggle(&mut self, other: DisplayIdsFlags)

Toggles the specified flags in-place.

pub fn set(&mut self, other: DisplayIdsFlags, value: bool)

Inserts or removes the specified flags depending on the passed value.

Trait Implementations

impl Sub<DisplayIdsFlags> for DisplayIdsFlags

type Output = DisplayIdsFlags

Important traits for DisplayIdsFlags

impl Iterator for DisplayIdsFlags type Item = DisplayIdsFlags;

fn sub(self, other: DisplayIdsFlags) -> DisplayIdsFlags

Returns the set difference of the two sets of flags.

impl Iterator for DisplayIdsFlags

type Item = DisplayIdsFlags

The type of the elements being iterated over.

fn next(&mut self) -> Option<<DisplayIdsFlags as Iterator>::Item>

Advances the iterator and returns the next value.

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

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

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

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

Consumes the iterator, returning the last element.

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

Returns the nth element of the iterator.

Important traits for StepBy<I>

impl<I> Iterator for StepBy<I> where
    I: Iterator,  type Item = <I as Iterator>::Item;

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

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

unstable replacement of Range::step_by

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

Important traits for Chain<A, B>

impl<A, B> Iterator for Chain<A, B> where
    A: Iterator,
    B: Iterator<Item = <A as Iterator>::Item>,  type Item = <A as Iterator>::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.

Important traits for Zip<A, B>

impl<A, B> Iterator for Zip<A, B> where
    A: Iterator,
    B: Iterator,  type Item = (<A as Iterator>::Item, <B as Iterator>::Item);

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.

Important traits for Map<I, F>

impl<B, I, F> Iterator for Map<I, F> where
    F: FnMut(<I as Iterator>::Item) -> B,
    I: Iterator,  type 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.

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

Calls a closure on each element of an iterator.

Important traits for Filter<I, P>

impl<I, P> Iterator for Filter<I, P> where
    I: Iterator,
    P: FnMut(&<I as Iterator>::Item) -> bool,  type Item = <I as Iterator>::Item;

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.

Important traits for FilterMap<I, F>

impl<B, I, F> Iterator for FilterMap<I, F> where
    F: FnMut(<I as Iterator>::Item) -> Option<B>,
    I: Iterator,  type Item = 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.

Important traits for Enumerate<I>

impl<I> Iterator for Enumerate<I> where
    I: Iterator,  type Item = (usize, <I as Iterator>::Item);

fn enumerate(self) -> Enumerate<Self>

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

Important traits for Peekable<I>

impl<I> Iterator for Peekable<I> where
    I: Iterator,  type Item = <I as Iterator>::Item;

fn peekable(self) -> Peekable<Self>

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

Important traits for SkipWhile<I, P>

impl<I, P> Iterator for SkipWhile<I, P> where
    I: Iterator,
    P: FnMut(&<I as Iterator>::Item) -> bool,  type Item = <I as Iterator>::Item;

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

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

Important traits for TakeWhile<I, P>

impl<I, P> Iterator for TakeWhile<I, P> where
    I: Iterator,
    P: FnMut(&<I as Iterator>::Item) -> bool,  type Item = <I as Iterator>::Item;

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.

Important traits for Skip<I>

impl<I> Iterator for Skip<I> where
    I: Iterator,  type Item = <I as Iterator>::Item;

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

Creates an iterator that skips the first n elements.

Important traits for Take<I>

impl<I> Iterator for Take<I> where
    I: Iterator,  type Item = <I as Iterator>::Item;

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

Creates an iterator that yields its first n elements.

Important traits for Scan<I, St, F>

impl<B, I, St, F> Iterator for Scan<I, St, F> where
    F: FnMut(&mut St, <I as Iterator>::Item) -> Option<B>,
    I: Iterator,  type Item = B;

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.

Important traits for FlatMap<I, U, F>

impl<I, U, F> Iterator for FlatMap<I, U, F> where
    F: FnMut(<I as Iterator>::Item) -> U,
    I: Iterator,
    U: IntoIterator,  type Item = <U as IntoIterator>::Item;

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.

Important traits for Fuse<I>

impl<I> Iterator for Fuse<I> where
    I: FusedIterator, impl<I> Iterator for Fuse<I> where
    I: Iterator,  type Item = <I as Iterator>::Item;

fn fuse(self) -> Fuse<Self>

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

Important traits for Inspect<I, F>

impl<I, F> Iterator for Inspect<I, F> where
    F: FnMut(&<I as Iterator>::Item) -> (),
    I: Iterator,  type Item = <I as Iterator>::Item;

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

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

Important traits for &'a mut I

impl<'a, I> Iterator for &'a mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

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

Borrows an iterator, rather than consuming it.

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

Transforms an iterator into a collection.

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

Consumes an iterator, creating two collections from it.

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

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

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

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

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

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

Tests if every element of the iterator matches a predicate.

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

Tests if any element of the iterator matches a predicate.

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.

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.

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.

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

Returns the maximum element of an iterator.

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

Returns the minimum element of an iterator.

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

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

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.

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

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

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.

Important traits for Rev<I>

impl<I> Iterator for Rev<I> where
    I: DoubleEndedIterator,  type Item = <I as Iterator>::Item;

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

Reverses an iterator's direction.

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.

Important traits for Cloned<I>

impl<'a, I, T> Iterator for Cloned<I> where
    I: Iterator<Item = &'a T>,
    T: 'a + Clone,  type Item = T;

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

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

Important traits for Cycle<I>

impl<I> Iterator for Cycle<I> where
    I: Clone + Iterator,  type Item = <I as Iterator>::Item;

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

Repeats an iterator endlessly.

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

Sums the elements of an iterator.

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

Iterates over the entire iterator, multiplying all the elements

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.

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.

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.

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.

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.

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.

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.

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.

impl Debug for DisplayIdsFlags

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

impl BitAndAssign<DisplayIdsFlags> for DisplayIdsFlags

fn bitand_assign(&mut self, other: DisplayIdsFlags)

Disables all flags disabled in the set.

impl PartialOrd<DisplayIdsFlags> for DisplayIdsFlags

fn partial_cmp(&self, __arg_0: &DisplayIdsFlags) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, __arg_0: &DisplayIdsFlags) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, __arg_0: &DisplayIdsFlags) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, __arg_0: &DisplayIdsFlags) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, __arg_0: &DisplayIdsFlags) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl Ord for DisplayIdsFlags

fn cmp(&self, __arg_0: &DisplayIdsFlags) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

impl Copy for DisplayIdsFlags

impl Not for DisplayIdsFlags

type Output = DisplayIdsFlags

Important traits for DisplayIdsFlags

impl Iterator for DisplayIdsFlags type Item = DisplayIdsFlags;

fn not(self) -> DisplayIdsFlags

Returns the complement of this set of flags.

impl FromIterator<DisplayIdsFlags> for DisplayIdsFlags

Important traits for DisplayIdsFlags

impl Iterator for DisplayIdsFlags type Item = DisplayIdsFlags;

fn from_iter<T>(iterator: T) -> DisplayIdsFlags where
    T: IntoIterator<Item = DisplayIdsFlags>, 

impl BitOr<DisplayIdsFlags> for DisplayIdsFlags

type Output = DisplayIdsFlags

Important traits for DisplayIdsFlags

impl Iterator for DisplayIdsFlags type Item = DisplayIdsFlags;

fn bitor(self, other: DisplayIdsFlags) -> DisplayIdsFlags

Returns the union of the two sets of flags.

impl Serialize for DisplayIdsFlags

fn serialize<__S>(
    &self,
    __serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
    __S: Serializer, 

impl UpperHex for DisplayIdsFlags

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

impl Binary for DisplayIdsFlags

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

impl Clone for DisplayIdsFlags

Important traits for DisplayIdsFlags

impl Iterator for DisplayIdsFlags type Item = DisplayIdsFlags;

fn clone(&self) -> DisplayIdsFlags

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Extend<DisplayIdsFlags> for DisplayIdsFlags

fn extend<T>(&mut self, iterator: T) where
    T: IntoIterator<Item = DisplayIdsFlags>, 

impl Default for DisplayIdsFlags

Important traits for DisplayIdsFlags

impl Iterator for DisplayIdsFlags type Item = DisplayIdsFlags;

fn default() -> DisplayIdsFlags

impl PartialEq<DisplayIdsFlags> for DisplayIdsFlags

fn eq(&self, __arg_0: &DisplayIdsFlags) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &DisplayIdsFlags) -> bool

This method tests for !=.

impl BitXorAssign<DisplayIdsFlags> for DisplayIdsFlags

fn bitxor_assign(&mut self, other: DisplayIdsFlags)

Toggles the set of flags.

impl LowerHex for DisplayIdsFlags

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

impl BitOrAssign<DisplayIdsFlags> for DisplayIdsFlags

fn bitor_assign(&mut self, other: DisplayIdsFlags)

Adds the set of flags.

impl Eq for DisplayIdsFlags

impl Octal for DisplayIdsFlags

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

impl SubAssign<DisplayIdsFlags> for DisplayIdsFlags

fn sub_assign(&mut self, other: DisplayIdsFlags)

Disables all flags enabled in the set.

impl BitAnd<DisplayIdsFlags> for DisplayIdsFlags

type Output = DisplayIdsFlags

Important traits for DisplayIdsFlags

impl Iterator for DisplayIdsFlags type Item = DisplayIdsFlags;

fn bitand(self, other: DisplayIdsFlags) -> DisplayIdsFlags

Returns the intersection between the two sets of flags.

impl Hash for DisplayIdsFlags

fn hash<__H>(&self, __arg_0: &mut __H) where
    __H: Hasher, 

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl<'de> Deserialize<'de> for DisplayIdsFlags

fn deserialize<__D>(
    __deserializer: __D
) -> Result<DisplayIdsFlags, <__D as Deserializer<'de>>::Error> where
    __D: Deserializer<'de>, 

impl BitXor<DisplayIdsFlags> for DisplayIdsFlags

type Output = DisplayIdsFlags

Important traits for DisplayIdsFlags

impl Iterator for DisplayIdsFlags type Item = DisplayIdsFlags;

fn bitxor(self, other: DisplayIdsFlags) -> DisplayIdsFlags

Returns the left flags, but with all the right flags toggled.