ProvSQL C/C++ API
Adding support for provenance and uncertainty management to PostgreSQL databases
Loading...
Searching...
No Matches
semiring::IntervalUnion Class Reference

Interval-union m-semiring with Datum carrier, parameterised by a multirange type OID. More...

#include "IntervalUnion.h"

Inheritance diagram for semiring::IntervalUnion:
Collaboration diagram for semiring::IntervalUnion:

Public Member Functions

 IntervalUnion (Oid multirange_oid)
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 exclusive () const override
 Exclusive: \(a \otimes (\mathbb{1} \ominus a) = \mathbb{0}\) (Lean IntervalUnion.exclusive).
virtual bool mul_idempotent () const override
 \(\otimes\) is idempotent (Lean IntervalUnion.mulIdempotent).
virtual bool absorptive () const override
 Return true if this semiring is absorptive ( \(\mathbb{1} \oplus a = \mathbb{1}\) for all \(a\)).
virtual bool equal (const value_type &a, const value_type &b) const override
 Equality of the multiranges, not of the Datum pointers.
virtual bool mul_sub_left_distributive () const override
 \(\otimes\) distributes over \(\ominus\), so the HAVING MIN / MAX comparisons take the single-scan closed form.
virtual bool compatibleWithBooleanRewrite () const override
 A semiring homomorphism BoolFunc(Y) →+* IntervalUnion exists (map each variable to a fixed nonempty interval), so the safe-query Boolean rewrite preserves evaluation results.
Datum parse_leaf (const char *str) const
 Parse a multirange text literal to a Datum.
Public Member Functions inherited from semiring::Semiring< Datum >
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 > &params) 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 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.

Private Member Functions

void ensureCache () const

Private Attributes

Oid in_func
Oid typioparam
Datum cached_zero = 0
Datum cached_one = 0
bool cached = false

Additional Inherited Members

Public Types inherited from semiring::Semiring< Datum >
typedef Datum value_type
 The carrier type of this semiring.

Detailed Description

Interval-union m-semiring with Datum carrier, parameterised by a multirange type OID.

Each gate evaluates to a multirange Datum allocated in the current memory context. The class caches the input-function OIDs in its constructor and the zero/one Datum values lazily on first use, so that operations dispatch cheaply during circuit traversal.

Definition at line 69 of file IntervalUnion.h.

Constructor & Destructor Documentation

◆ IntervalUnion()

semiring::IntervalUnion::IntervalUnion ( Oid multirange_oid)
inlineexplicit

Definition at line 94 of file IntervalUnion.h.

Member Function Documentation

◆ absorptive()

virtual bool semiring::IntervalUnion::absorptive ( ) const
inlineoverridevirtual

Return true if this semiring is absorptive ( \(\mathbb{1} \oplus a = \mathbb{1}\) for all \(a\)).

When true, the circuit evaluator and HAVING-semantics machinery may exploit the resulting idempotency ( \(a \oplus a = a\), implied by absorptivity) to deduplicate children of plus gates and to short-circuit over the multiplicative identity.

A semiring that does not commute (commutative()) is absorptive on both sides of a product: \(a \oplus a \otimes b = a \oplus b \otimes a = a\), which the absorptive folds of the circuit rely on. Circuits built under an 'absorptive' assumption marker do not keep the order of the query, and require a commutative semiring as well.

Returns
false by default; override to return true.

Reimplemented from semiring::Semiring< Datum >.

Definition at line 137 of file IntervalUnion.h.

◆ compatibleWithBooleanRewrite()

virtual bool semiring::IntervalUnion::compatibleWithBooleanRewrite ( ) const
inlineoverridevirtual

A semiring homomorphism BoolFunc(Y) →+* IntervalUnion exists (map each variable to a fixed nonempty interval), so the safe-query Boolean rewrite preserves evaluation results.

Lean: Provenance.Semirings.IntervalUnion.homomorphism_from_BoolFunc (provenance-lean/Provenance/Semirings/IntervalUnion.lean).

Reimplemented from semiring::Semiring< Datum >.

Definition at line 161 of file IntervalUnion.h.

◆ delta()

virtual value_type semiring::IntervalUnion::delta ( value_type x) const
inlineoverridevirtual

Apply the \(\delta\) operator.

Parameters
xInput value.
Returns
\(\delta(x)\).

Implements semiring::Semiring< Datum >.

Definition at line 124 of file IntervalUnion.h.

◆ ensureCache()

void semiring::IntervalUnion::ensureCache ( ) const
inlineprivate

