LexCounterInterface

kofre.decompose.interfaces.LexCounterInterface$

A LexCounter is a Delta CRDT modeling a counter.

It uses lexicographic pairs to allow counter decrements as well as increments.

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Type members

Classlikes

implicit class LexCounterSyntax[C](container: C) extends OpsSyntaxHelper[C, LexCounter]

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
case class LexPair[A, B](fst: A, snd: B)

A LexPair is a lexicographic pair of two values that is used with a lexicographical ordering in the state of interfaces.LexCounterInterface.

A LexPair is a lexicographic pair of two values that is used with a lexicographical ordering in the state of interfaces.LexCounterInterface.

Attributes

Companion:
object
Graph
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
case object LexPair

Attributes

Companion:
class
Graph
Supertypes
trait Singleton
trait Product
trait Mirror
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Self type
LexPair.type

Types

type LexCounter = Map[String, LexPair[Int, Int]]

Value members

Concrete methods

Implicits

Implicits

final implicit def LexCounterSyntax[C](container: C): LexCounterSyntax[C]