Package org.apache.flink.runtime.operators.testutils.types

Examples of org.apache.flink.runtime.operators.testutils.types.IntPair

158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
      end = System.currentTimeMillis();
      System.out.println("HashMap ready. Time: " + (end-start) + " ms");
     
      System.out.println("Starting first probing run...");
      start = System.currentTimeMillis();
      IntPair compare = new IntPair();
      HashBucketIterator<IntPair, IntPair> iter;
      IntPair target = new IntPair();
      while(probeTester.next(compare) != null) {
        iter = table.getMatchesFor(compare);
        iter.next(target);
        assertEquals(target.getKey(), compare.getKey());
        assertEquals(target.getValue(), compare.getValue());
        assertTrue(iter.next(target) == null);
      }
      end = System.currentTimeMillis();
      System.out.println("Probing done. Time: " + (end-start) + " ms");
 
      System.out.println("Starting update...");
      start = System.currentTimeMillis();
      while(updater.next(compare) != null) {
        compare.setValue(compare.getValue()*-1);
        iter = table.getMatchesFor(compare);
        iter.next(target);
        iter.writeBack(compare);
        //assertFalse(iter.next(target));
      }
      end = System.currentTimeMillis();
      System.out.println("Update done. Time: " + (end-start) + " ms");
     
      System.out.println("Starting second probing run...");
      start = System.currentTimeMillis();
      while(updateTester.next(compare) != null) {
        compare.setValue(compare.getValue()*-1);
        iter = table.getMatchesFor(compare);
        iter.next(target);
        assertEquals(target.getKey(), compare.getKey());
        assertEquals(target.getValue(), compare.getValue());
        assertTrue(iter.next(target) == null);
      }
      end = System.currentTimeMillis();
      System.out.println("Probing done. Time: " + (end-start) + " ms");
     
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
      for (int i = 0; i < NUM_PAIRS; i++) {
        table.insert(pairs[i]);
      }
 
      AbstractHashTableProber<IntPair, IntPair> prober = table.getProber(comparator, pairComparator);
      IntPair target = new IntPair();
     
      for (int i = 0; i < NUM_PAIRS; i++) {
        assertNotNull(prober.getMatchFor(pairs[i], target));
        assertEquals(pairs[i].getValue(), target.getValue());
      }
     
     
      table.close();
      assertEquals("Memory lost", NUM_MEM_PAGES, table.getFreeMemory().size());
