Struct ElementTreeId

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

Stable identity of one retained element tree.

ElementId values are only unique within a tree, so popup ownership always carries both identifiers. Zero is a valid compatibility namespace and no value is reserved by the type itself.

Examples

use ailloli_ui_runtime::popup::ElementTreeId;
assert_eq!(ElementTreeId::new(7).get(), 7);

Implementations

impl ElementTreeId

Construction and extraction for a retained-tree namespace.

pub const fn new(value: u64) -> Self

Wraps an arbitrary u64 without validation or allocation.

Examples

use ailloli_ui_runtime::popup::ElementTreeId;
assert_eq!(ElementTreeId::new(0).get(), 0);

pub const fn get(self) -> u64

Returns the exact stored integer.

Examples

use ailloli_ui_runtime::popup::ElementTreeId;
assert_eq!(ElementTreeId::new(u64::MAX).get(), u64::MAX);

Trait Implementations

impl Clone for ElementTreeId

fn clone(&self) -> ElementTreeId

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ElementTreeId

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

Formats the value using the given formatter.

impl Hash for ElementTreeId

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 Ord for ElementTreeId

fn cmp(&self, other: &ElementTreeId) -> 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.

impl PartialEq for ElementTreeId

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for ElementTreeId

fn partial_cmp(&self, other: &ElementTreeId) -> 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 Copy for ElementTreeId

impl Eq for ElementTreeId

impl StructuralPartialEq for ElementTreeId