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
71
72
73
74
75
76
|
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2003-2011, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | http://scala-lang.org/ **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
\* */
package scala.collection.parallel
import scala.collection.mutable.ArrayBuffer
import scala.collection.mutable.ArraySeq
import scala.collection.generic.Sizing
package object mutable {
/* aliases */
type ParArrayCombiner[T] = ResizableParArrayCombiner[T]
val ParArrayCombiner = ResizableParArrayCombiner
}
package mutable {
/* classes and traits */
private[mutable] trait SizeMapUtils {
protected def calcNumElems(from: Int, until: Int, tableLength: Int, sizeMapBucketSize: Int) = {
// find the first bucket
val fbindex = from / sizeMapBucketSize
// find the last bucket
val lbindex = until / sizeMapBucketSize
// note to self: FYI if you define lbindex as from / sizeMapBucketSize, the first branch
// below always triggers and tests pass, so you spend a great day benchmarking and profiling
if (fbindex == lbindex) {
// if first and last are the same, just count between `from` and `until`
// return this count
countElems(from, until)
} else {
// otherwise count in first, then count in last
val fbuntil = ((fbindex + 1) * sizeMapBucketSize) min tableLength
val fbcount = countElems(from, fbuntil)
val lbstart = lbindex * sizeMapBucketSize
val lbcount = countElems(lbstart, until)
// and finally count the elements in all the buckets between first and last using a sizemap
val inbetween = countBucketSizes(fbindex + 1, lbindex)
// return the sum
fbcount + inbetween + lbcount
}
}
protected def countElems(from: Int, until: Int): Int
protected def countBucketSizes(fromBucket: Int, untilBucket: Int): Int
}
/* hack-arounds */
private[mutable] class ExposedArrayBuffer[T] extends ArrayBuffer[T] with Sizing {
def internalArray = array
def setInternalSize(s: Int) = size0 = s
override def sizeHint(len: Int) = {
if (len > size && len >= 1) {
val newarray = new Array[AnyRef](len)
Array.copy(array, 0, newarray, 0, size0)
array = newarray
}
}
}
private[mutable] class ExposedArraySeq[T](arr: Array[AnyRef], sz: Int) extends ArraySeq[T](sz) {
override val array = arr
override val length = sz
override def stringPrefix = "ArraySeq"
}
}
|
