1brc/src/main/java/dev/morling/onebrc/CalculateAverage_zerninv.java

227 lines
8.0 KiB
Java
Raw Normal View History

/*
* 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 java.io.IOException;
import java.nio.MappedByteBuffer;
import java.nio.channels.FileChannel;
import java.nio.file.Path;
import java.nio.file.StandardOpenOption;
import java.util.*;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;
public class CalculateAverage_zerninv {
private static final String FILE = "./measurements.txt";
private static final int MIN_FILE_SIZE = 1024 * 1024;
private static final char DELIMITER = ';';
private static final char LINE_SEPARATOR = '\n';
private static final char ZERO = '0';
private static final char NINE = '9';
private static final char MINUS = '-';
public static void main(String[] args) throws IOException {
var results = new HashMap<String, MeasurementAggregation>();
try (var channel = FileChannel.open(Path.of(FILE), StandardOpenOption.READ)) {
var fileSize = channel.size();
var cores = Runtime.getRuntime().availableProcessors();
var chunks = cores - 1;
var maxChunkSize = fileSize < MIN_FILE_SIZE ? fileSize : Math.min(fileSize / chunks, Integer.MAX_VALUE);
var chunkOffsets = splitByChunks(channel, maxChunkSize);
var executor = Executors.newFixedThreadPool(cores);
List<Future<Map<String, MeasurementAggregation>>> fResults = new ArrayList<>();
for (int i = 1; i < chunkOffsets.size(); i++) {
final long prev = chunkOffsets.get(i - 1);
final long curr = chunkOffsets.get(i);
fResults.add(executor.submit(() -> calcForChunk(channel, prev, curr)));
}
fResults.forEach(f -> {
try {
f.get().forEach((key, value) -> {
var result = results.get(key);
if (result != null) {
result.merge(value);
}
else {
results.put(key, value);
}
});
}
catch (InterruptedException | ExecutionException e) {
e.printStackTrace();
}
});
executor.shutdown();
}
System.out.println(new TreeMap<>(results));
}
private static List<Long> splitByChunks(FileChannel channel, long maxChunkSize) throws IOException {
long size = channel.size();
List<Long> result = new ArrayList<>();
long current = 0;
result.add(current);
while (current < size) {
var mbb = channel.map(FileChannel.MapMode.READ_ONLY, current, Math.min(size - current, maxChunkSize));
int position = mbb.limit() - 1;
while (mbb.get(position) != LINE_SEPARATOR) {
position--;
}
current += position + 1;
result.add(current);
}
return result;
}
private static Map<String, MeasurementAggregation> calcForChunk(FileChannel channel, long begin, long end) throws IOException {
var mbb = channel.map(FileChannel.MapMode.READ_ONLY, begin, end - begin);
2024-01-11 21:53:51 +01:00
var results = new MeasurementContainer(mbb);
int cityOffset, cityNameSize, hashCode, temperatureOffset, temperature;
byte b;
while (mbb.hasRemaining()) {
cityOffset = mbb.position();
hashCode = 0;
while ((b = mbb.get()) != DELIMITER) {
hashCode = 31 * hashCode + b;
}
temperatureOffset = mbb.position();
2024-01-11 21:53:51 +01:00
cityNameSize = temperatureOffset - cityOffset - 1;
temperature = 0;
while ((b = mbb.get()) != LINE_SEPARATOR) {
if (b >= ZERO && b <= NINE) {
temperature = temperature * 10 + (b - ZERO);
}
}
if (mbb.get(temperatureOffset) == MINUS) {
temperature *= -1;
}
2024-01-11 21:53:51 +01:00
results.put(cityOffset, cityNameSize, hashCode, (short) temperature);
}
2024-01-11 21:53:51 +01:00
return results.toStringMap();
}
private static final class MeasurementAggregation {
private long sum;
private int count;
2024-01-11 21:53:51 +01:00
private short min;
private short max;
public MeasurementAggregation(long sum, int count, short min, short max) {
this.sum = sum;
this.count = count;
this.min = min;
this.max = max;
}
public void merge(MeasurementAggregation o) {
if (o == null) {
return;
}
sum += o.sum;
count += o.count;
2024-01-11 21:53:51 +01:00
min = min < o.min ? min : o.min;
max = max > o.max ? max : o.max;
}
@Override
public String toString() {
return String.format("%.1f/%.1f/%.1f", min / 10d, sum / 10d / count, max / 10d);
}
}
2024-01-11 21:53:51 +01:00
private static final class MeasurementContainer {
private static final int SIZE = 1024 * 16;
2024-01-11 21:53:51 +01:00
private final MappedByteBuffer mbb;
private final int[] offsets = new int[SIZE];
private final int[] sizes = new int[SIZE];
private final int[] hashes = new int[SIZE];
private final long[] sums = new long[SIZE];
private final int[] counts = new int[SIZE];
private final short[] mins = new short[SIZE];
private final short[] maxs = new short[SIZE];
private MeasurementContainer(MappedByteBuffer mbb) {
this.mbb = mbb;
Arrays.fill(mins, Short.MAX_VALUE);
Arrays.fill(maxs, Short.MIN_VALUE);
}
public void put(int offset, int size, int hash, short value) {
int i = findIdx(offset, size, hash);
offsets[i] = offset;
sizes[i] = size;
hashes[i] = hash;
sums[i] += value;
counts[i]++;
if (value < mins[i]) {
mins[i] = value;
}
if (value > maxs[i]) {
maxs[i] = value;
}
2024-01-11 21:53:51 +01:00
}
public Map<String, MeasurementAggregation> toStringMap() {
var result = new HashMap<String, MeasurementAggregation>();
for (int i = 0; i < SIZE; i++) {
if (counts[i] != 0) {
var key = createString(offsets[i], sizes[i]);
result.put(key, new MeasurementAggregation(sums[i], counts[i], mins[i], maxs[i]));
}
}
2024-01-11 21:53:51 +01:00
return result;
}
2024-01-11 21:53:51 +01:00
private int findIdx(int offset, int size, int hash) {
int i = Math.abs(hash % SIZE);
while (counts[i] != 0) {
if (hashes[i] == hash && sizes[i] == size && isEqual(i, offset)) {
break;
}
i = (i + 1) % SIZE;
}
2024-01-11 21:53:51 +01:00
return i;
}
private boolean isEqual(int index, int offset) {
for (int i = 0; i < sizes[index]; i++) {
if (mbb.get(offsets[index] + i) != mbb.get(offset + i)) {
return false;
}
}
return true;
}
2024-01-11 21:53:51 +01:00
private String createString(int offset, int size) {
byte[] arr = new byte[size];
for (int i = 0; i < size; i++) {
2024-01-11 21:53:51 +01:00
arr[i] = mbb.get(offset + i);
}
return new String(arr);
}
}
}