goodguide-gibbon 0.10.3 → 0.11.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: cabd835978ce48079cb610786bd50119555d75f3
-  data.tar.gz: f58c19cfbadc8ea11b5300aa8a135085d33c73a2
+  metadata.gz: 5c5e884ceb34d20830bd23d03ba92bf99469da19
+  data.tar.gz: a76825e187c534ea27d6e87b1fc5c0b2d2aed79c
 SHA512:
-  metadata.gz: a32bfa7fb568d4ef0a17b16acf51319125cd89f8c93770859b936cf2fc7175f8b7c939dc1199e3682aa543003d73ac5a143a7a5b05197d8563b19db2251d4e4b
-  data.tar.gz: 38c21a1b41fd85bf1700d3739911a132c7fe1b0a46f943787f434797e357f6f121e203133b6c9e17f2a80abf131c92f5334fa22fd79233d026f9bcf2b54b4763
+  metadata.gz: 8b376e02bd42b7a66e90cc625ddc3f3c496305bad92916f6d2166fdcdf16d4b484535f35549f6d8c805a53b7b4a844757013cb51df449a841024d480cc3d9c1a
+  data.tar.gz: a73558879b836d5eb0a8df2e036a09edfad92f3cb6f766802e706afb20ed69377da9cf232ecb7b43e5ae2b0b455c958f9a03096fad7fef8c88aeeaeede6dcfc2

data/goodguide-gibbon.gemspec

@@ -17,8 +17,8 @@ Gem::Specification.new do |s|
     'goodguide-gibbon.gemspec',
     'lib/**/*.rb',
     'vendor/gibbon/package.json',
-    'vendor/gibbon/lib/gibbon.browser.js',
-    'vendor/gibbon/lib/gibbon.browser.dev.js',
+    'vendor/gibbon/gibbon.browser.js',
+    'vendor/gibbon/gibbon.browser.dev.js',
   ]
 
   # see ext/mkrf_conf.rb for therubyracer/therubyrhino dependency

data/lib/goodguide/gibbon/version.rb

@@ -1,7 +1,9 @@
+require 'json' # stdlib
+
 module GoodGuide
   module Gibbon
     def self.version
-      '0.10.3'
+      JSON.load(File.read('vendor/gibbon/package.json'))['version']
     end
   end
 end

data/lib/goodguide/gibbon.rb

@@ -108,11 +108,11 @@ module GoodGuide
     end
 
     def self.js_lib
-      root.join('vendor/gibbon/lib/gibbon.browser.js')
+      root.join('vendor/gibbon/gibbon.browser.js')
     end
 
     def self.dev_js_lib
-      root.join('vendor/gibbon/lib/gibbon.browser.dev.js')
+      root.join('vendor/gibbon/gibbon.browser.dev.js')
     end
 
     def self.js_source

data/vendor/gibbon/{lib/gibbon.browser.dev.js → gibbon.browser.dev.js}

@@ -2787,6 +2787,18 @@ Gibbon.Core = Core = (function(_super) {
       squishList: function() {
         return false;
       },
+      foldList: function(list, out, arg, accumArg, idxArg, body) {
+        if (list.alwaysFails()) {
+          return true;
+        }
+        if (body.alwaysFails()) {
+          return true;
+        }
+        if (body.isStrictIn(Core.variable(accumArg)) && out.alwaysFails()) {
+          return true;
+        }
+        return false;
+      },
       other: function() {
         var subtree, _i, _len, _ref10;
         _ref10 = this.subtrees();
@@ -3150,7 +3162,7 @@ Gibbon.Core = Core = (function(_super) {
           return "(LET " + (r(val)) + " " + (r(expr)) + ")";
         },
         variable: function(name) {
-          return name;
+          return "v:" + name;
         },
         delist: function(e, i) {
           return "([" + (r(i)) + "] " + (r(e)) + ")";
@@ -3328,7 +3340,7 @@ Gibbon.optimize = (function() {
       depair: function(expr, key) {
         return recurse(expr).cases({
           pair: function() {
-            DEBUG.log("inlining lookup " + key + " of " + (this.inspect()));
+            DEBUG.log("> inlining lookup " + key + " of " + (this.inspect()));
             return this[key];
           },
           other: function() {
@@ -3339,7 +3351,7 @@ Gibbon.optimize = (function() {
       delist: function(expr, index) {
         return recurse(expr).cases({
           list: function(els) {
-            DEBUG.log("inlining lookup " + index + " of " + (this.inspect()));
+            DEBUG.log("> inlining lookup " + index + " of " + (this.inspect()));
             return els[index];
           },
           other: function() {
@@ -3354,7 +3366,7 @@ Gibbon.optimize = (function() {
           ifTrue = recurse(ifTrue);
           ifFalse = recurse(ifFalse);
           if (ifTrue.equals(ifFalse)) {
-            DEBUG.log("eliminating condition in equivalent branches: " + (this.inspect()));
+            DEBUG.log("> eliminating condition in equivalent branches: " + (this.inspect()));
             return ifTrue;
           }
           return cond.branch(ifTrue, ifFalse);
@@ -3362,21 +3374,21 @@ Gibbon.optimize = (function() {
         return cond.cases({
           constant: function(value) {
             if (value) {
-              DEBUG.log("eliminating dead false branch " + (ifFalse.inspect()));
+              DEBUG.log("> eliminating dead false branch " + (ifFalse.inspect()));
               return recurse(ifTrue);
             } else {
-              DEBUG.log("eliminating dead true branch " + (ifTrue.inspect()));
+              DEBUG.log("> eliminating dead true branch " + (ifTrue.inspect()));
               return recurse(ifFalse);
             }
           },
           branch: function(innerCond, innerTrue, innerFalse) {
             debugger;
-            DEBUG.log("flattening nested branch " + (this.inspect()));
+            DEBUG.log("> flattening nested branch " + (this.inspect()));
             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()));
+              DEBUG.log("> eliminating if negation in condition " + (this.inspect()));
               return recurse(arg.branch(ifFalse, ifTrue));
             } else {
               return abort();
@@ -3388,7 +3400,7 @@ Gibbon.optimize = (function() {
       app: function(block, arg) {
         return recurse(block).cases({
           block: function(argName, body) {
-            DEBUG.log("inlining application of " + (this.inspect()) + " to " + (arg.inspect()));
+            DEBUG.log("> inlining application of " + (this.inspect()) + " to " + (arg.inspect()));
             return recurse(body.subst(argName, arg));
           },
           other: function() {
@@ -3400,13 +3412,13 @@ Gibbon.optimize = (function() {
         return recurse(list).cases({
           list: function(elements) {
             var el, i, mapped;
-            DEBUG.log("inlining MAP");
+            DEBUG.log("> inlining MAP");
             mapped = (function() {
               var _i, _len, _results;
               _results = [];
               for (i = _i = 0, _len = elements.length; _i < _len; i = ++_i) {
                 el = elements[i];
-                DEBUG.log(("subst " + arg + "=" + (el.inspect()) + " ") + ("" + ixName + "=" + i + " " + (body.inspect())));
+                DEBUG.log(("> subst " + arg + "=" + (el.inspect()) + " ") + ("" + ixName + "=" + i + " " + (body.inspect())));
                 _results.push(recurse(body.subst(arg, el).subst(ixName, Core.constant(i))));
               }
               return _results;
@@ -3415,7 +3427,7 @@ Gibbon.optimize = (function() {
           },
           mapList: function(innerList, innerArg, innerIdxArg, innerBody) {
             var newBody;
-            DEBUG.log("fusing MAP of " + (this.inspect()));
+            DEBUG.log("> fusing MAP of " + (this.inspect()));
             newBody = body.subst(arg, innerBody).subst(ixName, Core.variable(innerIdxArg));
             return recurse(Core.mapList(innerList, innerArg, innerIdxArg, newBody));
           },
@@ -3428,20 +3440,20 @@ Gibbon.optimize = (function() {
         return recurse(list).cases({
           list: function(elements) {
             var _loop;
-            DEBUG.log("inlining FOLDR");
+            DEBUG.log("> inlining FOLDR");
             return recurse((_loop = function(i) {
               var next;
               if (i >= elements.length) {
                 return recurse(out);
               }
               next = _loop(i + 1);
-              DEBUG.log(("subst " + arg + "=" + (elements[i].inspect()) + " ") + ("" + accum + "=" + (next.inspect()) + " ") + ("" + ixName + "=i " + (body.inspect())));
+              DEBUG.log(("> subst " + arg + "=" + (elements[i].inspect()) + " ") + ("" + accum + "=" + (next.inspect()) + " ") + ("" + ixName + "=i " + (body.inspect())));
               return body.subst(arg, elements[i]).subst(accum, next).subst(ixName, Core.constant(i));
             })(0));
           },
           mapList: function(innerList, innerArg, innerIdxArg, mapBody) {
             var newBody;
-            DEBUG.log("fusing FOLDR of " + (this.inspect()));
+            DEBUG.log("> fusing FOLDR of " + (this.inspect()));
             newBody = body.subst(arg, mapBody).subst(ixName, Core.variable(innerIdxArg));
             return Core.foldList(innerList, out, innerArg, accum, innerIdxArg, newBody);
           },
@@ -3453,15 +3465,15 @@ Gibbon.optimize = (function() {
       len: function(list) {
         return recurse(list).cases({
           list: function(elements) {
-            DEBUG.log("optimizing out len from " + (this.inspect()));
+            DEBUG.log("> optimizing out len from " + (this.inspect()));
             return Core.constant(elements.length);
           },
           mapList: function(list) {
-            DEBUG.log("optimizing MAP out of len");
+            DEBUG.log("> optimizing MAP out of len");
             return recurse(list.len());
           },
           zipLists: function(l, r) {
-            DEBUG.log("optimizing ZIP out of len");
+            DEBUG.log("> optimizing ZIP out of len");
             return recurse(l.len());
           },
           other: function() {
@@ -3508,12 +3520,12 @@ Gibbon.optimize = (function() {
           if (checkConst(left, function(x) {
             return !isFinite(x);
           })) {
-            DEBUG.log("reducing comparison with infinite values");
+            DEBUG.log("> reducing comparison with infinite values");
             right = Core.constant(0);
           } else if (checkConst(right, function(x) {
             return !isFinite(x);
           })) {
-            DEBUG.log("reducing comparison with infinite values");
+            DEBUG.log("> reducing comparison with infinite values");
             left = Core.constant(0);
           }
         } else {
@@ -3524,24 +3536,24 @@ Gibbon.optimize = (function() {
           };
           identFold = checkIdent('*', right, 1, left) || checkIdent('*', left, 1, right) || checkIdent('*', right, 0, Core.constant(0)) || checkIdent('*', left, 0, Core.constant(0)) || checkIdent('+', left, 0, right) || checkIdent('+', right, 0, left) || checkIdent('/', right, 1, left);
           if (identFold) {
-            DEBUG.log("identity-folding " + (this.inspect()) + " to " + (identFold.inspect()));
+            DEBUG.log("> identity-folding " + (this.inspect()) + " to " + (identFold.inspect()));
             return identFold;
           }
         }
         if (!(left._tag === 'constant' && right._tag === 'constant')) {
           return Core.op2(op, left, right);
         }
-        DEBUG.log("constant-folding " + (left.op2(op, right).inspect()));
+        DEBUG.log("> constant-folding " + (left.op2(op, right).inspect()));
         _ref10 = [left.value, right.value], l = _ref10[0], r = _ref10[1];
         return Core.constant(applyOp2(op, left.value, right.value));
       },
       rescue: function(expr, default_) {
         expr = recurse(expr);
         if (expr.alwaysSucceeds()) {
-          DEBUG.log("eliminating dead default branch of " + (this.inspect()));
+          DEBUG.log("> eliminating dead default branch of " + (this.inspect()));
           return expr;
         } else if (expr.alwaysFails()) {
-          DEBUG.log("eliminating dead main branch of " + (this.inspect()));
+          DEBUG.log("> eliminating dead main branch of " + (this.inspect()));
           return recurse(default_);
         } else {
           return Core.rescue(expr, recurse(default_));
@@ -3604,7 +3616,7 @@ Gibbon.optimize = (function() {
       };
 
       SubstTree.prototype.substituteWith = function(names, bindableExprs) {
-        var bindable, core, hash, i, _i, _len;
+        var bindable, core, hash, i, _i, _len, _ref11;
         core = this.toCore();
         hash = core.hash();
         for (i = _i = 0, _len = bindableExprs.length; _i < _len; i = ++_i) {
@@ -3613,6 +3625,9 @@ Gibbon.optimize = (function() {
             return SubstTree.unit(Core.variable(names[i]));
           }
         }
+        if ((_ref11 = this.expr._tag) === 'rescue' || _ref11 === 'squishList') {
+          return this;
+        }
         return this.map(function(x) {
           return x.substituteWith(names, bindableExprs);
         });
@@ -3636,29 +3651,44 @@ Gibbon.optimize = (function() {
             return SubstTree.unit(Core.squishList(SubstTree.unit(list.map(insertSubstitutions))));
           },
           other: function() {
-            var bindable, i, names, out, substituted, _, _i, _len;
-            substituted = expr.map(function(t) {
-              return t.simplify();
-            });
-            names = (function() {
-              var _i, _len, _results;
-              _results = [];
-              for (_i = 0, _len = bindableExprs.length; _i < _len; _i++) {
-                _ = bindableExprs[_i];
-                _results.push(nameGen('b'));
+            var bindable, i, names, out, _, _i, _len;
+            if (bindableExprs.length) {
+              names = (function() {
+                var _i, _len, _results;
+                _results = [];
+                for (_i = 0, _len = bindableExprs.length; _i < _len; _i++) {
+                  _ = bindableExprs[_i];
+                  _results.push(nameGen('b'));
+                }
+                return _results;
+              })();
+              DEBUG(function() {
+                var e, _bindableExprs, _expr, _names;
+                _names = names.join(', ');
+                _bindableExprs = ((function() {
+                  var _i, _len, _results;
+                  _results = [];
+                  for (_i = 0, _len = bindableExprs.length; _i < _len; _i++) {
+                    e = bindableExprs[_i];
+                    _results.push(e.inspect());
+                  }
+                  return _results;
+                })()).join(', ');
+                _expr = expr.inspect();
+                return DEBUG.log("> binding " + _names + " as " + _bindableExprs + " in " + _expr);
+              });
+              out = SubstTree.unit(expr).substituteWith(names, bindableExprs);
+              for (i = _i = 0, _len = bindableExprs.length; _i < _len; i = ++_i) {
+                bindable = bindableExprs[i];
+                out = SubstTree.unit(Core.bind(names[i], bindable, out));
               }
-              return _results;
-            })();
-            if (!bindableExprs.length) {
-              return SubstTree.unit(substituted);
-            }
-            out = SubstTree.unit(substituted).substituteWith(names, bindableExprs);
-            for (i = _i = 0, _len = bindableExprs.length; _i < _len; i = ++_i) {
-              bindable = bindableExprs[i];
-              out = SubstTree.unit(Core.bind(names[i], bindable, out));
+              DEBUG.log("==> " + (out.inspect()));
+            } else {
+              out = SubstTree.unit(expr);
             }
-            DEBUG.log("=> " + (out.inspect()));
-            return out;
+            return out.map(function(t) {
+              return t.simplify();
+            });
           }
         });
       };
@@ -3671,14 +3701,12 @@ Gibbon.optimize = (function() {
 
     })(Variant);
     makeCrumbs = function(trace) {
-      return trace.mapArray(function(e) {
-        return e.hash();
-      }).reverse();
+      return trace.toArray().reverse();
     };
     genSubstitutions = function(expr) {
       var occurrences, queue, recurse, substitutions;
       occurrences = new ObjHash;
-      substitutions = new Hash;
+      substitutions = new ObjHash;
       queue = [[expr, List.empty()]];
       while (queue.length) {
         (function(_arg) {
@@ -3710,6 +3738,24 @@ Gibbon.optimize = (function() {
         if (!(crumbs.length >= 2)) {
           return;
         }
+        DEBUG(function() {
+          var c, crumbList, _i, _len, _results;
+          DEBUG.log("> found duplicate " + (expr.inspect()) + " at");
+          _results = [];
+          for (_i = 0, _len = crumbs.length; _i < _len; _i++) {
+            crumbList = crumbs[_i];
+            _results.push(DEBUG.log(((function() {
+              var _j, _len1, _results1;
+              _results1 = [];
+              for (_j = 0, _len1 = crumbList.length; _j < _len1; _j++) {
+                c = crumbList[_j];
+                _results1.push(c.inspect());
+              }
+              return _results1;
+            })()).reverse().join(' -> ')));
+          }
+          return _results;
+        });
         insertionPoint = findLastCommon(crumbs);
         substitutions.cache(insertionPoint, function() {
           return [];
@@ -3718,7 +3764,7 @@ Gibbon.optimize = (function() {
       });
       return (recurse = function(expr) {
         var bindableExprs, e;
-        bindableExprs = substitutions.get(expr.hash());
+        bindableExprs = substitutions.get(expr);
         if (!bindableExprs) {
           return SubstTree.unit(expr.map(recurse));
         }
@@ -3741,7 +3787,7 @@ Gibbon.optimize = (function() {
         refCrumb = reference[i];
         for (_j = 0, _len1 = rest.length; _j < _len1; _j++) {
           testCrumbs = rest[_j];
-          if (refCrumb !== testCrumbs[i]) {
+          if (!refCrumb.equals(testCrumbs[i])) {
             return last;
           }
         }
@@ -3750,7 +3796,10 @@ Gibbon.optimize = (function() {
       return refCrumb;
     };
     insertSubstitutions = function(expr) {
-      return genSubstitutions(expr).simplify();
+      var substitutions;
+      substitutions = genSubstitutions(expr);
+      DEBUG.log("=> generated " + (substitutions.inspect()));
+      return substitutions.simplify();
     };
     return function(expr) {
       return insertSubstitutions(expr).toCore();

data/vendor/gibbon/{lib/gibbon.browser.js → gibbon.browser.js}

@@ -2755,6 +2755,18 @@ Gibbon.Core = Core = (function(_super) {
       squishList: function() {
         return false;
       },
+      foldList: function(list, out, arg, accumArg, idxArg, body) {
+        if (list.alwaysFails()) {
+          return true;
+        }
+        if (body.alwaysFails()) {
+          return true;
+        }
+        if (body.isStrictIn(Core.variable(accumArg)) && out.alwaysFails()) {
+          return true;
+        }
+        return false;
+      },
       other: function() {
         var subtree, _i, _len, _ref10;
         _ref10 = this.subtrees();
@@ -3118,7 +3130,7 @@ Gibbon.Core = Core = (function(_super) {
           return "(LET " + (r(val)) + " " + (r(expr)) + ")";
         },
         variable: function(name) {
-          return name;
+          return "v:" + name;
         },
         delist: function(e, i) {
           return "([" + (r(i)) + "] " + (r(e)) + ")";
@@ -3572,7 +3584,7 @@ Gibbon.optimize = (function() {
       };
 
       SubstTree.prototype.substituteWith = function(names, bindableExprs) {
-        var bindable, core, hash, i, _i, _len;
+        var bindable, core, hash, i, _i, _len, _ref11;
         core = this.toCore();
         hash = core.hash();
         for (i = _i = 0, _len = bindableExprs.length; _i < _len; i = ++_i) {
@@ -3581,6 +3593,9 @@ Gibbon.optimize = (function() {
             return SubstTree.unit(Core.variable(names[i]));
           }
         }
+        if ((_ref11 = this.expr._tag) === 'rescue' || _ref11 === 'squishList') {
+          return this;
+        }
         return this.map(function(x) {
           return x.substituteWith(names, bindableExprs);
         });
@@ -3604,29 +3619,30 @@ Gibbon.optimize = (function() {
             return SubstTree.unit(Core.squishList(SubstTree.unit(list.map(insertSubstitutions))));
           },
           other: function() {
-            var bindable, i, names, out, substituted, _, _i, _len;
-            substituted = expr.map(function(t) {
-              return t.simplify();
-            });
-            names = (function() {
-              var _i, _len, _results;
-              _results = [];
-              for (_i = 0, _len = bindableExprs.length; _i < _len; _i++) {
-                _ = bindableExprs[_i];
-                _results.push(nameGen('b'));
+            var bindable, i, names, out, _, _i, _len;
+            if (bindableExprs.length) {
+              names = (function() {
+                var _i, _len, _results;
+                _results = [];
+                for (_i = 0, _len = bindableExprs.length; _i < _len; _i++) {
+                  _ = bindableExprs[_i];
+                  _results.push(nameGen('b'));
+                }
+                return _results;
+              })();
+              
+              out = SubstTree.unit(expr).substituteWith(names, bindableExprs);
+              for (i = _i = 0, _len = bindableExprs.length; _i < _len; i = ++_i) {
+                bindable = bindableExprs[i];
+                out = SubstTree.unit(Core.bind(names[i], bindable, out));
               }
-              return _results;
-            })();
-            if (!bindableExprs.length) {
-              return SubstTree.unit(substituted);
-            }
-            out = SubstTree.unit(substituted).substituteWith(names, bindableExprs);
-            for (i = _i = 0, _len = bindableExprs.length; _i < _len; i = ++_i) {
-              bindable = bindableExprs[i];
-              out = SubstTree.unit(Core.bind(names[i], bindable, out));
+              
+            } else {
+              out = SubstTree.unit(expr);
             }
-            
-            return out;
+            return out.map(function(t) {
+              return t.simplify();
+            });
           }
         });
       };
@@ -3639,14 +3655,12 @@ Gibbon.optimize = (function() {
 
     })(Variant);
     makeCrumbs = function(trace) {
-      return trace.mapArray(function(e) {
-        return e.hash();
-      }).reverse();
+      return trace.toArray().reverse();
     };
     genSubstitutions = function(expr) {
       var occurrences, queue, recurse, substitutions;
       occurrences = new ObjHash;
-      substitutions = new Hash;
+      substitutions = new ObjHash;
       queue = [[expr, List.empty()]];
       while (queue.length) {
         (function(_arg) {
@@ -3678,6 +3692,7 @@ Gibbon.optimize = (function() {
         if (!(crumbs.length >= 2)) {
           return;
         }
+        
         insertionPoint = findLastCommon(crumbs);
         substitutions.cache(insertionPoint, function() {
           return [];
@@ -3686,7 +3701,7 @@ Gibbon.optimize = (function() {
       });
       return (recurse = function(expr) {
         var bindableExprs, e;
-        bindableExprs = substitutions.get(expr.hash());
+        bindableExprs = substitutions.get(expr);
         if (!bindableExprs) {
           return SubstTree.unit(expr.map(recurse));
         }
@@ -3709,7 +3724,7 @@ Gibbon.optimize = (function() {
         refCrumb = reference[i];
         for (_j = 0, _len1 = rest.length; _j < _len1; _j++) {
           testCrumbs = rest[_j];
-          if (refCrumb !== testCrumbs[i]) {
+          if (!refCrumb.equals(testCrumbs[i])) {
             return last;
           }
         }
@@ -3718,7 +3733,10 @@ Gibbon.optimize = (function() {
       return refCrumb;
     };
     insertSubstitutions = function(expr) {
-      return genSubstitutions(expr).simplify();
+      var substitutions;
+      substitutions = genSubstitutions(expr);
+      
+      return substitutions.simplify();
     };
     return function(expr) {
       return insertSubstitutions(expr).toCore();

data/vendor/gibbon/package.json

@@ -1,6 +1,6 @@
 {
   "name": "gibbon",
-  "version": "0.0.1",
+  "version": "0.11.0",
   "description": "A data language",
   "keywords": ["language"],
   "author": "Jay Adkisson <jjmadkisson at gmail dot com>",

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: goodguide-gibbon
 version: !ruby/object:Gem::Version
-  version: 0.10.3
+  version: 0.11.0
 platform: ruby
 authors:
 - Jay Adkisson
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-04-22 00:00:00.000000000 Z
+date: 2014-04-24 00:00:00.000000000 Z
 dependencies: []
 description: Run and analyze gibbon code from ruby or a browser (via a ruby app).
 email:
@@ -23,8 +23,8 @@ files:
 - goodguide-gibbon.gemspec
 - lib/goodguide/gibbon.rb
 - lib/goodguide/gibbon/version.rb
-- vendor/gibbon/lib/gibbon.browser.dev.js
-- vendor/gibbon/lib/gibbon.browser.js
+- vendor/gibbon/gibbon.browser.dev.js
+- vendor/gibbon/gibbon.browser.js
 - vendor/gibbon/package.json
 homepage: http://github.com/GoodGuide/goodguide-gibbon
 licenses: []
@@ -45,7 +45,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: goodguide-gibbon
-rubygems_version: 2.2.0
+rubygems_version: 2.2.2
 signing_key: 
 specification_version: 4
 summary: Ruby bindings for the gibbon data language