@Test public void testOneKey() throws Exception { random = new Random(33221); VectorMapJoinFastLongHashMap map = new VectorMapJoinFastLongHashMap( false, false, HashTableKeyType.LONG, CAPACITY, LOAD_FACTOR, WB_SIZE, -1); VerifyFastLongHashMap verifyTable = new VerifyFastLongHashMap(); long key = random.nextLong(); byte[] value = new byte[random.nextInt(MAX_VALUE_LENGTH)]; random.nextBytes(value); map.testPutRow(key, value); verifyTable.add(key, value); // Second value. value = new byte[random.nextInt(MAX_VALUE_LENGTH)]; random.nextBytes(value); map.testPutRow(key, value); verifyTable.add(key, value); // Third value. value = new byte[random.nextInt(MAX_VALUE_LENGTH)]; random.nextBytes(value); map.testPutRow(key, value); verifyTable.add(key, value); verifyTable.verifyNonMatched(map, random); }
@Test public void testOneKey() throws Exception { random = new Random(33221); VectorMapJoinFastLongHashMap map = new VectorMapJoinFastLongHashMap( false, false, HashTableKeyType.LONG, CAPACITY, LOAD_FACTOR, WB_SIZE, -1); VerifyFastLongHashMap verifyTable = new VerifyFastLongHashMap(); long key = random.nextLong(); byte[] value = new byte[random.nextInt(MAX_VALUE_LENGTH)]; random.nextBytes(value); map.testPutRow(key, value); verifyTable.add(key, value); verifyTable.verify(map); // Second value. value = new byte[random.nextInt(MAX_VALUE_LENGTH)]; random.nextBytes(value); map.testPutRow(key, value); verifyTable.add(key, value); verifyTable.verify(map); // Third value. value = new byte[random.nextInt(MAX_VALUE_LENGTH)]; random.nextBytes(value); map.testPutRow(key, value); verifyTable.add(key, value); verifyTable.verify(map); }
public void addAndVerifyMultipleKeyMultipleValue(int keyCount, VectorMapJoinFastLongHashMap map, VerifyFastLongHashMap verifyTable, int fixedValueLength) throws HiveException, IOException { for (int i = 0; i < keyCount; i++) { byte[] value; if (fixedValueLength == -1) { value = new byte[generateLargeCount() - 1]; } else { value = new byte[fixedValueLength]; } random.nextBytes(value); // Add a new key or add a value to an existing key? if (random.nextBoolean() || verifyTable.getCount() == 0) { long key; while (true) { key = random.nextLong(); if (!verifyTable.contains(key)) { // Unique keys for this test. break; } } map.testPutRow(key, value); verifyTable.add(key, value); } else { long randomExistingKey = verifyTable.addRandomExisting(value, random); map.testPutRow(randomExistingKey, value); } } verifyTable.verifyNonMatched(map, random); }
@Test public void testMultipleKeysSingleValue() throws Exception { random = new Random(900); VectorMapJoinFastLongHashMap map = new VectorMapJoinFastLongHashMap( false, false, HashTableKeyType.LONG, CAPACITY, LOAD_FACTOR, WB_SIZE, -1); VerifyFastLongHashMap verifyTable = new VerifyFastLongHashMap(); int keyCount = 100 + random.nextInt(1000); for (int i = 0; i < keyCount; i++) { long key; while (true) { key = random.nextLong(); if (!verifyTable.contains(key)) { // Unique keys for this test. break; } } byte[] value = new byte[random.nextInt(MAX_VALUE_LENGTH)]; random.nextBytes(value); map.testPutRow(key, value); verifyTable.add(key, value); // verifyTable.verify(map); } verifyTable.verify(map); }
@Test public void testMultipleKeysSingleValue() throws Exception { random = new Random(900); VectorMapJoinFastLongHashMap map = new VectorMapJoinFastLongHashMap( false, false, HashTableKeyType.LONG, CAPACITY, LOAD_FACTOR, WB_SIZE, -1); VerifyFastLongHashMap verifyTable = new VerifyFastLongHashMap(); int keyCount = 100 + random.nextInt(1000); for (int i = 0; i < keyCount; i++) { long key; while (true) { key = random.nextLong(); if (!verifyTable.contains(key)) { // Unique keys for this test. break; } } byte[] value = new byte[random.nextInt(MAX_VALUE_LENGTH)]; random.nextBytes(value); map.testPutRow(key, value); verifyTable.add(key, value); } verifyTable.verifyNonMatched(map, random); }
@Test public void testExpand() throws Exception { random = new Random(5227); // Start with capacity 1; make sure we expand on every put. VectorMapJoinFastLongHashMap map = new VectorMapJoinFastLongHashMap( false, false, HashTableKeyType.LONG, 1, 0.0000001f, WB_SIZE, -1); VerifyFastLongHashMap verifyTable = new VerifyFastLongHashMap(); for (int i = 0; i < 18; ++i) { long key; while (true) { key = random.nextLong(); if (!verifyTable.contains(key)) { // Unique keys for this test. break; } } byte[] value = new byte[random.nextInt(MAX_VALUE_LENGTH)]; random.nextBytes(value); map.testPutRow(key, value); verifyTable.add(key, value); // verifyTable.verify(map); } verifyTable.verify(map); // assertEquals(1 << 18, map.getCapacity()); }
@Test public void testExpand() throws Exception { random = new Random(5227); // Start with capacity 1; make sure we expand on every put. VectorMapJoinFastLongHashMap map = new VectorMapJoinFastLongHashMap( false, false, HashTableKeyType.LONG, 1, 0.0000001f, WB_SIZE, -1); VerifyFastLongHashMap verifyTable = new VerifyFastLongHashMap(); for (int i = 0; i < 18; ++i) { long key; while (true) { key = random.nextLong(); if (!verifyTable.contains(key)) { // Unique keys for this test. break; } } byte[] value = new byte[random.nextInt(MAX_VALUE_LENGTH)]; random.nextBytes(value); map.testPutRow(key, value); verifyTable.add(key, value); } verifyTable.verifyNonMatched(map, random); // assertEquals(1 << 18, map.getCapacity()); }
map.testPutRow(key, value); verifyTable.add(key, value); verifyTable.verify(map); } else { long randomExistingKey = verifyTable.addRandomExisting(value, random); map.testPutRow(randomExistingKey, value);
random.nextBytes(value); map.testPutRow(key, value); verifyTable.add(key, value);
@Test public void testGetNonExistent() throws Exception { random = new Random(450); VectorMapJoinFastLongHashMap map = new VectorMapJoinFastLongHashMap( false, false, HashTableKeyType.LONG, CAPACITY, LOAD_FACTOR, WB_SIZE, -1); VerifyFastLongHashMap verifyTable = new VerifyFastLongHashMap(); long key1 = random.nextLong(); byte[] value = new byte[random.nextInt(MAX_VALUE_LENGTH)]; random.nextBytes(value); map.testPutRow(key1, value); verifyTable.add(key1, value); verifyTable.verify(map); long key2 = key1 += 1; VectorMapJoinHashMapResult hashMapResult = map.createHashMapResult(); JoinUtil.JoinResult joinResult = map.lookup(key2, hashMapResult); assertTrue(joinResult == JoinUtil.JoinResult.NOMATCH); assertTrue(!hashMapResult.hasRows()); map.testPutRow(key2, value); verifyTable.add(key2, value); verifyTable.verify(map); long key3 = key2 += 1; hashMapResult = map.createHashMapResult(); joinResult = map.lookup(key3, hashMapResult); assertTrue(joinResult == JoinUtil.JoinResult.NOMATCH); assertTrue(!hashMapResult.hasRows()); }