/**
* Copyright (C) 2014-2016 LinkedIn Corp. (pinot-core@linkedin.com)
*
* Licensed 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 com.linkedin.pinot.core.data.partition;
import java.util.Random;
import org.testng.Assert;
import org.testng.annotations.Test;
/**
* Unit test for {@link PartitionFunction}
*/
public class PartitionFunctionTest {
/**
* Unit test for {@link ModuloPartitionFunction}.
* <ul>
* <li> Builds an instance of the {@link ModuloPartitionFunction}. </li>
* <li> Performs modulo operations on random numbers and asserts results returned by the partition function
* are as expected. </li>
* </ul>
*/
@Test
public void testModulo() {
long seed = System.currentTimeMillis();
Random random = new Random(seed);
for (int i = 0; i < 1000; i++) {
int expectedNumPartitions = Math.abs(random.nextInt());
// Avoid divide-by-zero.
if (expectedNumPartitions == 0) {
expectedNumPartitions = 1;
}
String functionName = "MoDuLo";
PartitionFunction partitionFunction =
PartitionFunctionFactory.getPartitionFunction(functionName, expectedNumPartitions);
Assert.assertEquals(partitionFunction.toString().toLowerCase(), functionName.toLowerCase());
Assert.assertEquals(partitionFunction.getNumPartitions(), expectedNumPartitions);
for (int j = 0; j < 1000; j++) {
int value = random.nextInt();
Assert.assertEquals(partitionFunction.getPartition(value), (value % expectedNumPartitions));
}
}
}
/**
* Unit test for {@link MurmurPartitionFunction}.
* <ul>
* <li> Tests that partition values are in expected range. </li>
* <li> Tests that toString returns expected string. </li>
* </ul>
*/
@Test
public void testMurmurPartitioner() {
long seed = System.currentTimeMillis();
Random random = new Random(seed);
for (int i = 0; i < 1000; i++) {
int expectedNumPartitions = Math.abs(random.nextInt());
// Avoid divide-by-zero.
if (expectedNumPartitions == 0) {
expectedNumPartitions = 1;
}
String functionName = "mUrmur";
PartitionFunction partitionFunction =
PartitionFunctionFactory.getPartitionFunction(functionName, expectedNumPartitions);
Assert.assertEquals(partitionFunction.toString().toLowerCase(), functionName.toLowerCase());
Assert.assertEquals(partitionFunction.getNumPartitions(), expectedNumPartitions);
for (int j = 0; j < 1000; j++) {
Integer value = random.nextInt();
Assert.assertTrue(partitionFunction.getPartition(value.toString()) < expectedNumPartitions,
"Illegal: " + partitionFunction.getPartition(value.toString()) + " " + expectedNumPartitions);
}
}
}
/**
* Unit test for {@link MurmurPartitionFunction}.
* <ul>
* <li> Tests that partition values are in expected range. </li>
* <li> Tests that toString returns expected string. </li>
* </ul>
*/
@Test
public void testByteArrayPartitioner() {
long seed = System.currentTimeMillis();
Random random = new Random(seed);
for (int i = 0; i < 1000; i++) {
int expectedNumPartitions = Math.abs(random.nextInt());
// Avoid divide-by-zero.
if (expectedNumPartitions == 0) {
expectedNumPartitions = 1;
}
String functionName = "bYteArray";
PartitionFunction partitionFunction =
PartitionFunctionFactory.getPartitionFunction(functionName, expectedNumPartitions);
Assert.assertEquals(partitionFunction.toString().toLowerCase(), functionName.toLowerCase());
Assert.assertEquals(partitionFunction.getNumPartitions(), expectedNumPartitions);
for (int j = 0; j < 1000; j++) {
Integer value = random.nextInt();
Assert.assertTrue(partitionFunction.getPartition(value) < expectedNumPartitions,
"Illegal: " + partitionFunction.getPartition(value) + " " + expectedNumPartitions);
}
}
}
}