Struct GraphHandle 

#[repr(transparent)]
pub struct GraphHandle(pub Handle);

Handle to a kernel-resident graph store.

Tuple Fields

0: Handle

Implementations

impl GraphHandle

pub const fn new(id: u32, generation: u32) -> Self

Creates a new graph handle.

pub const fn null() -> Self

Creates a null (invalid) graph handle.

pub const fn is_null(&self) -> bool

Checks if this handle is null.

pub const fn raw(&self) -> Handle

Returns the raw handle.

Trait Implementations

impl Clone for GraphHandle

fn clone(&self) -> GraphHandle

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphHandle

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

Formats the value using the given formatter.

impl Default for GraphHandle

fn default() -> Self

Returns the “default value” for a type.

impl Hash for GraphHandle

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 PartialEq for GraphHandle

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

impl Eq for GraphHandle

impl StructuralPartialEq for GraphHandle