-
Notifications
You must be signed in to change notification settings - Fork 62
/
Copy pathAdd.kt
73 lines (67 loc) · 2.25 KB
/
Add.kt
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
/*
* Copyright 2016-2019 JetBrains s.r.o.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package benchmarks.immutableList
import benchmarks.*
import kotlinx.collections.immutable.ImmutableList
import org.openjdk.jmh.annotations.*
import org.openjdk.jmh.infra.Blackhole
@State(Scope.Thread)
open class Add {
@Param(BM_1, BM_10, BM_100, BM_1000, BM_10000, BM_100000, BM_1000000, BM_10000000)
var size: Int = 0
/**
* Adds [size] elements to an empty persistent list.
*
* Measures mean time and memory spent per `add` operation.
*
* Expected time: nearly constant.
* Expected memory: for size in 1..32 - O(size), nearly constant otherwise.
*/
@Benchmark
fun addLast(): ImmutableList<String> {
return persistentListAdd(size)
}
/**
* Adds [size] elements to an empty persistent list and then iterates all elements from first to last.
*
* Measures mean time and memory spent per `add` and `next` operations.
*
* Expected time: [addLast] + [Iterate.firstToLast]
* Expected memory: [addLast] + [Iterate.firstToLast]
*/
@Benchmark
fun addLastAndIterate(bh: Blackhole) {
val list = persistentListAdd(size)
for (e in list) {
bh.consume(e)
}
}
/**
* Adds [size] elements to an empty persistent list and then gets all elements by index from first to last.
*
* Measures mean time and memory spent per `add` and `get` operations.
*
* Expected time: [addLast] + [Get.getByIndex]
* Expected memory: [addLast] + [Get.getByIndex]
*/
@Benchmark
fun addLastAndGet(bh: Blackhole) {
val list = persistentListAdd(size)
for (i in 0 until list.size) {
bh.consume(list[i])
}
}
}