View Full Code Here
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
      for (int i = 0; i < NUM_PAIRS; i++) {
        table.insert(pairs[i]);
      }
 
      AbstractHashTableProber<IntPair, IntPair> prober = table.getProber(comparator, pairComparator);
      IntPair target = new IntPair();
     
      for (int i = 0; i < NUM_PAIRS; i++) {
        assertNotNull(prober.getMatchFor(pairs[i], target));
        assertEquals(pairs[i].getValue(), target.getValue());
      }
     
      // make sure there is enough memory for resize
      memory.addAll(getMemory(ADDITIONAL_MEM, PAGE_SIZE));
      Boolean b = Whitebox.<Boolean>invokeMethod(table, "resizeHashTable");
      assertTrue(b.booleanValue());
     
      for (int i = 0; i < NUM_PAIRS; i++) {
        assertNotNull(pairs[i].getKey() + " " + pairs[i].getValue(), prober.getMatchFor(pairs[i], target));
        assertEquals(pairs[i].getValue(), target.getValue());
      }
     
      table.close();
      assertEquals("Memory lost", NUM_MEM_PAGES + ADDITIONAL_MEM, table.getFreeMemory().size());
    } catch (Exception e) {
View Full Code Here
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
      for (int i = 0; i < NUM_PAIRS; i++) {
        table.insert(pairs[i]);
      }
 
      AbstractHashTableProber<IntPair, IntPair> prober = table.getProber(comparator, pairComparator);
      IntPair target = new IntPair();
     
      for (int i = 0; i < NUM_PAIRS; i++) {
        assertNotNull(prober.getMatchFor(pairs[i], target));
        assertEquals(pairs[i].getValue(), target.getValue());
      }
     
      // make sure there is enough memory for resize
      memory.addAll(getMemory(ADDITIONAL_MEM, PAGE_SIZE));
      Boolean b = Whitebox.<Boolean>invokeMethod(table, "resizeHashTable");
      assertTrue(b.booleanValue());
     
      for (int i = 0; i < NUM_PAIRS; i++) {
        assertNotNull(pairs[i].getKey() + " " + pairs[i].getValue(), prober.getMatchFor(pairs[i], target));
        assertEquals(pairs[i].getValue(), target.getValue());
      }
     
      // make sure there is enough memory for resize
      memory.addAll(getMemory(ADDITIONAL_MEM, PAGE_SIZE));
      b = Whitebox.<Boolean>invokeMethod(table, "resizeHashTable");
      assertTrue(b.booleanValue());
           
      for (int i = 0; i < NUM_PAIRS; i++) {
        assertNotNull(pairs[i].getKey() + " " + pairs[i].getValue(), prober.getMatchFor(pairs[i], target));
        assertEquals(pairs[i].getValue(), target.getValue());
      }
           
      table.close();
      assertEquals("Memory lost", NUM_MEM_PAGES + ADDITIONAL_MEM + ADDITIONAL_MEM, table.getFreeMemory().size());
    } catch (Exception e) {
View Full Code Here
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
      for (int i = 0; i < NUM_PAIRS; i++) {
        table.insert(pairs[i]);
      }
 
      AbstractHashTableProber<IntPair, IntPair> prober = table.getProber(comparator, pairComparator);
      IntPair target = new IntPair();
     
      for (int i = 0; i < NUM_PAIRS; i++) {
        assertNotNull(prober.getMatchFor(pairs[i], target));
        assertEquals(pairs[i].getValue(), target.getValue());
      }
     
      // make sure there is enough memory for resize
      memory.addAll(getMemory(ADDITIONAL_MEM, PAGE_SIZE));
      Boolean b = Whitebox.<Boolean>invokeMethod(table, "resizeHashTable");
      assertTrue(b.booleanValue());
     
      for (int i = 0; i < NUM_PAIRS; i++) {
        assertNotNull(pairs[i].getKey() + " " + pairs[i].getValue(), prober.getMatchFor(pairs[i], target));
        assertEquals(pairs[i].getValue(), target.getValue());
      }
     
      // make sure there is enough memory for resize
      memory.addAll(getMemory(ADDITIONAL_MEM, PAGE_SIZE));
      b = Whitebox.<Boolean>invokeMethod(table, "resizeHashTable");
      assertTrue(b.booleanValue());
           
      for (int i = 0; i < NUM_PAIRS; i++) {
        assertNotNull(pairs[i].getKey() + " " + pairs[i].getValue(), prober.getMatchFor(pairs[i], target));
        assertEquals(pairs[i].getValue(), target.getValue());
      }
     
      // make sure there is enough memory for resize
      memory.addAll(getMemory(2*ADDITIONAL_MEM, PAGE_SIZE));
      b = Whitebox.<Boolean>invokeMethod(table, "resizeHashTable");
      assertTrue(b.booleanValue());
                 
      for (int i = 0; i < NUM_PAIRS; i++) {
        assertNotNull(pairs[i].getKey() + " " + pairs[i].getValue(), prober.getMatchFor(pairs[i], target));
        assertEquals(pairs[i].getValue(), target.getValue());
      }
           
      table.close();
      assertEquals("Memory lost", NUM_MEM_PAGES + 4*ADDITIONAL_MEM, table.getFreeMemory().size());
    } catch (Exception e) {
View Full Code Here
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
  private static IntPair[] getRandomizedIntPairs(int num, Random rnd) {
    IntPair[] pairs = new IntPair[num];
   
    // create all the pairs, dense
    for (int i = 0; i < num; i++) {
      pairs[i] = new IntPair(i, i + KEY_VALUE_DIFF);
    }
   
    // randomly swap them
    for (int i = 0; i < 2 * num; i++) {
      int pos1 = rnd.nextInt(num);
      int pos2 = rnd.nextInt(num);
     
      IntPair tmp = pairs[pos1];
      pairs[pos1] = pairs[pos2];
      pairs[pos2] = tmp;
    }
   
    return pairs;
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
    FixedLengthRecordSorter<IntPair> sorter = newSortBuffer(memory);
    RandomIntPairGenerator generator = new RandomIntPairGenerator(SEED);
   
//    long startTime = System.currentTimeMillis();
    // write the records
    IntPair record = new IntPair();
    int num = -1;
    do {
      generator.next(record);
      num++;
    }
    while (sorter.write(record) && num < 3354624);
//    System.out.println("WRITE TIME " + (System.currentTimeMillis() - startTime));
   
    // re-read the records
    generator.reset();
    IntPair readTarget = new IntPair();
   
//    startTime = System.currentTimeMillis();
    int i = 0;
    while (i < num) {
      generator.next(record);
      readTarget = sorter.getRecord(readTarget, i++);
     
      int rk = readTarget.getKey();
      int gk = record.getKey();
     
      int rv = readTarget.getValue();
      int gv = record.getValue();
     
      if (gk != rk) {
        Assert.fail("The re-read key is wrong " + i);
      }
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
   
    FixedLengthRecordSorter<IntPair> sorter = newSortBuffer(memory);
    RandomIntPairGenerator generator = new RandomIntPairGenerator(SEED);
   
    // write the records
    IntPair record = new IntPair();
    int num = -1;
    do {
      generator.next(record);
      num++;
    }
    while (sorter.write(record));
   
    // re-read the records
    generator.reset();
   
    MutableObjectIterator<IntPair> iter = sorter.getIterator();
    IntPair readTarget = new IntPair();
    int count = 0;
   
    while ((readTarget = iter.next(readTarget)) != null) {
      count++;
     
      generator.next(record);
     
      int rk = readTarget.getKey();
      int gk = record.getKey();
     
      int rv = readTarget.getValue();
      int gv = record.getValue();
     
      Assert.assertEquals("The re-read key is wrong", gk, rk);
      Assert.assertEquals("The re-read value is wrong", gv, rv);
    }
View Full Code Here
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
   
    FixedLengthRecordSorter<IntPair> sorter = newSortBuffer(memory);
    RandomIntPairGenerator generator = new RandomIntPairGenerator(SEED);
   
    // write the buffer full with the first set of records
    IntPair record = new IntPair();
    int num = -1;
    do {
      generator.next(record);
      num++;
    }
    while (sorter.write(record) && num < 3354624);
   
    sorter.reset();
   
    // write a second sequence of records. since the values are of fixed length, we must be able to write an equal number
    generator.reset();
   
    // write the buffer full with the first set of records
    int num2 = -1;
    do {
      generator.next(record);
      num2++;
    }
    while (sorter.write(record) && num2 < 3354624);
   
    Assert.assertEquals("The number of records written after the reset was not the same as before.", num, num2);
   
    // re-read the records
    generator.reset();
    IntPair readTarget = new IntPair();
   
    int i = 0;
    while (i < num) {
      generator.next(record);
      readTarget = sorter.getRecord(readTarget, i++);
     
      int rk = readTarget.getKey();
      int gk = record.getKey();
     
      int rv = readTarget.getValue();
      int gv = record.getValue();
     
      Assert.assertEquals("The re-read key is wrong", gk, rk);
      Assert.assertEquals("The re-read value is wrong", gv, rv);
    }
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
   
    FixedLengthRecordSorter<IntPair> sorter = newSortBuffer(memory);
    RandomIntPairGenerator generator = new RandomIntPairGenerator(SEED);
   
    // write the records
    IntPair record = new IntPair();
    int num = -1;
    do {
      generator.next(record);
      num++;
    }
    while (sorter.write(record) && num < 3354624);
   
    // swap the records
    int start = 0, end = num - 1;
    while (start < end) {
      sorter.swap(start++, end--);
    }
   
    // re-read the records
    generator.reset();
    IntPair readTarget = new IntPair();
   
    int i = num - 1;
    while (i >= 0) {
      generator.next(record);
      readTarget = sorter.getRecord(readTarget, i--);
     
      int rk = readTarget.getKey();
      int gk = record.getKey();
     
      int rv = readTarget.getValue();
      int gv = record.getValue();
     
      Assert.assertEquals("The re-read key is wrong", gk, rk);
      Assert.assertEquals("The re-read value is wrong", gv, rv);
    }
View Full Code Here
TOP

Related Classes of org.apache.flink.runtime.operators.testutils.types.IntPair

  • org.apache.flink.runtime.operators.hash.HashMatchIteratorITCase
  • org.apache.flink.runtime.operators.hash.HashTableITCase
  • org.apache.flink.runtime.operators.hash.HashTablePerformanceComparison
  • org.apache.flink.runtime.operators.hash.MemoryHashTableTest
  • org.apache.flink.runtime.operators.sort.ExternalSortITCase
  • org.apache.flink.runtime.operators.sort.FixedLengthRecordSorterTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.