Struct linkspace::misc::TreeEntry

pub struct TreeEntry<K = Vec<u8>, V = [u8; 52]> {
    pub btree_key: TreeKey<K>,
    pub val: V,
}

‘tree’ index order is a Ord of NetPkts defined by the order of the tuple ( group, domain, space_depth, spacename, pubkey, create stamp, hash ) A wrapper around TreeKey ( see [[TreeKey::from_fields]] ) and [[TreeValue]] This is the key/value by which packets are saved in the tree index.

Fields

btree_key: TreeKey<K>

val: V

Implementations

impl TreeEntry

pub fn from_pkt(rstamp: U64, pkt: impl NetPkt) -> Option<TreeEntry>

impl<'a> TreeEntry<&'a [u8], &'a [u8; 52]>

pub fn from_db(_: (&'a [u8], &'a [u8; 52])) -> TreeEntry<&'a [u8], &'a [u8; 52]>

pub fn to_owned(&self) -> TreeEntry

impl<K, V> TreeEntry<K, V>where K: AsRef<[u8]>,

pub fn btree_key(&self) -> TreeKey<&[u8]>

impl<K, V> TreeEntry<K, V>where V: AsRef<[u8]>,

pub fn local_log_ptr(&self) -> U64

pub fn hash(&self) -> B64

pub fn create(&self) -> U64

pub fn data_size(&self) -> U16

pub fn links_len(&self) -> U16

Trait Implementations

impl<K, V> Clone for TreeEntry<K, V>where K: Clone, V: Clone,

fn clone(&self) -> TreeEntry<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for TreeEntry<K, V>where K: AsRef<[u8]>, V: AsRef<[u8]>,

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

Formats the value using the given formatter.

impl<'de, K, V> Deserialize<'de> for TreeEntry<K, V>where K: Deserialize<'de>, V: Deserialize<'de>,

fn deserialize<__D>( __deserializer: __D ) -> Result<TreeEntry<K, V>, <__D as Deserializer<'de>>::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K, V> Display for TreeEntry<K, V>where K: AsRef<[u8]>, V: AsRef<[u8]>,

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

Formats the value using the given formatter.

impl<K, V> PartialEq for TreeEntry<K, V>where K: PartialEq, V: PartialEq,

fn eq(&self, other: &TreeEntry<K, V>) -> 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<K, V> PartialOrd for TreeEntry<K, V>where K: PartialOrd, V: PartialOrd,

fn partial_cmp(&self, other: &TreeEntry<K, V>) -> 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<K, V> Serialize for TreeEntry<K, V>where K: Serialize, V: Serialize,

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

Serialize this value into the given Serde serializer.

impl<K, V> Copy for TreeEntry<K, V>where K: Copy, V: Copy,

impl<K, V> StructuralPartialEq for TreeEntry<K, V>