Struct VmSet 

pub struct VmSet { /* private fields */ }

Backing store for VmValue::Set.

A Harn set is an ordered collection that deduplicates by structural equality. Membership used to be answered by rebuilding a HashSet<String> of structural hash keys from the backing Vec on every contains / union / intersect / … call — O(n) work (plus an allocation) per query. VmSet keeps that index resident alongside the items, so membership is O(1) and the set-algebra builtins drop from rebuild-per-call to a single key computation per probe.

Invariants:

• keys holds exactly one entry per item: value_structural_hash_key(item).
• Insertion order is preserved in items (iteration, display, and serialization are order-stable); equality and hashing stay order-independent, matching the language spec.

Implementations

impl VmSet

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn insert(&mut self, value: VmValue) -> bool

Insert value, returning true when it was newly added (its structural key was not already present).

pub fn contains(&self, value: &VmValue) -> bool

O(1) membership test by structural equality.

pub fn remove(&mut self, value: &VmValue) -> bool

Remove value if present, returning true when it was removed.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> Iter<'_, VmValue>

pub fn items(&self) -> &[VmValue]

pub fn shared_items(&self) -> Arc<Vec<VmValue>>

The shared backing buffer, for iterators that walk a set without copying its elements (a refcount bump rather than an O(n) clone).

pub fn into_items(self) -> Vec<VmValue>

Consume the set, yielding its items in insertion order. Used by the iterative teardown path so deeply nested sets drop without recursing.

pub fn union(&self, other: &VmSet) -> VmSet

self ∪ other, preserving self’s order then other’s new items.

pub fn intersect(&self, other: &VmSet) -> VmSet

self ∩ other — items of self also present in other.

pub fn difference(&self, other: &VmSet) -> VmSet

self \ other — items of self not present in other.

pub fn symmetric_difference(&self, other: &VmSet) -> VmSet

self △ other — items in exactly one of the two sets.

pub fn is_subset(&self, other: &VmSet) -> bool

pub fn is_superset(&self, other: &VmSet) -> bool

pub fn is_disjoint(&self, other: &VmSet) -> bool

pub fn sorted_keys(&self) -> Vec<&str>

Structural keys in sorted order. Backs the order-independent set hash in value_structural_hash_key without re-deriving a key per element.

Trait Implementations

impl Clone for VmSet

fn clone(&self) -> VmSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for VmSet

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

Formats the value using the given formatter.

impl Default for VmSet

fn default() -> VmSet

Returns the “default value” for a type.

impl FromIterator<VmValue> for VmSet

fn from_iter<I: IntoIterator<Item = VmValue>>(iter: I) -> Self

Creates a value from an iterator.

impl<'a> IntoIterator for &'a VmSet

type Item = &'a VmValue

The type of the elements being iterated over.

type IntoIter = Iter<'a, VmValue>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.