Struct CNodeSlots 

pub struct CNodeSlots<O = Box<Cap>> { /* private fields */ }

Direct runtime slot map backing a CNode: Key -> CapHashOrRef<O>.

Stored as a sorted vector, not a BTreeMap: CNodes are usually tiny in the hot guest path, and avoiding per-entry tree-node allocations matters. The API is map-shaped and preserves strictly-ascending keys.

Implementations

impl<O> CNodeSlots<O>

pub fn new() -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn get(&self, key: &Key) -> Option<&MissingOr<CapHashOrRef<O>>>

pub fn insert( &mut self, key: Key, value: MissingOr<CapHashOrRef<O>>, ) -> Option<MissingOr<CapHashOrRef<O>>>

pub fn remove(&mut self, key: &Key) -> Option<MissingOr<CapHashOrRef<O>>>

pub fn iter(&self) -> impl Iterator<Item = (&Key, &MissingOr<CapHashOrRef<O>>)>

pub fn iter_mut( &mut self, ) -> impl Iterator<Item = (&Key, &mut MissingOr<CapHashOrRef<O>>)>

Trait Implementations

impl<O> Archive for CNodeSlots<O>

where Vec<(Key, MissingOr<CapHashOrRef<O>>)>: Archive,

type Archived = ArchivedCNodeSlots<O>

The archived representation of this type.

type Resolver = CNodeSlotsResolver<O>

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output.

const COPY_OPTIMIZATION: CopyOptimization<Self> = _

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

impl<O: Clone> Clone for CNodeSlots<O>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<O: Debug> Debug for CNodeSlots<O>

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

Formats the value using the given formatter.

impl<O> Default for CNodeSlots<O>

fn default() -> Self

Returns the “default value” for a type.

impl<__D: Fallible + ?Sized, O> Deserialize<CNodeSlots<O>, __D> for Archived<CNodeSlots<O>>

where Vec<(Key, MissingOr<CapHashOrRef<O>>)>: Archive, <Vec<(Key, MissingOr<CapHashOrRef<O>>)> as Archive>::Archived: Deserialize<Vec<(Key, MissingOr<CapHashOrRef<O>>)>, __D>,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<CNodeSlots<O>, <__D as Fallible>::Error>

Deserializes using the given deserializer

impl<__S: Fallible + ?Sized, O> Serialize<__S> for CNodeSlots<O>

where Vec<(Key, MissingOr<CapHashOrRef<O>>)>: Serialize<__S>,

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.