Struct redmaple::tree::id::ID

pub struct ID(_);

The Implementation of the ID that the crate uses

Example

For now, the implementation uses UUID v4 as the inner type.

use redmaple::tree::id::ID;
use uuid::Uuid;

let id = Uuid::new_v4();

assert_eq!(id, ID::new(id).inner());

assert_eq!(4usize, ID::new(id).inner().get_version_num());

We should make sure to insure that the ID::new() never outputs a nil (all zero) id.

use redmaple::tree::id::ID;

use uuid::Uuid;

let id = Uuid::new_v4();

assert!(!ID::new(id).inner().is_nil());

Of course all ID’s should be unique.

use redmaple::tree::id::ID;
use uuid::Uuid;

let id1 = Uuid::new_v4();
let id2 = Uuid::new_v4();


assert_ne!(ID::new(id1), ID::new(id2));

Implementations

impl ID

pub const fn new(id: Uuid) -> Self

creats a new instance of the ID

pub const fn inner(&self) -> Uuid

Returns the uuid of this ID.

Trait Implementations

impl Clone for ID

fn clone(&self) -> ID

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ID

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

Formats the value using the given formatter.

impl Default for ID

fn default() -> ID

Returns the “default value” for a type.

impl Display for ID

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

Formats the value using the given formatter.

impl Ord for ID

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

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<ID> for ID

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

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

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

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

impl PartialOrd<ID> for ID

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

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

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

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

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

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

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

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

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

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

impl Eq for ID

impl StructuralEq for ID

impl StructuralPartialEq for ID