goodguide-gibbon 0.9.1 → 0.9.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 0b9274f014ac2966c20ab9a9e93e1535754ca705
-  data.tar.gz: f8c5435731719c0b5bf2eb70a1af9dfa048226e3
+  metadata.gz: ade669c4d8c8e8cf9dc4f03f5e383e9f0341d8d9
+  data.tar.gz: c385c96569b2f9301590e6052a1076c44f0f4e2f
 SHA512:
-  metadata.gz: 839d16f12f2f2caec2c85279ebcd986c0588933fe16bdf436cf52e80fc29110dff46e48d6dca6e01f0d2503d33ec801abce550db2176b24a621122111910a7a5
-  data.tar.gz: d7ed1feab0b50fa8dd969348c86b2ceba57bd8e500de6b4256848e9b018e5cabbeb35f66233ad16462b55815a19582df4666616184112b4f0017338032d8daa3
+  metadata.gz: dd0d2352b67e3ea169bee3951c0856893c5fd4383593939f047adf196803ccd6171dd52abc3e1d488d2f805cf3987d7772eb314a6226eaf9a0b393dff33cd8fa
+  data.tar.gz: e447692892c3cc072396c2d09cdab4159697f1797639c7f0a84a065528404f33a582a483f12502b93310d63b1f985236efa40f5ddbd8ae6b4b4cc035ff1e9467

data/lib/goodguide/gibbon/version.rb

@@ -1,7 +1,7 @@
 module GoodGuide
   module Gibbon
     def self.version
-      '0.9.1'
+      '0.9.2'
     end
   end
 end

data/lib/goodguide/gibbon.rb

@@ -16,6 +16,8 @@ end
 
 require 'pathname'
 
+load Pathname.new(__FILE__).dirname.join('gibbon/version.rb')
+
 module GoodGuide
   module Gibbon
     module Util

data/vendor/gibbon/lib/gibbon.browser.dev.js

@@ -936,10 +936,11 @@ Gibbon.ObjHash = ObjHash = (function(_super) {
   };
 
   ObjHash.prototype.set = function(k, v) {
-    return this[k.hash()] = {
+    this[k.hash()] = {
       key: k,
       value: v
     };
+    return v;
   };
 
   ObjHash.prototype.has = function(k) {
@@ -2612,7 +2613,14 @@ Gibbon.Core = Core = (function(_super) {
 
   Core.prototype.depair = function(key) {
     if (key) {
-      return Core.depair(this, key);
+      return this.cases({
+        pair: function() {
+          return this[key];
+        },
+        other: function() {
+          return Core.depair(this, key);
+        }
+      });
     } else {
       return [this.depair('first'), this.depair('second')];
     }
@@ -2639,7 +2647,14 @@ Gibbon.Core = Core = (function(_super) {
   };
 
   Core.prototype.len = function() {
-    return Core.len(this);
+    return this.cases({
+      list: function(els) {
+        return Core.constant(els.length);
+      },
+      other: function() {
+        return Core.len(this);
+      }
+    });
   };
 
   Core.prototype.rescue = function(alt) {
@@ -2802,6 +2817,7 @@ Gibbon.Core = Core = (function(_super) {
       },
       delist: single,
       depair: single,
+      squishList: single,
       list: function(e) {
         return e;
       },
@@ -3257,11 +3273,22 @@ Gibbon.translate = (function() {
 })();
 
 Gibbon.optimize = (function() {
-  var insertBindings, partialEval;
+  var insertBindings, partialEval, uncachedPartialEval;
   partialEval = function(expr) {
+    var cache, recurse, result;
+    cache = new ObjHash;
+    result = (recurse = function(expr) {
+      return cache.cache(expr, function() {
+        return uncachedPartialEval(expr, recurse);
+      });
+    })(expr);
+    DEBUG.log("evaled to: " + (result.inspect()));
+    return result;
+  };
+  uncachedPartialEval = function(expr, recurse) {
     return expr.cases({
       depair: function(expr, key) {
-        return partialEval(expr).cases({
+        return recurse(expr).cases({
           pair: function() {
             DEBUG.log("inlining lookup " + key + " of " + (this.inspect()));
             return this[key];
@@ -3272,7 +3299,7 @@ Gibbon.optimize = (function() {
         });
       },
       delist: function(expr, index) {
-        return partialEval(expr).cases({
+        return recurse(expr).cases({
           list: function(els) {
             DEBUG.log("inlining lookup " + index + " of " + (this.inspect()));
             return els[index];
@@ -3284,10 +3311,10 @@ Gibbon.optimize = (function() {
       },
       branch: function(cond, ifTrue, ifFalse) {
         var abort;
-        cond = partialEval(cond);
+        cond = recurse(cond);
         abort = function() {
-          ifTrue = partialEval(ifTrue);
-          ifFalse = partialEval(ifFalse);
+          ifTrue = recurse(ifTrue);
+          ifFalse = recurse(ifFalse);
           if (ifTrue.equals(ifFalse)) {
             DEBUG.log("eliminating condition in equivalent branches: " + (this.inspect()));
             return ifTrue;
@@ -3298,20 +3325,21 @@ Gibbon.optimize = (function() {
           constant: function(value) {
             if (value) {
               DEBUG.log("eliminating dead false branch " + (ifFalse.inspect()));
-              return partialEval(ifTrue);
+              return recurse(ifTrue);
             } else {
               DEBUG.log("eliminating dead true branch " + (ifTrue.inspect()));
-              return partialEval(ifFalse);
+              return recurse(ifFalse);
             }
           },
           branch: function(innerCond, innerTrue, innerFalse) {
+            debugger;
             DEBUG.log("flattening nested branch " + (this.inspect()));
-            return partialEval(innerCond.branch(innerTrue.branch(ifTrue, ifFalse), innerFalse.branch(ifTrue, ifFalse)));
+            return recurse(innerCond.branch(innerTrue.branch(ifTrue, ifFalse), innerFalse.branch(ifTrue, ifFalse)));
           },
           op1: function(name, arg) {
             if (name === '!') {
               DEBUG.log("eliminating if negation in condition " + (this.inspect()));
-              return partialEval(arg.branch(ifFalse, ifTrue));
+              return recurse(arg.branch(ifFalse, ifTrue));
             } else {
               return abort();
             }
@@ -3320,57 +3348,53 @@ Gibbon.optimize = (function() {
         });
       },
       app: function(block, arg) {
-        return partialEval(block).cases({
+        return recurse(block).cases({
           block: function(argName, body) {
             DEBUG.log("inlining application of " + (this.inspect()) + " to " + (arg.inspect()));
-            return partialEval(body.subst(argName, arg));
+            return recurse(body.subst(argName, arg));
           },
           other: function() {
-            return this.app(partialEval(arg));
+            return this.app(recurse(arg));
           }
         });
       },
       mapList: function(list, arg, ixName, body) {
-        return list.cases({
+        return recurse(list).cases({
           list: function(elements) {
-            var el, i, mapped, _i, _len;
+            var el, i, mapped;
             DEBUG.log("inlining MAP");
-            for (i = _i = 0, _len = elements.length; _i < _len; i = ++_i) {
-              el = elements[i];
-              DEBUG.log(("subst " + arg + "=" + (el.inspect()) + " ") + ("" + ixName + "=" + i + " " + (body.inspect())));
-              partialEval(body.subst(arg, el).subst(ixName, Core.constant(i)));
-            }
             mapped = (function() {
-              var _j, _len1, _results;
+              var _i, _len, _results;
               _results = [];
-              for (_j = 0, _len1 = elements.length; _j < _len1; _j++) {
-                el = elements[_j];
-                _results.push(body.subst(arg, el));
+              for (i = _i = 0, _len = elements.length; _i < _len; i = ++_i) {
+                el = elements[i];
+                DEBUG.log(("subst " + arg + "=" + (el.inspect()) + " ") + ("" + ixName + "=" + i + " " + (body.inspect())));
+                _results.push(recurse(body.subst(arg, el).subst(ixName, Core.constant(i))));
               }
               return _results;
             })();
-            return partialEval(Core.list(mapped));
+            return recurse(Core.list(mapped));
           },
           mapList: function(innerList, innerArg, innerIdxArg, innerBody) {
             var newBody;
             DEBUG.log("fusing MAP of " + (this.inspect()));
             newBody = body.subst(arg, innerBody).subst(ixName, Core.variable(innerIdxArg));
-            return Core.mapList(innerList, innerArg, innerIdxArg, newBody);
+            return recurse(Core.mapList(innerList, innerArg, innerIdxArg, newBody));
           },
           other: function() {
-            return Core.mapList(partialEval(this), arg, ixName, partialEval(body));
+            return Core.mapList(recurse(this), arg, ixName, recurse(body));
           }
         });
       },
       foldList: function(list, out, arg, accum, ixName, body) {
-        return partialEval(list).cases({
+        return recurse(list).cases({
           list: function(elements) {
             var _loop;
             DEBUG.log("inlining FOLDR");
-            return partialEval((_loop = function(i) {
+            return recurse((_loop = function(i) {
               var next;
               if (i >= elements.length) {
-                return partialEval(out);
+                return recurse(out);
               }
               next = _loop(i + 1);
               DEBUG.log(("subst " + arg + "=" + (elements[i].inspect()) + " ") + ("" + accum + "=" + (next.inspect()) + " ") + ("" + ixName + "=i " + (body.inspect())));
@@ -3384,23 +3408,23 @@ Gibbon.optimize = (function() {
             return Core.foldList(innerList, out, innerArg, accum, innerIdxArg, newBody);
           },
           other: function() {
-            return Core.foldList(this, partialEval(out), arg, accum, ixName, partialEval(body));
+            return Core.foldList(this, recurse(out), arg, accum, ixName, recurse(body));
           }
         });
       },
       len: function(list) {
-        return partialEval(list).cases({
+        return recurse(list).cases({
           list: function(elements) {
             DEBUG.log("optimizing out len from " + (this.inspect()));
             return Core.constant(elements.length);
           },
           mapList: function(list) {
             DEBUG.log("optimizing MAP out of len");
-            return partialEval(list.len());
+            return recurse(list.len());
           },
           zipLists: function(l, r) {
             DEBUG.log("optimizing ZIP out of len");
-            return partialEval(l.len());
+            return recurse(l.len());
           },
           other: function() {
             return this.len();
@@ -3409,8 +3433,8 @@ Gibbon.optimize = (function() {
       },
       zipLists: function(l, r) {
         var e, elements, i;
-        l = partialEval(l);
-        r = partialEval(r);
+        l = recurse(l);
+        r = recurse(r);
         if (!(l._tag === 'list' && r._tag === 'list')) {
           return Core.zipLists(l, r);
         }
@@ -3423,10 +3447,10 @@ Gibbon.optimize = (function() {
           }
           return _results;
         })();
-        return partialEval(Core.list(elements));
+        return recurse(Core.list(elements));
       },
       op1: function(op, arg) {
-        return partialEval(arg).cases({
+        return recurse(arg).cases({
           constant: function(value) {
             return Core.constant(applyOp1(op, value));
           },
@@ -3437,8 +3461,8 @@ Gibbon.optimize = (function() {
       },
       op2: function(op, left, right) {
         var checkConst, checkIdent, identFold, l, r, _ref10;
-        left = partialEval(left);
-        right = partialEval(right);
+        left = recurse(left);
+        right = recurse(right);
         checkConst = function(val, f) {
           return val._tag === 'constant' && f(val.value);
         };
@@ -3474,19 +3498,19 @@ Gibbon.optimize = (function() {
         return Core.constant(applyOp2(op, left.value, right.value));
       },
       rescue: function(expr, default_) {
-        expr = partialEval(expr);
+        expr = recurse(expr);
         if (expr.alwaysSucceeds()) {
           DEBUG.log("eliminating dead default branch of " + (this.inspect()));
           return expr;
         } else if (expr.alwaysFails()) {
           DEBUG.log("eliminating dead main branch of " + (this.inspect()));
-          return partialEval(default_);
+          return recurse(default_);
         } else {
-          return Core.rescue(expr, partialEval(default_));
+          return Core.rescue(expr, recurse(default_));
         }
       },
       other: function() {
-        return this.map(partialEval);
+        return this.map(recurse);
       }
     });
   };
@@ -3498,7 +3522,7 @@ Gibbon.optimize = (function() {
       }).reverse();
     };
     genSubstitutions = function(expr) {
-      var newTrace, occurrences, queue, sub, substitutions, trace, _i, _len, _ref10, _ref11;
+      var newTrace, occurrences, queue, sub, substitutions, trace, _i, _len, _ref10, _ref11, _ref12;
       occurrences = new ObjHash;
       substitutions = new Hash;
       queue = [[expr, List.empty()]];
@@ -3512,9 +3536,12 @@ Gibbon.optimize = (function() {
         } else {
           occurrences.set(expr, [makeCrumbs(trace)]);
           newTrace = trace.cons(expr);
-          _ref11 = expr.subtrees();
-          for (_i = 0, _len = _ref11.length; _i < _len; _i++) {
-            sub = _ref11[_i];
+          if ((_ref11 = expr._tag) === 'rescue' || _ref11 === 'squishList') {
+            continue;
+          }
+          _ref12 = expr.subtrees();
+          for (_i = 0, _len = _ref12.length; _i < _len; _i++) {
+            sub = _ref12[_i];
             queue.push([sub, newTrace]);
           }
         }
@@ -3583,7 +3610,20 @@ Gibbon.optimize = (function() {
               return Core.variable(names[i]);
             }
           }
-          return boundExpr.map(recurseInner);
+          return boundExpr.cases({
+            rescue: function(expr, default_) {
+              return Core.rescue(insertBindings(expr), insertBindings(default_));
+            },
+            squishList: function(list) {
+              if (list._tag !== 'list') {
+                throw 'invalid squish';
+              }
+              return Core.squishList(list.map(insertBindings));
+            },
+            other: function() {
+              return this.map(recurseInner);
+            }
+          });
         })(expr);
         for (i = _i = 0, _len = bindableExprs.length; _i < _len; i = ++_i) {
           bindable = bindableExprs[i];
@@ -5571,6 +5611,20 @@ stdlib = Gibbon.stdlib = (function() {
         });
       }
     },
+    "bucket": {
+      type: parse.type('bucket [numeric : %b] = numeric -> %b'),
+      compile: function(input, _arg) {
+        var default_, partitions;
+        partitions = _arg[0];
+        default_ = Core.fail('bucket: exceeded the last bucket');
+        return partitions.foldList(default_, function(pair, next) {
+          var boundary, result;
+          boundary = pair.depair('first');
+          result = pair.depair('second');
+          return input.op2('<=', boundary).branch(result, next);
+        });
+      }
+    },
     "any-true?": {
       type: parse.type('any-true? = [bool] -> bool'),
       compile: function(list) {

data/vendor/gibbon/lib/gibbon.browser.js

@@ -926,10 +926,11 @@ Gibbon.ObjHash = ObjHash = (function(_super) {
   };
 
   ObjHash.prototype.set = function(k, v) {
-    return this[k.hash()] = {
+    this[k.hash()] = {
       key: k,
       value: v
     };
+    return v;
   };
 
   ObjHash.prototype.has = function(k) {
@@ -2580,7 +2581,14 @@ Gibbon.Core = Core = (function(_super) {
 
   Core.prototype.depair = function(key) {
     if (key) {
-      return Core.depair(this, key);
+      return this.cases({
+        pair: function() {
+          return this[key];
+        },
+        other: function() {
+          return Core.depair(this, key);
+        }
+      });
     } else {
       return [this.depair('first'), this.depair('second')];
     }
@@ -2607,7 +2615,14 @@ Gibbon.Core = Core = (function(_super) {
   };
 
   Core.prototype.len = function() {
-    return Core.len(this);
+    return this.cases({
+      list: function(els) {
+        return Core.constant(els.length);
+      },
+      other: function() {
+        return Core.len(this);
+      }
+    });
   };
 
   Core.prototype.rescue = function(alt) {
@@ -2770,6 +2785,7 @@ Gibbon.Core = Core = (function(_super) {
       },
       delist: single,
       depair: single,
+      squishList: single,
       list: function(e) {
         return e;
       },
@@ -3225,11 +3241,22 @@ Gibbon.translate = (function() {
 })();
 
 Gibbon.optimize = (function() {
-  var insertBindings, partialEval;
+  var insertBindings, partialEval, uncachedPartialEval;
   partialEval = function(expr) {
+    var cache, recurse, result;
+    cache = new ObjHash;
+    result = (recurse = function(expr) {
+      return cache.cache(expr, function() {
+        return uncachedPartialEval(expr, recurse);
+      });
+    })(expr);
+    
+    return result;
+  };
+  uncachedPartialEval = function(expr, recurse) {
     return expr.cases({
       depair: function(expr, key) {
-        return partialEval(expr).cases({
+        return recurse(expr).cases({
           pair: function() {
             
             return this[key];
@@ -3240,7 +3267,7 @@ Gibbon.optimize = (function() {
         });
       },
       delist: function(expr, index) {
-        return partialEval(expr).cases({
+        return recurse(expr).cases({
           list: function(els) {
             
             return els[index];
@@ -3252,10 +3279,10 @@ Gibbon.optimize = (function() {
       },
       branch: function(cond, ifTrue, ifFalse) {
         var abort;
-        cond = partialEval(cond);
+        cond = recurse(cond);
         abort = function() {
-          ifTrue = partialEval(ifTrue);
-          ifFalse = partialEval(ifFalse);
+          ifTrue = recurse(ifTrue);
+          ifFalse = recurse(ifFalse);
           if (ifTrue.equals(ifFalse)) {
             
             return ifTrue;
@@ -3266,20 +3293,21 @@ Gibbon.optimize = (function() {
           constant: function(value) {
             if (value) {
               
-              return partialEval(ifTrue);
+              return recurse(ifTrue);
             } else {
               
-              return partialEval(ifFalse);
+              return recurse(ifFalse);
             }
           },
           branch: function(innerCond, innerTrue, innerFalse) {
+            debugger;
             
-            return partialEval(innerCond.branch(innerTrue.branch(ifTrue, ifFalse), innerFalse.branch(ifTrue, ifFalse)));
+            return recurse(innerCond.branch(innerTrue.branch(ifTrue, ifFalse), innerFalse.branch(ifTrue, ifFalse)));
           },
           op1: function(name, arg) {
             if (name === '!') {
               
-              return partialEval(arg.branch(ifFalse, ifTrue));
+              return recurse(arg.branch(ifFalse, ifTrue));
             } else {
               return abort();
             }
@@ -3288,57 +3316,53 @@ Gibbon.optimize = (function() {
         });
       },
       app: function(block, arg) {
-        return partialEval(block).cases({
+        return recurse(block).cases({
           block: function(argName, body) {
             
-            return partialEval(body.subst(argName, arg));
+            return recurse(body.subst(argName, arg));
           },
           other: function() {
-            return this.app(partialEval(arg));
+            return this.app(recurse(arg));
           }
         });
       },
       mapList: function(list, arg, ixName, body) {
-        return list.cases({
+        return recurse(list).cases({
           list: function(elements) {
-            var el, i, mapped, _i, _len;
+            var el, i, mapped;
             
-            for (i = _i = 0, _len = elements.length; _i < _len; i = ++_i) {
-              el = elements[i];
-              
-              partialEval(body.subst(arg, el).subst(ixName, Core.constant(i)));
-            }
             mapped = (function() {
-              var _j, _len1, _results;
+              var _i, _len, _results;
               _results = [];
-              for (_j = 0, _len1 = elements.length; _j < _len1; _j++) {
-                el = elements[_j];
-                _results.push(body.subst(arg, el));
+              for (i = _i = 0, _len = elements.length; _i < _len; i = ++_i) {
+                el = elements[i];
+                
+                _results.push(recurse(body.subst(arg, el).subst(ixName, Core.constant(i))));
               }
               return _results;
             })();
-            return partialEval(Core.list(mapped));
+            return recurse(Core.list(mapped));
           },
           mapList: function(innerList, innerArg, innerIdxArg, innerBody) {
             var newBody;
             
             newBody = body.subst(arg, innerBody).subst(ixName, Core.variable(innerIdxArg));
-            return Core.mapList(innerList, innerArg, innerIdxArg, newBody);
+            return recurse(Core.mapList(innerList, innerArg, innerIdxArg, newBody));
           },
           other: function() {
-            return Core.mapList(partialEval(this), arg, ixName, partialEval(body));
+            return Core.mapList(recurse(this), arg, ixName, recurse(body));
           }
         });
       },
       foldList: function(list, out, arg, accum, ixName, body) {
-        return partialEval(list).cases({
+        return recurse(list).cases({
           list: function(elements) {
             var _loop;
             
-            return partialEval((_loop = function(i) {
+            return recurse((_loop = function(i) {
               var next;
               if (i >= elements.length) {
-                return partialEval(out);
+                return recurse(out);
               }
               next = _loop(i + 1);
               
@@ -3352,23 +3376,23 @@ Gibbon.optimize = (function() {
             return Core.foldList(innerList, out, innerArg, accum, innerIdxArg, newBody);
           },
           other: function() {
-            return Core.foldList(this, partialEval(out), arg, accum, ixName, partialEval(body));
+            return Core.foldList(this, recurse(out), arg, accum, ixName, recurse(body));
           }
         });
       },
       len: function(list) {
-        return partialEval(list).cases({
+        return recurse(list).cases({
           list: function(elements) {
             
             return Core.constant(elements.length);
           },
           mapList: function(list) {
             
-            return partialEval(list.len());
+            return recurse(list.len());
           },
           zipLists: function(l, r) {
             
-            return partialEval(l.len());
+            return recurse(l.len());
           },
           other: function() {
             return this.len();
@@ -3377,8 +3401,8 @@ Gibbon.optimize = (function() {
       },
       zipLists: function(l, r) {
         var e, elements, i;
-        l = partialEval(l);
-        r = partialEval(r);
+        l = recurse(l);
+        r = recurse(r);
         if (!(l._tag === 'list' && r._tag === 'list')) {
           return Core.zipLists(l, r);
         }
@@ -3391,10 +3415,10 @@ Gibbon.optimize = (function() {
           }
           return _results;
         })();
-        return partialEval(Core.list(elements));
+        return recurse(Core.list(elements));
       },
       op1: function(op, arg) {
-        return partialEval(arg).cases({
+        return recurse(arg).cases({
           constant: function(value) {
             return Core.constant(applyOp1(op, value));
           },
@@ -3405,8 +3429,8 @@ Gibbon.optimize = (function() {
       },
       op2: function(op, left, right) {
         var checkConst, checkIdent, identFold, l, r, _ref10;
-        left = partialEval(left);
-        right = partialEval(right);
+        left = recurse(left);
+        right = recurse(right);
         checkConst = function(val, f) {
           return val._tag === 'constant' && f(val.value);
         };
@@ -3442,19 +3466,19 @@ Gibbon.optimize = (function() {
         return Core.constant(applyOp2(op, left.value, right.value));
       },
       rescue: function(expr, default_) {
-        expr = partialEval(expr);
+        expr = recurse(expr);
         if (expr.alwaysSucceeds()) {
           
           return expr;
         } else if (expr.alwaysFails()) {
           
-          return partialEval(default_);
+          return recurse(default_);
         } else {
-          return Core.rescue(expr, partialEval(default_));
+          return Core.rescue(expr, recurse(default_));
         }
       },
       other: function() {
-        return this.map(partialEval);
+        return this.map(recurse);
       }
     });
   };
@@ -3466,7 +3490,7 @@ Gibbon.optimize = (function() {
       }).reverse();
     };
     genSubstitutions = function(expr) {
-      var newTrace, occurrences, queue, sub, substitutions, trace, _i, _len, _ref10, _ref11;
+      var newTrace, occurrences, queue, sub, substitutions, trace, _i, _len, _ref10, _ref11, _ref12;
       occurrences = new ObjHash;
       substitutions = new Hash;
       queue = [[expr, List.empty()]];
@@ -3480,9 +3504,12 @@ Gibbon.optimize = (function() {
         } else {
           occurrences.set(expr, [makeCrumbs(trace)]);
           newTrace = trace.cons(expr);
-          _ref11 = expr.subtrees();
-          for (_i = 0, _len = _ref11.length; _i < _len; _i++) {
-            sub = _ref11[_i];
+          if ((_ref11 = expr._tag) === 'rescue' || _ref11 === 'squishList') {
+            continue;
+          }
+          _ref12 = expr.subtrees();
+          for (_i = 0, _len = _ref12.length; _i < _len; _i++) {
+            sub = _ref12[_i];
             queue.push([sub, newTrace]);
           }
         }
@@ -3543,7 +3570,20 @@ Gibbon.optimize = (function() {
               return Core.variable(names[i]);
             }
           }
-          return boundExpr.map(recurseInner);
+          return boundExpr.cases({
+            rescue: function(expr, default_) {
+              return Core.rescue(insertBindings(expr), insertBindings(default_));
+            },
+            squishList: function(list) {
+              if (list._tag !== 'list') {
+                throw 'invalid squish';
+              }
+              return Core.squishList(list.map(insertBindings));
+            },
+            other: function() {
+              return this.map(recurseInner);
+            }
+          });
         })(expr);
         for (i = _i = 0, _len = bindableExprs.length; _i < _len; i = ++_i) {
           bindable = bindableExprs[i];
@@ -5531,6 +5571,20 @@ stdlib = Gibbon.stdlib = (function() {
         });
       }
     },
+    "bucket": {
+      type: parse.type('bucket [numeric : %b] = numeric -> %b'),
+      compile: function(input, _arg) {
+        var default_, partitions;
+        partitions = _arg[0];
+        default_ = Core.fail('bucket: exceeded the last bucket');
+        return partitions.foldList(default_, function(pair, next) {
+          var boundary, result;
+          boundary = pair.depair('first');
+          result = pair.depair('second');
+          return input.op2('<=', boundary).branch(result, next);
+        });
+      }
+    },
     "any-true?": {
       type: parse.type('any-true? = [bool] -> bool'),
       compile: function(list) {

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: goodguide-gibbon
 version: !ruby/object:Gem::Version
-  version: 0.9.1
+  version: 0.9.2
 platform: ruby
 authors:
 - Jay Adkisson
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-03-12 00:00:00.000000000 Z
+date: 2014-03-18 00:00:00.000000000 Z
 dependencies: []
 description: Run and analyze gibbon code from ruby or a browser (via a ruby app).
 email: