Examples of QuickSort

Examples of org.apache.hadoop.util.QuickSort

138
139
140
141
142
143
144
145
146
147
148
      if (numPartitions > numRecords) {
        throw new IllegalArgumentException
          ("Requested more partitions than input keys (" + numPartitions +
           " > " + numRecords + ")");
      }
      new QuickSort().sort(this, 0, records.size());
      float stepSize = numRecords / (float) numPartitions;
      Text[] result = new Text[numPartitions-1];
      for(int i=1; i < numPartitions; ++i) {
        result[i-1] = records.get(Math.round(stepSize * i));
      }
View Full Code Here

Examples of org.apache.hadoop.util.QuickSort

47
48
49
50
51
52
53
54
55
  @Override
  public void sort(SelectionVector4 vector4, VectorContainer container){
    Stopwatch watch = new Stopwatch();
    watch.start();
    QuickSort qs = new QuickSort();
    qs.sort(this, 0, vector4.getTotalCount());
    logger.debug("Took {} us to sort {} records", watch.elapsed(TimeUnit.MICROSECONDS), vector4.getTotalCount());
  }
View Full Code Here

Examples of org.apache.hadoop.util.QuickSort

37
38
39
40
41
42
43
44
    doSetup(context, sampleBatch, null);
  }

  @Override
  public void sort(SelectionVector2 vector2, VectorContainer container){
    QuickSort qs = new QuickSort();
    qs.sort(this, 0, vector2.getCount());
  }
View Full Code Here

Examples of org.apache.hadoop.util.QuickSort

42
43
44
45
46
47
48
49
50
51
52
53
54
    doSetup(context, incoming, null);
  }

  @Override
  public void sort(SelectionVector2 vector2){
    QuickSort qs = new QuickSort();
    Stopwatch watch = new Stopwatch();
    watch.start();
    if (vector2.getCount() > 0) {
      qs.sort(this, 0, vector2.getCount());
    }
    logger.debug("Took {} us to sort {} records", watch.elapsed(TimeUnit.MICROSECONDS), vector2.getCount());
  }
View Full Code Here

Examples of org.apache.hadoop.util.QuickSort

48
49
50
51
52
53
54
55
56
57
58
    r.nextBytes(data);
    System.out.print("Data generated. ");
  }

  public long doSort(){
    QuickSort qs = new QuickSort();
    ByteSortable b = new ByteSortable();
    long nano = System.nanoTime();
    qs.sort(b, 0, RECORD_COUNT);
    return System.nanoTime() - nano;
  }
View Full Code Here

Examples of org.apache.hadoop.util.QuickSort

125
126
127
128
129
130
131
132
133
134
135
      if (numPartitions > numRecords) {
        throw new IllegalArgumentException
          ("Requested more partitions than input keys (" + numPartitions +
           " > " + numRecords + ")");
      }
      new QuickSort().sort(this, 0, records.size());
      float stepSize = numRecords / (float) numPartitions;
      Text[] result = new Text[numPartitions-1];
      for(int i=1; i < numPartitions; ++i) {
        result[i-1] = records.get(Math.round(stepSize * i));
      }
View Full Code Here

Examples of org.apache.hadoop.util.QuickSort

111
112
113
114
115
116
117
118
    if (memBlock.currentPtr <= 0) {
      return;
    }
    // quick sort the offsets
    OffsetSortable sortableObj = new OffsetSortable(memBlock, kvbuffer);
    QuickSort quickSort = new QuickSort();
    quickSort.sort(sortableObj, 0, memBlock.currentPtr);
  }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.