Struct dharitri_wasm::storage::mappers::LinkedListNode

pub struct LinkedListNode<T: NestedEncode + NestedDecode + TopEncode + TopDecode + Clone> { /* private fields */ }

Implementations

impl<T: NestedEncode + NestedDecode + TopEncode + TopDecode + Clone> LinkedListNode<T>

pub fn get_value_cloned(&self) -> T

pub fn get_value_as_ref(&self) -> &T

pub fn into_value(self) -> T

pub fn get_node_id(&self) -> u32

pub fn get_next_node_id(&self) -> u32

pub fn get_prev_node_id(&self) -> u32

Trait Implementations

impl<T: Clone + NestedEncode + NestedDecode + TopEncode + TopDecode + Clone> Clone for LinkedListNode<T>

fn clone(&self) -> LinkedListNode<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: NestedEncode + NestedDecode + TopEncode + TopDecode + Clone> NestedDecode for LinkedListNode<T>

fn dep_decode<I: NestedDecodeInput>(input: &mut I) -> Result<Self, DecodeError>

Attempt to deserialise the value from input, using the format of an object nested inside another structure. In case of success returns the deserialized value and the number of bytes consumed during the operation.

fn dep_decode_or_exit<I: NestedDecodeInput, ExitCtx: Clone>( input: &mut I, c: ExitCtx, exit: fn(_: ExitCtx, _: DecodeError) -> ! ) -> Self

Version of top_decode that exits quickly in case of error. Its purpose is to create smaller implementations in cases where the application is supposed to exit directly on decode error.

impl<T: NestedEncode + NestedDecode + TopEncode + TopDecode + Clone> NestedEncode for LinkedListNode<T>

fn dep_encode<O: NestedEncodeOutput>( &self, dest: &mut O ) -> Result<(), EncodeError>

NestedEncode to output, using the format of an object nested inside another structure. Does not provide compact version.

fn dep_encode_or_exit<O: NestedEncodeOutput, ExitCtx: Clone>( &self, dest: &mut O, c: ExitCtx, exit: fn(_: ExitCtx, _: EncodeError) -> ! )

Version of top_decode that exits quickly in case of error. Its purpose is to create smaller implementations in cases where the application is supposed to exit directly on decode error.

impl<T: PartialEq + NestedEncode + NestedDecode + TopEncode + TopDecode + Clone> PartialEq for LinkedListNode<T>

fn eq(&self, other: &LinkedListNode<T>) -> 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<T: NestedEncode + NestedDecode + TopEncode + TopDecode + Clone> TopDecode for LinkedListNode<T>

fn top_decode<I: TopDecodeInput>(top_input: I) -> Result<Self, DecodeError>

Attempt to deserialize the value from input.

fn top_decode_or_exit<I: TopDecodeInput, ExitCtx: Clone>( top_input: I, c: ExitCtx, exit: fn(_: ExitCtx, _: DecodeError) -> ! ) -> Self

Version of top_decode that exits quickly in case of error. Its purpose is to create smaller implementations in cases where the application is supposed to exit directly on decode error.

impl<T: NestedEncode + NestedDecode + TopEncode + TopDecode + Clone> TopEncode for LinkedListNode<T>

fn top_encode<O: TopEncodeOutput>(&self, output: O) -> Result<(), EncodeError>

Attempt to serialize the value to ouput.

fn top_encode_or_exit<O: TopEncodeOutput, ExitCtx: Clone>( &self, output: O, c: ExitCtx, exit: fn(_: ExitCtx, _: EncodeError) -> ! )

Version of top_decode that exits quickly in case of error. Its purpose is to create smaller bytecode implementations in cases where the application is supposed to exit directly on decode error.

impl<T: Copy + NestedEncode + NestedDecode + TopEncode + TopDecode + Clone> Copy for LinkedListNode<T>

impl<T: NestedEncode + NestedDecode + TopEncode + TopDecode + Clone> StructuralPartialEq for LinkedListNode<T>