Type Members

1.  final class CellSet[Ref[_], A] extends AnyVal

   Similar to IncSet but specialized for domain references.

   Similar to IncSet but specialized for domain references. Failed domains might be removed from this set automatically without emitting any delta.

2.  sealed trait Closeable[+A] extends AnyRef

   Represents a refinable value that in addition can be artificially revoked ("closed").

3.  final class DecSet[A] extends AnyVal

   Decreasing set.

   Decreasing set. A wrapper for Set where a _monotonic_ update is one that removes elements, e.g. by intersection or set difference. This is dual to the usual view of the poset of sets: here, smaller sets (by subset relation) are considered greater (i.e. are higher in the lattice), set intersection is the join and set union is the meet.

4.  final case class Discrete[A](value: A) extends Product with Serializable

   Marker wrapper meaning that any two distinct values of type Discrete[A] should be treated as incomparable.

   Marker wrapper meaning that any two distinct values of type Discrete[A] should be treated as incomparable. As a consequence, a value of type Discrete[A] cannot be refined to obtain a different value. Therefore, refinement is disallowed altogether by setting the Update type to an uninhabited type.

   See also

   Revocable which in addition has a top element.

   Promise which in addition has bottom and top elements.

5.  trait DiscreteInstances extends DiscreteInstances1
6.  trait DiscreteInstances1 extends AnyRef
7.  final class IncSet[A] extends AnyVal

   Increasing set.

   Increasing set. A wrapper for Set where a _monotonic_ update is one that adds elements, e.g. by union with another set.

8.  class IncSets[F[_], Var[_], Val[_]] extends AnyRef
9.  final case class Lexicographic[A, B](_1: A, _2: B) extends Product with Serializable
10.  sealed trait Promise[+A] extends AnyRef

    For any type A, Promise[A] is a bounded lattice on the set A ⊔ {0, 1} (where "⊔" means "disjoint union") with 0 being the least element, 1 being the greatest element, and all elements of A forming an antichain (i.e.

    For any type A, Promise[A] is a bounded lattice on the set A ⊔ {0, 1} (where "⊔" means "disjoint union") with 0 being the least element, 1 being the greatest element, and all elements of A forming an antichain (i.e. mutually incomparable). 0 represents an empty (incomplete) promise, the elements of A represent a completed promise, and 1 represents a conflict (a promise completed multiple times with different values).

    See also

    Revocable

    Discrete

11.  sealed trait Revocable[+A] extends AnyRef

    Represents a discrete (non-refinable) value that can be revoked.

    Represents a discrete (non-refinable) value that can be revoked. Is isomorphic to Closeable[Discrete[A]].

    See also

    Discrete, Closeable

12.  case class Tupled2[A, B, Ref[_]]() extends Rel3[Ref[A], Ref[B], Ref[(A, B)]] with Product with Serializable

    Product of two cells.

    Product of two cells.

    The flow is unidirectional, from factors to the product, but not the other way around.

    Queries have to specify a superset of either both factors, or the result. A query that specifies just one factor doesn't uniquely determine the types of the other columns, and therefore is not considered type-safe.