ranger-compiler 2.1.69 → 3.0.3

package/adventofcode/day2/compile.bat

@@ -1,7 +0,0 @@
-call ranger-compiler day2.clj -l=es6
-call ranger-compiler day2.clj -l=go
-call ranger-compiler day2.clj -l=php
-call ranger-compiler day2.clj -l=cpp
-call ranger-compiler day2.clj -l=java7
-call ranger-compiler day2.clj -l=scala -scalafiddle
-call ranger-compiler day2.clj -l=swift3

package/adventofcode/day2/compile2.bat

@@ -1,7 +0,0 @@
-call ranger-compiler day2_part2.clj -l=es6
-call ranger-compiler day2_part2.clj -l=go
-call ranger-compiler day2_part2.clj -l=php
-call ranger-compiler day2_part2.clj -l=cpp
-call ranger-compiler day2_part2.clj -l=java7
-call ranger-compiler day2_part2.clj -l=scala -scalafiddle
-call ranger-compiler day2_part2.clj -l=swift3

package/adventofcode/day2/day2.clj

@@ -1,60 +0,0 @@
-
-
-class day_two {
-  static fn main() {
-    def data `
-3751	3769	2769	2039	2794	240	3579	1228	4291	220	324	3960	211	1346	237	1586
-550	589	538	110	167	567	99	203	524	288	500	111	118	185	505	74
-2127	1904	199	221	1201	250	1119	377	1633	1801	2011	1794	394	238	206	680
-435	1703	1385	1461	213	1211	192	1553	1580	197	571	195	326	1491	869	1282
-109	104	3033	120	652	2752	1822	2518	1289	1053	1397	951	3015	3016	125	1782
-2025	1920	1891	99	1057	1909	2237	106	97	920	603	1841	2150	1980	1970	88
-1870	170	167	176	306	1909	1825	1709	168	1400	359	817	1678	1718	1594	1552
-98	81	216	677	572	295	38	574	403	74	91	534	662	588	511	51
-453	1153	666	695	63	69	68	58	524	1088	75	1117	1192	1232	1046	443
-3893	441	1825	3730	3660	115	4503	4105	3495	4092	48	3852	132	156	150	4229
-867	44	571	40	884	922	418	328	901	845	42	860	932	53	432	569
-905	717	162	4536	4219	179	990	374	4409	4821	393	4181	4054	4958	186	193
-2610	2936	218	2552	3281	761	204	3433	3699	2727	3065	3624	193	926	1866	236
-2602	216	495	3733	183	4688	2893	4042	3066	3810	189	4392	3900	4321	2814	159
-166	136	80	185	135	78	177	123	82	150	121	145	115	63	68	24
-214	221	265	766	959	1038	226	1188	1122	117	458	1105	1285	1017	274	281    
-`
-    def list (strsplit data "")
-    def idx 0 
-    def value 0
-    def n_idx 1
-    def min 0 
-    def max 0
-    def total 0 
-    list.forEach({
-      def iValue (to_int item)
-      if(!null? iValue) {
-        value = ( (unwrap iValue) + value * 10)
-        n_idx = n_idx + 1
-      } {
-        if(n_idx > 1) {
-          if( min == 0 && max == 0) {
-            min = value
-            max = value
-          } {
-            if( min > value) {
-              min = value
-            }
-            if( max < value ) {
-              max = value
-            }
-          }          
-        }
-        value = 0
-        n_idx = 1
-        if( (charAt item 0 ) == (ccode '\n') || (charAt item 0 ) == (ccode '\r') ) {
-          total = total + (max - min)
-          max = 0
-          min = 0
-        }
-      }
-    })
-    print "Total == " + total
-  }
-}

package/adventofcode/day2/day2_part2.clj

@@ -1,69 +0,0 @@
-
-
-class day_two_part_two {
-  static fn main() {
-    def data `
-3751	3769	2769	2039	2794	240	3579	1228	4291	220	324	3960	211	1346	237	1586
-550	589	538	110	167	567	99	203	524	288	500	111	118	185	505	74
-2127	1904	199	221	1201	250	1119	377	1633	1801	2011	1794	394	238	206	680
-435	1703	1385	1461	213	1211	192	1553	1580	197	571	195	326	1491	869	1282
-109	104	3033	120	652	2752	1822	2518	1289	1053	1397	951	3015	3016	125	1782
-2025	1920	1891	99	1057	1909	2237	106	97	920	603	1841	2150	1980	1970	88
-1870	170	167	176	306	1909	1825	1709	168	1400	359	817	1678	1718	1594	1552
-98	81	216	677	572	295	38	574	403	74	91	534	662	588	511	51
-453	1153	666	695	63	69	68	58	524	1088	75	1117	1192	1232	1046	443
-3893	441	1825	3730	3660	115	4503	4105	3495	4092	48	3852	132	156	150	4229
-867	44	571	40	884	922	418	328	901	845	42	860	932	53	432	569
-905	717	162	4536	4219	179	990	374	4409	4821	393	4181	4054	4958	186	193
-2610	2936	218	2552	3281	761	204	3433	3699	2727	3065	3624	193	926	1866	236
-2602	216	495	3733	183	4688	2893	4042	3066	3810	189	4392	3900	4321	2814	159
-166	136	80	185	135	78	177	123	82	150	121	145	115	63	68	24
-214	221	265	766	959	1038	226	1188	1122	117	458	1105	1285	1017	274	281    
-`
-    def list (strsplit data "")
-    def idx 0 
-    def value 0
-    def n_idx 1
-    def min 0 
-    def max 0
-    def total 0 
-    def row:[int]
-    list.forEach({
-      def iValue (to_int item)
-      if(!null? iValue) {
-        value = ( (unwrap iValue) + value * 10)
-        n_idx = n_idx + 1
-      } {
-        if(n_idx > 1) {
-          push row value
-        }
-        value = 0
-        n_idx = 1
-        if( (charAt item 0 ) == (ccode '\n') || (charAt item 0 ) == (ccode '\r') ) {
-          def theValue 0
-          row.forEach({
-            def item1 item
-            def outer_index index
-            row.forEach({
-              if(index != outer_index) {
-                def divRes ((to_double item) / (to_double item1))
-                if( item % item1 == 0) {
-                  theValue = (to_int divRes)
-                }
-                def divRes ((to_double item1) / (to_double item))
-                if( item1 % item == 0) {
-                  theValue = (to_int divRes)
-                }
-              }
-            })
-          })
-          total = total + theValue
-          max = 0
-          min = 0
-          clear row
-        }
-      }
-    })
-    print "Total == " + total
-  }
-}

package/adventofcode/day2/input1.txt

@@ -1 +0,0 @@
-428122498997587283996116951397957933569136949848379417125362532269869461185743113733992331379856446362482129646556286611543756564275715359874924898113424472782974789464348626278532936228881786273586278886575828239366794429223317476722337424399239986153675275924113322561873814364451339186918813451685263192891627186769818128715595715444565444581514677521874935942913547121751851631373316122491471564697731298951989511917272684335463436218283261962158671266625299188764589814518793576375629163896349665312991285776595142146261792244475721782941364787968924537841698538288459355159783985638187254653851864874544584878999193242641611859756728634623853475638478923744471563845635468173824196684361934269459459124269196811512927442662761563824323621758785866391424778683599179447845595931928589255935953295111937431266815352781399967295389339626178664148415561175386725992469782888757942558362117938629369129439717427474416851628121191639355646394276451847131182652486561415942815818785884559193483878139351841633366398788657844396925423217662517356486193821341454889283266691224778723833397914224396722559593959125317175899594685524852419495793389481831354787287452367145661829287518771631939314683137722493531318181315216342994141683484111969476952946378314883421677952397588613562958741328987734565492378977396431481215983656814486518865642645612413945129485464979535991675776338786758997128124651311153182816188924935186361813797251997643992686294724699281969473142721116432968216434977684138184481963845141486793996476793954226225885432422654394439882842163295458549755137247614338991879966665925466545111899714943716571113326479432925939227996799951279485722836754457737668191845914566732285928453781818792236447816127492445993945894435692799839217467253986218213131249786833333936332257795191937942688668182629489191693154184177398186462481316834678733713614889439352976144726162214648922159719979143735815478633912633185334529484779322818611438194522292278787653763328944421516569181178517915745625295158611636365253948455727653672922299582352766484

package/adventofcode/day3/bin/Grid.java

@@ -1,92 +0,0 @@
-import java.util.*;
-import java.lang.StringBuilder;
-import java.io.*;
-
-public class Grid { 
-  
-  static String joinStrings(ArrayList<String> list, String delimiter) 
-  {
-      StringBuilder b = new StringBuilder();
-      for(int i=0; i < list.size() ; i++) {
-          if( i > 0 ) {
-              b.append(delimiter);
-          }
-          b.append(list.get(i));
-      }
-      return b.toString();
-  }    
-      
-  public HashMap<Integer,GridRow> cols = new HashMap<Integer,GridRow>();
-  public Integer minx = 0;
-  public Integer maxx = 0;
-  public Integer miny = 0;
-  public Integer maxy = 0;
-  public Integer turtle_limit = 0;
-  public Integer first_largest = 0;
-  
-  public Integer getValue( final Integer x , final Integer y ) {
-    if ( cols.containsKey(y) ) {
-      final GridRow col = cols.get(y);
-      if ( col.values.containsKey(x) ) {
-        return (col.values.get(x));
-      }
-    }
-    return 0;
-  }
-  
-  public void setValue( final Integer x , final Integer y , final Integer value ) {
-    if ( (value > turtle_limit) && (first_largest == 0) ) {
-      first_largest = value;
-    }
-    if ( cols.containsKey(y) ) {
-      final GridRow col = cols.get(y);
-      col.values.put(x, value);
-    } else {
-      final GridRow newCol = new GridRow();
-      cols.put(y, newCol);
-      newCol.values.put(x, value);
-    }
-    if ( x < minx ) {
-      minx = x;
-    }
-    if ( x > maxx ) {
-      maxx = x;
-    }
-    if ( y < miny ) {
-      miny = y;
-    }
-    if ( y > maxy ) {
-      maxy = y;
-    }
-  }
-  
-  public Integer getAdjacentSum( final Integer x , final Integer y ) {
-    final LambdaSignature1 v = new LambdaSignature1() { 
-      public Integer run( final Integer dx,  final Integer dy) {
-        return (Grid.this).getValue((x + dx), (y + dy));
-        // captured var x
-        // captured var y
-      }
-    };
-    return ((((((v.run(-1, -1) + v.run(-1, 0)) + v.run(-1, 1)) + v.run(0, -1)) + v.run(0, 1)) + v.run(1, -1)) + v.run(1, 0)) + v.run(1, 1);
-  }
-  
-  public void printGrid() {
-    Integer xx = minx;
-    Integer yy = miny;
-    while (yy <= maxy) {
-      xx = minx;
-      ArrayList<Integer> row = new ArrayList<Integer>();
-      while (xx <= maxx) {
-        row.add((this).getValue(xx, yy));
-        xx = xx + 1;
-      }
-      System.out.println(String.valueOf( joinStrings(operatorsOf.map_2(row, new LambdaSignature2() { 
-        public String run( final Integer item,  final Integer index) {
-          return String.valueOf(item );
-        }
-      }), " ") ) );
-      yy = yy + 1;
-    }
-  }
-}

package/adventofcode/day3/bin/GridRow.java

@@ -1,5 +0,0 @@
-import java.util.*;
-
-public class GridRow { 
-  public HashMap<Integer,Integer> values = new HashMap<Integer,Integer>();
-}

package/adventofcode/day3/bin/LambdaSignature1.java

@@ -1,3 +0,0 @@
-public interface LambdaSignature1 { 
-  public Integer run( final Integer dx,  final Integer dy);
-}

package/adventofcode/day3/bin/LambdaSignature2.java

@@ -1,3 +0,0 @@
-public interface LambdaSignature2 { 
-  public String run( final Integer item,  final Integer index);
-}

package/adventofcode/day3/bin/LambdaSignature3.java

@@ -1,3 +0,0 @@
-public interface LambdaSignature3 { 
-  public void run( final Integer dx,  final Integer dy,  final Integer steps);
-}

package/adventofcode/day3/bin/day3.cpp

@@ -1,64 +0,0 @@
-#include  <memory>
-#include  "variant.hpp"
-#include  <math.h>
-#include  <iostream>
-#include  <string>
-
-// define classes here to avoid compiler errors
-class day_two;
-
-typedef mpark::variant<std::shared_ptr<day_two>, int, std::string, bool, double>  r_union_Any;
-
-// header definitions
-class day_two : public std::enable_shared_from_this<day_two>  { 
-  public :
-    /* class constructor */ 
-    day_two( );
-    /* static methods */ 
-    static int distance( int data );
-    static void main();
-};
-
-int __g_argc;
-char **__g_argv;
-day_two::day_two( ) {
-}
-int  day_two::distance( int data ) {
-  /** unused:  int size = 1   **/ ;
-  int side = 1;
-  int total = 1;
-  int last_total = 1;
-  int n = 1;
-  while (total < data) {
-    last_total = total;
-    side = side + 2;
-    total = total + ((side - 1) * 4);
-    n = n + 1;
-  }
-  int dist = (data - last_total) - 1;
-  int sideStep = side - 1;
-  int pos = dist % sideStep;
-  int step_ort = 0;
-  int halfway = (int)floor( (sideStep / 2));
-  if ( pos < halfway ) {
-    step_ort = (halfway - 1) - pos;
-  } else {
-    step_ort = (pos - halfway) + 1;
-  }
-  std::cout << ((std::string("total steps for ") + std::to_string(data)) + std::string(" == ")) + std::to_string((step_ort + halfway)) << std::endl;
-  return step_ort + halfway;
-}
-int main(int argc, char* argv[]) {
-  __g_argc = argc;
-  __g_argv = argv;
-  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);
-  return 0;
-}

package/adventofcode/day3/bin/day3.go

@@ -1,55 +0,0 @@
-package main
-import (
-  "strings"
-  "strconv"
-  "fmt"
-)
-
-type GoNullable struct { 
-  value interface{}
-  has_value bool
-}
-
-type day_two struct { 
-}
-
-func CreateNew_day_two() *day_two {
-  me := new(day_two)
-  return me;
-}
-func day_two_static_distance(data int64) int64 {
-  /** unused:  size*/
-  var side int64= int64(1);
-  var total int64= int64(1);
-  var last_total int64= int64(1);
-  var n int64= int64(1);
-  for total < data {
-    last_total = total; 
-    side = side + int64(2); 
-    total = total + ((side - int64(1)) * int64(4)); 
-    n = n + int64(1); 
-  }
-  var dist int64= (data - last_total) - int64(1);
-  var sideStep int64= side - int64(1);
-  var pos int64= dist % sideStep;
-  var step_ort int64= int64(0);
-  var halfway int64= int64((sideStep / int64(2)));
-  if  pos < halfway {
-    step_ort = (halfway - int64(1)) - pos; 
-  } else {
-    step_ort = (pos - halfway) + int64(1); 
-  }
-  fmt.Println( strings.Join([]string{ ((strings.Join([]string{ "total steps for ",strconv.FormatInt(data, 10) }, "")) + " == "),strconv.FormatInt((step_ort + halfway), 10) }, "") )
-  return step_ort + halfway
-}
-func main() {
-  day_two_static_distance(int64(9));
-  day_two_static_distance(int64(10));
-  day_two_static_distance(int64(11));
-  day_two_static_distance(int64(12));
-  day_two_static_distance(int64(17));
-  day_two_static_distance(int64(23));
-  day_two_static_distance(int64(24));
-  day_two_static_distance(int64(1024));
-  day_two_static_distance(int64(289326));
-}

package/adventofcode/day3/bin/day3.js

@@ -1,42 +0,0 @@
-class day_two  {
-  constructor() {
-  }
-}
-day_two.distance = function(data) {
-  /** unused:  const size = 1   **/ 
-  let side = 1;
-  let total = 1;
-  let last_total = 1;
-  let n = 1;
-  while (total < data) {
-    last_total = total;
-    side = side + 2;
-    total = total + ((side - 1) * 4);
-    n = n + 1;
-  };
-  const dist = (data - last_total) - 1;
-  const sideStep = side - 1;
-  const pos = dist % sideStep;
-  let step_ort = 0;
-  const halfway = Math.floor( (sideStep / 2));
-  if ( pos < halfway ) {
-    step_ort = (halfway - 1) - pos;
-  } else {
-    step_ort = (pos - halfway) + 1;
-  }
-  console.log((("total steps for " + data) + " == ") + (step_ort + halfway));
-  return step_ort + halfway;
-};
-/* static JavaSript main routine at the end of the JS file */
-function __js_main() {
-  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);
-}
-__js_main();

package/adventofcode/day3/bin/day3.php

@@ -1,41 +0,0 @@
-<?php 
-
-class day_two { 
-  function __construct( ) {
-  }
-  public static function distance( $data ) {
-    /** unused:  $size = 1   **/ ;
-    $side = 1;
-    $total = 1;
-    $last_total = 1;
-    $n = 1;
-    while ($total < $data) {
-      $last_total = $total;
-      $side = $side + 2;
-      $total = $total + (($side - 1) * 4);
-      $n = $n + 1;
-    }
-    $dist = ($data - $last_total) - 1;
-    $sideStep = $side - 1;
-    $pos = $dist % $sideStep;
-    $step_ort = 0;
-    $halfway = floor(($sideStep / 2));
-    if ( $pos < $halfway ) {
-      $step_ort = ($halfway - 1) - $pos;
-    } else {
-      $step_ort = ($pos - $halfway) + 1;
-    }
-    echo( (("total steps for " . $data) . " == ") . ($step_ort + $halfway) . "\n");
-    return $step_ort + $halfway;
-  }
-}
-/* static PHP main routine */
-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/day3.scala

@@ -1,52 +0,0 @@
-import scala.util.control._
-case class ScalaReturnValue(value:Any) extends Exception
-
-// -----------  the scalafiddle main function begins ---------
-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);
-// -----------  the scalafiddle main function ends ---------
-
-
-// companion object for static methods of day_two static cnt == 2
-object day_two {
-  def  distance( data : Int) : Int = {
-    /** unused val size : Int = 1**/ 
-    var side : Int = 1
-    var total : Int = 1
-    var last_total : Int = 1
-    var n : Int = 1
-    try {
-      val __break__ = new Breaks;
-      __break__.breakable { 
-        while (total < data) {
-          val __continue__ = new Breaks;
-          __continue__.breakable {
-            last_total = total
-            side = side + 2
-            total = total + ((side - 1) * 4)
-            n = n + 1
-          }
-        }
-      }
-    } 
-    val dist : Int = (data - last_total) - 1
-    val sideStep : Int = side - 1
-    val pos : Int = dist % sideStep
-    var step_ort : Int = 0
-    val halfway : Int = (sideStep / 2).toInt
-    if ( pos < halfway ) {
-      step_ort = (halfway - 1) - pos
-    } else {
-      step_ort = (pos - halfway) + 1
-    }
-    println( (("total steps for " + data) + " == ") + (step_ort + halfway) )
-    return step_ort + halfway  
-  }
-}

package/adventofcode/day3/bin/day3.swift

@@ -1,43 +0,0 @@
-func ==(l: day_two, r: day_two) -> Bool {
-  return l === r
-}
-class day_two : Equatable  { 
-  class func distance(data : Int) -> Int {
-    /** unused:  let size : Int = 1   **/ 
-    var side : Int = 1
-    var total : Int = 1
-    var last_total : Int = 1
-    var n : Int = 1
-    while (total < data) {
-      last_total = total;
-      side = side + 2;
-      total = total + ((side - 1) * 4);
-      n = n + 1;
-    }
-    let dist : Int = (data - last_total) - 1
-    let sideStep : Int = side - 1
-    let pos : Int = dist % sideStep
-    var step_ort : Int = 0
-    let halfway : Int = Int((sideStep / 2))
-    if ( pos < halfway ) {
-      step_ort = (halfway - 1) - pos;
-    } else {
-      step_ort = (pos - halfway) + 1;
-    }
-    print((("total steps for " + String(data)) + " == ") + String((step_ort + halfway)))
-    return step_ort + halfway;
-  }
-}
-func __main__swift() {
-  _ = day_two.distance(data : 9)
-  _ = day_two.distance(data : 10)
-  _ = day_two.distance(data : 11)
-  _ = day_two.distance(data : 12)
-  _ = day_two.distance(data : 17)
-  _ = day_two.distance(data : 23)
-  _ = day_two.distance(data : 24)
-  _ = day_two.distance(data : 1024)
-  _ = day_two.distance(data : 289326)
-}
-// call the main function
-__main__swift()