-
Notifications
You must be signed in to change notification settings - Fork 1.9k
/
CalculateAverage_seijikun.java
285 lines (248 loc) · 10 KB
/
CalculateAverage_seijikun.java
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
/*
* Copyright 2023 The original 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 dev.morling.onebrc;
import jdk.incubator.vector.ByteVector;
import jdk.incubator.vector.VectorOperators;
import java.io.IOException;
import java.io.PrintStream;
import java.io.RandomAccessFile;
import java.lang.foreign.MemorySegment;
import java.nio.ByteOrder;
import java.nio.MappedByteBuffer;
import java.nio.channels.FileChannel;
import java.util.Arrays;
import java.util.HashMap;
import java.util.TreeMap;
import java.util.concurrent.Executors;
import java.util.concurrent.TimeUnit;
public class CalculateAverage_seijikun {
private static final String FILE = "./measurements.txt";
private static class MeasurementAggregator {
private int min = Integer.MAX_VALUE;
private int max = Integer.MIN_VALUE;
// final long startTs = System.currentTimeMillis();
private long sum = 0;
private long count = 0;
private double mean = 0;
public void finish() {
double sum = this.sum / 10.0;
mean = sum / (double) count;
}
public void printInto(PrintStream out) {
double min = (double) this.min / 10.0;
double max = (double) this.max / 10.0;
out.printf("%.1f/%.1f/%.1f", min, mean, max);
}
}
public static class StationIdent {
private final byte[] name;
private final int nameHash;
public StationIdent(byte[] name, int nameHash) {
this.name = name;
this.nameHash = nameHash;
}
@Override
public int hashCode() {
return nameHash;
}
@Override
public boolean equals(Object obj) {
var other = (StationIdent) obj;
if (other.name.length != name.length) {
return false;
}
return Arrays.equals(name, other.name);
}
}
public static class ChunkReader implements Runnable {
RandomAccessFile file;
// Start offset of this chunk
private final long startOffset;
// end offset of this chunk
private final long endOffset;
// state
private int chunkSize = 0;
private MappedByteBuffer buffer = null;
private MemorySegment memorySegment = null;
private int ptr = 0;
private HashMap<StationIdent, MeasurementAggregator> workSet;
public ChunkReader(RandomAccessFile file, long startOffset, long endOffset) {
this.file = file;
this.startOffset = startOffset;
this.endOffset = endOffset;
}
// private StationIdent readStationName() {
// int startPtr = ptr;
// int hashCode = 0;
// int hashBytePtr = 0;
// byte c;
// while ((c = buffer.get(ptr++)) != ';') {
// hashCode ^= ((int) c) << (hashBytePtr * 8);
// hashBytePtr = (hashBytePtr + 1) % 4;
// }
// byte[] stationNameBfr = new byte[ptr - startPtr - 1];
// buffer.get(startPtr, stationNameBfr);
// return new StationIdent(stationNameBfr, hashCode);
// }
private StationIdent readStationName() {
final var VECTOR_SPECIES = ByteVector.SPECIES_256;
if (chunkSize - ptr - 100 < VECTOR_SPECIES.length()) { // fallback
int startPtr = ptr;
while (buffer.get(ptr++) != ';') {
}
byte[] stationNameBfr = new byte[ptr - startPtr - 1];
buffer.get(startPtr, stationNameBfr);
return new StationIdent(stationNameBfr, Arrays.hashCode(stationNameBfr) ^ stationNameBfr.length);
}
else { // SIMD
int sepIdx = 0;
while (true) {
ByteVector tmp = ByteVector.fromMemorySegment(VECTOR_SPECIES, memorySegment, ptr + sepIdx, ByteOrder.LITTLE_ENDIAN);
final var cmpResult = tmp.compare(VectorOperators.EQ, ';');
if (cmpResult.anyTrue()) {
sepIdx += cmpResult.firstTrue();
break;
}
else {
sepIdx += tmp.length();
}
}
int endPtr = ptr + sepIdx;
byte[] stationNameBfr = new byte[endPtr - ptr];
buffer.get(ptr, stationNameBfr);
ptr = endPtr + 1;
return new StationIdent(stationNameBfr, Arrays.hashCode(stationNameBfr) ^ stationNameBfr.length);
}
}
private int readTemperature() {
int ret = 0;
byte c = buffer.get(ptr++);
final boolean neg = (c == '-');
if (neg) {
c = buffer.get(ptr++);
}
do {
if (c != '.') {
ret = ret * 10 + c - '0';
}
} while ((c = buffer.get(ptr++)) != '\n');
if (neg)
return -ret;
return ret;
}
@Override
public void run() {
workSet = new HashMap<>();
if (endOffset - startOffset > Integer.MAX_VALUE) {
throw new RuntimeException("Mapping a block larger than 2GB is not possible with Java! Welcome to 2024 :)");
}
chunkSize = (int) (endOffset - startOffset);
try {
buffer = file.getChannel().map(FileChannel.MapMode.READ_ONLY, startOffset, chunkSize);
memorySegment = MemorySegment.ofBuffer(buffer);
while (ptr < chunkSize) {
var station = readStationName();
int temp = readTemperature();
var stationWorkSet = workSet.get(station);
if (stationWorkSet == null) {
stationWorkSet = new MeasurementAggregator();
workSet.put(station, stationWorkSet);
}
stationWorkSet.min = Math.min(temp, stationWorkSet.min);
stationWorkSet.max = Math.max(temp, stationWorkSet.max);
stationWorkSet.sum += temp;
stationWorkSet.count += 1;
}
}
catch (Throwable e) {
e.printStackTrace();
throw new RuntimeException(e);
}
}
}
private static void printWorkSet(TreeMap<String, MeasurementAggregator> result, PrintStream out) {
out.write('{');
final var iterator = result.entrySet().iterator();
while (iterator.hasNext()) {
var entry = iterator.next();
out.print(entry.getKey());
out.write('=');
entry.getValue().printInto(out);
if (iterator.hasNext()) {
out.print(", ");
}
}
out.println('}');
}
private static int createChunks(final RandomAccessFile file, final ChunkReader[] chunks) throws IOException {
final long fileEndPtr = file.length();
final long chunkSize = Math.max(1, fileEndPtr / chunks.length);
int jobCnt = 0;
long chunkStartPtr = 0;
final byte[] tmpBuffer = new byte[128];
while (chunkStartPtr < fileEndPtr) {
long chunkEndPtr = Math.min(chunkStartPtr + chunkSize, fileEndPtr);
// Seek into file at the calculated chunk end ptr, then extend it until the next
// new-line or EOF
if (chunkEndPtr < fileEndPtr) {
file.seek(Math.max(0, chunkEndPtr - 1));
file.read(tmpBuffer);
int offset = 0;
while (tmpBuffer[offset] != '\n') {
offset += 1;
}
chunkEndPtr += offset;
}
chunks[jobCnt] = new ChunkReader(file, chunkStartPtr, chunkEndPtr);
jobCnt += 1;
chunkStartPtr = chunkEndPtr;
}
return jobCnt;
}
public static void main(String[] args) throws IOException, InterruptedException {
final RandomAccessFile file = new RandomAccessFile(FILE, "r");
int jobCnt = Runtime.getRuntime().availableProcessors();
final var chunks = new ChunkReader[jobCnt];
jobCnt = createChunks(file, chunks);
try (final var executor = Executors.newFixedThreadPool(jobCnt)) {
for (int i = 0; i < jobCnt; ++i) {
executor.submit(chunks[i]);
}
executor.shutdown();
final var ignored = executor.awaitTermination(1, TimeUnit.DAYS);
}
// merge chunks
final var result = new TreeMap<String, MeasurementAggregator>();
for (int i = 0; i < jobCnt; ++i) {
chunks[i].workSet.forEach((ident, otherStationWorkSet) -> {
final var identStr = new String(ident.name);
final var stationWorkSet = result.get(identStr);
if (stationWorkSet == null) {
result.put(identStr, otherStationWorkSet);
}
else {
stationWorkSet.min = Math.min(stationWorkSet.min, otherStationWorkSet.min);
stationWorkSet.max = Math.max(stationWorkSet.max, otherStationWorkSet.max);
stationWorkSet.sum += otherStationWorkSet.sum;
stationWorkSet.count += otherStationWorkSet.count;
}
});
}
result.forEach((ignored, meas) -> meas.finish());
// print in required format
printWorkSet(result, System.out);
}
}