lattice

rdts.filters.PermissionTree.lattice
object lattice extends Lattice[PermissionTree]

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type
lattice.type

Members list

Value members

Concrete methods

override def merge(left: PermissionTree, right: PermissionTree): PermissionTree

By assumption: associative, commutative, idempotent.

By assumption: associative, commutative, idempotent.

Implementation note: If it matters, assume that left is the current state and right is an added delta. All code should assume that left is the larger state (and optimize for this). If left == right, prefer to return left.

Attributes

Definition Classes

Inherited methods

def subsumption(left: PermissionTree, right: PermissionTree): Boolean

Subsumption states that left <= right in the sense that everything information in left is already contained in right. Overriding implementations must make sure that they compute exactly the same results as the equation below.

Subsumption states that left <= right in the sense that everything information in left is already contained in right. Overriding implementations must make sure that they compute exactly the same results as the equation below.

Attributes

Inherited from:
Lattice

Extensions

Inherited extensions

extension (left: PermissionTree)
inline def inflates(right: PermissionTree): Boolean

Merging left into right is strictly larger than right

Merging left into right is strictly larger than right

Attributes

Inherited from:
Lattice
inline def merge(right: PermissionTree): PermissionTree

Convenience extensions for the above.

Convenience extensions for the above.

Attributes

Inherited from:
Lattice
inline def subsumes(right: PermissionTree): Boolean

Merging right into left has no effect

Merging right into left has no effect

Attributes

Inherited from:
Lattice