Struct Dictionary 

pub struct Dictionary {
    pub handle: Handle,
    pub owner: Handle,
    pub entries: Vec<(String, Handle)>,
    pub duplicate_cloning: i16,
    pub hard_owner: bool,
    pub reactors: Vec<Handle>,
    pub xdictionary_handle: Option<Handle>,
}

Dictionary object - stores key-value pairs of object handles

Fields

handle: Handle

Unique handle

owner: Handle

Owner handle (soft pointer)

entries: Vec<(String, Handle)>

Dictionary entries (key -> handle)

duplicate_cloning: i16

Duplicate record cloning flag

hard_owner: bool

Hard owner flag

reactors: Vec<Handle>

Reactor handles ({ACAD_REACTORS})

xdictionary_handle: Option<Handle>

Extended dictionary handle ({ACAD_XDICTIONARY})

Implementations

impl Dictionary

pub fn new() -> Self

Create a new dictionary

pub fn add_entry(&mut self, key: impl Into<String>, handle: Handle)

Add an entry to the dictionary

pub fn get(&self, key: &str) -> Option<Handle>

Get a handle by key

pub fn len(&self) -> usize

Get the number of entries

pub fn is_empty(&self) -> bool

Check if the dictionary is empty

Trait Implementations

impl Clone for Dictionary

fn clone(&self) -> Dictionary

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Dictionary

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

Formats the value using the given formatter.

impl Default for Dictionary

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for Dictionary

fn eq(&self, other: &Dictionary) -> 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 StructuralPartialEq for Dictionary