trim spaces

Author: archmoj

lib/compile_sort.js

@@ -53,9 +53,9 @@ function createInsertionSort(order, dtype) {
   var funcName = ["ndarrayInsertionSort", order.join("d"), dtype].join("")
   var funcArgs = ["left", "right", "data", "offset" ].concat(shapeArgs(order.length))
   var allocator = getMallocFree(dtype)
-  
+
   var vars = [ "i,j,cptr,ptr=left*s0+offset" ]
-  
+
   if(order.length > 1) {
     var scratch_shape = []
     for(var i=1; i<order.length; ++i) {
@@ -71,31 +71,31 @@ function createInsertionSort(order, dtype) {
   } else {
     vars.push("scratch")
   }
-  
+
   function dataRead(ptr) {
     if(dtype === "generic") {
       return ["data.get(", ptr, ")"].join("")
     }
     return ["data[",ptr,"]"].join("")
   }
-  
+
   function dataWrite(ptr, v) {
     if(dtype === "generic") {
       return ["data.set(", ptr, ",", v, ")"].join("")
     }
     return ["data[",ptr,"]=",v].join("")
   }
-  
+
   //Create function header
   code.push(
     ["function ", funcName, "(", funcArgs.join(","), "){var ", vars.join(",")].join(""),
       "for(i=left+1;i<=right;++i){",
         "j=i;ptr+=s0",
         "cptr=ptr")
-  
-  
+
+
   if(order.length > 1) {
-  
+
     //Copy data into scratch
     code.push("dptr=0;sptr=ptr")
     for(var i=order.length-1; i>=0; --i) {
@@ -114,7 +114,7 @@ function createInsertionSort(order, dtype) {
       code.push("sptr+=d"+j,"}")
     }
 
-    
+
     //Compare items in outer loop
     code.push("__g:while(j-->left){",
               "dptr=0",
@@ -132,7 +132,7 @@ function createInsertionSort(order, dtype) {
         "dptr+=f"+i,
         "}")
     }
-    
+
     //Copy data back
     code.push("dptr=cptr;sptr=cptr-s0")
     for(var i=order.length-1; i>=0; --i) {
@@ -150,7 +150,7 @@ function createInsertionSort(order, dtype) {
       }
       code.push(["dptr+=d",j,";sptr+=d",j].join(""),"}")
     }
-    
+
     //Close while loop
     code.push("cptr-=s0\n}")
 
@@ -179,14 +179,14 @@ function createInsertionSort(order, dtype) {
               "}",
               dataWrite("cptr", "scratch"))
   }
-  
+
   //Close outer loop body
   code.push("}")
   if(order.length > 1 && allocator) {
     code.push("free(scratch)")
   }
   code.push("} return " + funcName)
-  
+
   //Compile and link function
   if(allocator) {
     var result = new Function("malloc", "free", code.join("\n"))
@@ -203,9 +203,9 @@ function createQuickSort(order, dtype, insertionSort) {
   var funcArgs = ["left", "right", "data", "offset" ].concat(shapeArgs(order.length))
   var allocator = getMallocFree(dtype)
   var labelCounter=0
-  
+
   code.push(["function ", funcName, "(", funcArgs.join(","), "){"].join(""))
-  
+
   var vars = [
     "sixth=((right-left+1)/6)|0",
     "index1=left+sixth",
@@ -234,7 +234,7 @@ function createQuickSort(order, dtype, insertionSort) {
     "comp_pivot2=0",
     "comp=0"
   ]
-  
+
   if(order.length > 1) {
     var ele_size = []
     for(var i=1; i<order.length; ++i) {
@@ -262,28 +262,28 @@ function createQuickSort(order, dtype, insertionSort) {
   } else {
     vars.push("pivot1", "pivot2")
   }
-  
+
   //Initialize local variables
   code.push("var " + vars.join(","))
-  
+
   function toPointer(v) {
     return ["(offset+",v,"*s0)"].join("")
   }
-  
+
   function dataRead(ptr) {
     if(dtype === "generic") {
       return ["data.get(", ptr, ")"].join("")
     }
     return ["data[",ptr,"]"].join("")
   }
-  
+
   function dataWrite(ptr, v) {
     if(dtype === "generic") {
       return ["data.set(", ptr, ",", v, ")"].join("")
     }
     return ["data[",ptr,"]=",v].join("")
   }
-  
+
   function cacheLoop(ptrs, usePivot, body) {
     if(ptrs.length === 1) {
       code.push("ptr0="+toPointer(ptrs[0]))
@@ -325,7 +325,7 @@ function createQuickSort(order, dtype, insertionSort) {
       code.push("}")
     }
   }
-  
+
   function lexicoLoop(label, ptrs, usePivot, body) {
     if(ptrs.length === 1) {
       code.push("ptr0="+toPointer(ptrs[0]))
@@ -362,13 +362,13 @@ function createQuickSort(order, dtype, insertionSort) {
       code.push("}")
     }
   }
-  
+
   function cleanUp() {
     if(order.length > 1 && allocator) {
       code.push("free(pivot1)", "free(pivot2)")
     }
   }
-  
+
   function compareSwap(a_id, b_id) {
     var a = "el"+a_id
     var b = "el"+b_id
@@ -383,7 +383,7 @@ function createQuickSort(order, dtype, insertionSort) {
       code.push(["if(", dataRead(toPointer(a)), ">", dataRead(toPointer(b)), "){tmp0=", a, ";",a,"=",b,";", b,"=tmp0}"].join(""))
     }
   }
-  
+
   compareSwap(1, 2)
   compareSwap(4, 5)
   compareSwap(1, 3)
@@ -393,7 +393,7 @@ function createQuickSort(order, dtype, insertionSort) {
   compareSwap(2, 5)
   compareSwap(2, 3)
   compareSwap(4, 5)
-  
+
   if(order.length > 1) {
     cacheLoop(["el1", "el2", "el3", "el4", "el5", "index1", "index3", "index5"], true, [
       "pivot1[pivot_ptr]=",dataRead("ptr1"),"\n",
@@ -419,7 +419,7 @@ function createQuickSort(order, dtype, insertionSort) {
       dataWrite(toPointer("index5"), "z")
     ].join(""))
   }
-  
+
 
   function moveElement(dst, src) {
     if(order.length > 1) {
@@ -430,10 +430,10 @@ function createQuickSort(order, dtype, insertionSort) {
       code.push(dataWrite(toPointer(dst), dataRead(toPointer(src))))
     }
   }
-  
+
   moveElement("index2", "left")
   moveElement("index4", "right")
-  
+
   function comparePivot(result, ptr, n) {
     if(order.length > 1) {
       var lbl = "__l" + (++labelCounter)
@@ -445,7 +445,7 @@ function createQuickSort(order, dtype, insertionSort) {
       code.push([result,"=", dataRead(toPointer(ptr)), "-pivot", n].join(""))
     }
   }
-  
+
   function swapElements(a, b) {
     if(order.length > 1) {
       cacheLoop([a,b],false,[
@@ -463,7 +463,7 @@ function createQuickSort(order, dtype, insertionSort) {
       ].join(""))
     }
   }
-  
+
   function tripleSwap(k, less, great) {
     if(order.length > 1) {
       cacheLoop([k,less,great], false, [
@@ -487,12 +487,12 @@ function createQuickSort(order, dtype, insertionSort) {
       ].join(""))
     }
   }
-  
+
   function swapAndDecrement(k, great) {
     swapElements(k, great)
     code.push("--"+great)
   }
-    
+
   code.push("if(pivots_are_equal){")
     //Pivots are equal case
     code.push("for(k=less;k<=great;++k){")
@@ -549,7 +549,7 @@ function createQuickSort(order, dtype, insertionSort) {
       code.push("}")
     code.push("}")
   code.push("}")
-  
+
   //Move pivots to correct place
   function storePivot(mem_dest, pivot_dest, pivot) {
     if(order.length>1) {
@@ -563,7 +563,7 @@ function createQuickSort(order, dtype, insertionSort) {
           dataWrite(toPointer(pivot_dest), "pivot"+pivot))
     }
   }
-  
+
   storePivot("left", "(less-1)", 1)
   storePivot("right", "(great+1)", 2)
 
@@ -579,13 +579,13 @@ function createQuickSort(order, dtype, insertionSort) {
   }
   doSort("left", "(less-2)")
   doSort("(great+2)", "right")
-  
+
   //If pivots are equal, then early out
   code.push("if(pivots_are_equal){")
     cleanUp()
     code.push("return")
   code.push("}")
-  
+
   function walkPointer(ptr, pivot, body) {
     if(order.length > 1) {
       code.push(["__l",++labelCounter,":while(true){"].join(""))
@@ -597,13 +597,13 @@ function createQuickSort(order, dtype, insertionSort) {
       code.push(["while(", dataRead(toPointer(ptr)), "===pivot", pivot, "){", body, "}"].join(""))
     }
   }
-  
+
   //Check bounds
   code.push("if(less<index1&&great>index5){")
-  
+
     walkPointer("less", 1, "++less")
     walkPointer("great", 2, "--great")
-  
+
     code.push("for(k=less;k<=great;++k){")
       comparePivot("comp_pivot1", "k", 1)
       code.push("if(comp_pivot1===0){")
@@ -633,14 +633,14 @@ function createQuickSort(order, dtype, insertionSort) {
       code.push("}")
     code.push("}")
   code.push("}")
-  
+
   //Clean up and do a final sorting pass
   cleanUp()
   doSort("less", "great")
- 
+
   //Close off main loop
   code.push("}return " + funcName)
-  
+
   //Compile and link
   if(order.length > 1 && allocator) {
     var compiled = new Function("insertionSort", "malloc", "free", code.join("\n"))
@@ -654,15 +654,15 @@ function compileSort(order, dtype) {
   var code = ["'use strict'"]
   var funcName = ["ndarraySortWrapper", order.join("d"), dtype].join("")
   var funcArgs = [ "array" ]
-  
+
   code.push(["function ", funcName, "(", funcArgs.join(","), "){"].join(""))
-  
+
   //Unpack local variables from array
   var vars = ["data=array.data,offset=array.offset|0,shape=array.shape,stride=array.stride"]
   for(var i=0; i<order.length; ++i) {
     vars.push(["s",i,"=stride[",i,"]|0,n",i,"=shape[",i,"]|0"].join(""))
   }
-  
+
   var scratch_stride = new Array(order.length)
   var nprod = []
   for(var i=0; i<order.length; ++i) {
@@ -677,7 +677,7 @@ function compileSort(order, dtype) {
     }
     nprod.push("n"+k)
   }
-  
+
   var p = -1, q = -1
   for(var i=0; i<order.length; ++i) {
     var j = order[i]
@@ -700,24 +700,24 @@ function compileSort(order, dtype) {
       q = k
     }
   }
-  
+
   //Declare local variables
   code.push("var " + vars.join(","))
-  
+
   //Create arguments for subroutine
   var sortArgs = ["0", "n0-1", "data", "offset"].concat(shapeArgs(order.length))
-  
+
   //Call main sorting routine
   code.push([
     "if(n0<=",INSERTION_SORT_THRESHOLD,"){",
       "insertionSort(", sortArgs.join(","), ")}else{",
       "quickSort(", sortArgs.join(","),
     ")}"
   ].join(""))
-  
+
   //Return
   code.push("}return " + funcName)
-  
+
   //Link everything together
   var result = new Function("insertionSort", "quickSort", code.join("\n"))
   var insertionSort = createInsertionSort(order, dtype)