ranger-compiler 2.1.69 → 3.0.3

package/adventofcode/day3/bin/day3_part2.cpp

@@ -1,216 +0,0 @@
-#include  <memory>
-#include  "variant.hpp"
-#include  <map>
-#include  <functional>
-#include  <vector>
-#include  <string>
-#include  <sstream>
-#include  <iostream>
-
-// define classes here to avoid compiler errors
-class GridRow;
-class Grid;
-class day_three_part_two;
-class operatorsOf;
-
-typedef mpark::variant<std::shared_ptr<GridRow>, std::shared_ptr<Grid>, std::shared_ptr<day_three_part_two>, int, std::string, bool, double>  r_union_Any;
-
-template <class T>
-class r_optional_primitive {
-  public:
-    bool has_value;
-    T value;
-    r_optional_primitive<T> & operator=(const r_optional_primitive<T> & rhs) {
-        has_value = rhs.has_value;
-        value = rhs.value;
-        return *this;
-    }
-    r_optional_primitive<T> & operator=(const T a_value) {
-        has_value = true;
-        value = a_value;
-        return *this;
-    }
-};
-
-
-template<typename T>
-r_optional_primitive<int> cpp_get_map_int_value( std::map<int, int> m , int key) {
-r_optional_primitive<int> result;
-try {
-result.value = m[key];
-result.has_value = true;
-} catch (...) {
-
-}
-return result;
-}
-
-template <typename T>
-std::string join(const T& v, const std::string& delim) {
-    std::ostringstream s;
-    for (const auto& i : v) {
-        if (&i != &v[0]) {
-            s << delim;
-        }
-        s << i;
-    }
-    return s.str();
-}   
-    
-
-// header definitions
-class GridRow : public std::enable_shared_from_this<GridRow>  { 
-  public :
-    std::map<int,int> values;
-    /* class constructor */ 
-    GridRow( );
-};
-class Grid : public std::enable_shared_from_this<Grid>  { 
-  public :
-    std::map<int,std::shared_ptr<GridRow>> cols;
-    int minx;
-    int maxx;
-    int miny;
-    int maxy;
-    int turtle_limit;
-    int first_largest;
-    /* class constructor */ 
-    Grid( );
-    /* instance methods */ 
-    int getValue( int x , int y );
-    void setValue( int x , int y , int value );
-    int getAdjacentSum( int x , int y );
-    void printGrid();
-};
-class day_three_part_two : public std::enable_shared_from_this<day_three_part_two>  { 
-  public :
-    /* class constructor */ 
-    day_three_part_two( );
-    /* static methods */ 
-    static int distance( int data );
-    static void main();
-};
-class operatorsOf : public std::enable_shared_from_this<operatorsOf>  { 
-  public :
-    /* class constructor */ 
-    operatorsOf( );
-    /* static methods */ 
-    static std::vector<std::string> map_2( std::vector<int> __self , std::function<std::string(int, int)> cb );
-};
-
-int __g_argc;
-char **__g_argv;
-GridRow::GridRow( ) {
-}
-Grid::Grid( ) {
-  this->minx = 0;
-  this->maxx = 0;
-  this->miny = 0;
-  this->maxy = 0;
-  this->turtle_limit = 0;
-  this->first_largest = 0;
-}
-int  Grid::getValue( int x , int y ) {
-  if ( cols.count(y) > 0 ) {
-    std::shared_ptr<GridRow> col = cols[y];
-    if ( col->values.count(x) > 0 ) {
-      return /*unwrap int*/(cpp_get_map_int_value<int>(col->values, x)).value;
-    }
-  }
-  return 0;
-}
-void  Grid::setValue( int x , int y , int value ) {
-  if ( (value > turtle_limit) && (first_largest == 0) ) {
-    first_largest = value;
-  }
-  if ( cols.count(y) > 0 ) {
-    std::shared_ptr<GridRow> col = cols[y];
-    col->values[x] = value;
-  } else {
-    std::shared_ptr<GridRow> newCol =  std::make_shared<GridRow>();
-    cols[y] = newCol;
-    newCol->values[x] = value;
-  }
-  if ( x < minx ) {
-    minx = x;
-  }
-  if ( x > maxx ) {
-    maxx = x;
-  }
-  if ( y < miny ) {
-    miny = y;
-  }
-  if ( y > maxy ) {
-    maxy = y;
-  }
-}
-int  Grid::getAdjacentSum( int x , int y ) {
-  std::function<int(int, int)> v = [&, x, y](int dx, int dy) mutable { 
-    return (shared_from_this())->getValue((x + dx), (y + dy));
-  };
-  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);
-}
-void  Grid::printGrid() {
-  int xx = minx;
-  int yy = miny;
-  while (yy <= maxy) {
-    xx = minx;
-    std::vector<int> row;
-    while (xx <= maxx) {
-      row.push_back( (shared_from_this())->getValue(xx, yy)  );
-      xx = xx + 1;
-    }
-    std::cout << join( operatorsOf::map_2(row, [&](int item, int index) mutable { 
-      return std::to_string(item);
-    }) , std::string(" ")) << std::endl;
-    yy = yy + 1;
-  }
-}
-day_three_part_two::day_three_part_two( ) {
-}
-int  day_three_part_two::distance( int data ) {
-  std::shared_ptr<Grid> myGrid =  std::make_shared<Grid>();
-  myGrid->turtle_limit = data;
-  myGrid->setValue(0, 0, 1);
-  int i = 0;
-  int j = 0;
-  std::function<void(int, int, int)> moveTurtle = [&](int dx, int dy, int steps) mutable { 
-    int cnt = steps;
-    while (cnt > 0) {
-      i = i + dx;
-      j = j + dy;
-      int sum = myGrid->getAdjacentSum(i, j);
-      myGrid->setValue(i, j, sum);
-      cnt = cnt - 1;
-    }
-  };
-  int step = 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();
-  std::cout << std::string("the first largest was ") + std::to_string(myGrid->first_largest) << std::endl;
-  return myGrid->turtle_limit;
-}
-int main(int argc, char* argv[]) {
-  __g_argc = argc;
-  __g_argv = argv;
-  day_three_part_two::distance(289326);
-  return 0;
-}
-operatorsOf::operatorsOf( ) {
-}
-std::vector<std::string>  operatorsOf::map_2( std::vector<int> __self , std::function<std::string(int, int)> cb ) {
-  /** unused:  int __len = (int)(__self.size())   **/ ;
-  std::vector<std::string> res;
-  for ( int i = 0; i != (int)(__self.size()); i++) {
-    int it = __self.at(i);
-    res.push_back( cb(it, i)  );
-  }
-  return res;
-}

package/adventofcode/day3/bin/day3_part2.go

@@ -1,188 +0,0 @@
-package main
-import (
-  "strconv"
-  "fmt"
-  "strings"
-)
-
-type GoNullable struct { 
-  value interface{}
-  has_value bool
-}
-
-func r_has_key_int64_GridRow( a map[int64]*GridRow, key int64 ) bool { 
-  _, ok := a[key]
-  return ok
-
-}
-func r_get_int64_GridRow( a map[int64]*GridRow, key int64 ) *GoNullable  { 
-  res := new(GoNullable)
-  v, ok := a[key]
-  if ok { 
-    res.has_value = true
-    res.value = v
-    return res
-  }
-  res.has_value = false
-  return res
-}
-func r_has_key_int64_int64( a map[int64]int64, key int64 ) bool { 
-  _, ok := a[key]
-  return ok
-
-}
-func r_get_int64_int64( a map[int64]int64, key int64 ) *GoNullable  { 
-  res := new(GoNullable)
-  v, ok := a[key]
-  if ok { 
-    res.has_value = true
-    res.value = v
-    return res
-  }
-  res.has_value = false
-  return res
-}
-type GridRow struct { 
-  values map[int64]int64 `json:"values"` 
-}
-
-func CreateNew_GridRow() *GridRow {
-  me := new(GridRow)
-  me.values = make(map[int64]int64)
-  return me;
-}
-type Grid struct { 
-  cols map[int64]*GridRow `json:"cols"` 
-  minx int64 `json:"minx"` 
-  maxx int64 `json:"maxx"` 
-  miny int64 `json:"miny"` 
-  maxy int64 `json:"maxy"` 
-  turtle_limit int64 `json:"turtle_limit"` 
-  first_largest int64 `json:"first_largest"` 
-}
-
-func CreateNew_Grid() *Grid {
-  me := new(Grid)
-  me.cols = make(map[int64]*GridRow)
-  me.minx = int64(0)
-  me.maxx = int64(0)
-  me.miny = int64(0)
-  me.maxy = int64(0)
-  me.turtle_limit = int64(0)
-  me.first_largest = int64(0)
-  return me;
-}
-func (this *Grid) getValue (x int64, y int64) int64 {
-  if  r_has_key_int64_GridRow(this.cols, y) {
-    var col *GoNullable = new(GoNullable); 
-    col = r_get_int64_GridRow(this.cols, y);
-    if  r_has_key_int64_int64(col.value.(*GridRow).values, x) {
-      return (r_get_int64_int64(col.value.(*GridRow).values, x)).value.(int64)
-    }
-  }
-  return int64(0)
-}
-func (this *Grid) setValue (x int64, y int64, value int64) () {
-  if  (value > this.turtle_limit) && (this.first_largest == int64(0)) {
-    this.first_largest = value; 
-  }
-  if  r_has_key_int64_GridRow(this.cols, y) {
-    var col *GoNullable = new(GoNullable); 
-    col = r_get_int64_GridRow(this.cols, y);
-    col.value.(*GridRow).values[x] = value;
-  } else {
-    var newCol *GridRow= CreateNew_GridRow();
-    this.cols[y] = newCol;
-    newCol.values[x] = value;
-  }
-  if  x < this.minx {
-    this.minx = x; 
-  }
-  if  x > this.maxx {
-    this.maxx = x; 
-  }
-  if  y < this.miny {
-    this.miny = y; 
-  }
-  if  y > this.maxy {
-    this.maxy = y; 
-  }
-}
-func (this *Grid) getAdjacentSum (x int64, y int64) int64 {
-  var v func(int64, int64) int64= func (dx int64, dy int64) int64 {
-    return (this).getValue((x + dx), (y + dy))
-  };
-  return ((((((v(int64(-1), int64(-1)) + v(int64(-1), int64(0))) + v(int64(-1), int64(1))) + v(int64(0), int64(-1))) + v(int64(0), int64(1))) + v(int64(1), int64(-1))) + v(int64(1), int64(0))) + v(int64(1), int64(1))
-}
-func (this *Grid) printGrid () () {
-  var xx int64= this.minx;
-  var yy int64= this.miny;
-  for yy <= this.maxy {
-    xx = this.minx; 
-    var row []int64 = make([]int64, 0);
-    for xx <= this.maxx {
-      row = append(row,(this).getValue(xx, yy)); 
-      xx = xx + int64(1); 
-    }
-    fmt.Println( strings.Join(operatorsOf_static_map_2(row, func (item int64, index int64) string {
-      return strconv.FormatInt(item, 10)
-    }), " ") )
-    yy = yy + int64(1); 
-  }
-}
-type day_three_part_two struct { 
-}
-
-func CreateNew_day_three_part_two() *day_three_part_two {
-  me := new(day_three_part_two)
-  return me;
-}
-func day_three_part_two_static_distance(data int64) int64 {
-  var myGrid *Grid= CreateNew_Grid();
-  myGrid.turtle_limit = data; 
-  myGrid.setValue(int64(0), int64(0), int64(1));
-  var i int64= int64(0);
-  var j int64= int64(0);
-  var moveTurtle func(int64, int64, int64) ()= func (dx int64, dy int64, steps int64) () {
-    var cnt int64= steps;
-    for cnt > int64(0) {
-      i = i + dx; 
-      j = j + dy; 
-      var sum int64= myGrid.getAdjacentSum(i, j);
-      myGrid.setValue(i, j, sum);
-      cnt = cnt - int64(1); 
-    }
-  };
-  var step int64= int64(2);
-  for myGrid.first_largest == int64(0) {
-    moveTurtle(int64(1), int64(0), int64(1));
-    moveTurtle(int64(0), int64(-1), step - int64(1));
-    moveTurtle(int64(-1), int64(0), step);
-    moveTurtle(int64(0), int64(1), step);
-    moveTurtle(int64(1), int64(0), step);
-    step = step + int64(2); 
-  }
-  myGrid.printGrid();
-  fmt.Println( strings.Join([]string{ "the first largest was ",strconv.FormatInt(myGrid.first_largest, 10) }, "") )
-  return myGrid.turtle_limit
-}
-func main() {
-  day_three_part_two_static_distance(int64(289326));
-}
-type operatorsOf struct { 
-}
-
-func CreateNew_operatorsOf() *operatorsOf {
-  me := new(operatorsOf)
-  return me;
-}
-func operatorsOf_static_map_2(__self []int64, cb func(int64, int64) string) []string {
-  /** unused:  __len*/
-  var res []string = make([]string, 0);
-  var i int64 = 0;  
-  for ; i < int64(len(__self)) ; i++ {
-    it := __self[i];
-    res = append(res,cb(it, i)); 
-  }
-  return res
-}

