@Test public void testOneKey() throws Exception { random = new Random(4186); VectorMapJoinFastLongHashSet map = new VectorMapJoinFastLongHashSet( false, false, HashTableKeyType.LONG, CAPACITY, LOAD_FACTOR, WB_SIZE, -1); VerifyFastLongHashSet verifyTable = new VerifyFastLongHashSet(); long key = random.nextLong(); map.testPutRow(key); verifyTable.add(key); verifyTable.verify(map); // Second time. map.testPutRow(key); verifyTable.add(key); verifyTable.verify(map); // Third time. map.testPutRow(key); verifyTable.add(key); verifyTable.verify(map); }
public void addAndVerifyMultipleKeyMultipleValue(int keyCount, VectorMapJoinFastLongHashSet map, VerifyFastLongHashSet verifyTable) throws HiveException, IOException { for (int i = 0; i < keyCount; i++) { byte[] value = new byte[generateLargeCount() - 1]; 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); verifyTable.add(key); verifyTable.verify(map); } else { long randomExistingKey = verifyTable.addRandomExisting(value, random); map.testPutRow(randomExistingKey); // verifyTable.verify(map); } verifyTable.verify(map); } } @Test
@Test public void testMultipleKeysSingleValue() throws Exception { random = new Random(1412); VectorMapJoinFastLongHashSet map = new VectorMapJoinFastLongHashSet( false, false, HashTableKeyType.LONG, CAPACITY, LOAD_FACTOR, WB_SIZE, -1); VerifyFastLongHashSet verifyTable = new VerifyFastLongHashSet(); 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; } } map.testPutRow(key); verifyTable.add(key); // verifyTable.verify(map); } verifyTable.verify(map); }
@Test public void testExpand() throws Exception { random = new Random(348); // Start with capacity 1; make sure we expand on every put. VectorMapJoinFastLongHashSet map = new VectorMapJoinFastLongHashSet( false, false, HashTableKeyType.LONG, 1, 0.0000001f, WB_SIZE, -1); VerifyFastLongHashSet verifyTable = new VerifyFastLongHashSet(); for (int i = 0; i < 18; ++i) { long key; while (true) { key = random.nextLong(); if (!verifyTable.contains(key)) { // Unique keys for this test. break; } } map.testPutRow(key); verifyTable.add(key); // verifyTable.verify(map); } verifyTable.verify(map); // assertEquals(1 << 18, map.getCapacity()); }
@Test public void testGetNonExistent() throws Exception { random = new Random(100); VectorMapJoinFastLongHashSet map = new VectorMapJoinFastLongHashSet( false, false, HashTableKeyType.LONG, CAPACITY, LOAD_FACTOR, WB_SIZE, -1); VerifyFastLongHashSet verifyTable = new VerifyFastLongHashSet(); long key1 = random.nextLong(); map.testPutRow(key1); verifyTable.add(key1); verifyTable.verify(map); long key2 = key1 += 1; VectorMapJoinHashSetResult hashSetResult = map.createHashSetResult(); JoinUtil.JoinResult joinResult = map.contains(key2, hashSetResult); assertTrue(joinResult == JoinUtil.JoinResult.NOMATCH); map.testPutRow(key2); verifyTable.add(key2); verifyTable.verify(map); long key3 = key2 += 1; hashSetResult = map.createHashSetResult(); joinResult = map.contains(key3, hashSetResult); assertTrue(joinResult == JoinUtil.JoinResult.NOMATCH); }
map.testPutRow(key); verifyTable.add(key);