jass 0.9.1 → 0.9.3

data/vendor/node_modules/acorn/dist/walk.es.js

@@ -16,11 +16,11 @@
 // walker, and state can be used to give this walked an initial
 // state.
 
-function simple(node, visitors, base, state, override) {
-  if (!base) { base = exports.base
+function simple(node, visitors, baseVisitor, state, override) {
+  if (!baseVisitor) { baseVisitor = base
   ; }(function c(node, st, override) {
     var type = override || node.type, found = visitors[type];
-    base[type](node, st, c);
+    baseVisitor[type](node, st, c);
     if (found) { found(node, st); }
   })(node, state, override);
 }
@@ -28,13 +28,14 @@ function simple(node, visitors, base, state, override) {
 // An ancestor walk keeps an array of ancestor nodes (including the
 // current node) and passes them to the callback as third parameter
 // (and also as state parameter when no other state is present).
-function ancestor(node, visitors, base, state) {
-  if (!base) { base = exports.base; }
-  var ancestors = [];(function c(node, st, override) {
+function ancestor(node, visitors, baseVisitor, state) {
+  var ancestors = [];
+  if (!baseVisitor) { baseVisitor = base
+  ; }(function c(node, st, override) {
     var type = override || node.type, found = visitors[type];
-    var isNew = node != ancestors[ancestors.length - 1];
+    var isNew = node !== ancestors[ancestors.length - 1];
     if (isNew) { ancestors.push(node); }
-    base[type](node, st, c);
+    baseVisitor[type](node, st, c);
     if (found) { found(node, st || ancestors, ancestors); }
     if (isNew) { ancestors.pop(); }
   })(node, state);
@@ -45,15 +46,15 @@ function ancestor(node, visitors, base, state) {
 // threaded through the walk, and can opt how and whether to walk
 // their child nodes (by calling their third argument on these
 // nodes).
-function recursive(node, state, funcs, base, override) {
-  var visitor = funcs ? exports.make(funcs, base) : base;(function c(node, st, override) {
+function recursive(node, state, funcs, baseVisitor, override) {
+  var visitor = funcs ? make(funcs, baseVisitor || undefined) : baseVisitor;(function c(node, st, override) {
     visitor[override || node.type](node, st, c);
   })(node, state, override);
 }
 
 function makeTest(test) {
-  if (typeof test == "string")
-    { return function (type) { return type == test; } }
+  if (typeof test === "string")
+    { return function (type) { return type === test; } }
   else if (!test)
     { return function () { return true; } }
   else
@@ -63,24 +64,24 @@ function makeTest(test) {
 var Found = function Found(node, state) { this.node = node; this.state = state; };
 
 // A full walk triggers the callback on each node
-function full(node, callback, base, state, override) {
-  if (!base) { base = exports.base
+function full(node, callback, baseVisitor, state, override) {
+  if (!baseVisitor) { baseVisitor = base
   ; }(function c(node, st, override) {
     var type = override || node.type;
-    base[type](node, st, c);
+    baseVisitor[type](node, st, c);
     if (!override) { callback(node, st, type); }
   })(node, state, override);
 }
 
 // An fullAncestor walk is like an ancestor walk, but triggers
 // the callback on each node
-function fullAncestor(node, callback, base, state) {
-  if (!base) { base = exports.base; }
+function fullAncestor(node, callback, baseVisitor, state) {
+  if (!baseVisitor) { baseVisitor = base; }
   var ancestors = [];(function c(node, st, override) {
     var type = override || node.type;
-    var isNew = node != ancestors[ancestors.length - 1];
+    var isNew = node !== ancestors[ancestors.length - 1];
     if (isNew) { ancestors.push(node); }
-    base[type](node, st, c);
+    baseVisitor[type](node, st, c);
     if (!override) { callback(node, st || ancestors, ancestors, type); }
     if (isNew) { ancestors.pop(); }
   })(node, state);
@@ -89,17 +90,17 @@ function fullAncestor(node, callback, base, state) {
 // Find a node with a given start, end, and type (all are optional,
 // null can be used as wildcard). Returns a {node, state} object, or
 // undefined when it doesn't find a matching node.
-function findNodeAt(node, start, end, test, base, state) {
+function findNodeAt(node, start, end, test, baseVisitor, state) {
+  if (!baseVisitor) { baseVisitor = base; }
   test = makeTest(test);
-  if (!base) { base = exports.base; }
   try {
     (function c(node, st, override) {
       var type = override || node.type;
       if ((start == null || node.start <= start) &&
           (end == null || node.end >= end))
-        { base[type](node, st, c); }
-      if ((start == null || node.start == start) &&
-          (end == null || node.end == end) &&
+        { baseVisitor[type](node, st, c); }
+      if ((start == null || node.start === start) &&
+          (end == null || node.end === end) &&
           test(type, node))
         { throw new Found(node, st) }
     })(node, state);
@@ -111,14 +112,14 @@ function findNodeAt(node, start, end, test, base, state) {
 
 // Find the innermost node of a given type that contains the given
 // position. Interface similar to findNodeAt.
-function findNodeAround(node, pos, test, base, state) {
+function findNodeAround(node, pos, test, baseVisitor, state) {
   test = makeTest(test);
-  if (!base) { base = exports.base; }
+  if (!baseVisitor) { baseVisitor = base; }
   try {
     (function c(node, st, override) {
       var type = override || node.type;
       if (node.start > pos || node.end < pos) { return }
-      base[type](node, st, c);
+      baseVisitor[type](node, st, c);
       if (test(type, node)) { throw new Found(node, st) }
     })(node, state);
   } catch (e) {
@@ -128,15 +129,15 @@ function findNodeAround(node, pos, test, base, state) {
 }
 
 // Find the outermost matching node after a given position.
-function findNodeAfter(node, pos, test, base, state) {
+function findNodeAfter(node, pos, test, baseVisitor, state) {
   test = makeTest(test);
-  if (!base) { base = exports.base; }
+  if (!baseVisitor) { baseVisitor = base; }
   try {
     (function c(node, st, override) {
       if (node.end < pos) { return }
       var type = override || node.type;
       if (node.start >= pos && test(type, node)) { throw new Found(node, st) }
-      base[type](node, st, c);
+      baseVisitor[type](node, st, c);
     })(node, state);
   } catch (e) {
     if (e instanceof Found) { return e }
@@ -145,15 +146,15 @@ function findNodeAfter(node, pos, test, base, state) {
 }
 
 // Find the outermost matching node before a given position.
-function findNodeBefore(node, pos, test, base, state) {
+function findNodeBefore(node, pos, test, baseVisitor, state) {
   test = makeTest(test);
-  if (!base) { base = exports.base; }
+  if (!baseVisitor) { baseVisitor = base; }
   var max;(function c(node, st, override) {
     if (node.start > pos) { return }
     var type = override || node.type;
     if (node.end <= pos && (!max || max.node.end < node.end) && test(type, node))
       { max = new Found(node, st); }
-    base[type](node, st, c);
+    baseVisitor[type](node, st, c);
   })(node, state);
   return max
 }
@@ -167,9 +168,8 @@ var create = Object.create || function(proto) {
 
 // Used to create a custom walker. Will fill in all missing node
 // type properties with the defaults.
-function make(funcs, base) {
-  if (!base) { base = exports.base; }
-  var visitor = create(base);
+function make(funcs, baseVisitor) {
+  var visitor = create(baseVisitor || base);
   for (var type in funcs) { visitor[type] = funcs[type]; }
   return visitor
 }
@@ -238,7 +238,7 @@ base.TryStatement = function (node, st, c) {
   if (node.finalizer) { c(node.finalizer, st, "Statement"); }
 };
 base.CatchClause = function (node, st, c) {
-  c(node.param, st, "Pattern");
+  if (node.param) { c(node.param, st, "Pattern"); }
   c(node.body, st, "ScopeBody");
 };
 base.WhileStatement = base.DoWhileStatement = function (node, st, c) {
@@ -257,7 +257,7 @@ base.ForInStatement = base.ForOfStatement = function (node, st, c) {
   c(node.body, st, "Statement");
 };
 base.ForInit = function (node, st, c) {
-  if (node.type == "VariableDeclaration") { c(node, st); }
+  if (node.type === "VariableDeclaration") { c(node, st); }
   else { c(node, st, "Expression"); }
 };
 base.DebuggerStatement = ignore;
@@ -292,9 +292,9 @@ base.ScopeBody = function (node, st, c) { return c(node, st, "Statement"); };
 base.ScopeExpression = function (node, st, c) { return c(node, st, "Expression"); };
 
 base.Pattern = function (node, st, c) {
-  if (node.type == "Identifier")
+  if (node.type === "Identifier")
     { c(node, st, "VariablePattern"); }
-  else if (node.type == "MemberExpression")
+  else if (node.type === "MemberExpression")
     { c(node, st, "MemberPattern"); }
   else
     { c(node, st); }
@@ -313,8 +313,12 @@ base.ObjectPattern = function (node, st, c) {
   for (var i = 0, list = node.properties; i < list.length; i += 1) {
     var prop = list[i];
 
-    if (prop.computed) { c(prop.key, st, "Expression"); }
-    c(prop.value, st, "Pattern");
+    if (prop.type === "Property") {
+      if (prop.computed) { c(prop.key, st, "Expression"); }
+      c(prop.value, st, "Pattern");
+    } else if (prop.type === "RestElement") {
+      c(prop.argument, st, "Pattern");
+    }
   }
 };
 
@@ -376,7 +380,7 @@ base.MemberExpression = function (node, st, c) {
 };
 base.ExportNamedDeclaration = base.ExportDefaultDeclaration = function (node, st, c) {
   if (node.declaration)
-    { c(node.declaration, st, node.type == "ExportNamedDeclaration" || node.declaration.id ? "Statement" : "Expression"); }
+    { c(node.declaration, st, node.type === "ExportNamedDeclaration" || node.declaration.id ? "Statement" : "Expression"); }
   if (node.source) { c(node.source, st, "Expression"); }
 };
 base.ExportAllDeclaration = function (node, st, c) {

data/vendor/node_modules/acorn/dist/walk.js

@@ -22,11 +22,11 @@
 // walker, and state can be used to give this walked an initial
 // state.
 
-function simple(node, visitors, base, state, override) {
-  if (!base) { base = exports.base
+function simple(node, visitors, baseVisitor, state, override) {
+  if (!baseVisitor) { baseVisitor = base
   ; }(function c(node, st, override) {
     var type = override || node.type, found = visitors[type];
-    base[type](node, st, c);
+    baseVisitor[type](node, st, c);
     if (found) { found(node, st); }
   })(node, state, override);
 }
@@ -34,13 +34,14 @@ function simple(node, visitors, base, state, override) {
 // An ancestor walk keeps an array of ancestor nodes (including the
 // current node) and passes them to the callback as third parameter
 // (and also as state parameter when no other state is present).
-function ancestor(node, visitors, base, state) {
-  if (!base) { base = exports.base; }
-  var ancestors = [];(function c(node, st, override) {
+function ancestor(node, visitors, baseVisitor, state) {
+  var ancestors = [];
+  if (!baseVisitor) { baseVisitor = base
+  ; }(function c(node, st, override) {
     var type = override || node.type, found = visitors[type];
-    var isNew = node != ancestors[ancestors.length - 1];
+    var isNew = node !== ancestors[ancestors.length - 1];
     if (isNew) { ancestors.push(node); }
-    base[type](node, st, c);
+    baseVisitor[type](node, st, c);
     if (found) { found(node, st || ancestors, ancestors); }
     if (isNew) { ancestors.pop(); }
   })(node, state);
@@ -51,15 +52,15 @@ function ancestor(node, visitors, base, state) {
 // threaded through the walk, and can opt how and whether to walk
 // their child nodes (by calling their third argument on these
 // nodes).
-function recursive(node, state, funcs, base, override) {
-  var visitor = funcs ? exports.make(funcs, base) : base;(function c(node, st, override) {
+function recursive(node, state, funcs, baseVisitor, override) {
+  var visitor = funcs ? make(funcs, baseVisitor || undefined) : baseVisitor;(function c(node, st, override) {
     visitor[override || node.type](node, st, c);
   })(node, state, override);
 }
 
 function makeTest(test) {
-  if (typeof test == "string")
-    { return function (type) { return type == test; } }
+  if (typeof test === "string")
+    { return function (type) { return type === test; } }
   else if (!test)
     { return function () { return true; } }
   else
@@ -69,24 +70,24 @@ function makeTest(test) {
 var Found = function Found(node, state) { this.node = node; this.state = state; };
 
 // A full walk triggers the callback on each node
-function full(node, callback, base, state, override) {
-  if (!base) { base = exports.base
+function full(node, callback, baseVisitor, state, override) {
+  if (!baseVisitor) { baseVisitor = base
   ; }(function c(node, st, override) {
     var type = override || node.type;
-    base[type](node, st, c);
+    baseVisitor[type](node, st, c);
     if (!override) { callback(node, st, type); }
   })(node, state, override);
 }
 
 // An fullAncestor walk is like an ancestor walk, but triggers
 // the callback on each node
-function fullAncestor(node, callback, base, state) {
-  if (!base) { base = exports.base; }
+function fullAncestor(node, callback, baseVisitor, state) {
+  if (!baseVisitor) { baseVisitor = base; }
   var ancestors = [];(function c(node, st, override) {
     var type = override || node.type;
-    var isNew = node != ancestors[ancestors.length - 1];
+    var isNew = node !== ancestors[ancestors.length - 1];
     if (isNew) { ancestors.push(node); }
-    base[type](node, st, c);
+    baseVisitor[type](node, st, c);
     if (!override) { callback(node, st || ancestors, ancestors, type); }
     if (isNew) { ancestors.pop(); }
   })(node, state);
@@ -95,17 +96,17 @@ function fullAncestor(node, callback, base, state) {
 // Find a node with a given start, end, and type (all are optional,
 // null can be used as wildcard). Returns a {node, state} object, or
 // undefined when it doesn't find a matching node.
-function findNodeAt(node, start, end, test, base, state) {
+function findNodeAt(node, start, end, test, baseVisitor, state) {
+  if (!baseVisitor) { baseVisitor = base; }
   test = makeTest(test);
-  if (!base) { base = exports.base; }
   try {
     (function c(node, st, override) {
       var type = override || node.type;
       if ((start == null || node.start <= start) &&
           (end == null || node.end >= end))
-        { base[type](node, st, c); }
-      if ((start == null || node.start == start) &&
-          (end == null || node.end == end) &&
+        { baseVisitor[type](node, st, c); }
+      if ((start == null || node.start === start) &&
+          (end == null || node.end === end) &&
           test(type, node))
         { throw new Found(node, st) }
     })(node, state);
@@ -117,14 +118,14 @@ function findNodeAt(node, start, end, test, base, state) {
 
 // Find the innermost node of a given type that contains the given
 // position. Interface similar to findNodeAt.
-function findNodeAround(node, pos, test, base, state) {
+function findNodeAround(node, pos, test, baseVisitor, state) {
   test = makeTest(test);
-  if (!base) { base = exports.base; }
+  if (!baseVisitor) { baseVisitor = base; }
   try {
     (function c(node, st, override) {
       var type = override || node.type;
       if (node.start > pos || node.end < pos) { return }
-      base[type](node, st, c);
+      baseVisitor[type](node, st, c);
       if (test(type, node)) { throw new Found(node, st) }
     })(node, state);
   } catch (e) {
@@ -134,15 +135,15 @@ function findNodeAround(node, pos, test, base, state) {
 }
 
 // Find the outermost matching node after a given position.
-function findNodeAfter(node, pos, test, base, state) {
+function findNodeAfter(node, pos, test, baseVisitor, state) {
   test = makeTest(test);
-  if (!base) { base = exports.base; }
+  if (!baseVisitor) { baseVisitor = base; }
   try {
     (function c(node, st, override) {
       if (node.end < pos) { return }
       var type = override || node.type;
       if (node.start >= pos && test(type, node)) { throw new Found(node, st) }
-      base[type](node, st, c);
+      baseVisitor[type](node, st, c);
     })(node, state);
   } catch (e) {
     if (e instanceof Found) { return e }
@@ -151,15 +152,15 @@ function findNodeAfter(node, pos, test, base, state) {
 }
 
 // Find the outermost matching node before a given position.
-function findNodeBefore(node, pos, test, base, state) {
+function findNodeBefore(node, pos, test, baseVisitor, state) {
   test = makeTest(test);
-  if (!base) { base = exports.base; }
+  if (!baseVisitor) { baseVisitor = base; }
   var max;(function c(node, st, override) {
     if (node.start > pos) { return }
     var type = override || node.type;
     if (node.end <= pos && (!max || max.node.end < node.end) && test(type, node))
       { max = new Found(node, st); }
-    base[type](node, st, c);
+    baseVisitor[type](node, st, c);
   })(node, state);
   return max
 }
@@ -173,9 +174,8 @@ var create = Object.create || function(proto) {
 
 // Used to create a custom walker. Will fill in all missing node
 // type properties with the defaults.
-function make(funcs, base) {
-  if (!base) { base = exports.base; }
-  var visitor = create(base);
+function make(funcs, baseVisitor) {
+  var visitor = create(baseVisitor || base);
   for (var type in funcs) { visitor[type] = funcs[type]; }
   return visitor
 }
@@ -244,7 +244,7 @@ base.TryStatement = function (node, st, c) {
   if (node.finalizer) { c(node.finalizer, st, "Statement"); }
 };
 base.CatchClause = function (node, st, c) {
-  c(node.param, st, "Pattern");
+  if (node.param) { c(node.param, st, "Pattern"); }
   c(node.body, st, "ScopeBody");
 };
 base.WhileStatement = base.DoWhileStatement = function (node, st, c) {
@@ -263,7 +263,7 @@ base.ForInStatement = base.ForOfStatement = function (node, st, c) {
   c(node.body, st, "Statement");
 };
 base.ForInit = function (node, st, c) {
-  if (node.type == "VariableDeclaration") { c(node, st); }
+  if (node.type === "VariableDeclaration") { c(node, st); }
   else { c(node, st, "Expression"); }
 };
 base.DebuggerStatement = ignore;
@@ -298,9 +298,9 @@ base.ScopeBody = function (node, st, c) { return c(node, st, "Statement"); };
 base.ScopeExpression = function (node, st, c) { return c(node, st, "Expression"); };
 
 base.Pattern = function (node, st, c) {
-  if (node.type == "Identifier")
+  if (node.type === "Identifier")
     { c(node, st, "VariablePattern"); }
-  else if (node.type == "MemberExpression")
+  else if (node.type === "MemberExpression")
     { c(node, st, "MemberPattern"); }
   else
     { c(node, st); }
@@ -319,8 +319,12 @@ base.ObjectPattern = function (node, st, c) {
   for (var i = 0, list = node.properties; i < list.length; i += 1) {
     var prop = list[i];
 
-    if (prop.computed) { c(prop.key, st, "Expression"); }
-    c(prop.value, st, "Pattern");
+    if (prop.type === "Property") {
+      if (prop.computed) { c(prop.key, st, "Expression"); }
+      c(prop.value, st, "Pattern");
+    } else if (prop.type === "RestElement") {
+      c(prop.argument, st, "Pattern");
+    }
   }
 };
 
@@ -382,7 +386,7 @@ base.MemberExpression = function (node, st, c) {
 };
 base.ExportNamedDeclaration = base.ExportDefaultDeclaration = function (node, st, c) {
   if (node.declaration)
-    { c(node.declaration, st, node.type == "ExportNamedDeclaration" || node.declaration.id ? "Statement" : "Expression"); }
+    { c(node.declaration, st, node.type === "ExportNamedDeclaration" || node.declaration.id ? "Statement" : "Expression"); }
   if (node.source) { c(node.source, st, "Expression"); }
 };
 base.ExportAllDeclaration = function (node, st, c) {

data/vendor/node_modules/acorn/package.json

@@ -4,7 +4,7 @@
   "homepage": "https://github.com/acornjs/acorn",
   "main": "dist/acorn.js",
   "module": "dist/acorn.es.js",
-  "version": "5.5.3",
+  "version": "5.7.2",
   "engines": {
     "node": ">=0.4.0"
   },
@@ -18,6 +18,10 @@
       "name": "Ingvar Stepanyan",
       "email": "me@rreverser.com",
       "web": "http://rreverser.com/"
+    },
+    {
+      "name": "Adrian Heine",
+      "email": "http://adrianheine.de"
     }
   ],
   "repository": {
@@ -26,7 +30,7 @@
   },
   "license": "MIT",
   "scripts": {
-    "prepare": "npm test",
+    "prepare": "npm run build && node test/run.js && node test/lint.js",
     "test": "node test/run.js && node test/lint.js",
     "pretest": "npm run build:main && npm run build:loose",
     "test:test262": "node bin/run_test262.js",
@@ -49,8 +53,8 @@
     "eslint-plugin-standard": "^3.0.1",
     "rollup": "^0.45.0",
     "rollup-plugin-buble": "^0.16.0",
-    "test262": "git+https://github.com/tc39/test262.git#18c1e799a01cc976695983b61e225ce7959bdd91",
-    "test262-parser-runner": "^0.3.1",
-    "unicode-10.0.0": "^0.7.5"
+    "test262": "git+https://github.com/tc39/test262.git#3bfad28cc302fd4455badcfcbca7c5bb7ce41a72",
+    "test262-parser-runner": "^0.4.0",
+    "unicode-11.0.0": "^0.7.7"
   }
 }