ranger-compiler 2.1.70 → 3.0.3

package/adventofcode/day3/bin/day3_part2.swift

@@ -1,131 +0,0 @@
-func ==(l: GridRow, r: GridRow) -> Bool {
-  return l === r
-}
-class GridRow : Equatable  { 
-  var values : [Int:Int] = [Int:Int]()
-}
-func ==(l: Grid, r: Grid) -> Bool {
-  return l === r
-}
-class Grid : Equatable  { 
-  var cols : [Int:GridRow] = [Int:GridRow]()
-  var minx : Int = 0
-  var maxx : Int = 0
-  var miny : Int = 0
-  var maxy : Int = 0
-  var turtle_limit : Int = 0
-  var first_largest : Int = 0
-  func getValue(x : Int, y : Int) -> Int {
-    if ( self.cols[y] != nil ) {
-      let col : GridRow? = self.cols[y]
-      if ( col!.values[x] != nil ) {
-        return (col!.values[x])!;
-      }
-    }
-    return 0;
-  }
-  func setValue(x : Int, y : Int, value : Int) -> Void {
-    if ( (value > self.turtle_limit) && (self.first_largest == 0) ) {
-      self.first_largest = value;
-    }
-    if ( self.cols[y] != nil ) {
-      let col : GridRow? = self.cols[y]
-      col!.values[x] = value;
-    } else {
-      let newCol : GridRow = GridRow()
-      self.cols[y] = newCol;
-      newCol.values[x] = value;
-    }
-    if ( x < self.minx ) {
-      self.minx = x;
-    }
-    if ( x > self.maxx ) {
-      self.maxx = x;
-    }
-    if ( y < self.miny ) {
-      self.miny = y;
-    }
-    if ( y > self.maxy ) {
-      self.maxy = y;
-    }
-  }
-  func getAdjacentSum(x : Int, y : Int) -> Int {
-    let v : (( _ : Int,  _ : Int) -> Int) = ({ (dx, dy) ->  Int in 
-      return (self).getValue(x : (x + dx), y : (y + dy));
-      // captured var x
-      // captured var y
-    })
-    return ((((((v(-1, -1) + v(-1, 0)) + v(-1, 1)) + v(0, -1)) + v(0, 1)) + v(1, -1)) + v(1, 0)) + v(1, 1);
-  }
-  func printGrid() -> Void {
-    var xx : Int = self.minx
-    var yy : Int = self.miny
-    while (yy <= self.maxy) {
-      xx = self.minx;
-      var row : [Int] = [Int]()
-      while (xx <= self.maxx) {
-        row.append((self).getValue(x : xx, y : yy))
-        xx = xx + 1;
-      }
-      print(operatorsOf.map_2(__self : row, cb : ({ (item, index) ->  String in 
-        return String(item);
-      })).joined(separator:" "))
-      yy = yy + 1;
-    }
-  }
-}
-func ==(l: day_three_part_two, r: day_three_part_two) -> Bool {
-  return l === r
-}
-class day_three_part_two : Equatable  { 
-  class func distance(data : Int) -> Int {
-    let myGrid : Grid = Grid()
-    myGrid.turtle_limit = data;
-    myGrid.setValue(x : 0, y : 0, value : 1)
-    var i : Int = 0
-    var j : Int = 0
-    let moveTurtle : (( _ : Int,  _ : Int,  _ : Int) -> Void) = ({ (dx, dy, steps) ->  Void in 
-      var cnt : Int = steps
-      while (cnt > 0) {
-        i = i + dx;
-        j = j + dy;
-        let sum : Int = myGrid.getAdjacentSum(x : i, y : j)
-        myGrid.setValue(x : i, y : j, value : sum)
-        cnt = cnt - 1;
-      }
-      // captured var i
-      // captured var j
-      // captured var myGrid
-    })
-    var step : Int = 2
-    while (myGrid.first_largest == 0) {
-      moveTurtle(1, 0, 1);
-      moveTurtle(0, -1, step - 1);
-      moveTurtle(-1, 0, step);
-      moveTurtle(0, 1, step);
-      moveTurtle(1, 0, step);
-      step = step + 2;
-    }
-    myGrid.printGrid()
-    print("the first largest was " + String(myGrid.first_largest))
-    return myGrid.turtle_limit;
-  }
-}
-func ==(l: operatorsOf, r: operatorsOf) -> Bool {
-  return l === r
-}
-class operatorsOf : Equatable  { 
-  class func map_2(__self : [Int], cb :   @escaping  (( _ : Int,  _ : Int) -> String)) -> [String] {
-    /** unused:  let __len : Int = __self.count   **/ 
-    var res : [String] = [String]()
-    for ( i , it ) in __self.enumerated() {
-      res.append(cb(it, i))
-    }
-    return res;
-  }
-}
-func __main__swift() {
-  _ = day_three_part_two.distance(data : 289326)
-}
-// call the main function
-__main__swift()

