/**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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 org.apache.hadoop.hive.ql.exec.vector.mapjoin.fast;
import static org.junit.Assert.*;
import java.io.IOException;
import java.util.Random;
import org.apache.hadoop.hive.ql.exec.JoinUtil;
import org.apache.hadoop.hive.ql.exec.vector.mapjoin.fast.CheckFastHashTable.VerifyFastBytesHashSet;
import org.apache.hadoop.hive.ql.exec.vector.mapjoin.hashtable.VectorMapJoinHashSetResult;
import org.apache.hadoop.hive.ql.metadata.HiveException;
import org.junit.Test;
public class TestVectorMapJoinFastBytesHashSet extends CommonFastHashTable {
@Test
public void testOneKey() throws Exception {
random = new Random(81104);
VectorMapJoinFastMultiKeyHashSet map =
new VectorMapJoinFastMultiKeyHashSet(
false,CAPACITY, LOAD_FACTOR, WB_SIZE, -1);
VerifyFastBytesHashSet verifyTable = new VerifyFastBytesHashSet();
byte[] key = new byte[random.nextInt(MAX_KEY_LENGTH)];
random.nextBytes(key);
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);
}
@Test
public void testMultipleKeysSingleValue() throws Exception {
random = new Random(1120);
VectorMapJoinFastMultiKeyHashSet map =
new VectorMapJoinFastMultiKeyHashSet(
false,CAPACITY, LOAD_FACTOR, WB_SIZE, -1);
VerifyFastBytesHashSet verifyTable = new VerifyFastBytesHashSet();
int keyCount = 100 + random.nextInt(1000);
for (int i = 0; i < keyCount; i++) {
byte[] key = new byte[random.nextInt(MAX_KEY_LENGTH)];
random.nextBytes(key);
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 testGetNonExistent() throws Exception {
random = new Random(2293);
VectorMapJoinFastMultiKeyHashSet map =
new VectorMapJoinFastMultiKeyHashSet(
false,CAPACITY, LOAD_FACTOR, WB_SIZE, -1);
VerifyFastBytesHashSet verifyTable = new VerifyFastBytesHashSet();
byte[] key1 = new byte[random.nextInt(MAX_KEY_LENGTH)];
random.nextBytes(key1);
map.testPutRow(key1);
verifyTable.add(key1);
verifyTable.verify(map);
byte[] key2 = new byte[random.nextInt(MAX_KEY_LENGTH)];
random.nextBytes(key2);
VectorMapJoinHashSetResult hashSetResult = map.createHashSetResult();
JoinUtil.JoinResult joinResult = map.contains(key2, 0, key2.length, hashSetResult);
assertTrue(joinResult == JoinUtil.JoinResult.NOMATCH);
map.testPutRow(key2);
verifyTable.add(key2);
verifyTable.verify(map);
byte[] key3 = new byte[random.nextInt(MAX_KEY_LENGTH)];
random.nextBytes(key3);
hashSetResult = map.createHashSetResult();
joinResult = map.contains(key3, 0, key3.length, hashSetResult);
assertTrue(joinResult == JoinUtil.JoinResult.NOMATCH);
}
@Test
public void testFullMap() throws Exception {
random = new Random(219);
// Make sure the map does not expand; should be able to find space.
VectorMapJoinFastMultiKeyHashSet map =
new VectorMapJoinFastMultiKeyHashSet(false,CAPACITY, 1f, WB_SIZE, -1);
VerifyFastBytesHashSet verifyTable = new VerifyFastBytesHashSet();
for (int i = 0; i < CAPACITY; i++) {
byte[] key;
while (true) {
key = new byte[random.nextInt(MAX_KEY_LENGTH)];
random.nextBytes(key);
if (!verifyTable.contains(key)) {
// Unique keys for this test.
break;
}
}
map.testPutRow(key);
verifyTable.add(key);
// verifyTable.verify(map);
}
verifyTable.verify(map);
byte[] anotherKey;
while (true) {
anotherKey = new byte[random.nextInt(MAX_KEY_LENGTH)];
random.nextBytes(anotherKey);
if (!verifyTable.contains(anotherKey)) {
// Unique keys for this test.
break;
}
}
VectorMapJoinHashSetResult hashSetResult = map.createHashSetResult();
JoinUtil.JoinResult joinResult = map.contains(anotherKey, 0, anotherKey.length, hashSetResult);
assertTrue(joinResult == JoinUtil.JoinResult.NOMATCH);
}
@Test
public void testExpand() throws Exception {
random = new Random(773);
// Start with capacity 1; make sure we expand on every put.
VectorMapJoinFastMultiKeyHashSet map =
new VectorMapJoinFastMultiKeyHashSet(false,1, 0.0000001f, WB_SIZE, -1);
VerifyFastBytesHashSet verifyTable = new VerifyFastBytesHashSet();
for (int i = 0; i < 18; ++i) {
byte[] key;
while (true) {
key = new byte[random.nextInt(MAX_KEY_LENGTH)];
random.nextBytes(key);
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());
}
public void addAndVerifyMultipleKeyMultipleValue(int keyCount,
VectorMapJoinFastMultiKeyHashSet map, VerifyFastBytesHashSet 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) {
byte[] key;
while (true) {
key = new byte[random.nextInt(MAX_KEY_LENGTH)];
random.nextBytes(key);
if (!verifyTable.contains(key)) {
// Unique keys for this test.
break;
}
}
map.testPutRow(key);
verifyTable.add(key);
// verifyTable.verify(map);
} else {
byte[] randomExistingKey = verifyTable.addRandomExisting(value, random);
map.testPutRow(randomExistingKey);
// verifyTable.verify(map);
}
}
verifyTable.verify(map);
}
@Test
public void testMultipleKeysMultipleValue() throws Exception {
random = new Random(9);
// Use a large capacity that doesn't require expansion, yet.
VectorMapJoinFastMultiKeyHashSet map =
new VectorMapJoinFastMultiKeyHashSet(
false,LARGE_CAPACITY, LOAD_FACTOR, LARGE_WB_SIZE, -1);
VerifyFastBytesHashSet verifyTable = new VerifyFastBytesHashSet();
int keyCount = 1000;
addAndVerifyMultipleKeyMultipleValue(keyCount, map, verifyTable);
}
@Test
public void testLargeAndExpand() throws Exception {
random = new Random(8462);
// Use a large capacity that doesn't require expansion, yet.
VectorMapJoinFastMultiKeyHashSet map =
new VectorMapJoinFastMultiKeyHashSet(
false,MODERATE_CAPACITY, LOAD_FACTOR, MODERATE_WB_SIZE, -1);
VerifyFastBytesHashSet verifyTable = new VerifyFastBytesHashSet();
int keyCount = 1000;
addAndVerifyMultipleKeyMultipleValue(keyCount, map, verifyTable);
}
}