AFTER: [info] Benchmark (set1Size) Mode Cnt Score Error Units [info] ORSetMergeBenchmark.mergeAddFromBothNodes 1 thrpt 10 1892.687 ± 182.830 ops/ms [info] ORSetMergeBenchmark.mergeAddFromBothNodes 10 thrpt 10 346.653 ± 22.048 ops/ms [info] ORSetMergeBenchmark.mergeAddFromBothNodes 20 thrpt 10 215.354 ± 15.486 ops/ms [info] ORSetMergeBenchmark.mergeAddFromBothNodes 100 thrpt 10 46.544 ± 2.930 ops/ms [info] ORSetMergeBenchmark.mergeAddFromOtherNode 1 thrpt 10 2483.531 ± 192.286 ops/ms [info] ORSetMergeBenchmark.mergeAddFromOtherNode 10 thrpt 10 355.292 ± 27.886 ops/ms [info] ORSetMergeBenchmark.mergeAddFromOtherNode 20 thrpt 10 211.221 ± 14.300 ops/ms [info] ORSetMergeBenchmark.mergeAddFromOtherNode 100 thrpt 10 47.516 ± 2.750 ops/ms [info] ORSetMergeBenchmark.mergeAddFromSameNode 1 thrpt 10 10323.210 ± 732.747 ops/ms [info] ORSetMergeBenchmark.mergeAddFromSameNode 10 thrpt 10 3476.660 ± 512.333 ops/ms [info] ORSetMergeBenchmark.mergeAddFromSameNode 20 thrpt 10 3490.045 ± 180.549 ops/ms [info] ORSetMergeBenchmark.mergeAddFromSameNode 100 thrpt 10 2915.627 ± 202.994 ops/ms [info] ORSetMergeBenchmark.mergeComplex 1 thrpt 10 556.034 ± 44.991 ops/ms [info] ORSetMergeBenchmark.mergeComplex 10 thrpt 10 246.468 ± 14.414 ops/ms [info] ORSetMergeBenchmark.mergeComplex 20 thrpt 10 175.547 ± 12.543 ops/ms [info] ORSetMergeBenchmark.mergeComplex 100 thrpt 10 47.452 ± 1.467 ops/ms BEFORE: [info] Benchmark (set1Size) Mode Cnt Score Error Units [info] ORSetMergeBenchmark.mergeAddFromBothNodes 1 thrpt 10 2007.939 ± 74.673 ops/ms [info] ORSetMergeBenchmark.mergeAddFromBothNodes 10 thrpt 10 337.110 ± 15.055 ops/ms [info] ORSetMergeBenchmark.mergeAddFromBothNodes 20 thrpt 10 223.600 ± 8.403 ops/ms [info] ORSetMergeBenchmark.mergeAddFromBothNodes 100 thrpt 10 46.697 ± 2.136 ops/ms [info] ORSetMergeBenchmark.mergeAddFromOtherNode 1 thrpt 10 2542.537 ± 120.697 ops/ms [info] ORSetMergeBenchmark.mergeAddFromOtherNode 10 thrpt 10 365.694 ± 17.571 ops/ms [info] ORSetMergeBenchmark.mergeAddFromOtherNode 20 thrpt 10 216.323 ± 9.446 ops/ms [info] ORSetMergeBenchmark.mergeAddFromOtherNode 100 thrpt 10 49.563 ± 2.725 ops/ms [info] ORSetMergeBenchmark.mergeAddFromSameNode 1 thrpt 10 9883.186 ± 725.672 ops/ms [info] ORSetMergeBenchmark.mergeAddFromSameNode 10 thrpt 10 3266.528 ± 189.993 ops/ms [info] ORSetMergeBenchmark.mergeAddFromSameNode 20 thrpt 10 3206.017 ± 124.623 ops/ms [info] ORSetMergeBenchmark.mergeAddFromSameNode 100 thrpt 10 2709.031 ± 162.182 ops/ms [info] ORSetMergeBenchmark.mergeComplex 1 thrpt 10 572.704 ± 21.504 ops/ms [info] ORSetMergeBenchmark.mergeComplex 10 thrpt 10 249.226 ± 12.324 ops/ms [info] ORSetMergeBenchmark.mergeComplex 20 thrpt 10 170.560 ± 10.320 ops/ms [info] ORSetMergeBenchmark.mergeComplex 100 thrpt 10 46.373 ± 1.800 ops/ms
72 lines
1.9 KiB
Scala
72 lines
1.9 KiB
Scala
/**
|
|
* Copyright (C) 2009-2015 Typesafe Inc. <http://www.typesafe.com>
|
|
*/
|
|
package akka.cluster.ddata
|
|
|
|
object GSet {
|
|
private val _empty: GSet[Any] = new GSet(Set.empty)
|
|
def empty[A]: GSet[A] = _empty.asInstanceOf[GSet[A]]
|
|
def apply(): GSet[Any] = _empty
|
|
/**
|
|
* Java API
|
|
*/
|
|
def create[A](): GSet[A] = empty[A]
|
|
|
|
// unapply from case class
|
|
}
|
|
|
|
/**
|
|
* Implements a 'Add Set' CRDT, also called a 'G-Set'. You can't
|
|
* remove elements of a G-Set.
|
|
*
|
|
* It is described in the paper
|
|
* <a href="http://hal.upmc.fr/file/index/docid/555588/filename/techreport.pdf">A comprehensive study of Convergent and Commutative Replicated Data Types</a>.
|
|
*
|
|
* A G-Set doesn't accumulate any garbage apart from the elements themselves.
|
|
*
|
|
* This class is immutable, i.e. "modifying" methods return a new instance.
|
|
*/
|
|
@SerialVersionUID(1L)
|
|
final case class GSet[A](elements: Set[A]) extends ReplicatedData with ReplicatedDataSerialization with FastMerge {
|
|
|
|
type T = GSet[A]
|
|
|
|
/**
|
|
* Java API
|
|
*/
|
|
def getElements(): java.util.Set[A] = {
|
|
import scala.collection.JavaConverters._
|
|
elements.asJava
|
|
}
|
|
|
|
def contains(a: A): Boolean = elements(a)
|
|
|
|
def isEmpty: Boolean = elements.isEmpty
|
|
|
|
def size: Int = elements.size
|
|
|
|
/**
|
|
* Adds an element to the set
|
|
*/
|
|
def +(element: A): GSet[A] = add(element)
|
|
|
|
/**
|
|
* Adds an element to the set
|
|
*/
|
|
def add(element: A): GSet[A] = assignAncestor(copy(elements + element))
|
|
|
|
override def merge(that: GSet[A]): GSet[A] =
|
|
if ((this eq that) || that.isAncestorOf(this)) this.clearAncestor()
|
|
else if (this.isAncestorOf(that)) that.clearAncestor()
|
|
else {
|
|
clearAncestor()
|
|
copy(elements union that.elements)
|
|
}
|
|
}
|
|
|
|
object GSetKey {
|
|
def create[A](id: String): Key[GSet[A]] = GSetKey(id)
|
|
}
|
|
|
|
@SerialVersionUID(1L)
|
|
final case class GSetKey[A](_id: String) extends Key[GSet[A]](_id) with ReplicatedDataSerialization
|