kofre.syntax
Members list
Type members
Classlikes
Helper trait to state that container C contains lattices of type L. This is used for better type inference
Helper trait to state that container C contains lattices of type L. This is used for better type inference
Attributes
- Companion:
- object
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
Attributes
- Companion:
- trait
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
- ArdtOpsContains.type
Attributes
- Companion:
- object
- Graph
- Supertypes
- trait Serializabletrait Producttrait Equalsclass Objecttrait Matchableclass Any
Attributes
- Companion:
- class
- Graph
- Supertypes
- trait Producttrait Mirrorclass Objecttrait Matchableclass Any
- Self type
- DottedName.type
Attributes
- Graph
- Supertypes
Helps to define operations that update any container C containing values of type L using a scheme where mutations return deltas which are systematically applied.
Helps to define operations that update any container C containing values of type L using a scheme where mutations return deltas which are systematically applied.
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Known subtypes
- class EnableWinsFlagOps[C]class GrowOnlyCounterSyntax[C]class PNCounterSyntax[C]class LexCounterSyntax[C]class RCounterSyntax[C]class AuctionSyntax[C]class BoundedCounterSyntax[C]class RubisSyntax[C]
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Known subtypes
Attributes
- Graph
- Supertypes
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Known subtypes
- class FixedId[C]
Attributes
- Companion:
- object
- Graph
- Supertypes
Attributes
- Companion:
- trait
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
- PermIdMutate.type
Attributes
- Companion:
- object
- Graph
- Supertypes
- Known subtypes
Attributes
- Companion:
- trait
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
- PermMutate.type
The basic idea behind this machinery is to allow lattices of type L to be stored in a Container of type C. In the simplest case C = L and the lattice is used as is. More complex containers contain additional information such as the replica ID or a set of deltas since the last synchronization. No matter the concrete container, they should all offer the same API to the underlying lattice.
The basic idea behind this machinery is to allow lattices of type L to be stored in a Container of type C. In the simplest case C = L and the lattice is used as is. More complex containers contain additional information such as the replica ID or a set of deltas since the last synchronization. No matter the concrete container, they should all offer the same API to the underlying lattice.
Attributes
- Companion:
- object
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Known subtypes
Attributes
- Companion:
- object
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
Attributes
- Companion:
- class
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
- TestReplica.type