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
|
/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* (C) Copyright 2009-2014, Arnaud Roques
*
* Project Info: http://plantuml.sourceforge.net
*
* This file is part of PlantUML.
*
* Licensed under The MIT License (Massachusetts Institute of Technology License)
*
* See http://opensource.org/licenses/MIT
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
* IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*
* Original Author: Arnaud Roques
*/
package net.sourceforge.plantuml.api;
public final class MagicArray {
private final int data[];
private final int size;
private long lastUpdatedKey = -1;
private int lastUpdatedValue;
private long sum;
private long maxSum;
public MagicArray(int size) {
this.data = new int[size];
this.size = size;
}
synchronized public void incKey(long key) {
incKey(key, 1);
}
synchronized public void incKey(long key, int delta) {
if (key < lastUpdatedKey) {
return;
}
if (key != lastUpdatedKey) {
if (lastUpdatedKey != -1) {
setValue(lastUpdatedKey, lastUpdatedValue);
for (long i = lastUpdatedKey + 1; i < key; i++) {
setValue(i, 0);
}
}
lastUpdatedValue = 0;
lastUpdatedKey = key;
}
lastUpdatedValue += delta;
}
private void setValue(long key, int value) {
final int i = (int) (key % size);
sum += value - data[i];
if (sum > maxSum) {
maxSum = sum;
}
data[i] = value;
}
synchronized public long getSum() {
return sum;
}
synchronized public long getMaxSum() {
return maxSum;
}
private long getSumSlow() {
long tmp = 0;
for (int d : data) {
tmp += d;
}
return tmp;
}
}
|
