Struct LargeList

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

Same as List, but with 64-bit offsets, allowing to represent extremely large data values.

Fields

_tab: Table<'a>

Implementations

impl<'a> LargeList<'a>

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 LargeListArgs, ) -> WIPOffset<LargeList<'bldr>>

Trait Implementations

impl<'a> Clone for LargeList<'a>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for LargeList<'_>

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

Formats the value using the given formatter.

impl<'a> Follow<'a> for LargeList<'a>

type Inner = LargeList<'a>

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

Safety

impl<'a> PartialEq for LargeList<'a>

fn eq(&self, other: &LargeList<'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 LargeList<'_>

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 LargeList<'a>

impl<'a> StructuralPartialEq for LargeList<'a>