Struct BTreeNodeId 

#[repr(transparent)]
pub struct BTreeNodeId(pub u64);

Node ID for B+ tree nodes (internal and leaf nodes).

B+ tree nodes form a hierarchical structure with internal nodes containing keys and child pointers, and leaf nodes containing the actual key-value pairs.

Tuple Fields

0: u64

Implementations

impl BTreeNodeId

pub const fn new(id: u64) -> BTreeNodeId

Create a new BTreeNodeId

pub const fn get(self) -> u64

Get the raw u64 value

Trait Implementations

impl Clone for BTreeNodeId

fn clone(&self) -> BTreeNodeId

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BTreeNodeId

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

Formats the value using the given formatter.

impl Default for BTreeNodeId

fn default() -> BTreeNodeId

Returns the “default value” for a type.

impl Display for BTreeNodeId

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

Formats the value using the given formatter.

impl From<u64> for BTreeNodeId

fn from(id: u64) -> BTreeNodeId

Converts to this type from the input type.

impl Hash for BTreeNodeId

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

where __H: Hasher,

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 BTreeNodeId

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

fn eq(&self, other: &BTreeNodeId) -> 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 BTreeNodeId

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

impl Eq for BTreeNodeId

impl StructuralPartialEq for BTreeNodeId