package/adventofcode/day3/bin/day3_part2.js

@@ -1,123 +0,0 @@
-class GridRow  {
-  constructor() {
-    this.values = {};
-  }
-}
-class Grid  {
-  constructor() {
-    this.cols = {};
-    this.minx = 0;
-    this.maxx = 0;
-    this.miny = 0;
-    this.maxy = 0;
-    this.turtle_limit = 0;
-    this.first_largest = 0;
-  }
-  getValue (x, y) {
-    if ( ( typeof(this.cols[y] ) != "undefined" && this.cols.hasOwnProperty(y) ) ) {
-      const col = this.cols[y];
-      if ( ( typeof(col.values[x] ) != "undefined" && col.values.hasOwnProperty(x) ) ) {
-        return (col.values[x]);
-      }
-    }
-    return 0;
-  };
-  setValue (x, y, value) {
-    if ( (value > this.turtle_limit) && (this.first_largest == 0) ) {
-      this.first_largest = value;
-    }
-    if ( ( typeof(this.cols[y] ) != "undefined" && this.cols.hasOwnProperty(y) ) ) {
-      const col = this.cols[y];
-      col.values[x] = value;
-    } else {
-      const newCol = new GridRow();
-      this.cols[y] = newCol;
-      newCol.values[x] = value;
-    }
-    if ( x < this.minx ) {
-      this.minx = x;
-    }
-    if ( x > this.maxx ) {
-      this.maxx = x;
-    }
-    if ( y < this.miny ) {
-      this.miny = y;
-    }
-    if ( y > this.maxy ) {
-      this.maxy = y;
-    }
-  };
-  getAdjacentSum (x, y) {
-    const v = ((dx, dy) => { 
-      return (this).getValue((x + dx), (y + dy));
-    });
-    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);
-  };
-  printGrid () {
-    let xx = this.minx;
-    let yy = this.miny;
-    while (yy <= this.maxy) {
-      xx = this.minx;
-      let row = [];
-      while (xx <= this.maxx) {
-        row.push((this).getValue(xx, yy));
-        xx = xx + 1;
-      };
-      console.log(operatorsOf.map_2(row, ((item, index) => { 
-        return (item.toString());
-      })).join(" "));
-      yy = yy + 1;
-    };
-  };
-}
-class day_three_part_two  {
-  constructor() {
-  }
-}
-day_three_part_two.distance = function(data) {
-  const myGrid = new Grid();
-  myGrid.turtle_limit = data;
-  myGrid.setValue(0, 0, 1);
-  let i = 0;
-  let j = 0;
-  const moveTurtle = ((dx, dy, steps) => { 
-    let cnt = steps;
-    while (cnt > 0) {
-      i = i + dx;
-      j = j + dy;
-      const sum = myGrid.getAdjacentSum(i, j);
-      myGrid.setValue(i, j, sum);
-      cnt = cnt - 1;
-    };
-  });
-  let step = 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();
-  console.log("the first largest was " + myGrid.first_largest);
-  return myGrid.turtle_limit;
-};
-class operatorsOf  {
-  constructor() {
-  }
-}
-operatorsOf.map_2 = function(__self, cb) {
-  /** unused:  const __len = __self.length   **/ 
-  let res = [];
-  for ( let i = 0; i < __self.length; i++) {
-    var it = __self[i];
-    res.push(cb(it, i));
-  };
-  return res;
-};
-/* static JavaSript main routine at the end of the JS file */
-function __js_main() {
-  day_three_part_two.distance(289326);
-}
-__js_main();

