PNCounterMap

Type Members

type D = DeltaOp

The type of the delta.
The type of the delta. To be specified by subclass. It may be the same type as T or a different type if needed. For example GSet uses the same type and ORSet uses different types.

Definition Classes
PNCounterMap → DeltaReplicatedData
type T = PNCounterMap[A]

The type of the concrete implementation, e.g.
The type of the concrete implementation, e.g. GSet[A]. To be specified by subclass.

Definition Classes
PNCounterMap → ReplicatedData

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def +(other: String): String

Implicit information
This member is added by an implicit conversion from PNCounterMap[A] to any2stringadd[PNCounterMap[A]] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
def -(key: A)(implicit node: Cluster): PNCounterMap[A]

Removes an entry from the map.
Removes an entry from the map. Note that if there is a conflicting update on another node the entry will not be removed after merge.
def ->[B](y: B): (PNCounterMap[A], B)

Implicit information
This member is added by an implicit conversion from PNCounterMap[A] to ArrowAssoc[PNCounterMap[A]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def contains(key: A): Boolean
def decrement(node: Cluster, key: A, delta: Long): PNCounterMap[A]

Decrement the counter with the delta specified.
Decrement the counter with the delta specified. If the delta is negative then it will increment instead of decrement.
def decrement(key: A, delta: Long = 1)(implicit node: Cluster): PNCounterMap[A]

Decrement the counter with the delta specified.
Decrement the counter with the delta specified. If the delta is negative then it will increment instead of decrement.
def delta: Option[D]

The accumulated delta of mutator operations since previous #resetDelta.
The accumulated delta of mutator operations since previous #resetDelta. When the Replicator invokes the modify function of the Update message and the user code is invoking one or more mutator operations the data is collecting the delta of the operations and makes it available for the Replicator with the #delta accessor. The modify function shall still return the full state in the same way as ReplicatedData without support for deltas.

Definition Classes
PNCounterMap → DeltaReplicatedData
def ensuring(cond: (PNCounterMap[A]) ⇒ Boolean, msg: ⇒ Any): PNCounterMap[A]

Implicit information
This member is added by an implicit conversion from PNCounterMap[A] to Ensuring[PNCounterMap[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (PNCounterMap[A]) ⇒ Boolean): PNCounterMap[A]

Implicit information
This member is added by an implicit conversion from PNCounterMap[A] to Ensuring[PNCounterMap[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: ⇒ Any): PNCounterMap[A]

Implicit information
This member is added by an implicit conversion from PNCounterMap[A] to Ensuring[PNCounterMap[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): PNCounterMap[A]

Implicit information
This member is added by an implicit conversion from PNCounterMap[A] to Ensuring[PNCounterMap[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def entries: Map[A, BigInt]

Scala API
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(o: Any): Boolean

Definition Classes
PNCounterMap → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def formatted(fmtstr: String): String

Implicit information
This member is added by an implicit conversion from PNCounterMap[A] to StringFormat[PNCounterMap[A]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
def get(key: A): Option[BigInt]

Scala API: The count for a key
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getEntries: Map[A, BigInteger]

Java API
def getValue(key: A): BigInteger

Java API: The count for a key, or null if it doesn't exist
def hashCode(): Int

Definition Classes
PNCounterMap → AnyRef → Any
def increment(node: Cluster, key: A, delta: Long): PNCounterMap[A]

Increment the counter with the delta specified.
Increment the counter with the delta specified. If the delta is negative then it will decrement instead of increment.
def increment(key: A, delta: Long = 1)(implicit node: Cluster): PNCounterMap[A]

Increment the counter with the delta specified.
Increment the counter with the delta specified. If the delta is negative then it will decrement instead of increment.
def isEmpty: Boolean
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def merge(that: PNCounterMap[A]): PNCounterMap[A]

Monotonic merge function.
Monotonic merge function.

Definition Classes
PNCounterMap → ReplicatedData
def mergeDelta(thatDelta: D): PNCounterMap[A]

When delta is merged into the full state this method is used.
When delta is merged into the full state this method is used. When the type D of the delta is of the same type as the full state T this method can be implemented by delegating to merge.

Definition Classes
PNCounterMap → DeltaReplicatedData
def modifiedByNodes: Set[UniqueAddress]

The nodes that have changed the state for this data and would need pruning when such node is no longer part of the cluster.
The nodes that have changed the state for this data and would need pruning when such node is no longer part of the cluster.

Definition Classes
PNCounterMap → RemovedNodePruning
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def needPruningFrom(removedNode: UniqueAddress): Boolean

Does it have any state changes from a specific node, which has been removed from the cluster.
Does it have any state changes from a specific node, which has been removed from the cluster.

Definition Classes
PNCounterMap → RemovedNodePruning
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def prune(removedNode: UniqueAddress, collapseInto: UniqueAddress): PNCounterMap[A]

When the removed node has been removed from the cluster the state changes from that node will be pruned by collapsing the data entries to another node.
When the removed node has been removed from the cluster the state changes from that node will be pruned by collapsing the data entries to another node.

Definition Classes
PNCounterMap → RemovedNodePruning
def pruningCleanup(removedNode: UniqueAddress): PNCounterMap[A]

Remove data entries from a node that has been removed from the cluster and already been pruned.
Remove data entries from a node that has been removed from the cluster and already been pruned.

Definition Classes
PNCounterMap → RemovedNodePruning
def remove(node: Cluster, key: A): PNCounterMap[A]

Removes an entry from the map.
Removes an entry from the map. Note that if there is a conflicting update on another node the entry will not be removed after merge.
def resetDelta: PNCounterMap[A]

Reset collection of deltas from mutator operations.
Reset collection of deltas from mutator operations. When the Replicator invokes the modify function of the Update message the delta is always "reset" and when the user code is invoking one or more mutator operations the data is collecting the delta of the operations and makes it available for the Replicator with the #delta accessor. When the Replicator has grabbed the delta it will invoke this method to get a clean data instance without the delta.

Definition Classes
PNCounterMap → DeltaReplicatedData
def size: Int
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
PNCounterMap → AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def →[B](y: B): (PNCounterMap[A], B)

Implicit information
This member is added by an implicit conversion from PNCounterMap[A] to ArrowAssoc[PNCounterMap[A]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc

Inherited from RemovedNodePruning

Inherited from ReplicatedDataSerialization

Inherited from Serializable

Inherited from DeltaReplicatedData

Inherited from ReplicatedData

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from PNCounterMap[A] to any2stringadd[PNCounterMap[A]]

Inherited by implicit conversion StringFormat from PNCounterMap[A] to StringFormat[PNCounterMap[A]]

Inherited by implicit conversion Ensuring from PNCounterMap[A] to Ensuring[PNCounterMap[A]]

Inherited by implicit conversion ArrowAssoc from PNCounterMap[A] to ArrowAssoc[PNCounterMap[A]]

Ungrouped

Related Docs: object PNCounterMap | package ddata

final class PNCounterMap[A] extends DeltaReplicatedData with ReplicatedDataSerialization with RemovedNodePruning

Type Members

type D = DeltaOp

type T = PNCounterMap[A]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def -(key: A)(implicit node: Cluster): PNCounterMap[A]

def ->[B](y: B): (PNCounterMap[A], B)

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def contains(key: A): Boolean

def decrement(node: Cluster, key: A, delta: Long): PNCounterMap[A]

def decrement(key: A, delta: Long = 1)(implicit node: Cluster): PNCounterMap[A]

def delta: Option[D]

def ensuring(cond: (PNCounterMap[A]) ⇒ Boolean, msg: ⇒ Any): PNCounterMap[A]

def ensuring(cond: (PNCounterMap[A]) ⇒ Boolean): PNCounterMap[A]

def ensuring(cond: Boolean, msg: ⇒ Any): PNCounterMap[A]

def ensuring(cond: Boolean): PNCounterMap[A]

def entries: Map[A, BigInt]

final def eq(arg0: AnyRef): Boolean

def equals(o: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

def get(key: A): Option[BigInt]

final def getClass(): Class[_]

def getEntries: Map[A, BigInteger]

def getValue(key: A): BigInteger

def hashCode(): Int

def increment(node: Cluster, key: A, delta: Long): PNCounterMap[A]

def increment(key: A, delta: Long = 1)(implicit node: Cluster): PNCounterMap[A]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def merge(that: PNCounterMap[A]): PNCounterMap[A]

def mergeDelta(thatDelta: D): PNCounterMap[A]

def modifiedByNodes: Set[UniqueAddress]

final def ne(arg0: AnyRef): Boolean

def needPruningFrom(removedNode: UniqueAddress): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def prune(removedNode: UniqueAddress, collapseInto: UniqueAddress): PNCounterMap[A]

def pruningCleanup(removedNode: UniqueAddress): PNCounterMap[A]

def remove(node: Cluster, key: A): PNCounterMap[A]

def resetDelta: PNCounterMap[A]

def size: Int

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def →[B](y: B): (PNCounterMap[A], B)

Inherited from RemovedNodePruning

Inherited from ReplicatedDataSerialization

Inherited from Serializable

Inherited from Serializable

Inherited from DeltaReplicatedData

Inherited from ReplicatedData

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from PNCounterMap[A] to any2stringadd[PNCounterMap[A]]

Inherited by implicit conversion StringFormat from PNCounterMap[A] to StringFormat[PNCounterMap[A]]

Inherited by implicit conversion Ensuring from PNCounterMap[A] to Ensuring[PNCounterMap[A]]

Inherited by implicit conversion ArrowAssoc from PNCounterMap[A] to ArrowAssoc[PNCounterMap[A]]

Ungrouped