Trait Table 

pub trait Table: RuntimeObject {
    // Required methods
    fn backend_symbol(&self) -> Symbol;
    fn get(&self, cx: &mut Cx, key: Symbol) -> Result<Value>;
    fn set(&self, cx: &mut Cx, key: Symbol, value: Value) -> Result<()>;
    fn has(&self, cx: &mut Cx, key: Symbol) -> Result<bool>;
    fn del(&self, cx: &mut Cx, key: Symbol) -> Result<Value>;
    fn keys(&self, cx: &mut Cx) -> Result<Vec<Symbol>>;
    fn entries(&self, cx: &mut Cx) -> Result<Vec<(Symbol, Value)>>;
    fn len(&self, cx: &mut Cx) -> Result<usize>;
    fn clear(&self, cx: &mut Cx) -> Result<()>;

    // Provided methods
    fn is_empty(&self, cx: &mut Cx) -> Result<bool> { ... }
    fn compare_exchange(
        &self,
        _cx: &mut Cx,
        _key: Symbol,
        _expected: TableExpected,
        _replacement: TableReplacement,
    ) -> Result<TableCompareExchange> { ... }
    fn as_table_expr(&self, cx: &mut Cx) -> Result<Expr> { ... }
    fn table_eq(&self, cx: &mut Cx, other: &dyn Table) -> Result<bool> { ... }
}

Universal map surface. Keys are symbols; values are runtime values.

Required Methods

fn backend_symbol(&self) -> Symbol

Symbol identifying the backend representation.

fn get(&self, cx: &mut Cx, key: Symbol) -> Result<Value>

Looks up key, returning nil when absent.

fn set(&self, cx: &mut Cx, key: Symbol, value: Value) -> Result<()>

Inserts or replaces the value for key.

fn has(&self, cx: &mut Cx, key: Symbol) -> Result<bool>

Whether key is present.

fn del(&self, cx: &mut Cx, key: Symbol) -> Result<Value>

Removes key, returning its prior value or nil.

fn keys(&self, cx: &mut Cx) -> Result<Vec<Symbol>>

All keys, in backend order.

fn entries(&self, cx: &mut Cx) -> Result<Vec<(Symbol, Value)>>

All key/value pairs, in backend order.

fn len(&self, cx: &mut Cx) -> Result<usize>

Number of entries.

fn clear(&self, cx: &mut Cx) -> Result<()>

Removes all entries.

Provided Methods

fn is_empty(&self, cx: &mut Cx) -> Result<bool>

Whether the table has no entries.

fn compare_exchange( &self, _cx: &mut Cx, _key: Symbol, _expected: TableExpected, _replacement: TableReplacement, ) -> Result<TableCompareExchange>

Atomically replaces key iff its state equals expected.

Equality is canonical semantic Expr equality. Implementations must establish one linearization point or honestly report unsupported.

fn as_table_expr(&self, cx: &mut Cx) -> Result<Expr>

Projects the table to an Expr::Map.

fn table_eq(&self, cx: &mut Cx, other: &dyn Table) -> Result<bool>

Order-insensitive equality against another table’s entries.

Dyn Compatibility

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementors

impl Table for AssocTable

impl Table for CatalogDirView

impl Table for CatalogTable

impl Table for CatalogTableView