Struct PokeSet 

pub struct PokeSet<'mem, 'facet> { /* private fields */ }

Lets you mutate a set (implements mutable facet_core::SetVTable proxies)

Implementations

impl<'mem, 'facet> PokeSet<'mem, 'facet>

pub const unsafe fn new(value: Poke<'mem, 'facet>, def: SetDef) -> Self

Creates a new poke set

Safety

The caller must ensure that def contains valid vtable function pointers that:

• Correctly implement the set operations for the actual type
• Do not cause undefined behavior when called
• Return pointers within valid memory bounds
• Match the element type specified in def.t()

Violating these requirements can lead to memory safety issues.

pub fn len(&self) -> usize

Get the number of entries in the set

pub fn is_empty(&self) -> bool

Returns true if the set is empty

pub fn contains(&self, value: &impl Facet<'facet>) -> Result<bool, ReflectError>

Check if the set contains a value

pub fn contains_peek( &self, value: Peek<'_, 'facet>, ) -> Result<bool, ReflectError>

Check if the set contains a value (using a Peek)

pub fn insert<T: Facet<'facet>>( &mut self, value: T, ) -> Result<bool, ReflectError>

Insert a value into the set. Returns true if the value was newly inserted, false if it was already present.

pub fn insert_from_heap<const BORROW: bool>( &mut self, value: HeapValue<'facet, BORROW>, ) -> Result<bool, ReflectError>

Type-erased insert.

Accepts a HeapValue whose shape must match the set’s element type. The value is moved into the set. Returns true if the value was newly inserted.

pub fn iter(&self) -> PeekSetIter<'_, 'facet>

Returns an iterator over the values in the set (read-only).

pub const fn def(&self) -> SetDef

Def getter

pub fn into_inner(self) -> Poke<'mem, 'facet>

Converts this PokeSet back into a Poke

pub fn as_peek_set(&self) -> PeekSet<'_, 'facet>

Returns a read-only PeekSet view

Trait Implementations

impl<'mem, 'facet> Debug for PokeSet<'mem, 'facet>

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

Formats the value using the given formatter.