Struct declarative_dataflow::server::Context

pub struct Context<T> where
    T: Timestamp + Lattice,  {
    pub rules: HashMap<Aid, Rule>,
    pub underconstrained: HashSet<Aid>,
    pub internal: Domain<T>,
}

Implementation context.

Fields

rules: HashMap<Aid, Rule>

Representation of named rules.

underconstrained: HashSet<Aid>

Set of rules known to be underconstrained.

internal: Domain<T>

Internal domain of command sequence numbers.

Trait Implementations

impl<T> ImplContext<T> for Context<T> where
    T: Timestamp + Lattice, 

fn rule(&self, name: &str) -> Option<&Rule>

Returns the definition for the rule of the given name.

fn global_arrangement(&mut self, name: &str) -> Option<&mut RelationHandle<T>>

Returns a mutable reference to a (non-base) relation, if one is registered under the given name.

fn has_attribute(&self, name: &str) -> bool

Checks whether an attribute of that name exists.

fn forward_count(
    &mut self,
    name: &str
) -> Option<&mut TraceKeyHandle<Value, T, isize>>

Retrieves the forward count trace for the specified aid.

fn forward_propose(
    &mut self,
    name: &str
) -> Option<&mut TraceValHandle<Value, Value, T, isize>>

Retrieves the forward propose trace for the specified aid.

fn forward_validate(
    &mut self,
    name: &str
) -> Option<&mut TraceKeyHandle<(Value, Value), T, isize>>

Retrieves the forward validate trace for the specified aid.

fn reverse_count(
    &mut self,
    name: &str
) -> Option<&mut TraceKeyHandle<Value, T, isize>>

Retrieves the reverse count trace for the specified aid.

fn reverse_propose(
    &mut self,
    name: &str
) -> Option<&mut TraceValHandle<Value, Value, T, isize>>

Retrieves the reverse propose trace for the specified aid.

fn reverse_validate(
    &mut self,
    name: &str
) -> Option<&mut TraceKeyHandle<(Value, Value), T, isize>>

Retrieves the reverse validate trace for the specified aid.

fn is_underconstrained(&self, _name: &str) -> bool

Returns the current opinion as to whether this rule is underconstrained. Underconstrained rules cannot be safely materialized and re-used on their own (i.e. without more specific constraints).