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
122
123
124
125
126
127
128
129
130
131
132
|
package de.lmu.ifi.dbs.elki.utilities.datastructures.histogram;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2012
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
import java.util.Arrays;
/**
* Histogram class storing long values.
*
* The histogram will start with "bin" bins, but it can grow dynamically to the
* left and right.
*
* @author Erich Schubert
*/
public class LongStaticHistogram extends AbstractStaticHistogram implements LongHistogram {
/**
* Constructor.
*
* @param bins Number of bins
* @param min Cover minimum
* @param max Cover maximum
*/
public LongStaticHistogram(int bins, double min, double max) {
super(bins, min, max);
if (bins >= 0) {
data = new long[bins];
} else {
data = null;
}
}
/**
* Data store
*/
long[] data;
/**
* Increment the value of a bin.
*
* @param coord Coordinate
* @param val Value
*/
@Override
public void increment(double coord, long val) {
int bin = getBinNr(coord);
if (bin < 0) {
if (size - bin > data.length) {
// Reallocate. TODO: use an arraylist-like grow strategy!
long[] tmpdata = new long[growSize(data.length, size - bin)];
System.arraycopy(data, 0, tmpdata, -bin, size);
data = tmpdata;
} else {
// Shift in place and clear head
System.arraycopy(data, 0, data, -bin, size);
Arrays.fill(data, 0, -bin, (long) 0);
}
data[0] = val;
// Note that bin is negative, -bin is the shift offset!
assert (data.length >= size - bin);
offset -= bin;
size -= bin;
// TODO: modCounter++; and have iterators fast-fail
} else if (bin >= data.length) {
long[] tmpdata = new long[growSize(data.length, bin + 1)];
System.arraycopy(data, 0, tmpdata, 0, size);
tmpdata[bin] = val;
data = tmpdata;
size = bin + 1;
// TODO: modCounter++; and have iterators fast-fail
// Unset max value when resizing
max = Double.MAX_VALUE;
} else {
if (bin >= size) {
// TODO: reset bins to 0 first?
size = bin + 1;
}
data[bin] += val;
}
}
/**
* Get the value at a particular position.
*
* @param coord Coordinate
* @return Value
*/
public long get(double coord) {
int bin = getBinNr(coord);
if (bin < 0 || bin >= size) {
return 0;
}
return data[bin];
}
@Override
public Iter iter() {
return new Iter();
}
/**
* Iterator class.
*
* @author Erich Schubert
*/
public class Iter extends AbstractStaticHistogram.Iter implements LongHistogram.Iter {
@Override
public long getValue() {
return data[bin];
}
}
}
|
