ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/loops/ScalarLongSort.java
(Generate patch)

Comparing jsr166/src/test/loops/ScalarLongSort.java (file contents):
Revision 1.9 by dl, Fri Aug 19 11:25:04 2011 UTC vs.
Revision 1.12 by jsr166, Wed Dec 31 17:00:58 2014 UTC

# Line 4 | Line 4
4   * http://creativecommons.org/publicdomain/zero/1.0/
5   */
6  
7 – import java.util.concurrent.*;
7   import java.util.*;
8 + import java.util.concurrent.*;
9  
10   class ScalarLongSort {
11      static final long NPS = (1000L * 1000 * 1000);
# Line 13 | Line 13 | class ScalarLongSort {
13      static int THRESHOLD = -1;
14      static final boolean warmup = true;
15  
16 <    public static void main (String[] args) throws Exception {
16 >    public static void main(String[] args) throws Exception {
17          int procs = 0;
18          int n = 1 << 22;
19          int reps = 20;
# Line 148 | Line 148 | class ScalarLongSort {
148           * and finding index of right closest to split point.
149           * Uses left-spine decomposition to generate all
150           * merge tasks before bottomming out at base case.
151 –         *
151           */
152          public final void compute() {
153              Merger rights = null;
# Line 209 | Line 208 | class ScalarLongSort {
208  
209      }
210  
211 <    static void checkSorted (long[] a) {
211 >    static void checkSorted(long[] a) {
212          int n = a.length;
213          for (int i = 0; i < n - 1; i++) {
214              if (a[i] > a[i+1]) {

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines