Struct WidgetId 

pub struct WidgetId(/* private fields */);

Identifies one node in the widget tree.

The id stays valid for as long as the node lives and is never reused for a different node, so an id whose node was removed refers to nothing. Every operation that takes one reports that rather than acting on another node.

Implementations

impl WidgetId

pub fn as_u64(self) -> u64

Returns the raw representation of the id.

An accessibility backend identifies its nodes by u64, so the projection maps ids through this conversion. The raw value of two live ids is always different, and a value this tree never handed out restores to an id that names no node.

pub fn from_u64(raw: u64) -> WidgetId

Restores the id that WidgetId::as_u64 encoded.

An id whose node was removed already, or one that names no node at all, is a no-op everywhere the tree takes it.

Trait Implementations

impl Clone for WidgetId

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for WidgetId

impl Debug for WidgetId

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

Formats the value using the given formatter.

impl Default for WidgetId

fn default() -> Self

Returns the “default value” for a type.

impl Eq for WidgetId

impl From<KeyData> for WidgetId

fn from(k: KeyData) -> Self

Converts to this type from the input type.

impl Hash for WidgetId

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Key for WidgetId

fn data(&self) -> KeyData

Gets the KeyData stored in this key.

fn null() -> Self

Creates a new key that is always invalid and distinct from any non-null key. A null key can only be created through this method (or default initialization of keys made with new_key_type!, which calls this method).

fn is_null(&self) -> bool

Checks if a key is null. There is only a single null key, that is a.is_null() && b.is_null() implies a == b.

impl Ord for WidgetId

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

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

Restrict a value to a certain range.

impl PartialEq for WidgetId

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl PartialOrd for WidgetId

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

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

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

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

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

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

impl StructuralPartialEq for WidgetId