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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/*
* Copyright (C) 2011 The Guava Authors
*
* 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 com.google.common.util.concurrent;
import static java.util.concurrent.TimeUnit.SECONDS;
import com.google.common.annotations.GwtIncompatible;
import java.util.ArrayList;
import java.util.Random;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;
import junit.framework.TestCase;
/**
* Basher test for {@link AtomicLongMap}.
*
* @author mike nonemacher
*/
@GwtIncompatible // threads
public class AtomicLongMapBasherTest extends TestCase {
private final Random random = new Random(301);
public void testModify_basher() throws Exception {
int nTasks = 3000;
int nThreads = 100;
final int getsPerTask = 1000;
final int deltaRange = 10000;
final String key = "key";
final AtomicLongMap<String> map = AtomicLongMap.create();
ExecutorService threadPool = Executors.newFixedThreadPool(nThreads);
ArrayList<Future<Long>> futures = new ArrayList<>();
for (int i = 0; i < nTasks; i++) {
futures.add(
threadPool.submit(
new Callable<Long>() {
@Override
public Long call() {
long threadSum = 0;
for (int j = 0; j < getsPerTask; j++) {
long delta = random.nextInt(deltaRange);
int behavior = random.nextInt(10);
switch (behavior) {
case 0:
map.incrementAndGet(key);
threadSum++;
break;
case 1:
map.decrementAndGet(key);
threadSum--;
break;
case 2:
map.addAndGet(key, delta);
threadSum += delta;
break;
case 3:
map.getAndIncrement(key);
threadSum++;
break;
case 4:
map.getAndDecrement(key);
threadSum--;
break;
case 5:
map.getAndAdd(key, delta);
threadSum += delta;
break;
case 6:
long oldValue = map.put(key, delta);
threadSum += delta - oldValue;
break;
case 7:
oldValue = map.get(key);
if (map.replace(key, oldValue, delta)) {
threadSum += delta - oldValue;
}
break;
case 8:
oldValue = map.remove(key);
threadSum -= oldValue;
break;
case 9:
oldValue = map.get(key);
if (map.remove(key, oldValue)) {
threadSum -= oldValue;
}
break;
default:
throw new AssertionError();
}
}
return threadSum;
}
}));
}
threadPool.shutdown();
assertTrue(threadPool.awaitTermination(300, SECONDS));
long sum = 0;
for (Future<Long> f : futures) {
sum += f.get();
}
assertEquals(sum, map.get(key));
}
}
|
