summaryrefslogtreecommitdiff
path: root/test/scalacheck/concurrent-map.scala
blob: 0dae7a98bdbbe3765f2c7e53529b290a1d91225b (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
import java.util.concurrent._
import scala.collection._
import scala.collection.JavaConverters._
import org.scalacheck._
import org.scalacheck.Prop._
import org.scalacheck.Gen._

object ConcurrentMapTest extends Properties("concurrent.TrieMap") {

  case class Wrap(i: Int) {
    override def hashCode = i * 0x9e3775cd
  }

  /* generators */

  val sizes = choose(0, 20000)

  val threadCounts = choose(2, 16)

  val threadCountsAndSizes = for {
    p <- threadCounts
    sz <- sizes
  } yield (p, sz);


  /* helpers */

  def inParallel[T](totalThreads: Int)(body: Int => T): Seq[T] = {
    val threads = for (idx <- 0 until totalThreads) yield new Thread {
      setName("ParThread-" + idx)
      private var res: T = _
      override def run() {
        res = body(idx)
      }
      def result = {
        this.join()
        res
      }
    }

    threads foreach (_.start())
    threads map (_.result)
  }

  property("concurrent getOrElseUpdate insertions") = forAll(threadCounts, sizes) {
    (p, sz) =>
    val chm = new ConcurrentHashMap[Wrap, Int]().asScala

    val results = inParallel(p) {
      idx =>
      for (i <- 0 until sz) yield chm.getOrElseUpdate(new Wrap(i), idx)
    }

    val resultSets = for (i <- 0 until sz) yield results.map(_(i)).toSet
    val largerThanOne = resultSets.zipWithIndex.find(_._1.size != 1)
    val allThreadsAgreeOnWhoInserted = {
      largerThanOne == None
    } :| s"$p threads agree on who inserted [disagreement (differentResults, position) = $largerThanOne]"

    allThreadsAgreeOnWhoInserted
  }


}