Struct Ptr 

pub struct Ptr { /* private fields */ }

Description

The Official Pseudo Pointer type for this module

comments

• Most of the collections are vector-based or ‘arena based’ because they are:
  • Easy to serialize
  • Cache local
  • less likely to segfault when bounds checks are off
  • easier to implement

Implementations

impl Ptr

pub fn as_usize(&self) -> usize

pub const fn null() -> Self

pub fn is_null(&self) -> bool

Trait Implementations

impl<T> Add<T> for Ptr

where i64: From<T>,

type Output = Ptr

The resulting type after applying the + operator.

fn add(self, rhs: T) -> Self::Output

Performs the + operation.

impl<T> AddAssign<T> for Ptr

where i64: From<T>,

fn add_assign(&mut self, rhs: T)

Performs the += operation.

impl Clone for Ptr

fn clone(&self) -> Ptr

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Ptr

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

Formats the value using the given formatter.

impl Default for Ptr

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Ptr

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for Ptr

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

Formats the value using the given formatter.

impl From<usize> for Ptr

fn from(idx: usize) -> Self

Converts to this type from the input type.

impl Hash for Ptr

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<T> Index<Ptr> for BinaryTree<T>

type Output = BinNode<T>

The returned type after indexing.

fn index(&self, index: Ptr) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<NodeType> Index<Ptr> for DoublyLinkedList<NodeType>

type Output = NodeType

The returned type after indexing.

fn index(&self, index: Ptr) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T> Index<Ptr> for NaryForest<T>

type Output = NaryNode<T>

The returned type after indexing.

fn index(&self, ptr: Ptr) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T> Index<Ptr> for Vec<T>

type Output = T

The returned type after indexing.

fn index(&self, index: Ptr) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T> IndexMut<Ptr> for BinaryTree<T>

fn index_mut(&mut self, index: Ptr) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<NodeType> IndexMut<Ptr> for DoublyLinkedList<NodeType>

fn index_mut(&mut self, index: Ptr) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<T> IndexMut<Ptr> for NaryForest<T>

fn index_mut(&mut self, ptr: Ptr) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<T> IndexMut<Ptr> for Vec<T>

fn index_mut(&mut self, index: Ptr) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl PartialEq for Ptr

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for Ptr

impl Eq for Ptr

impl StructuralPartialEq for Ptr