tiennm99/zfoo
1
0
Fork 0
mirror of https://github.com/tiennm99/zfoo.git synced 2026-05-24 10:25:46 +00:00
Code Issues Packages Projects Releases Wiki Activity

perf[map]: 优化计算HashMap初始化合适的大小

Browse Source
This commit is contained in:
godotg
2022-09-24 19:25:18 +08:00
parent a0e00b4da8
commit d5e2704b0a
2 changed files with 13 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files
protocol/src/main/java/com/zfoo/protocol/buffer/ByteBufUtils.java
+12 -12
View File
@@ -454,7 +454,7 @@ public abstract class ByteBufUtils {
public static Map<Integer, Integer> readIntIntMap(ByteBuf byteBuf) {
var length = readInt(byteBuf);
var map = new IntObjectHashMap<Integer>(length);
var map = new IntObjectHashMap<Integer>(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
map.put(readInt(byteBuf), readIntBox(byteBuf));
}
@@ -475,7 +475,7 @@ public abstract class ByteBufUtils {
public static Map<Integer, Long> readIntLongMap(ByteBuf byteBuf) {
var length = readInt(byteBuf);
var map = new IntObjectHashMap<Long>(length);
var map = new IntObjectHashMap<Long>(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
map.put(readInt(byteBuf), readLongBox(byteBuf));
}
@@ -496,7 +496,7 @@ public abstract class ByteBufUtils {
public static Map<Integer, String> readIntStringMap(ByteBuf byteBuf) {
var length = readInt(byteBuf);
var map = new IntObjectHashMap<String>(length);
var map = new IntObjectHashMap<String>(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
map.put(readInt(byteBuf), readString(byteBuf));
}
@@ -517,7 +517,7 @@ public abstract class ByteBufUtils {
public static Map<Integer, IPacket> readIntPacketMap(ByteBuf byteBuf, IProtocolRegistration protocolRegistration) {
var length = readInt(byteBuf);
var map = new IntObjectHashMap<IPacket>(length);
var map = new IntObjectHashMap<IPacket>(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
map.put(readInt(byteBuf), (IPacket) protocolRegistration.read(byteBuf));
}
@@ -538,7 +538,7 @@ public abstract class ByteBufUtils {
public static Map<Long, Integer> readLongIntMap(ByteBuf byteBuf) {
var length = readInt(byteBuf);
var map = new LongObjectHashMap<Integer>(length);
var map = new LongObjectHashMap<Integer>(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
map.put(readLong(byteBuf), readIntBox(byteBuf));
}
@@ -559,7 +559,7 @@ public abstract class ByteBufUtils {
public static Map<Long, Long> readLongLongMap(ByteBuf byteBuf) {
var length = readInt(byteBuf);
var map = new LongObjectHashMap<Long>(length);
var map = new LongObjectHashMap<Long>(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
map.put(readLong(byteBuf), readLongBox(byteBuf));
}
@@ -580,7 +580,7 @@ public abstract class ByteBufUtils {
public static Map<Long, String> readLongStringMap(ByteBuf byteBuf) {
var length = readInt(byteBuf);
var map = new LongObjectHashMap<String>(length);
var map = new LongObjectHashMap<String>(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
map.put(readLong(byteBuf), readString(byteBuf));
}
@@ -601,7 +601,7 @@ public abstract class ByteBufUtils {
public static Map<Long, IPacket> readLongPacketMap(ByteBuf byteBuf, IProtocolRegistration protocolRegistration) {
var length = readInt(byteBuf);
var map = new LongObjectHashMap<IPacket>(length);
var map = new LongObjectHashMap<IPacket>(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
map.put(readLong(byteBuf), (IPacket) protocolRegistration.read(byteBuf));
}
@@ -846,7 +846,7 @@ public abstract class ByteBufUtils {
public static Set<Byte> readByteSet(ByteBuf byteBuf) {
var length = readInt(byteBuf);
var set = new HashByteSet(length);
var set = new HashByteSet(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
set.add(readByte(byteBuf));
}
@@ -932,7 +932,7 @@ public abstract class ByteBufUtils {
public static Set<Short> readShortSet(ByteBuf byteBuf) {
var length = readInt(byteBuf);
var set = new HashShortSet(length);
var set = new HashShortSet(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
set.add(readShort(byteBuf));
}
@@ -1011,7 +1011,7 @@ public abstract class ByteBufUtils {
public static Set<Integer> readIntSet(ByteBuf byteBuf) {
var length = readInt(byteBuf);
var set = new HashIntSet(length);
var set = new HashIntSet(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
set.add(readInt(byteBuf));
}
@@ -1090,7 +1090,7 @@ public abstract class ByteBufUtils {
public static Set<Long> readLongSet(ByteBuf byteBuf) {
var length = readInt(byteBuf);
var set = new HashLongSet(length);
var set = new HashLongSet(CollectionUtils.comfortableCapacity(length));
for (var i = 0; i < length; i++) {
set.add(readLong(byteBuf));
}
protocol/src/main/java/com/zfoo/protocol/collection/CollectionUtils.java
+1 -16
View File
@@ -88,27 +88,12 @@ public abstract class CollectionUtils {
return size <= 0 ? Collections.EMPTY_MAP : new HashMap<>(comfortableCapacity(size));
}
/**
* The largest power of two that can be represented as an {@code int}.
*/
public static final int MAX_POWER_OF_TWO = 1 << (Integer.SIZE - 2);
/**
* 计算HashMap初始化合适的大小
* <p>
* from com.google.common.collect.Maps.capacity()
*/
public static int comfortableCapacity(int expectedSize) {
if (expectedSize < 3) {
return expectedSize + 1;
}
if (expectedSize < MAX_POWER_OF_TWO) {
return (int) ((float) expectedSize / 0.75F + 1.0F);
}
// any large value
return Integer.MAX_VALUE;
return expectedSize < 8 ? 16 : expectedSize << 1;
}
// ----------------------------------归并排序----------------------------------