@Test
public void testRecordReader() throws Exception {
int n = 1;
int maxNumSplits = 100;
int maxNbTrees = 1000;
Random rng = RandomUtils.getRandom();
for (int nloop = 0; nloop < n; nloop++) {
int numSplits = rng.nextInt(maxNumSplits) + 1;
int nbTrees = rng.nextInt(maxNbTrees) + 1;
Configuration conf = getConfiguration();
Builder.setNbTrees(conf, nbTrees);
InMemInputFormat inputFormat = new InMemInputFormat();
List<InputSplit> splits = inputFormat.getSplits(conf, numSplits);
for (int index = 0; index < numSplits; index++) {
InMemInputSplit split = (InMemInputSplit) splits.get(index);
InMemRecordReader reader = new InMemRecordReader(split);
reader.initialize(split, null);
for (int tree = 0; tree < split.getNbTrees(); tree++) {
// reader.next() should return true until there is no tree left
assertEquals(tree < split.getNbTrees(), reader.nextKeyValue());
assertEquals(split.getFirstId() + tree, reader.getCurrentKey().get());
}
}
}
}
@Override
protected DecisionForest parseOutput(Job job) throws IOException {
Configuration conf = job.getConfiguration();
int numTrees = Builder.getNbTrees(conf);
Path outputPath = getOutputPath(conf);
TreeID[] keys = new TreeID[numTrees];
Node[] trees = new Node[numTrees];
int[] npos = new int[Builder.getNumMaps(conf)];
int[] nneg = new int[Builder.getNumMaps(conf)];
processOutput(job, outputPath, keys, trees, nneg, npos);
return new DecisionForest(Arrays.asList(trees), nneg, npos);
}
@Test
public void testSplits() throws Exception {
int n = 1;
int maxNumSplits = 100;
int maxNbTrees = 1000;
Random rng = RandomUtils.getRandom();
for (int nloop = 0; nloop < n; nloop++) {
int numSplits = rng.nextInt(maxNumSplits) + 1;
int nbTrees = rng.nextInt(maxNbTrees) + 1;
Configuration conf = getConfiguration();
Builder.setNbTrees(conf, nbTrees);
InMemInputFormat inputFormat = new InMemInputFormat();
List<InputSplit> splits = inputFormat.getSplits(conf, numSplits);
assertEquals(numSplits, splits.size());
int nbTreesPerSplit = nbTrees / numSplits;
int totalTrees = 0;
int expectedId = 0;
for (int index = 0; index < numSplits; index++) {
assertTrue(splits.get(index) instanceof InMemInputSplit);
InMemInputSplit split = (InMemInputSplit) splits.get(index);
assertEquals(expectedId, split.getFirstId());
if (index < numSplits - 1) {
assertEquals(nbTreesPerSplit, split.getNbTrees());
} else {
assertEquals(nbTrees - totalTrees, split.getNbTrees());
}
totalTrees += split.getNbTrees();
expectedId += split.getNbTrees();
}
}
}