|
| | Subset (Oid enum_type_oid, Mode mode_) |
| const std::vector< Oid > & | label_oids () const |
| | The labels, in enumsortorder.
|
| virtual value_type | zero () const override |
| | Return the additive identity \(\mathbb{0}\).
|
| virtual value_type | one () const override |
| | Return the multiplicative identity \(\mathbb{1}\).
|
| virtual value_type | plus (const std::vector< value_type > &v) const override |
| | Apply the additive operation to a list of values.
|
| virtual value_type | times (const std::vector< value_type > &v) const override |
| | Apply the multiplicative operation to a list of values.
|
| virtual value_type | monus (value_type x, value_type y) const override |
| | Apply the monus (m-semiring difference) operation.
|
| virtual value_type | delta (value_type x) const override |
| | Apply the \(\delta\) operator.
|
| virtual bool | absorptive () const override |
| | Return true if this semiring is absorptive ( \(\mathbb{1} \oplus a = \mathbb{1}\) for all \(a\)).
|
| virtual bool | exclusive () const override |
| | Return true if the semiring is exclusive: \(a \otimes (\mathbb{1} \ominus a) = \mathbb{0}\).
|
| virtual bool | mul_idempotent () const override |
| | Return true if \(\otimes\) is idempotent: \(a \otimes a = a\).
|
| virtual bool | mul_sub_left_distributive () const override |
| | Return true if \(\otimes\) distributes over the monus on the left: \(a \otimes (b \ominus c) = (a \otimes b) \ominus
(a \otimes c)\) for all \(a, b, c\).
|
| virtual bool | compatibleWithBooleanRewrite () const override |
| | A Boolean algebra receives a homomorphism from the Boolean functions, so the safe-query rewriting is sound here.
|
| value_type | parse_leaf (const char *str) const |
| | Parse a mapping value: a single label, or an array of labels.
|
| virtual value_type | plus_of (const std::vector< const value_type * > &v) const |
| | plus over the values v points to, read in place.
|
| virtual value_type | times_of (const std::vector< const value_type * > &v) const |
| | times over the values v points to, read in place (see plus_of).
|
| virtual value_type | cmp (value_type s1, ComparisonOperator op, value_type s2) const |
| | Evaluate a comparison gate.
|
| virtual value_type | semimod (value_type x, value_type s) const |
| | Apply a semimodule scalar multiplication.
|
| virtual value_type | agg (AggregationOperator op, const std::vector< value_type > &s) |
| | Evaluate an aggregation gate.
|
| virtual value_type | value (const std::string &s) const |
| | Interpret a literal string as a semiring value.
|
| virtual value_type | unmapped_input (const std::string &uuid) const |
| | Value of a variable leaf (gate_input / gate_mulinput) that the provenance mapping does not name.
|
| virtual value_type | rv (const std::string &spec, const std::vector< value_type > ¶ms) const |
| | Evaluate a continuous random-variable leaf (gate_rv).
|
| virtual value_type | arith (ArithmeticOperator op, const std::vector< value_type > &children, const std::string &extra) const |
| | Evaluate an arithmetic gate over scalar children (gate_arith).
|
| virtual value_type | mixture (value_type p, value_type x, value_type y) const |
| | Evaluate a Bernoulli mixture (gate_mixture, three wires).
|
| virtual value_type | categorical (value_type key, const std::vector< double > &probs, const std::vector< std::string > &outcomes) const |
| | Evaluate a categorical mixture (gate_mixture over gate_mulinput outcomes).
|
| virtual value_type | guarded_case (const std::vector< value_type > &children) const |
| | Evaluate a guarded selection (gate_case).
|
| virtual value_type | observe (value_type child, const std::string &datum) const |
| | Evaluate a latent-variable observation (gate_observe).
|
| virtual value_type | conditioned (const std::vector< value_type > &children) const |
| | Evaluate a conditioning marker (gate_conditioned).
|
| virtual | ~Semiring ()=default |
| virtual bool | idempotent () const |
| | Return true if this semiring is idempotent ( \(a \oplus a = a\) for all \(a\)).
|
| virtual bool | selective () const |
| | Return true if \(\oplus\) is selective (for all \(a, b\), \(a \oplus b \in \{a, b\}\)).
|
| virtual bool | commutative () const |
| | Return true if \(\otimes\) is commutative ( \(a \otimes b = b \otimes a\) for all \(a, b\)).
|
| virtual bool | has_star () const |
| | Return true if star computes \(a^* = \mathbb{1} \oplus a \oplus a^2 \oplus \cdots\).
|
| virtual value_type | star (const value_type &a) const |
| | \(a^*\), the sum of the powers of a.
|
| virtual bool | symbolic () const |
| | Return true if the semiring can name an unknown and record an equation over it (symbolic_unknown, define).
|
| virtual value_type | symbolic_unknown (std::size_t position) const |
| | A fresh unknown, as a value.
|
| virtual void | define (const value_type &unknown, const value_type &rhs) const |
| | Record the equation unknown = rhs.
|
| virtual bool | equal (const value_type &a, const value_type &b) const |
| | Equality of the semiring elements two values denote.
|
| virtual bool | exact_equality () const |
| | Return true if equal decides equality of semiring elements.
|
| bool | product_is_joint () const |
| | Whether the product of the predicate provenances of two conditions over one family of occurrences is the provenance of their conjunction (and their sum that of their disjunction).
|
| virtual bool | certifying () const |
| | Whether this semiring builds certified exclusive enumerations (see the three hooks below).
|
| virtual bool | independent_literal (const value_type &) const |
| | Whether v is an independent literal for certification purposes: a base Bernoulli variable (or a constant), so that distinct literals have disjoint supports and an AND over them is decomposable.
|
| virtual value_type | certified_world_term (const std::vector< value_type > &, const std::vector< value_type > &) const |
| | Build one complete world term: the conjunction of the present literals and the negations of the missing literals, certified decomposable.
|
| virtual value_type | certified_exclusive_plus (const std::vector< value_type > &) const |
| | Build the disjunction of pairwise-exclusive disjuncts, certified deterministic.
|
Subsets of the labels of an enum type, as a 64-bit mask.
Definition at line 95 of file Subset.h.