Struct DataNode 

pub struct DataNode<'a> {
    pub _tab: Table<'a>,
}

Fields

_tab: Table<'a>

Implementations

impl<'a> DataNode<'a>

pub const VT_NODE_ID: VOffsetT = 4

pub const VT_NAME: VOffsetT = 6

pub const VT_SOURCE: VOffsetT = 8

pub const VT_CACHE_STRATEGY: VOffsetT = 10

pub const VT_STALE_TIME: VOffsetT = 12

pub const VT_CACHE_TIME: VOffsetT = 14

pub const VT_CACHE_TAGS: VOffsetT = 16

pub const VT_AUTH_REQUIRED: VOffsetT = 18

pub const VT_LOADING_STATE_MACHINE: VOffsetT = 20

pub const VT_QUERY_PARAMS: VOffsetT = 22

pub unsafe fn init_from_table(table: Table<'a>) -> Self

pub fn create<'bldr: 'args, 'args: 'mut_bldr, 'mut_bldr, A: Allocator + 'bldr>( _fbb: &'mut_bldr mut FlatBufferBuilder<'bldr, A>, args: &'args DataNodeArgs<'args>, ) -> WIPOffset<DataNode<'bldr>>

pub fn node_id(&self) -> &'a str

pub fn name(&self) -> Option<&'a str>

pub fn source(&self) -> DataSource<'a>

pub fn cache_strategy(&self) -> CacheStrategy

Cache behavior.

pub fn stale_time(&self) -> u32

How long data is considered fresh (ms).

pub fn cache_time(&self) -> u32

How long to keep unused data in cache (ms).

pub fn cache_tags(&self) -> Option<Vector<'a, ForwardsUOffset<&'a str>>>

Tags for invalidation (ActionNode references these).

pub fn auth_required(&self) -> bool

Whether this data requires authentication.

pub fn loading_state_machine(&self) -> Option<&'a str>

Reference to a StateMachine that tracks loading/error/success state.

pub fn query_params(&self) -> Option<Vector<'a, ForwardsUOffset<KeyValue<'a>>>>

Query parameters — filters, sort, pagination.

Trait Implementations

impl<'a> Clone for DataNode<'a>

fn clone(&self) -> DataNode<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DataNode<'_>

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

Formats the value using the given formatter.

impl<'a> Follow<'a> for DataNode<'a>

type Inner = DataNode<'a>

unsafe fn follow(buf: &'a [u8], loc: usize) -> Self::Inner

Safety

impl<'a> PartialEq for DataNode<'a>

fn eq(&self, other: &DataNode<'a>) -> 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 Verifiable for DataNode<'_>

fn run_verifier( v: &mut Verifier<'_, '_>, pos: usize, ) -> Result<(), InvalidFlatbuffer>

Runs the verifier for this type, assuming its at position pos in the verifier’s buffer. Should not need to be called directly.

impl<'a> Copy for DataNode<'a>

impl<'a> StructuralPartialEq for DataNode<'a>