Membership

rdts.datatypes.experiments.protocols.Membership
See theMembership companion class
object Membership

Attributes

Companion
class
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Membership.type

Members list

Value members

Concrete methods

def empty[A, C[_], D[_]](using Bottom[C[Set[Uid]]], Bottom[D[A]], Consensus[C], Consensus[D], Lattice[C[Set[Uid]]], Lattice[D[A]]): Membership[A, C, D]
def init[A, C[_], D[_]](initialMembers: Set[Uid])(using Bottom[C[Set[Uid]]], Bottom[D[A]], Consensus[C], Consensus[D], Lattice[C[Set[Uid]]], Lattice[D[A]]): Membership[A, C, D]

Givens

Givens

given lattice[A, C[_], D[_]](using x$1: Bottom[C[Set[Uid]]], x$2: Bottom[D[A]], x$3: Consensus[C], x$4: Consensus[D], x$5: Lattice[C[Set[Uid]]], x$6: Lattice[D[A]]): lattice[A, C, D]