package/adventofcode/day3/bin/day3_part2.php

@@ -1,135 +0,0 @@
-<?php 
-
-class GridRow { 
-  var $values;
-  function __construct( ) {
-    $this->values = array();
-  }
-}
-class Grid { 
-  var $cols;
-  var $minx;
-  var $maxx;
-  var $miny;
-  var $maxy;
-  var $turtle_limit;
-  var $first_largest;
-  function __construct( ) {
-    $this->cols = array();
-    $this->minx = 0;
-    $this->maxx = 0;
-    $this->miny = 0;
-    $this->maxy = 0;
-    $this->turtle_limit = 0;
-    $this->first_largest = 0;
-  }
-  function getValue( $x , $y ) {
-    if ( array_key_exists($y , $this->cols ) ) {
-      $col = $this->cols[$y];
-      if ( array_key_exists($x , $col->values ) ) {
-        return ($col->values[$x]);
-      }
-    }
-    return 0;
-  }
-  function setValue( $x , $y , $value ) {
-    if ( ($value > $this->turtle_limit) && ($this->first_largest == 0) ) {
-      $this->first_largest = $value;
-    }
-    if ( array_key_exists($y , $this->cols ) ) {
-      $col = $this->cols[$y];
-      $col->values[$x] = $value;
-    } else {
-      $newCol =  new GridRow();
-      $this->cols[$y] = $newCol;
-      $newCol->values[$x] = $value;
-    }
-    if ( $x < $this->minx ) {
-      $this->minx = $x;
-    }
-    if ( $x > $this->maxx ) {
-      $this->maxx = $x;
-    }
-    if ( $y < $this->miny ) {
-      $this->miny = $y;
-    }
-    if ( $y > $this->maxy ) {
-      $this->maxy = $y;
-    }
-  }
-  function getAdjacentSum( $x , $y ) {
-    $v = (function ($dx, $dy) use ( &$x,  &$y) {
-      return ($this)->getValue(($x + $dx), ($y + $dy));
-      // captured var x
-      // captured var y
-    });
-    return ((((((call_user_func($v, -1, -1) + call_user_func($v, -1, 0)) + call_user_func($v, -1, 1)) + call_user_func($v, 0, -1)) + call_user_func($v, 0, 1)) + call_user_func($v, 1, -1)) + call_user_func($v, 1, 0)) + call_user_func($v, 1, 1);
-  }
-  function printGrid() {
-    $xx = $this->minx;
-    $yy = $this->miny;
-    while ($yy <= $this->maxy) {
-      $xx = $this->minx;
-      $row = array();
-      while ($xx <= $this->maxx) {
-        array_push($row, ($this)->getValue($xx, $yy));
-        $xx = $xx + 1;
-      }
-      echo( implode(" ", operatorsOf::map_2($row, (function ($item, $index)  {
-        return strval($item);
-      }))) . "\n");
-      $yy = $yy + 1;
-    }
-  }
-}
-class day_three_part_two { 
-  function __construct( ) {
-  }
-  public static function distance( $data ) {
-    $myGrid =  new Grid();
-    $myGrid->turtle_limit = $data;
-    $myGrid->setValue(0, 0, 1);
-    $i = 0;
-    $j = 0;
-    $moveTurtle = (function ($dx, $dy, $steps) use ( &$i,  &$j,  &$myGrid) {
-      $cnt = $steps;
-      while ($cnt > 0) {
-        $i = $i + $dx;
-        $j = $j + $dy;
-        $sum = $myGrid->getAdjacentSum($i, $j);
-        $myGrid->setValue($i, $j, $sum);
-        $cnt = $cnt - 1;
-      }
-      // captured var i
-      // captured var j
-      // captured var myGrid
-    });
-    $step = 2;
-    while ($myGrid->first_largest == 0) {
-      call_user_func($moveTurtle, 1, 0, 1);
-      call_user_func($moveTurtle, 0, -1, $step - 1);
-      call_user_func($moveTurtle, -1, 0, $step);
-      call_user_func($moveTurtle, 0, 1, $step);
-      call_user_func($moveTurtle, 1, 0, $step);
-      $step = $step + 2;
-    }
-    $myGrid->printGrid();
-    echo( "the first largest was " . $myGrid->first_largest . "\n");
-    return $myGrid->turtle_limit;
-  }
-}
-/* static PHP main routine */
-day_three_part_two::distance(289326);
-class operatorsOf { 
-  function __construct( ) {
-  }
-  public static function map_2( $__self , $cb ) {
-    /** unused:  $__len = count($__self)   **/ ;
-    $res = array();
-    for ( $i = 0; $i < count($__self); $i++) {
-      $it = $__self[$i];
-      array_push($res, call_user_func($cb, $it, $i));
-    }
-    return $res;
-  }
-}