Definition at line 83 of file IntervalUnion.h.

Here is the caller graph for this function:

◆ equal()

virtual bool semiring::IntervalUnion::equal ( const value_type & a,
const value_type & b ) const
inlineoverridevirtual

Equality of the multiranges, not of the Datum pointers.

Reimplemented from semiring::Semiring< Datum >.

Definition at line 141 of file IntervalUnion.h.

◆ exclusive()

virtual bool semiring::IntervalUnion::exclusive ( ) const
inlineoverridevirtual

Exclusive: \(a \otimes (\mathbb{1} \ominus a) = \mathbb{0}\) (Lean IntervalUnion.exclusive).

Reimplemented from semiring::Semiring< Datum >.

Definition at line 130 of file IntervalUnion.h.

◆ monus()

virtual value_type semiring::IntervalUnion::monus ( value_type x,
value_type y ) const
inlineoverridevirtual

Apply the monus (m-semiring difference) operation.

Parameters
xMinuend.
ySubtrahend.
Returns
\(x \ominus y\).

Implements semiring::Semiring< Datum >.

Definition at line 120 of file IntervalUnion.h.

◆ mul_idempotent()

virtual bool semiring::IntervalUnion::mul_idempotent ( ) const
inlineoverridevirtual

\(\otimes\) is idempotent (Lean IntervalUnion.mulIdempotent).

Reimplemented from semiring::Semiring< Datum >.

Definition at line 134 of file IntervalUnion.h.

◆ mul_sub_left_distributive()

virtual bool semiring::IntervalUnion::mul_sub_left_distributive ( ) const
inlineoverridevirtual

\(\otimes\) distributes over \(\ominus\), so the HAVING MIN / MAX comparisons take the single-scan closed form.

Lean: Provenance.Semirings.IntervalUnion.mul_sub_left_distributive.

Reimplemented from semiring::Semiring< Datum >.

Definition at line 150 of file IntervalUnion.h.

◆ one()

virtual value_type semiring::IntervalUnion::one ( ) const
inlineoverridevirtual

Return the multiplicative identity \(\mathbb{1}\).

Returns
The one element of the semiring.

Implements semiring::Semiring< Datum >.

Definition at line 102 of file IntervalUnion.h.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ parse_leaf()

Datum semiring::IntervalUnion::parse_leaf ( const char * str) const
inline

Parse a multirange text literal to a Datum.

Used by pec_multirange() to build the input mapping; exposed here so the parser can share the cached in_func / typioparam.

Definition at line 171 of file IntervalUnion.h.

◆ plus()

virtual value_type semiring::IntervalUnion::plus ( const std::vector< value_type > & v) const
inlineoverridevirtual

Apply the additive operation to a list of values.

Parameters
vOrdered list of operands (empty list should return zero()).
Returns
\(v_0 \oplus v_1 \oplus \cdots\).

Implements semiring::Semiring< Datum >.

Definition at line 106 of file IntervalUnion.h.

Here is the call graph for this function:

◆ times()

virtual value_type semiring::IntervalUnion::times ( const std::vector< value_type > & v) const
inlineoverridevirtual

Apply the multiplicative operation to a list of values.

Parameters
vOrdered list of operands (empty list should return one()).
Returns
\(v_0 \otimes v_1 \otimes \cdots\).

Implements semiring::Semiring< Datum >.

Definition at line 113 of file IntervalUnion.h.

Here is the call graph for this function:

◆ zero()

virtual value_type semiring::IntervalUnion::zero ( ) const
inlineoverridevirtual

Return the additive identity \(\mathbb{0}\).

Returns
The zero element of the semiring.

Implements semiring::Semiring< Datum >.

Definition at line 98 of file IntervalUnion.h.

Here is the call graph for this function:
Here is the caller graph for this function:

Member Data Documentation

◆ cached

bool semiring::IntervalUnion::cached = false
mutableprivate

Definition at line 81 of file IntervalUnion.h.

◆ cached_one

Datum semiring::IntervalUnion::cached_one = 0
mutableprivate

Definition at line 80 of file IntervalUnion.h.

◆ cached_zero

Datum semiring::IntervalUnion::cached_zero = 0
mutableprivate

Definition at line 79 of file IntervalUnion.h.

◆ in_func

Oid semiring::IntervalUnion::in_func
private

Definition at line 71 of file IntervalUnion.h.

◆ typioparam

Oid semiring::IntervalUnion::typioparam
private

Definition at line 72 of file IntervalUnion.h.


The documentation for this class was generated from the following file: