Improved stdlib

src/aeso_stdlib.erl

@@ -15,9 +15,41 @@
 stdlib() ->
     maps:from_list(
       [ {<<"List.aes">>, std_list()}
+     %% , {<<"Func.aes">>, std_function()}
       ]
      ).
 
+std_function() ->
+"
+namespace Func =
+
+  function id(x) = x
+
+  function const(x) = (y) => x
+
+  function comp(f, g) = (x) => f(g(x))
+
+  function iter(n, f) = iter_(n, f, (x) => x)
+  private function iter_(n, f, acc) =
+    if(n == 0) acc
+    elif(n == 1) comp(f, acc)
+    else iter_(n / 2, f, if(n mod 2 == 0) comp(acc, acc) else comp(f, comp(acc, acc)))
+
+  function curry2(f) = (x) => (y) => f(x, y)
+  function curry3(f) = (x) => (y) => (z) => f(x, y, z)
+
+  function uncurry2(f) = (x, y) => f(x)(y)
+  function uncurry3(f) = (x, y, z) => f(x)(y)(z)
+
+  function tuplify2(f) = (t) => switch(t)
+    (x, y) => f(x, y)
+//  function tuplify3(f) = (t) => switch(t)
+//    (x, y, z) => f(x, y, z)
+
+  function untuplify2(f) = (x, y) => f((x, y))
+  function untuplify3(f) = (x, y, z) => f((x, y, z))
+".
+
 std_list() ->
 "
 namespace List =
@@ -26,6 +58,33 @@ namespace List =
     [] => true
     _  => false
 
+
+  function first(l) = switch(l)
+    [] => None
+    h::_ => Some(h)
+
+  function tail(l) = switch(l)
+    [] => None
+    _::t => Some(t)
+
+  function last(l) = switch(l)
+    [] => None
+    [x] => Some(x)
+    _::t => last(t)
+
+  function find(p, l) = switch(l)
+    [] => None
+    h::t => if(p(h)) Some(h) else find(p, t)
+
+  function nth(n, l) = switch(l)
+    h::t => if(n == 0) Some(h) else nth(n-1, t)
+    [] => None
+
+  function get(n, l) = switch(l)
+    [] => abort(\"Out of index get\")
+    h::t => if(n == 0) h else get(n-1, t)
+
+
   function length(l) = length_(l, 0)
   private function length_(l, acc) = switch(l)
     [] => acc
@@ -39,8 +98,10 @@ namespace List =
     [] => acc
     h::t => foldl(rcons, rcons(acc, h), t)
 
+
   function reverse(l) = foldl((lst, el) => el :: lst, [], l)
 
+
   function map(f, l) = map_(f, l, [])
   private function map_(f, l, acc) = switch(l)
     [] => reverse(acc)
@@ -50,16 +111,12 @@ namespace List =
     [] => []
     h::t => f(h) ++ flat_map(f, t)
 
-  function concats(ll) = foldr((l1, l2) => l1 ++ l2, [], ll)
 
   function filter(p, l) = filter_(p, l, [])
   private function filter_(p, l, acc) = switch(l)
     [] => reverse(acc)
     h::t => filter_(p, t, if(p(h)) h::acc else acc)
 
-  function all(p, l) = foldl((prev, next) => prev && p(next), true, l)
-  function any(p, l) = foldl((prev, next) => prev || p(next), false, l)
-
   /* Take `n` first elements */
   function take(n, l) = if(n < 0) abort(\"Take negative number of elements\") else take_(n, l, [])
   private function take_(n, l, acc) =
@@ -87,6 +144,24 @@ namespace List =
     [] => []
     h::t => if(p(h)) drop_while(p, t) else l
 
+  /* Splits list into two lists of elements that respectively match and don't match predicate `p` */
+  function partition(p, l) = partition_(p, l, [], [])
+  private function partition_(p, l, acc_t, acc_f) = switch(l)
+    [] => (reverse(acc_t), reverse(acc_f))
+    h::t => if(p(h)) partition_(p, t, h::acc_t, acc_f) else partition_(p, t, acc_t, h::acc_f)
+
+
+  function concats(ll) = foldr((l1, l2) => l1 ++ l2, [], ll)
+
+  function all(p, l) = foldl((prev, next) => prev && p(next), true, l)
+
+  function any(p, l) = foldl((prev, next) => prev || p(next), false, l)
+
+  function sum(l) = foldl ((a, b) => a + b, 0, l)
+
+  function product(l) = foldl((a, b) => a * b, 1, l)
+
+
   /* Zips two list by applying bimapping function on respective elements. Drops longer tail. */
   function zip_with(f, l1, l2) = zip_with_(f, l1, l2, [])
   private function zip_with_(f, l1, l2, acc) = switch ((l1, l2))
@@ -96,15 +171,29 @@ namespace List =
   /* Zips two lists into list of pairs. Drops longer tail. */
   function zip(l1, l2) = zip_with((a, b) => (a, b), l1, l2)
 
-  /* Splits list into two lists of elements that respectively match and don't match predicate `p` */
+  function unzip(l) = unzip_(l, [], [])
-  function partition(p, l) = partition_(p, l, [], [])
+  private function unzip_(l, acc_l, acc_r) = switch(l)
-  private function partition_(p, l, acc_t, acc_f) = switch(l)
+    [] => (reverse(acc_l), reverse(acc_r))
-    [] => (reverse(acc_t), reverse(acc_f))
+    (left, right)::t => unzip_(t, left::acc_l, right::acc_r)
-    h::t => if(p(h)) partition_(p, t, h::acc_t, acc_f) else partition_(p, t, acc_t, h::acc_f)
+
 
   // TODO: Improve?
   function sort(lesser_cmp, l) = switch(l)
     [] => []
     h::t => switch (partition((x) => lesser_cmp(x, h), t))
       (lesser, bigger) => sort(lesser_cmp, lesser) ++ h::sort(lesser_cmp, bigger)
+
+
+  function intersperse(delim, l) = intersperse_(delim, l, [])
+  private function intersperse_(delim, l, acc) = switch(l)
+    [] => reverse(acc)
+    [e] => reverse(e::acc)
+    h::t => intersperse_(delim, t, h::delim::acc)
+
+
+  function index(l) = index_(l, 0, [])
+  private function index_(l, n, acc) = switch(l)
+    [] => reverse(acc)
+    h::t => index_(t, n + 1, (n, h)::acc)
+
 ".