Java Code Examples for org.apache.flink.runtime.operators.testutils.TestData#MockTuple2Reader
The following examples show how to use
org.apache.flink.runtime.operators.testutils.TestData#MockTuple2Reader .
You can vote up the ones you like or vote down the ones you don't like,
and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: CombiningUnilateralSortMergerITCase.java From Flink-CEPplus with Apache License 2.0 | 5 votes |
@Test public void testCombine() throws Exception { int noKeys = 100; int noKeyCnt = 10000; TestData.MockTuple2Reader<Tuple2<Integer, Integer>> reader = TestData.getIntIntTupleReader(); LOG.debug("initializing sortmerger"); TestCountCombiner comb = new TestCountCombiner(); Sorter<Tuple2<Integer, Integer>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory2, this.comparator2, 0.25, 64, 0.7f, true /* use large record handler */, false); final Tuple2<Integer, Integer> rec = new Tuple2<>(); rec.setField(1, 1); for (int i = 0; i < noKeyCnt; i++) { for (int j = 0; j < noKeys; j++) { rec.setField(j, 0); reader.emit(rec); } } reader.close(); MutableObjectIterator<Tuple2<Integer, Integer>> iterator = merger.getIterator(); Iterator<Integer> result = getReducingIterator(iterator, serializerFactory2.getSerializer(), comparator2.duplicate()); while (result.hasNext()) { Assert.assertEquals(noKeyCnt, result.next().intValue()); } merger.close(); // if the combiner was opened, it must have been closed Assert.assertTrue(comb.opened == comb.closed); }
Example 2
Source File: CombiningUnilateralSortMergerITCase.java From Flink-CEPplus with Apache License 2.0 | 5 votes |
@Test public void testCombineSpilling() throws Exception { int noKeys = 100; int noKeyCnt = 10000; TestData.MockTuple2Reader<Tuple2<Integer, Integer>> reader = TestData.getIntIntTupleReader(); LOG.debug("initializing sortmerger"); TestCountCombiner comb = new TestCountCombiner(); Sorter<Tuple2<Integer, Integer>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory2, this.comparator2, 0.01, 64, 0.005f, true /* use large record handler */, true); final Tuple2<Integer, Integer> rec = new Tuple2<>(); rec.setField(1, 1); for (int i = 0; i < noKeyCnt; i++) { for (int j = 0; j < noKeys; j++) { rec.setField(j, 0); reader.emit(rec); } } reader.close(); MutableObjectIterator<Tuple2<Integer, Integer>> iterator = merger.getIterator(); Iterator<Integer> result = getReducingIterator(iterator, serializerFactory2.getSerializer(), comparator2.duplicate()); while (result.hasNext()) { Assert.assertEquals(noKeyCnt, result.next().intValue()); } merger.close(); // if the combiner was opened, it must have been closed Assert.assertTrue(comb.opened == comb.closed); }
Example 3
Source File: CombiningUnilateralSortMergerITCase.java From Flink-CEPplus with Apache License 2.0 | 5 votes |
@Test public void testCombineSpillingDisableObjectReuse() throws Exception { int noKeys = 100; int noKeyCnt = 10000; TestData.MockTuple2Reader<Tuple2<Integer, Integer>> reader = TestData.getIntIntTupleReader(); LOG.debug("initializing sortmerger"); MaterializedCountCombiner comb = new MaterializedCountCombiner(); // set maxNumFileHandles = 2 to trigger multiple channel merging Sorter<Tuple2<Integer, Integer>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory2, this.comparator2, 0.01, 2, 0.005f, true /* use large record handler */, false); final Tuple2<Integer, Integer> rec = new Tuple2<>(); for (int i = 0; i < noKeyCnt; i++) { rec.setField(i, 0); for (int j = 0; j < noKeys; j++) { rec.setField(j, 1); reader.emit(rec); } } reader.close(); MutableObjectIterator<Tuple2<Integer, Integer>> iterator = merger.getIterator(); Iterator<Integer> result = getReducingIterator(iterator, serializerFactory2.getSerializer(), comparator2.duplicate()); while (result.hasNext()) { Assert.assertEquals(4950, result.next().intValue()); } merger.close(); }
Example 4
Source File: CombiningUnilateralSortMergerITCase.java From flink with Apache License 2.0 | 5 votes |
@Test public void testCombine() throws Exception { int noKeys = 100; int noKeyCnt = 10000; TestData.MockTuple2Reader<Tuple2<Integer, Integer>> reader = TestData.getIntIntTupleReader(); LOG.debug("initializing sortmerger"); TestCountCombiner comb = new TestCountCombiner(); Sorter<Tuple2<Integer, Integer>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory2, this.comparator2, 0.25, 64, 0.7f, true /* use large record handler */, false); final Tuple2<Integer, Integer> rec = new Tuple2<>(); rec.setField(1, 1); for (int i = 0; i < noKeyCnt; i++) { for (int j = 0; j < noKeys; j++) { rec.setField(j, 0); reader.emit(rec); } } reader.close(); MutableObjectIterator<Tuple2<Integer, Integer>> iterator = merger.getIterator(); Iterator<Integer> result = getReducingIterator(iterator, serializerFactory2.getSerializer(), comparator2.duplicate()); while (result.hasNext()) { Assert.assertEquals(noKeyCnt, result.next().intValue()); } merger.close(); // if the combiner was opened, it must have been closed Assert.assertTrue(comb.opened == comb.closed); }
Example 5
Source File: CombiningUnilateralSortMergerITCase.java From flink with Apache License 2.0 | 5 votes |
@Test public void testCombineSpilling() throws Exception { int noKeys = 100; int noKeyCnt = 10000; TestData.MockTuple2Reader<Tuple2<Integer, Integer>> reader = TestData.getIntIntTupleReader(); LOG.debug("initializing sortmerger"); TestCountCombiner comb = new TestCountCombiner(); Sorter<Tuple2<Integer, Integer>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory2, this.comparator2, 0.01, 64, 0.005f, true /* use large record handler */, true); final Tuple2<Integer, Integer> rec = new Tuple2<>(); rec.setField(1, 1); for (int i = 0; i < noKeyCnt; i++) { for (int j = 0; j < noKeys; j++) { rec.setField(j, 0); reader.emit(rec); } } reader.close(); MutableObjectIterator<Tuple2<Integer, Integer>> iterator = merger.getIterator(); Iterator<Integer> result = getReducingIterator(iterator, serializerFactory2.getSerializer(), comparator2.duplicate()); while (result.hasNext()) { Assert.assertEquals(noKeyCnt, result.next().intValue()); } merger.close(); // if the combiner was opened, it must have been closed Assert.assertTrue(comb.opened == comb.closed); }
Example 6
Source File: CombiningUnilateralSortMergerITCase.java From flink with Apache License 2.0 | 5 votes |
@Test public void testCombineSpillingDisableObjectReuse() throws Exception { int noKeys = 100; int noKeyCnt = 10000; TestData.MockTuple2Reader<Tuple2<Integer, Integer>> reader = TestData.getIntIntTupleReader(); LOG.debug("initializing sortmerger"); MaterializedCountCombiner comb = new MaterializedCountCombiner(); // set maxNumFileHandles = 2 to trigger multiple channel merging Sorter<Tuple2<Integer, Integer>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory2, this.comparator2, 0.01, 2, 0.005f, true /* use large record handler */, false); final Tuple2<Integer, Integer> rec = new Tuple2<>(); for (int i = 0; i < noKeyCnt; i++) { rec.setField(i, 0); for (int j = 0; j < noKeys; j++) { rec.setField(j, 1); reader.emit(rec); } } reader.close(); MutableObjectIterator<Tuple2<Integer, Integer>> iterator = merger.getIterator(); Iterator<Integer> result = getReducingIterator(iterator, serializerFactory2.getSerializer(), comparator2.duplicate()); while (result.hasNext()) { Assert.assertEquals(4950, result.next().intValue()); } merger.close(); }
Example 7
Source File: CombiningUnilateralSortMergerITCase.java From flink with Apache License 2.0 | 5 votes |
@Test public void testCombine() throws Exception { int noKeys = 100; int noKeyCnt = 10000; TestData.MockTuple2Reader<Tuple2<Integer, Integer>> reader = TestData.getIntIntTupleReader(); LOG.debug("initializing sortmerger"); TestCountCombiner comb = new TestCountCombiner(); Sorter<Tuple2<Integer, Integer>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory2, this.comparator2, 0.25, 64, 0.7f, true /* use large record handler */, false); final Tuple2<Integer, Integer> rec = new Tuple2<>(); rec.setField(1, 1); for (int i = 0; i < noKeyCnt; i++) { for (int j = 0; j < noKeys; j++) { rec.setField(j, 0); reader.emit(rec); } } reader.close(); MutableObjectIterator<Tuple2<Integer, Integer>> iterator = merger.getIterator(); Iterator<Integer> result = getReducingIterator(iterator, serializerFactory2.getSerializer(), comparator2.duplicate()); while (result.hasNext()) { Assert.assertEquals(noKeyCnt, result.next().intValue()); } merger.close(); // if the combiner was opened, it must have been closed Assert.assertTrue(comb.opened == comb.closed); }
Example 8
Source File: CombiningUnilateralSortMergerITCase.java From flink with Apache License 2.0 | 5 votes |
@Test public void testCombineSpilling() throws Exception { int noKeys = 100; int noKeyCnt = 10000; TestData.MockTuple2Reader<Tuple2<Integer, Integer>> reader = TestData.getIntIntTupleReader(); LOG.debug("initializing sortmerger"); TestCountCombiner comb = new TestCountCombiner(); Sorter<Tuple2<Integer, Integer>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory2, this.comparator2, 0.01, 64, 0.005f, true /* use large record handler */, true); final Tuple2<Integer, Integer> rec = new Tuple2<>(); rec.setField(1, 1); for (int i = 0; i < noKeyCnt; i++) { for (int j = 0; j < noKeys; j++) { rec.setField(j, 0); reader.emit(rec); } } reader.close(); MutableObjectIterator<Tuple2<Integer, Integer>> iterator = merger.getIterator(); Iterator<Integer> result = getReducingIterator(iterator, serializerFactory2.getSerializer(), comparator2.duplicate()); while (result.hasNext()) { Assert.assertEquals(noKeyCnt, result.next().intValue()); } merger.close(); // if the combiner was opened, it must have been closed Assert.assertTrue(comb.opened == comb.closed); }
Example 9
Source File: CombiningUnilateralSortMergerITCase.java From flink with Apache License 2.0 | 5 votes |
@Test public void testCombineSpillingDisableObjectReuse() throws Exception { int noKeys = 100; int noKeyCnt = 10000; TestData.MockTuple2Reader<Tuple2<Integer, Integer>> reader = TestData.getIntIntTupleReader(); LOG.debug("initializing sortmerger"); MaterializedCountCombiner comb = new MaterializedCountCombiner(); // set maxNumFileHandles = 2 to trigger multiple channel merging Sorter<Tuple2<Integer, Integer>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory2, this.comparator2, 0.01, 2, 0.005f, true /* use large record handler */, false); final Tuple2<Integer, Integer> rec = new Tuple2<>(); for (int i = 0; i < noKeyCnt; i++) { rec.setField(i, 0); for (int j = 0; j < noKeys; j++) { rec.setField(j, 1); reader.emit(rec); } } reader.close(); MutableObjectIterator<Tuple2<Integer, Integer>> iterator = merger.getIterator(); Iterator<Integer> result = getReducingIterator(iterator, serializerFactory2.getSerializer(), comparator2.duplicate()); while (result.hasNext()) { Assert.assertEquals(4950, result.next().intValue()); } merger.close(); }
Example 10
Source File: CombiningUnilateralSortMergerITCase.java From Flink-CEPplus with Apache License 2.0 | 4 votes |
@Test public void testSortAndValidate() throws Exception { final Hashtable<Integer, Integer> countTable = new Hashtable<>(KEY_MAX); for (int i = 1; i <= KEY_MAX; i++) { countTable.put(i, 0); } // comparator final TypeComparator<Integer> keyComparator = new IntComparator(true); // reader TestData.MockTuple2Reader<Tuple2<Integer, String>> reader = TestData.getIntStringTupleReader(); // merge iterator LOG.debug("initializing sortmerger"); TestCountCombiner2 comb = new TestCountCombiner2(); Sorter<Tuple2<Integer, String>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory1, this.comparator1, 0.25, 2, 0.7f, true /* use large record handler */, false); // emit data LOG.debug("emitting data"); TestData.TupleGenerator generator = new TestData.TupleGenerator(SEED, KEY_MAX, VALUE_LENGTH, KeyMode.RANDOM, ValueMode.FIX_LENGTH); Tuple2<Integer, String> rec = new Tuple2<>(); for (int i = 0; i < NUM_PAIRS; i++) { Assert.assertTrue((rec = generator.next(rec)) != null); final Integer key = rec.f0; rec.setField("1", 1); reader.emit(rec); countTable.put(key, countTable.get(key) + 1); } reader.close(); // check order MutableObjectIterator<Tuple2<Integer, String>> iterator = merger.getIterator(); LOG.debug("checking results"); Tuple2<Integer, String> rec1 = new Tuple2<>(); Tuple2<Integer, String> rec2 = new Tuple2<>(); Assert.assertTrue((rec1 = iterator.next(rec1)) != null); countTable.put(rec1.f0, countTable.get(rec1.f0) - (Integer.parseInt(rec1.f1))); while ((rec2 = iterator.next(rec2)) != null) { int k1 = rec1.f0; int k2 = rec2.f0; Assert.assertTrue(keyComparator.compare(k1, k2) <= 0); countTable.put(k2, countTable.get(k2) - (Integer.parseInt(rec2.f1))); rec1 = rec2; } for (Integer cnt : countTable.values()) { Assert.assertTrue(cnt == 0); } merger.close(); // if the combiner was opened, it must have been closed Assert.assertTrue(comb.opened == comb.closed); }
Example 11
Source File: CombiningUnilateralSortMergerITCase.java From flink with Apache License 2.0 | 4 votes |
@Test public void testSortAndValidate() throws Exception { final Hashtable<Integer, Integer> countTable = new Hashtable<>(KEY_MAX); for (int i = 1; i <= KEY_MAX; i++) { countTable.put(i, 0); } // comparator final TypeComparator<Integer> keyComparator = new IntComparator(true); // reader TestData.MockTuple2Reader<Tuple2<Integer, String>> reader = TestData.getIntStringTupleReader(); // merge iterator LOG.debug("initializing sortmerger"); TestCountCombiner2 comb = new TestCountCombiner2(); Sorter<Tuple2<Integer, String>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory1, this.comparator1, 0.25, 2, 0.7f, true /* use large record handler */, false); // emit data LOG.debug("emitting data"); TestData.TupleGenerator generator = new TestData.TupleGenerator(SEED, KEY_MAX, VALUE_LENGTH, KeyMode.RANDOM, ValueMode.FIX_LENGTH); Tuple2<Integer, String> rec = new Tuple2<>(); for (int i = 0; i < NUM_PAIRS; i++) { Assert.assertTrue((rec = generator.next(rec)) != null); final Integer key = rec.f0; rec.setField("1", 1); reader.emit(rec); countTable.put(key, countTable.get(key) + 1); } reader.close(); // check order MutableObjectIterator<Tuple2<Integer, String>> iterator = merger.getIterator(); LOG.debug("checking results"); Tuple2<Integer, String> rec1 = new Tuple2<>(); Tuple2<Integer, String> rec2 = new Tuple2<>(); Assert.assertTrue((rec1 = iterator.next(rec1)) != null); countTable.put(rec1.f0, countTable.get(rec1.f0) - (Integer.parseInt(rec1.f1))); while ((rec2 = iterator.next(rec2)) != null) { int k1 = rec1.f0; int k2 = rec2.f0; Assert.assertTrue(keyComparator.compare(k1, k2) <= 0); countTable.put(k2, countTable.get(k2) - (Integer.parseInt(rec2.f1))); rec1 = rec2; } for (Integer cnt : countTable.values()) { Assert.assertTrue(cnt == 0); } merger.close(); // if the combiner was opened, it must have been closed Assert.assertTrue(comb.opened == comb.closed); }
Example 12
Source File: CombiningUnilateralSortMergerITCase.java From flink with Apache License 2.0 | 4 votes |
@Test public void testSortAndValidate() throws Exception { final Hashtable<Integer, Integer> countTable = new Hashtable<>(KEY_MAX); for (int i = 1; i <= KEY_MAX; i++) { countTable.put(i, 0); } // comparator final TypeComparator<Integer> keyComparator = new IntComparator(true); // reader TestData.MockTuple2Reader<Tuple2<Integer, String>> reader = TestData.getIntStringTupleReader(); // merge iterator LOG.debug("initializing sortmerger"); TestCountCombiner2 comb = new TestCountCombiner2(); Sorter<Tuple2<Integer, String>> merger = new CombiningUnilateralSortMerger<>(comb, this.memoryManager, this.ioManager, reader, this.parentTask, this.serializerFactory1, this.comparator1, 0.25, 2, 0.7f, true /* use large record handler */, false); // emit data LOG.debug("emitting data"); TestData.TupleGenerator generator = new TestData.TupleGenerator(SEED, KEY_MAX, VALUE_LENGTH, KeyMode.RANDOM, ValueMode.FIX_LENGTH); Tuple2<Integer, String> rec = new Tuple2<>(); for (int i = 0; i < NUM_PAIRS; i++) { Assert.assertTrue((rec = generator.next(rec)) != null); final Integer key = rec.f0; rec.setField("1", 1); reader.emit(rec); countTable.put(key, countTable.get(key) + 1); } reader.close(); // check order MutableObjectIterator<Tuple2<Integer, String>> iterator = merger.getIterator(); LOG.debug("checking results"); Tuple2<Integer, String> rec1 = new Tuple2<>(); Tuple2<Integer, String> rec2 = new Tuple2<>(); Assert.assertTrue((rec1 = iterator.next(rec1)) != null); countTable.put(rec1.f0, countTable.get(rec1.f0) - (Integer.parseInt(rec1.f1))); while ((rec2 = iterator.next(rec2)) != null) { int k1 = rec1.f0; int k2 = rec2.f0; Assert.assertTrue(keyComparator.compare(k1, k2) <= 0); countTable.put(k2, countTable.get(k2) - (Integer.parseInt(rec2.f1))); rec1 = rec2; } for (Integer cnt : countTable.values()) { Assert.assertTrue(cnt == 0); } merger.close(); // if the combiner was opened, it must have been closed Assert.assertTrue(comb.opened == comb.closed); }