Struct Dictionary 

pub struct Dictionary { /* private fields */ }

A key value based dictionary.

Implementations

impl Dictionary

pub fn len(&self) -> usize

The number of items in the dictionary.

pub fn is_empty(&self) -> bool

Returns true if the dictionary has no items.

pub fn keys(&self) -> &[KBox<Any>]

Gets a slice containing all the keys in this dictionary.

pub fn values(&self) -> &[KBox<Any>]

Gets a slice containing all the values in this dictionary.

pub fn insert(&mut self, key: impl Into<KBox<Any>>, value: impl Into<KBox<Any>>)

Insert a specified key and value at the end of the dictionary. No checks are done on uniqueness so duplicates are possible.

Examples found in repository

examples/using_dictionaries.rs (line 8)

fn main() {
    //Symbols use a lot of try_into. Sad.
    let mut dict = KBox::new_dict();

    dict.insert(symbol("One"), 1i32);
    dict.insert(symbol("Two"), 2i32);
    dict.insert(symbol("Three"), 3i32);

    println!("{:?}", cast!(&dict[symbol("Two")]; Atom<Symbol>));
}

pub fn get<T: Into<KBox<Any>>>(&self, key: T) -> Option<&KBox<Any>>

Gets a value by key. Note that KDB dictionaries are treated as unordered and hence this is an O(n) operation.

pub fn iter(&self) -> impl Iterator<Item = (&KBox<Any>, &KBox<Any>)>

An iterator through every value in the KDB object

Trait Implementations

impl AsRef<Any> for Dictionary

fn as_ref(&self) -> &Any

Converts this type into a shared reference of the (usually inferred) input type.

impl<T> Index<T> for Dictionary

where for<'a> T: Into<KBox<Any>>,

type Output = Any

The returned type after indexing.

fn index(&self, index: T) -> &Self::Output

Performs the indexing (container[index]) operation.