package/adventofcode/day3/bin/day_three_part_two.java

@@ -1,43 +0,0 @@
-import java.io.*;
-
-public class day_three_part_two { 
-  
-  public static Integer distance( final Integer data ) {
-    final Grid myGrid = new Grid();
-    myGrid.turtle_limit = data;
-    myGrid.setValue(0, 0, 1);
-    final Integer[] i =  new Integer[]{0};
-    final Integer[] j =  new Integer[]{0};
-    final LambdaSignature3 moveTurtle = new LambdaSignature3() { 
-      public void run( final Integer dx,  final Integer dy,  final Integer steps) {
-        Integer cnt = steps;
-        while (cnt > 0) {
-          i[0] = i[0] + dx;
-          j[0] = j[0] + dy;
-          final Integer sum = myGrid.getAdjacentSum(i[0], j[0]);
-          myGrid.setValue(i[0], j[0], sum);
-          cnt = cnt - 1;
-        }
-        // captured var i
-        // captured var j
-        // captured var myGrid
-      }
-    };
-    Integer step = 2;
-    while (myGrid.first_largest == 0) {
-      moveTurtle.run(1, 0, 1);
-      moveTurtle.run(0, -1, step - 1);
-      moveTurtle.run(-1, 0, step);
-      moveTurtle.run(0, 1, step);
-      moveTurtle.run(1, 0, step);
-      step = step + 2;
-    }
-    myGrid.printGrid();
-    System.out.println(String.valueOf( "the first largest was " + myGrid.first_largest ) );
-    return myGrid.turtle_limit;
-  }
-  
-  public static void main(String [] args ) {
-    day_three_part_two.distance(289326);
-  }
-}

package/adventofcode/day3/bin/day_two.java

@@ -1,42 +0,0 @@
-import java.io.*;
-
-public class day_two { 
-  
-  public static Integer distance( final Integer data ) {
-    /** unused:  final Integer size = 1   **/ ;
-    Integer side = 1;
-    Integer total = 1;
-    Integer last_total = 1;
-    Integer n = 1;
-    while (total < data) {
-      last_total = total;
-      side = side + 2;
-      total = total + ((side - 1) * 4);
-      n = n + 1;
-    }
-    final Integer dist = (data - last_total) - 1;
-    final Integer sideStep = side - 1;
-    final Integer pos = dist % sideStep;
-    Integer step_ort = 0;
-    final Integer halfway = Double.valueOf((sideStep / 2)).intValue();
-    if ( pos < halfway ) {
-      step_ort = (halfway - 1) - pos;
-    } else {
-      step_ort = (pos - halfway) + 1;
-    }
-    System.out.println(String.valueOf( (("total steps for " + data) + " == ") + (step_ort + halfway) ) );
-    return step_ort + halfway;
-  }
-  
-  public static void main(String [] args ) {
-    day_two.distance(9);
-    day_two.distance(10);
-    day_two.distance(11);
-    day_two.distance(12);
-    day_two.distance(17);
-    day_two.distance(23);
-    day_two.distance(24);
-    day_two.distance(1024);
-    day_two.distance(289326);
-  }
-}

package/adventofcode/day3/bin/operatorsOf.java

@@ -1,14 +0,0 @@
-import java.util.*;
-
-public class operatorsOf { 
-  
-  public static ArrayList<String> map_2( final ArrayList<Integer> __self , final LambdaSignature2 cb ) {
-    /** unused:  final Integer __len = __self.size()   **/ ;
-    ArrayList<String> res = new ArrayList<String>();
-    for ( int i = 0; i < __self.size(); i++) {
-      Integer it = __self.get(i);
-      res.add(cb.run(it, i));
-    }
-    return res;
-  }
-}