tests/run/t2849.scala


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

import scala.collection.immutable.SortedSet
import scala.collection.immutable.TreeSet

object Test {

  def main(args: Array[String]): Unit = {
    ticketExample
    similarExample
  }

  //def freeMBytes = Runtime.getRuntime.freeMemory / 1048576
  def totalMBytes = Runtime.getRuntime.totalMemory / 1048576

  val N = if (totalMBytes > 1000) 10000 else 4000
  val M = N / 10

  def ticketExample: Unit = {
    var big = 100000

    var aSortedSet: SortedSet[Int] = TreeSet(big)

    for (i <- 1 until N) {
      aSortedSet = (aSortedSet - big) ++ (TreeSet(i, big - 1))
      big -= 1
      if (i % M == 0) {
        //println("big: "+big+", free memory: "+freeMBytes)
        aSortedSet.until(i)
      }
    }
  }

  def similarExample: Unit = {
    var big = 100

    var aSortedSet: SortedSet[Int] = TreeSet(big)

    for (i <- 1 until N) {
      aSortedSet = (aSortedSet - big) ++ (TreeSet(i, big - 1)) + big
      big -= 1
      if (i % M == 0) {
        aSortedSet.until(i)
      }
    }
  }

}