2021-03-13 19:01:36 +01:00
|
|
|
package it.cavallium.dbengine.database.collections;
|
|
|
|
|
2021-04-30 19:15:04 +02:00
|
|
|
import io.netty.buffer.ByteBufAllocator;
|
|
|
|
import io.netty.buffer.PooledByteBufAllocator;
|
|
|
|
import io.netty.buffer.Unpooled;
|
|
|
|
import it.cavallium.dbengine.database.LLUtils;
|
2021-03-13 19:01:36 +01:00
|
|
|
import java.util.Arrays;
|
|
|
|
import org.junit.jupiter.api.Assertions;
|
|
|
|
import org.junit.jupiter.api.Test;
|
2021-04-30 19:15:04 +02:00
|
|
|
import static io.netty.buffer.Unpooled.*;
|
2021-03-13 19:01:36 +01:00
|
|
|
|
|
|
|
public class TestRanges {
|
2021-04-30 19:15:04 +02:00
|
|
|
|
|
|
|
@Test
|
|
|
|
public void testDirectBuffer() {
|
|
|
|
Assertions.assertTrue(wrappedBuffer(Unpooled.directBuffer(10, 10), Unpooled.buffer(10, 10)).isDirect());
|
|
|
|
}
|
|
|
|
|
2021-03-13 19:01:36 +01:00
|
|
|
@Test
|
|
|
|
public void testNextRangeKey() {
|
|
|
|
testNextRangeKey(new byte[] {0x00, 0x00, 0x00});
|
|
|
|
testNextRangeKey(new byte[] {0x00, 0x00, 0x01});
|
|
|
|
testNextRangeKey(new byte[] {0x00, 0x00, 0x02});
|
|
|
|
testNextRangeKey(new byte[] {0x00, 0x01, 0x02});
|
|
|
|
testNextRangeKey(new byte[] {0x00, 0x00, (byte) 0xFF});
|
|
|
|
testNextRangeKey(new byte[] {0x00, 0x01, (byte) 0xFF});
|
|
|
|
testNextRangeKey(new byte[] {0x00, (byte) 0xFF, (byte) 0xFF});
|
|
|
|
testNextRangeKey(new byte[] {(byte) 0xFF, (byte) 0xFF, (byte) 0xFF});
|
|
|
|
testNextRangeKey(new byte[] {(byte) 0xFF, (byte) 0, (byte) 0xFF});
|
|
|
|
testNextRangeKey(new byte[] {(byte) 0xFF, (byte) 0xFF, (byte) 0});
|
|
|
|
}
|
|
|
|
|
|
|
|
public void testNextRangeKey(byte[] prefixKey) {
|
|
|
|
|
2021-04-30 19:15:04 +02:00
|
|
|
byte[] firstRangeKey = LLUtils.toArray(DatabaseMapDictionaryDeep.firstRangeKey(PooledByteBufAllocator.DEFAULT,
|
|
|
|
LLUtils.convertToDirectByteBuf(PooledByteBufAllocator.DEFAULT, wrappedBuffer(prefixKey)),
|
|
|
|
prefixKey.length,
|
|
|
|
7,
|
|
|
|
3
|
|
|
|
));
|
|
|
|
byte[] nextRangeKey = LLUtils.toArray(DatabaseMapDictionaryDeep.nextRangeKey(PooledByteBufAllocator.DEFAULT,
|
|
|
|
LLUtils.convertToDirectByteBuf(PooledByteBufAllocator.DEFAULT, wrappedBuffer(prefixKey)),
|
|
|
|
prefixKey.length,
|
|
|
|
7,
|
|
|
|
3
|
|
|
|
));
|
2021-03-13 19:01:36 +01:00
|
|
|
|
|
|
|
if (Arrays.equals(prefixKey, new byte[] {(byte) 0xFF, (byte) 0xFF, (byte) 0xFF})) {
|
2021-04-30 19:15:04 +02:00
|
|
|
Assertions.assertArrayEquals(new byte[] {(byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, 0}, nextRangeKey);
|
2021-03-13 19:01:36 +01:00
|
|
|
} else {
|
|
|
|
long biPrefix = 0;
|
|
|
|
var s = 0;
|
|
|
|
for (int i = prefixKey.length - 1; i >= 0; i--) {
|
|
|
|
biPrefix += ((long) (prefixKey[i] & 0xFF)) << s;
|
|
|
|
s += Byte.SIZE;
|
|
|
|
}
|
|
|
|
var nrPrefix = Arrays.copyOf(nextRangeKey, prefixKey.length);
|
|
|
|
|
|
|
|
long biNextPrefix = 0;
|
|
|
|
s = 0;
|
|
|
|
for (int i = prefixKey.length - 1; i >= 0; i--) {
|
|
|
|
biNextPrefix += ((long) (nrPrefix[i] & 0xFF)) << s;
|
|
|
|
s += Byte.SIZE;
|
|
|
|
}
|
|
|
|
Assertions.assertEquals(biPrefix + 1, biNextPrefix);
|
|
|
|
Assertions.assertArrayEquals(
|
|
|
|
new byte[7 + 3],
|
|
|
|
Arrays.copyOfRange(nextRangeKey, prefixKey.length, prefixKey.length + 7 + 3)
|
|
|
|
);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
@Test
|
|
|
|
public void testNextRangeKeyWithSuffix() {
|
|
|
|
testNextRangeKeyWithSuffix(new byte[] {0x00, 0x01, (byte) 0xFF}, new byte[] {0x00, 0x00, 0x00});
|
|
|
|
testNextRangeKeyWithSuffix(new byte[] {0x00, 0x00, 0x01}, new byte[] {0x00, 0x00, 0x01});
|
|
|
|
testNextRangeKeyWithSuffix(new byte[] {0x00, 0x00, 0x02}, new byte[] {0x00, 0x00, 0x02});
|
|
|
|
testNextRangeKeyWithSuffix(new byte[] {0x00, 0x01, 0x02}, new byte[] {0x00, 0x01, 0x02});
|
|
|
|
testNextRangeKeyWithSuffix(new byte[] {0x00, 0x00, (byte) 0xFF}, new byte[] {0x00, 0x00, (byte) 0xFF});
|
|
|
|
testNextRangeKeyWithSuffix(new byte[] {0x00, 0x01, (byte) 0xFF}, new byte[] {0x00, 0x01, (byte) 0xFF});
|
|
|
|
testNextRangeKeyWithSuffix(new byte[] {0x00, (byte) 0xFF, (byte) 0xFF}, new byte[] {0x00, (byte) 0xFF, (byte) 0xFF});
|
|
|
|
testNextRangeKeyWithSuffix(new byte[] {(byte) 0xFF, (byte) 0xFF, (byte) 0xFF}, new byte[] {(byte) 0xFF, (byte) 0xFF, (byte) 0xFF});
|
|
|
|
testNextRangeKeyWithSuffix(new byte[] {(byte) 0xFF, (byte) 0, (byte) 0xFF}, new byte[] {(byte) 0xFF, (byte) 0, (byte) 0xFF});
|
|
|
|
testNextRangeKeyWithSuffix(new byte[] {(byte) 0xFF, (byte) 0xFF, (byte) 0}, new byte[] {(byte) 0xFF, (byte) 0xFF, (byte) 0});
|
|
|
|
}
|
|
|
|
|
|
|
|
public void testNextRangeKeyWithSuffix(byte[] prefixKey, byte[] suffixKey) {
|
|
|
|
|
2021-04-30 19:15:04 +02:00
|
|
|
byte[] firstRangeKey = LLUtils.toArray(DatabaseMapDictionaryDeep.firstRangeKey(ByteBufAllocator.DEFAULT,
|
|
|
|
LLUtils.convertToDirectByteBuf(PooledByteBufAllocator.DEFAULT, wrappedBuffer(prefixKey)),
|
|
|
|
LLUtils.convertToDirectByteBuf(PooledByteBufAllocator.DEFAULT, wrappedBuffer(suffixKey)),
|
|
|
|
prefixKey.length,
|
|
|
|
3,
|
|
|
|
7
|
|
|
|
));
|
|
|
|
byte[] nextRangeKey = LLUtils.toArray(DatabaseMapDictionaryDeep.nextRangeKey(ByteBufAllocator.DEFAULT,
|
|
|
|
LLUtils.convertToDirectByteBuf(PooledByteBufAllocator.DEFAULT, wrappedBuffer(prefixKey)),
|
|
|
|
LLUtils.convertToDirectByteBuf(PooledByteBufAllocator.DEFAULT, wrappedBuffer(suffixKey)),
|
|
|
|
prefixKey.length,
|
|
|
|
3,
|
|
|
|
7
|
|
|
|
));
|
2021-03-13 19:01:36 +01:00
|
|
|
|
|
|
|
if (Arrays.equals(prefixKey, new byte[] {(byte) 0xFF, (byte) 0xFF, (byte) 0xFF}) && Arrays.equals(suffixKey, new byte[] {(byte) 0xFF, (byte) 0xFF, (byte) 0xFF})) {
|
2021-04-30 19:15:04 +02:00
|
|
|
Assertions.assertArrayEquals(new byte[] {(byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, 0}, nextRangeKey);
|
2021-03-13 19:01:36 +01:00
|
|
|
} else {
|
|
|
|
long biPrefix = 0;
|
|
|
|
var s = 0;
|
|
|
|
for (int i = (suffixKey.length) - 1; i >= 0; i--) {
|
|
|
|
biPrefix += ((long) (suffixKey[i] & 0xFF)) << s;
|
|
|
|
s += Byte.SIZE;
|
|
|
|
}
|
|
|
|
for (int i = (prefixKey.length) - 1; i >= 0; i--) {
|
|
|
|
biPrefix += ((long) (prefixKey[i] & 0xFF)) << s;
|
|
|
|
s += Byte.SIZE;
|
|
|
|
}
|
|
|
|
var nrPrefix = Arrays.copyOf(nextRangeKey, prefixKey.length + suffixKey.length);
|
|
|
|
|
|
|
|
long biNextPrefix = 0;
|
|
|
|
s = 0;
|
|
|
|
for (int i = (prefixKey.length + suffixKey.length) - 1; i >= 0; i--) {
|
|
|
|
biNextPrefix += ((long) (nrPrefix[i] & 0xFF)) << s;
|
|
|
|
s += Byte.SIZE;
|
|
|
|
}
|
|
|
|
Assertions.assertEquals(biPrefix + 1, biNextPrefix);
|
|
|
|
Assertions.assertArrayEquals(
|
|
|
|
new byte[7],
|
|
|
|
Arrays.copyOfRange(nextRangeKey, prefixKey.length + suffixKey.length, prefixKey.length + suffixKey.length + 7)
|
|
|
|
);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|