[gnome-code-assistance] js: update deps
- From: Giovanni Campagna <gcampagna src gnome org>
- To: commits-list gnome org
- Cc:
- Subject: [gnome-code-assistance] js: update deps
- Date: Wed, 27 Apr 2016 18:02:23 +0000 (UTC)
commit 94359d7a805b724522501db5c83886e5911008c5
Author: Giovanni Campagna <gcampagn cs stanford edu>
Date: Tue Apr 26 14:08:18 2016 -0700
js: update deps
Which brings in support for es6
https://bugzilla.gnome.org/show_bug.cgi?id=765638
backends/js/deps/acorn.js | 4706 ++++++++----
backends/js/deps/jshint.js |18203 ++++++++++++++++++++++++++++++++++++--------
2 files changed, 18348 insertions(+), 4561 deletions(-)
---
diff --git a/backends/js/deps/acorn.js b/backends/js/deps/acorn.js
index bd08072..4c5cb51 100644
--- a/backends/js/deps/acorn.js
+++ b/backends/js/deps/acorn.js
@@ -1,17 +1,806 @@
+var acorn;
+(function(f){ acorn = f() })(function(){var define,module,exports;return (function e(t,n,r){function
s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return
i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var
l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return
s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var
o=0;o<r.length;o++)s(r[o]);return s})({1:[function(_dereq_,module,exports){
+// A recursive descent parser operates by defining functions for all
+// syntactic elements, and recursively calling those, each function
+// advancing the input stream and returning an AST node. Precedence
+// of constructs (for example, the fact that `!x[1]` means `!(x[1])`
+// instead of `(!x)[1]` is handled by the fact that the parser
+// function that parses unary prefix operators is called first, and
+// in turn calls the function that parses `[]` subscripts — that
+// way, it'll receive the node for `x[1]` already parsed, and wraps
+// *that* in the unary operator node.
+//
+// Acorn uses an [operator precedence parser][opp] to handle binary
+// operator precedence, because it is much more compact than using
+// the technique outlined above, which uses different, nesting
+// functions to specify precedence, for all of the ten binary
+// precedence levels that JavaScript defines.
+//
+// [opp]: http://en.wikipedia.org/wiki/Operator-precedence_parser
+
+"use strict";
+
+var _tokentype = _dereq_("./tokentype");
+
+var _state = _dereq_("./state");
+
+var pp = _state.Parser.prototype;
+
+// Check if property name clashes with already added.
+// Object/class getters and setters are not allowed to clash —
+// either with each other or with an init property — and in
+// strict mode, init properties are also not allowed to be repeated.
+
+pp.checkPropClash = function (prop, propHash) {
+ if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand)) return;
+ var key = prop.key;var name = undefined;
+ switch (key.type) {
+ case "Identifier":
+ name = key.name;break;
+ case "Literal":
+ name = String(key.value);break;
+ default:
+ return;
+ }
+ var kind = prop.kind;
+
+ if (this.options.ecmaVersion >= 6) {
+ if (name === "__proto__" && kind === "init") {
+ if (propHash.proto) this.raiseRecoverable(key.start, "Redefinition of __proto__ property");
+ propHash.proto = true;
+ }
+ return;
+ }
+ name = "$" + name;
+ var other = propHash[name];
+ if (other) {
+ var isGetSet = kind !== "init";
+ if ((this.strict || isGetSet) && other[kind] || !(isGetSet ^ other.init))
this.raiseRecoverable(key.start, "Redefinition of property");
+ } else {
+ other = propHash[name] = {
+ init: false,
+ get: false,
+ set: false
+ };
+ }
+ other[kind] = true;
+};
+
+// ### Expression parsing
+
+// These nest, from the most general expression type at the top to
+// 'atomic', nondivisible expression types at the bottom. Most of
+// the functions will simply let the function(s) below them parse,
+// and, *if* the syntactic construct they handle is present, wrap
+// the AST node that the inner parser gave them in another node.
+
+// Parse a full expression. The optional arguments are used to
+// forbid the `in` operator (in for loops initalization expressions)
+// and provide reference for storing '=' operator inside shorthand
+// property assignment in contexts where both object expression
+// and object pattern might appear (so it's possible to raise
+// delayed syntax error at correct position).
+
+pp.parseExpression = function (noIn, refDestructuringErrors) {
+ var startPos = this.start,
+ startLoc = this.startLoc;
+ var expr = this.parseMaybeAssign(noIn, refDestructuringErrors);
+ if (this.type === _tokentype.types.comma) {
+ var node = this.startNodeAt(startPos, startLoc);
+ node.expressions = [expr];
+ while (this.eat(_tokentype.types.comma)) node.expressions.push(this.parseMaybeAssign(noIn,
refDestructuringErrors));
+ return this.finishNode(node, "SequenceExpression");
+ }
+ return expr;
+};
+
+// Parse an assignment expression. This includes applications of
+// operators like `+=`.
+
+pp.parseMaybeAssign = function (noIn, refDestructuringErrors, afterLeftParse) {
+ if (this.inGenerator && this.isContextual("yield")) return this.parseYield();
+
+ var validateDestructuring = false;
+ if (!refDestructuringErrors) {
+ refDestructuringErrors = { shorthandAssign: 0, trailingComma: 0 };
+ validateDestructuring = true;
+ }
+ var startPos = this.start,
+ startLoc = this.startLoc;
+ if (this.type == _tokentype.types.parenL || this.type == _tokentype.types.name) this.potentialArrowAt =
this.start;
+ var left = this.parseMaybeConditional(noIn, refDestructuringErrors);
+ if (afterLeftParse) left = afterLeftParse.call(this, left, startPos, startLoc);
+ if (this.type.isAssign) {
+ if (validateDestructuring) this.checkPatternErrors(refDestructuringErrors, true);
+ var node = this.startNodeAt(startPos, startLoc);
+ node.operator = this.value;
+ node.left = this.type === _tokentype.types.eq ? this.toAssignable(left) : left;
+ refDestructuringErrors.shorthandAssign = 0; // reset because shorthand default was used correctly
+ this.checkLVal(left);
+ this.next();
+ node.right = this.parseMaybeAssign(noIn);
+ return this.finishNode(node, "AssignmentExpression");
+ } else {
+ if (validateDestructuring) this.checkExpressionErrors(refDestructuringErrors, true);
+ }
+ return left;
+};
+
+// Parse a ternary conditional (`?:`) operator.
+
+pp.parseMaybeConditional = function (noIn, refDestructuringErrors) {
+ var startPos = this.start,
+ startLoc = this.startLoc;
+ var expr = this.parseExprOps(noIn, refDestructuringErrors);
+ if (this.checkExpressionErrors(refDestructuringErrors)) return expr;
+ if (this.eat(_tokentype.types.question)) {
+ var node = this.startNodeAt(startPos, startLoc);
+ node.test = expr;
+ node.consequent = this.parseMaybeAssign();
+ this.expect(_tokentype.types.colon);
+ node.alternate = this.parseMaybeAssign(noIn);
+ return this.finishNode(node, "ConditionalExpression");
+ }
+ return expr;
+};
+
+// Start the precedence parser.
+
+pp.parseExprOps = function (noIn, refDestructuringErrors) {
+ var startPos = this.start,
+ startLoc = this.startLoc;
+ var expr = this.parseMaybeUnary(refDestructuringErrors, false);
+ if (this.checkExpressionErrors(refDestructuringErrors)) return expr;
+ return this.parseExprOp(expr, startPos, startLoc, -1, noIn);
+};
+
+// Parse binary operators with the operator precedence parsing
+// algorithm. `left` is the left-hand side of the operator.
+// `minPrec` provides context that allows the function to stop and
+// defer further parser to one of its callers when it encounters an
+// operator that has a lower precedence than the set it is parsing.
+
+pp.parseExprOp = function (left, leftStartPos, leftStartLoc, minPrec, noIn) {
+ var prec = this.type.binop;
+ if (prec != null && (!noIn || this.type !== _tokentype.types._in)) {
+ if (prec > minPrec) {
+ var logical = this.type === _tokentype.types.logicalOR || this.type === _tokentype.types.logicalAND;
+ var op = this.value;
+ this.next();
+ var startPos = this.start,
+ startLoc = this.startLoc;
+ var right = this.parseExprOp(this.parseMaybeUnary(null, false), startPos, startLoc, prec, noIn);
+ var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical);
+ return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, noIn);
+ }
+ }
+ return left;
+};
+
+pp.buildBinary = function (startPos, startLoc, left, right, op, logical) {
+ var node = this.startNodeAt(startPos, startLoc);
+ node.left = left;
+ node.operator = op;
+ node.right = right;
+ return this.finishNode(node, logical ? "LogicalExpression" : "BinaryExpression");
+};
+
+// Parse unary operators, both prefix and postfix.
+
+pp.parseMaybeUnary = function (refDestructuringErrors, sawUnary) {
+ var startPos = this.start,
+ startLoc = this.startLoc,
+ expr = undefined;
+ if (this.type.prefix) {
+ var node = this.startNode(),
+ update = this.type === _tokentype.types.incDec;
+ node.operator = this.value;
+ node.prefix = true;
+ this.next();
+ node.argument = this.parseMaybeUnary(null, true);
+ this.checkExpressionErrors(refDestructuringErrors, true);
+ if (update) this.checkLVal(node.argument);else if (this.strict && node.operator === "delete" &&
node.argument.type === "Identifier") this.raiseRecoverable(node.start, "Deleting local variable in strict
mode");else sawUnary = true;
+ expr = this.finishNode(node, update ? "UpdateExpression" : "UnaryExpression");
+ } else {
+ expr = this.parseExprSubscripts(refDestructuringErrors);
+ if (this.checkExpressionErrors(refDestructuringErrors)) return expr;
+ while (this.type.postfix && !this.canInsertSemicolon()) {
+ var node = this.startNodeAt(startPos, startLoc);
+ node.operator = this.value;
+ node.prefix = false;
+ node.argument = expr;
+ this.checkLVal(expr);
+ this.next();
+ expr = this.finishNode(node, "UpdateExpression");
+ }
+ }
+
+ if (!sawUnary && this.eat(_tokentype.types.starstar)) return this.buildBinary(startPos, startLoc, expr,
this.parseMaybeUnary(null, false), "**", false);else return expr;
+};
+
+// Parse call, dot, and `[]`-subscript expressions.
+
+pp.parseExprSubscripts = function (refDestructuringErrors) {
+ var startPos = this.start,
+ startLoc = this.startLoc;
+ var expr = this.parseExprAtom(refDestructuringErrors);
+ var skipArrowSubscripts = expr.type === "ArrowFunctionExpression" && this.input.slice(this.lastTokStart,
this.lastTokEnd) !== ")";
+ if (this.checkExpressionErrors(refDestructuringErrors) || skipArrowSubscripts) return expr;
+ return this.parseSubscripts(expr, startPos, startLoc);
+};
+
+pp.parseSubscripts = function (base, startPos, startLoc, noCalls) {
+ for (;;) {
+ if (this.eat(_tokentype.types.dot)) {
+ var node = this.startNodeAt(startPos, startLoc);
+ node.object = base;
+ node.property = this.parseIdent(true);
+ node.computed = false;
+ base = this.finishNode(node, "MemberExpression");
+ } else if (this.eat(_tokentype.types.bracketL)) {
+ var node = this.startNodeAt(startPos, startLoc);
+ node.object = base;
+ node.property = this.parseExpression();
+ node.computed = true;
+ this.expect(_tokentype.types.bracketR);
+ base = this.finishNode(node, "MemberExpression");
+ } else if (!noCalls && this.eat(_tokentype.types.parenL)) {
+ var node = this.startNodeAt(startPos, startLoc);
+ node.callee = base;
+ node.arguments = this.parseExprList(_tokentype.types.parenR, false);
+ base = this.finishNode(node, "CallExpression");
+ } else if (this.type === _tokentype.types.backQuote) {
+ var node = this.startNodeAt(startPos, startLoc);
+ node.tag = base;
+ node.quasi = this.parseTemplate();
+ base = this.finishNode(node, "TaggedTemplateExpression");
+ } else {
+ return base;
+ }
+ }
+};
+
+// Parse an atomic expression — either a single token that is an
+// expression, an expression started by a keyword like `function` or
+// `new`, or an expression wrapped in punctuation like `()`, `[]`,
+// or `{}`.
+
+pp.parseExprAtom = function (refDestructuringErrors) {
+ var node = undefined,
+ canBeArrow = this.potentialArrowAt == this.start;
+ switch (this.type) {
+ case _tokentype.types._super:
+ if (!this.inFunction) this.raise(this.start, "'super' outside of function or class");
+
+ case _tokentype.types._this:
+ var type = this.type === _tokentype.types._this ? "ThisExpression" : "Super";
+ node = this.startNode();
+ this.next();
+ return this.finishNode(node, type);
+
+ case _tokentype.types.name:
+ var startPos = this.start,
+ startLoc = this.startLoc;
+ var id = this.parseIdent(this.type !== _tokentype.types.name);
+ if (canBeArrow && !this.canInsertSemicolon() && this.eat(_tokentype.types.arrow)) return
this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id]);
+ return id;
+
+ case _tokentype.types.regexp:
+ var value = this.value;
+ node = this.parseLiteral(value.value);
+ node.regex = { pattern: value.pattern, flags: value.flags };
+ return node;
+
+ case _tokentype.types.num:case _tokentype.types.string:
+ return this.parseLiteral(this.value);
+
+ case _tokentype.types._null:case _tokentype.types._true:case _tokentype.types._false:
+ node = this.startNode();
+ node.value = this.type === _tokentype.types._null ? null : this.type === _tokentype.types._true;
+ node.raw = this.type.keyword;
+ this.next();
+ return this.finishNode(node, "Literal");
+
+ case _tokentype.types.parenL:
+ return this.parseParenAndDistinguishExpression(canBeArrow);
+
+ case _tokentype.types.bracketL:
+ node = this.startNode();
+ this.next();
+ node.elements = this.parseExprList(_tokentype.types.bracketR, true, true, refDestructuringErrors);
+ return this.finishNode(node, "ArrayExpression");
+
+ case _tokentype.types.braceL:
+ return this.parseObj(false, refDestructuringErrors);
+
+ case _tokentype.types._function:
+ node = this.startNode();
+ this.next();
+ return this.parseFunction(node, false);
+
+ case _tokentype.types._class:
+ return this.parseClass(this.startNode(), false);
+
+ case _tokentype.types._new:
+ return this.parseNew();
+
+ case _tokentype.types.backQuote:
+ return this.parseTemplate();
+
+ default:
+ this.unexpected();
+ }
+};
+
+pp.parseLiteral = function (value) {
+ var node = this.startNode();
+ node.value = value;
+ node.raw = this.input.slice(this.start, this.end);
+ this.next();
+ return this.finishNode(node, "Literal");
+};
+
+pp.parseParenExpression = function () {
+ this.expect(_tokentype.types.parenL);
+ var val = this.parseExpression();
+ this.expect(_tokentype.types.parenR);
+ return val;
+};
+
+pp.parseParenAndDistinguishExpression = function (canBeArrow) {
+ var startPos = this.start,
+ startLoc = this.startLoc,
+ val = undefined;
+ if (this.options.ecmaVersion >= 6) {
+ this.next();
+
+ var innerStartPos = this.start,
+ innerStartLoc = this.startLoc;
+ var exprList = [],
+ first = true;
+ var refDestructuringErrors = { shorthandAssign: 0, trailingComma: 0 },
+ spreadStart = undefined,
+ innerParenStart = undefined;
+ while (this.type !== _tokentype.types.parenR) {
+ first ? first = false : this.expect(_tokentype.types.comma);
+ if (this.type === _tokentype.types.ellipsis) {
+ spreadStart = this.start;
+ exprList.push(this.parseParenItem(this.parseRest()));
+ break;
+ } else {
+ if (this.type === _tokentype.types.parenL && !innerParenStart) {
+ innerParenStart = this.start;
+ }
+ exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem));
+ }
+ }
+ var innerEndPos = this.start,
+ innerEndLoc = this.startLoc;
+ this.expect(_tokentype.types.parenR);
+
+ if (canBeArrow && !this.canInsertSemicolon() && this.eat(_tokentype.types.arrow)) {
+ this.checkPatternErrors(refDestructuringErrors, true);
+ if (innerParenStart) this.unexpected(innerParenStart);
+ return this.parseParenArrowList(startPos, startLoc, exprList);
+ }
+
+ if (!exprList.length) this.unexpected(this.lastTokStart);
+ if (spreadStart) this.unexpected(spreadStart);
+ this.checkExpressionErrors(refDestructuringErrors, true);
+
+ if (exprList.length > 1) {
+ val = this.startNodeAt(innerStartPos, innerStartLoc);
+ val.expressions = exprList;
+ this.finishNodeAt(val, "SequenceExpression", innerEndPos, innerEndLoc);
+ } else {
+ val = exprList[0];
+ }
+ } else {
+ val = this.parseParenExpression();
+ }
+
+ if (this.options.preserveParens) {
+ var par = this.startNodeAt(startPos, startLoc);
+ par.expression = val;
+ return this.finishNode(par, "ParenthesizedExpression");
+ } else {
+ return val;
+ }
+};
+
+pp.parseParenItem = function (item) {
+ return item;
+};
+
+pp.parseParenArrowList = function (startPos, startLoc, exprList) {
+ return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList);
+};
+
+// New's precedence is slightly tricky. It must allow its argument to
+// be a `[]` or dot subscript expression, but not a call — at least,
+// not without wrapping it in parentheses. Thus, it uses the noCalls
+// argument to parseSubscripts to prevent it from consuming the
+// argument list.
+
+var empty = [];
+
+pp.parseNew = function () {
+ var node = this.startNode();
+ var meta = this.parseIdent(true);
+ if (this.options.ecmaVersion >= 6 && this.eat(_tokentype.types.dot)) {
+ node.meta = meta;
+ node.property = this.parseIdent(true);
+ if (node.property.name !== "target") this.raiseRecoverable(node.property.start, "The only valid meta
property for new is new.target");
+ if (!this.inFunction) this.raiseRecoverable(node.start, "new.target can only be used in functions");
+ return this.finishNode(node, "MetaProperty");
+ }
+ var startPos = this.start,
+ startLoc = this.startLoc;
+ node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true);
+ if (this.eat(_tokentype.types.parenL)) node.arguments = this.parseExprList(_tokentype.types.parenR,
false);else node.arguments = empty;
+ return this.finishNode(node, "NewExpression");
+};
+
+// Parse template expression.
+
+pp.parseTemplateElement = function () {
+ var elem = this.startNode();
+ elem.value = {
+ raw: this.input.slice(this.start, this.end).replace(/\r\n?/g, '\n'),
+ cooked: this.value
+ };
+ this.next();
+ elem.tail = this.type === _tokentype.types.backQuote;
+ return this.finishNode(elem, "TemplateElement");
+};
+
+pp.parseTemplate = function () {
+ var node = this.startNode();
+ this.next();
+ node.expressions = [];
+ var curElt = this.parseTemplateElement();
+ node.quasis = [curElt];
+ while (!curElt.tail) {
+ this.expect(_tokentype.types.dollarBraceL);
+ node.expressions.push(this.parseExpression());
+ this.expect(_tokentype.types.braceR);
+ node.quasis.push(curElt = this.parseTemplateElement());
+ }
+ this.next();
+ return this.finishNode(node, "TemplateLiteral");
+};
+
+// Parse an object literal or binding pattern.
+
+pp.parseObj = function (isPattern, refDestructuringErrors) {
+ var node = this.startNode(),
+ first = true,
+ propHash = {};
+ node.properties = [];
+ this.next();
+ while (!this.eat(_tokentype.types.braceR)) {
+ if (!first) {
+ this.expect(_tokentype.types.comma);
+ if (this.afterTrailingComma(_tokentype.types.braceR)) break;
+ } else first = false;
+
+ var prop = this.startNode(),
+ isGenerator = undefined,
+ startPos = undefined,
+ startLoc = undefined;
+ if (this.options.ecmaVersion >= 6) {
+ prop.method = false;
+ prop.shorthand = false;
+ if (isPattern || refDestructuringErrors) {
+ startPos = this.start;
+ startLoc = this.startLoc;
+ }
+ if (!isPattern) isGenerator = this.eat(_tokentype.types.star);
+ }
+ this.parsePropertyName(prop);
+ this.parsePropertyValue(prop, isPattern, isGenerator, startPos, startLoc, refDestructuringErrors);
+ this.checkPropClash(prop, propHash);
+ node.properties.push(this.finishNode(prop, "Property"));
+ }
+ return this.finishNode(node, isPattern ? "ObjectPattern" : "ObjectExpression");
+};
+
+pp.parsePropertyValue = function (prop, isPattern, isGenerator, startPos, startLoc, refDestructuringErrors) {
+ if (this.eat(_tokentype.types.colon)) {
+ prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) :
this.parseMaybeAssign(false, refDestructuringErrors);
+ prop.kind = "init";
+ } else if (this.options.ecmaVersion >= 6 && this.type === _tokentype.types.parenL) {
+ if (isPattern) this.unexpected();
+ prop.kind = "init";
+ prop.method = true;
+ prop.value = this.parseMethod(isGenerator);
+ } else if (this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === "Identifier" &&
(prop.key.name === "get" || prop.key.name === "set") && this.type != _tokentype.types.comma && this.type !=
_tokentype.types.braceR) {
+ if (isGenerator || isPattern) this.unexpected();
+ prop.kind = prop.key.name;
+ this.parsePropertyName(prop);
+ prop.value = this.parseMethod(false);
+ var paramCount = prop.kind === "get" ? 0 : 1;
+ if (prop.value.params.length !== paramCount) {
+ var start = prop.value.start;
+ if (prop.kind === "get") this.raiseRecoverable(start, "getter should have no params");else
this.raiseRecoverable(start, "setter should have exactly one param");
+ }
+ if (prop.kind === "set" && prop.value.params[0].type === "RestElement")
this.raiseRecoverable(prop.value.params[0].start, "Setter cannot use rest params");
+ } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === "Identifier") {
+ prop.kind = "init";
+ if (isPattern) {
+ if (this.keywords.test(prop.key.name) || (this.strict ? this.reservedWordsStrictBind :
this.reservedWords).test(prop.key.name) || this.inGenerator && prop.key.name == "yield")
this.raiseRecoverable(prop.key.start, "Binding " + prop.key.name);
+ prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);
+ } else if (this.type === _tokentype.types.eq && refDestructuringErrors) {
+ if (!refDestructuringErrors.shorthandAssign) refDestructuringErrors.shorthandAssign = this.start;
+ prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);
+ } else {
+ prop.value = prop.key;
+ }
+ prop.shorthand = true;
+ } else this.unexpected();
+};
+
+pp.parsePropertyName = function (prop) {
+ if (this.options.ecmaVersion >= 6) {
+ if (this.eat(_tokentype.types.bracketL)) {
+ prop.computed = true;
+ prop.key = this.parseMaybeAssign();
+ this.expect(_tokentype.types.bracketR);
+ return prop.key;
+ } else {
+ prop.computed = false;
+ }
+ }
+ return prop.key = this.type === _tokentype.types.num || this.type === _tokentype.types.string ?
this.parseExprAtom() : this.parseIdent(true);
+};
+
+// Initialize empty function node.
+
+pp.initFunction = function (node) {
+ node.id = null;
+ if (this.options.ecmaVersion >= 6) {
+ node.generator = false;
+ node.expression = false;
+ }
+};
+
+// Parse object or class method.
+
+pp.parseMethod = function (isGenerator) {
+ var node = this.startNode(),
+ oldInGen = this.inGenerator;
+ this.inGenerator = isGenerator;
+ this.initFunction(node);
+ this.expect(_tokentype.types.parenL);
+ node.params = this.parseBindingList(_tokentype.types.parenR, false, false);
+ if (this.options.ecmaVersion >= 6) node.generator = isGenerator;
+ this.parseFunctionBody(node, false);
+ this.inGenerator = oldInGen;
+ return this.finishNode(node, "FunctionExpression");
+};
+
+// Parse arrow function expression with given parameters.
+
+pp.parseArrowExpression = function (node, params) {
+ var oldInGen = this.inGenerator;
+ this.inGenerator = false;
+ this.initFunction(node);
+ node.params = this.toAssignableList(params, true);
+ this.parseFunctionBody(node, true);
+ this.inGenerator = oldInGen;
+ return this.finishNode(node, "ArrowFunctionExpression");
+};
+
+// Parse function body and check parameters.
+
+pp.parseFunctionBody = function (node, isArrowFunction) {
+ var isExpression = isArrowFunction && this.type !== _tokentype.types.braceL;
+
+ if (isExpression) {
+ node.body = this.parseMaybeAssign();
+ node.expression = true;
+ } else {
+ // Start a new scope with regard to labels and the `inFunction`
+ // flag (restore them to their old value afterwards).
+ var oldInFunc = this.inFunction,
+ oldLabels = this.labels;
+ this.inFunction = true;this.labels = [];
+ node.body = this.parseBlock(true);
+ node.expression = false;
+ this.inFunction = oldInFunc;this.labels = oldLabels;
+ }
+
+ // If this is a strict mode function, verify that argument names
+ // are not repeated, and it does not try to bind the words `eval`
+ // or `arguments`.
+ if (this.strict || !isExpression && node.body.body.length && this.isUseStrict(node.body.body[0])) {
+ var oldStrict = this.strict;
+ this.strict = true;
+ if (node.id) this.checkLVal(node.id, true);
+ this.checkParams(node);
+ this.strict = oldStrict;
+ } else if (isArrowFunction) {
+ this.checkParams(node);
+ }
+};
+
+// Checks function params for various disallowed patterns such as using "eval"
+// or "arguments" and duplicate parameters.
+
+pp.checkParams = function (node) {
+ var nameHash = {};
+ for (var i = 0; i < node.params.length; i++) {
+ this.checkLVal(node.params[i], true, nameHash);
+ }
+};
+
+// Parses a comma-separated list of expressions, and returns them as
+// an array. `close` is the token type that ends the list, and
+// `allowEmpty` can be turned on to allow subsequent commas with
+// nothing in between them to be parsed as `null` (which is needed
+// for array literals).
+
+pp.parseExprList = function (close, allowTrailingComma, allowEmpty, refDestructuringErrors) {
+ var elts = [],
+ first = true;
+ while (!this.eat(close)) {
+ if (!first) {
+ this.expect(_tokentype.types.comma);
+ if (allowTrailingComma && this.afterTrailingComma(close)) break;
+ } else first = false;
+
+ var elt = undefined;
+ if (allowEmpty && this.type === _tokentype.types.comma) elt = null;else if (this.type ===
_tokentype.types.ellipsis) {
+ elt = this.parseSpread(refDestructuringErrors);
+ if (this.type === _tokentype.types.comma && refDestructuringErrors &&
!refDestructuringErrors.trailingComma) {
+ refDestructuringErrors.trailingComma = this.lastTokStart;
+ }
+ } else elt = this.parseMaybeAssign(false, refDestructuringErrors);
+ elts.push(elt);
+ }
+ return elts;
+};
+
+// Parse the next token as an identifier. If `liberal` is true (used
+// when parsing properties), it will also convert keywords into
+// identifiers.
+
+pp.parseIdent = function (liberal) {
+ var node = this.startNode();
+ if (liberal && this.options.allowReserved == "never") liberal = false;
+ if (this.type === _tokentype.types.name) {
+ if (!liberal && (this.strict ? this.reservedWordsStrict : this.reservedWords).test(this.value) &&
(this.options.ecmaVersion >= 6 || this.input.slice(this.start, this.end).indexOf("\\") == -1))
this.raiseRecoverable(this.start, "The keyword '" + this.value + "' is reserved");
+ if (!liberal && this.inGenerator && this.value === "yield") this.raiseRecoverable(this.start, "Can not
use 'yield' as identifier inside a generator");
+ node.name = this.value;
+ } else if (liberal && this.type.keyword) {
+ node.name = this.type.keyword;
+ } else {
+ this.unexpected();
+ }
+ this.next();
+ return this.finishNode(node, "Identifier");
+};
+
+// Parses yield expression inside generator.
+
+pp.parseYield = function () {
+ var node = this.startNode();
+ this.next();
+ if (this.type == _tokentype.types.semi || this.canInsertSemicolon() || this.type != _tokentype.types.star
&& !this.type.startsExpr) {
+ node.delegate = false;
+ node.argument = null;
+ } else {
+ node.delegate = this.eat(_tokentype.types.star);
+ node.argument = this.parseMaybeAssign();
+ }
+ return this.finishNode(node, "YieldExpression");
+};
+
+},{"./state":10,"./tokentype":14}],2:[function(_dereq_,module,exports){
+// Reserved word lists for various dialects of the language
+
+"use strict";
+
+exports.__esModule = true;
+exports.isIdentifierStart = isIdentifierStart;
+exports.isIdentifierChar = isIdentifierChar;
+var reservedWords = {
+ 3: "abstract boolean byte char class double enum export extends final float goto implements import int
interface long native package private protected public short static super synchronized throws transient
volatile",
+ 5: "class enum extends super const export import",
+ 6: "enum",
+ 7: "enum",
+ strict: "implements interface let package private protected public static yield",
+ strictBind: "eval arguments"
+};
+
+exports.reservedWords = reservedWords;
+// And the keywords
+
+var ecma5AndLessKeywords = "break case catch continue debugger default do else finally for function if
return switch throw try var while with null true false instanceof typeof void delete new in this";
+
+var keywords = {
+ 5: ecma5AndLessKeywords,
+ 6: ecma5AndLessKeywords + " const class extends export import super"
+};
+
+exports.keywords = keywords;
+// ## Character categories
+
+// Big ugly regular expressions that match characters in the
+// whitespace, identifier, and identifier-start categories. These
+// are only applied when a character is found to actually have a
+// code point above 128.
+// Generated by `bin/generate-identifier-regex.js`.
+
+var nonASCIIidentifierStartChars =
"ªµºÀ-ÖØ-öø-ˁˆ-ˑˠ-ˤˬˮͰ-ʹͶͷͺ-ͽͿΆΈ-ΊΌΎ-ΡΣ-ϵϷ-ҁҊ-ԯԱ-Ֆՙա-ևא-תװ-ײؠ-يٮٯٱ-ۓەۥۦۮۯۺ-ۼۿܐܒ-ܯݍ-ޥޱߊ-ߪߴߵߺࠀ-ࠕࠚࠤࠨࡀ-ࡘࢠ-ࢴऄ-हऽॐक़-ॡॱ-ঀঅ-ঌএঐও-নপ-রলশ-হঽৎড়ঢ়য়-ৡৰৱਅ-ਊਏਐਓ-ਨਪ-ਰਲਲ਼ਵਸ਼ਸਹਖ਼-ੜਫ਼ੲ-ੴઅ-ઍએ-ઑઓ-નપ-રલળવ-હઽૐૠૡૹଅ-ଌଏଐଓ-ନପ-ରଲଳଵ-ହଽଡ଼ଢ଼ୟ-ୡୱஃஅ-ஊஎ-ஐஒ-கஙசஜஞடணதந-பம-ஹௐఅ-ఌఎ-ఐఒ-నప-హఽౘ-ౚౠౡಅ-ಌಎ-ಐಒ-ನಪ-ಳವ-ಹಽೞೠೡೱೲഅ-ഌഎ-ഐഒ-ഺഽൎൟ-ൡൺ-ൿඅ-ඖක-නඳ-රලව-ෆก-ะาำเ-ๆກຂຄງຈຊຍດ-ທນ-ຟມ-ຣລວສຫອ-ະາຳຽເ-ໄໆໜ-ໟༀཀ-ཇཉ-ཬྈ-ྌက-ဪဿၐ-ၕၚ-ၝၡၥၦၮ-ၰၵ-ႁႎႠ-ჅჇჍა-ჺჼ-ቈቊ-ቍቐ-ቖቘቚ-ቝበ-ኈኊ-ኍነ-ኰኲ-ኵኸ-ኾ�
��ዂ-ዅወ-ዖዘ-ጐጒ-ጕጘ-ፚᎀ-ᎏᎠ-Ᏽᏸ-ᏽᐁ-ᙬᙯ-ᙿᚁ-ᚚᚠ-ᛪᛮ-ᛸᜀ-ᜌᜎ-ᜑᜠ-ᜱᝀ-ᝑᝠ-ᝬᝮ-ᝰក-ឳៗៜᠠ-ᡷᢀ-ᢨᢪᢰ-ᣵᤀ-ᤞᥐ-ᥭᥰ-ᥴᦀ-ᦫᦰ-ᧉᨀ-ᨖᨠ-ᩔᪧᬅ-ᬳᭅ-ᭋᮃ-ᮠᮮᮯᮺ-ᯥᰀ-ᰣᱍ-ᱏᱚ-ᱽᳩ-ᳬᳮ-ᳱᳵᳶᴀ-ᶿḀ-ἕἘ-Ἕἠ-ὅὈ-Ὅὐ-ὗὙὛὝὟ-ώᾀ-ᾴᾶ-ᾼιῂ-ῄῆ-ῌῐ-ΐῖ-Ίῠ-Ῥῲ-ῴῶ-ῼⁱⁿₐ-ₜℂℇℊ-ℓℕ℘-ℝℤΩℨK-ℹℼ-ℿⅅ-ⅉⅎⅠ-ↈⰀ-Ⱞⰰ-ⱞⱠ-ⳤⳫ-ⳮⳲⳳⴀ-ⴥⴧⴭⴰ-ⵧⵯⶀ-ⶖⶠ-ⶦⶨ-ⶮⶰ-ⶶⶸ-ⶾⷀ-ⷆⷈ-ⷎⷐ-ⷖⷘ-ⷞ々-〇〡-〩〱-〵〸-〼ぁ-ゖ゛-ゟァ-ヺー-ヿㄅ-ㄭㄱ-ㆎㆠ-ㆺㇰ-ㇿ㐀-䶵一-鿕ꀀ-ꒌꓐ-ꓽꔀ-ꘌꘐ-ꘟꘪꘫꙀ-ꙮꙿ-ꚝꚠ-ꛯꜗ-ꜟꜢ-ꞈꞋ-ꞭꞰ-ꞷꟷ-ꠁꠃ-ꠅꠇ-ꠊꠌ-ꠢꡀ-ꡳꢂ-ꢳꣲ-ꣷꣻꣽꤊ-ꤥꤰ-ꥆꥠ-ꥼꦄ-ꦲꧏꧠ-ꧤꧦ-ꧯꧺ-ꧾꨀ-ꨨꩀ-ꩂꩄ-ꩋꩠ-ꩶꩺꩾ-ꪯꪱꪵꪶꪹ-ꪽꫀꫂꫛ-ꫝꫠ-ꫪꫲ-ꫴ�
��-ꬆꬉ-ꬎꬑ-ꬖꬠ-ꬦꬨ-ꬮꬰ-ꭚꭜ-ꭥꭰ-ꯢ가-힣ힰ-ퟆퟋ-ퟻ豈-舘並-龎ff-stﬓ-ﬗיִײַ-ﬨשׁ-זּטּ-לּמּנּסּףּפּצּ-ﮱﯓ-ﴽﵐ-ﶏﶒ-ﷇﷰ-ﷻﹰ-ﹴﹶ-ﻼＡ-Ｚａ-ｚｦ-ﾾￂ-ￇￊ-ￏￒ-ￗￚ-ￜ";
+var nonASCIIidentifierChars =
"·̀-ͯ·҃-֑҇-ׇֽֿׁׂׅׄؐ-ًؚ-٩ٰۖ-ۜ۟-۪ۤۧۨ-ۭ۰-۹ܑܰ-݊ަ-ް߀-߉߫-߳ࠖ-࠙ࠛ-ࠣࠥ-ࠧࠩ-࡙࠭-࡛ࣣ-ःऺ-़ा-ॏ॑-ॗॢॣ०-९ঁ-ঃ়া-ৄেৈো-্ৗৢৣ০-৯ਁ-ਃ਼ਾ-ੂੇੈੋ-੍ੑ੦-ੱੵઁ-ઃ઼ા-ૅે-ૉો-્ૢૣ૦-૯ଁ-ଃ଼ା-ୄେୈୋ-୍ୖୗୢୣ୦-୯ஂா-ூெ-ைொ-்ௗ௦-௯ఀ-ఃా-ౄె-ైొ-్ౕౖౢౣ౦-౯ಁ-ಃ಼ಾ-ೄೆ-ೈೊ-್ೕೖೢೣ೦-೯ഁ-ഃാ-ൄെ-ൈൊ-്ൗൢൣ൦-൯ංඃ්ා-ුූෘ-ෟ෦-෯ෲෳัิ-ฺ็-๎๐-๙ັິ-ູົຼ່-ໍ໐-໙༘༙༠-༩༹༵༷༾༿ཱ-྄྆྇ྍ-ྗྙ-ྼ࿆ါ-ှ၀-၉ၖ-ၙၞ-ၠၢ-ၤၧ-ၭၱ-ၴႂ-ႍႏ-ႝ፝-፟፩-፱ᜒ-᜔ᜲ-᜴ᝒᝓᝲᝳ឴-៓៝០-៩᠋-᠍᠐-᠙ᢩᤠ-ᤫᤰ-᤻᥆-᥏᧐-᧚ᨗ-ᨛᩕ-ᩞ᩠-᩿᩼-᪉᪐-᪙᪰-᪽ᬀ-ᬄ᬴-᭄᭐-᭙᭫-᭳ᮀ-ᮂᮡ-ᮭ᮰-᮹᯦-᯳ᰤ-᰷᱀-᱉��
�-᱙᳐-᳔᳒-᳨᳭ᳲ-᳴᳸᳹᷀-᷵᷼-᷿‿⁀⁔⃐-⃥⃜⃡-⃰⳯-⵿⳱ⷠ-〪ⷿ-゙゚〯꘠-꘩꙯ꙴ-꙽ꚞꚟ꛰꛱ꠂ꠆ꠋꠣ-ꠧꢀꢁꢴ-꣄꣐-꣙꣠-꣱꤀-꤉ꤦ-꤭ꥇ-꥓ꦀ-ꦃ꦳-꧀꧐-꧙ꧥ꧰-꧹ꨩ-ꨶꩃꩌꩍ꩐-꩙ꩻ-ꩽꪰꪲ-ꪴꪷꪸꪾ꪿꫁ꫫ-ꫯꫵ꫶ꯣ-ꯪ꯬꯭꯰-꯹ﬞ︀-️︠-︯︳︴﹍-﹏０-９＿";
+
+var nonASCIIidentifierStart = new RegExp("[" + nonASCIIidentifierStartChars + "]");
+var nonASCIIidentifier = new RegExp("[" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + "]");
+
+nonASCIIidentifierStartChars = nonASCIIidentifierChars = null;
+
+// These are a run-length and offset encoded representation of the
+// >0xffff code points that are a valid part of identifiers. The
+// offset starts at 0x10000, and each pair of numbers represents an
+// offset to the next range, and then a size of the range. They were
+// generated by bin/generate-identifier-regex.js
+var astralIdentifierStartCodes = [0, 11, 2, 25, 2, 18, 2, 1, 2, 14, 3, 13, 35, 122, 70, 52, 268, 28, 4, 48,
48, 31, 17, 26, 6, 37, 11, 29, 3, 35, 5, 7, 2, 4, 43, 157, 99, 39, 9, 51, 157, 310, 10, 21, 11, 7, 153, 5, 3,
0, 2, 43, 2, 1, 4, 0, 3, 22, 11, 22, 10, 30, 66, 18, 2, 1, 11, 21, 11, 25, 71, 55, 7, 1, 65, 0, 16, 3, 2, 2,
2, 26, 45, 28, 4, 28, 36, 7, 2, 27, 28, 53, 11, 21, 11, 18, 14, 17, 111, 72, 56, 50, 14, 50, 785, 52, 76, 44,
33, 24, 27, 35, 42, 34, 4, 0, 13, 47, 15, 3, 22, 0, 2, 0, 36, 17, 2, 24, 85, 6, 2, 0, 2, 3, 2, 14, 2, 9, 8,
46, 39, 7, 3, 1, 3, 21, 2, 6, 2, 1, 2, 4, 4, 0, 19, 0, 13, 4, 287, 47, 21, 1, 2, 0, 185, 46, 42, 3, 37, 47,
21, 0, 60, 42, 86, 25, 391, 63, 32, 0, 449, 56, 1288, 921, 103, 110, 18, 195, 2749, 1070, 4050, 582, 8634,
568, 8, 30, 114, 29, 19, 47, 17, 3, 32, 20, 6, 18, 881, 68, 12, 0, 67, 12, 16481, 1, 3071, 106, 6, 12, 4, 8,
8, 9, 5991, 84, 2, 70, 2, 1, 3, 0, 3, 1, 3, 3, 2, 11, 2, 0, 2, 6, 2, 64, 2, 3, 3, 7, 2, 6, 2, 27, 2, 3, 2, 4,
2, 0, 4, 6
, 2, 339, 3, 24, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 7, 4149, 196, 1340, 3, 2,
26, 2, 1, 2, 0, 3, 0, 2, 9, 2, 3, 2, 0, 2, 0, 7, 0, 5, 0, 2, 0, 2, 0, 2, 2, 2, 1, 2, 0, 3, 0, 2, 0, 2, 0, 2,
0, 2, 0, 2, 1, 2, 0, 3, 3, 2, 6, 2, 3, 2, 3, 2, 0, 2, 9, 2, 16, 6, 2, 2, 4, 2, 16, 4421, 42710, 42, 4148, 12,
221, 3, 5761, 10591, 541];
+var astralIdentifierCodes = [509, 0, 227, 0, 150, 4, 294, 9, 1368, 2, 2, 1, 6, 3, 41, 2, 5, 0, 166, 1, 1306,
2, 54, 14, 32, 9, 16, 3, 46, 10, 54, 9, 7, 2, 37, 13, 2, 9, 52, 0, 13, 2, 49, 13, 10, 2, 4, 9, 83, 11, 168,
11, 6, 9, 7, 3, 57, 0, 2, 6, 3, 1, 3, 2, 10, 0, 11, 1, 3, 6, 4, 4, 316, 19, 13, 9, 214, 6, 3, 8, 28, 1, 83,
16, 16, 9, 82, 12, 9, 9, 84, 14, 5, 9, 423, 9, 20855, 9, 135, 4, 60, 6, 26, 9, 1016, 45, 17, 3, 19723, 1,
5319, 4, 4, 5, 9, 7, 3, 6, 31, 3, 149, 2, 1418, 49, 513, 54, 5, 49, 9, 0, 15, 0, 23, 4, 2, 14, 3617, 6,
792618, 239];
+
+// This has a complexity linear to the value of the code. The
+// assumption is that looking up astral identifier characters is
+// rare.
+function isInAstralSet(code, set) {
+ var pos = 0x10000;
+ for (var i = 0; i < set.length; i += 2) {
+ pos += set[i];
+ if (pos > code) return false;
+ pos += set[i + 1];
+ if (pos >= code) return true;
+ }
+}
+
+// Test whether a given character code starts an identifier.
+
+function isIdentifierStart(code, astral) {
+ if (code < 65) return code === 36;
+ if (code < 91) return true;
+ if (code < 97) return code === 95;
+ if (code < 123) return true;
+ if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code));
+ if (astral === false) return false;
+ return isInAstralSet(code, astralIdentifierStartCodes);
+}
+
+// Test whether a given character is part of an identifier.
+
+function isIdentifierChar(code, astral) {
+ if (code < 48) return code === 36;
+ if (code < 58) return true;
+ if (code < 65) return false;
+ if (code < 91) return true;
+ if (code < 97) return code === 95;
+ if (code < 123) return true;
+ if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code));
+ if (astral === false) return false;
+ return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes);
+}
+
+},{}],3:[function(_dereq_,module,exports){
// Acorn is a tiny, fast JavaScript parser written in JavaScript.
//
-// Acorn was written by Marijn Haverbeke and released under an MIT
-// license. The Unicode regexps (for identifiers and whitespace) were
-// taken from [Esprima](http://esprima.org) by Ariya Hidayat.
+// Acorn was written by Marijn Haverbeke, Ingvar Stepanyan, and
+// various contributors and released under an MIT license.
//
// Git repositories for Acorn are available at
//
// http://marijnhaverbeke.nl/git/acorn
-// https://github.com/marijnh/acorn.git
+// https://github.com/ternjs/acorn.git
//
// Please use the [github bug tracker][ghbt] to report issues.
//
-// [ghbt]: https://github.com/marijnh/acorn/issues
+// [ghbt]: https://github.com/ternjs/acorn/issues
//
// This file defines the main parser interface. The library also comes
// with a [error-tolerant parser][dammit] and an
@@ -20,1780 +809,2553 @@
// [dammit]: acorn_loose.js
// [walk]: util/walk.js
-(function(root, mod) {
- if (typeof exports == "object" && typeof module == "object") return mod(exports); // CommonJS
- if (typeof define == "function" && define.amd) return define(["exports"], mod); // AMD
- mod(root.acorn || (root.acorn = {})); // Plain browser env
-})(this, function(exports) {
- "use strict";
+"use strict";
- exports.version = "0.4.1";
+exports.__esModule = true;
+exports.parse = parse;
+exports.parseExpressionAt = parseExpressionAt;
+exports.tokenizer = tokenizer;
- // The main exported interface (under `self.acorn` when in the
- // browser) is a `parse` function that takes a code string and
- // returns an abstract syntax tree as specified by [Mozilla parser
- // API][api], with the caveat that the SpiderMonkey-specific syntax
- // (`let`, `yield`, inline XML, etc) is not recognized.
- //
- // [api]: https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API
+var _state = _dereq_("./state");
- var options, input, inputLen, sourceFile;
+_dereq_("./parseutil");
- exports.parse = function(inpt, opts) {
- input = String(inpt); inputLen = input.length;
- setOptions(opts);
- initTokenState();
- return parseTopLevel(options.program);
- };
+_dereq_("./statement");
- // A second optional argument can be given to further configure
- // the parser process. These options are recognized:
-
- var defaultOptions = exports.defaultOptions = {
- // `ecmaVersion` indicates the ECMAScript version to parse. Must
- // be either 3 or 5. This
- // influences support for strict mode, the set of reserved words, and
- // support for getters and setter.
- ecmaVersion: 5,
- // Turn on `strictSemicolons` to prevent the parser from doing
- // automatic semicolon insertion.
- strictSemicolons: false,
- // When `allowTrailingCommas` is false, the parser will not allow
- // trailing commas in array and object literals.
- allowTrailingCommas: true,
- // By default, reserved words are not enforced. Enable
- // `forbidReserved` to enforce them.
- forbidReserved: false,
- // When `locations` is on, `loc` properties holding objects with
- // `start` and `end` properties in `{line, column}` form (with
- // line being 1-based and column 0-based) will be attached to the
- // nodes.
- locations: false,
- // A function can be passed as `onComment` option, which will
- // cause Acorn to call that function with `(block, text, start,
- // end)` parameters whenever a comment is skipped. `block` is a
- // boolean indicating whether this is a block (`/* */`) comment,
- // `text` is the content of the comment, and `start` and `end` are
- // character offsets that denote the start and end of the comment.
- // When the `locations` option is on, two more parameters are
- // passed, the full `{line, column}` locations of the start and
- // end of the comments.
- onComment: null,
- // Nodes have their start and end characters offsets recorded in
- // `start` and `end` properties (directly on the node, rather than
- // the `loc` object, which holds line/column data. To also add a
- // [semi-standardized][range] `range` property holding a `[start,
- // end]` array with the same numbers, set the `ranges` option to
- // `true`.
- //
- // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678
- ranges: false,
- // It is possible to parse multiple files into a single AST by
- // passing the tree produced by parsing the first file as
- // `program` option in subsequent parses. This will add the
- // toplevel forms of the parsed file to the `Program` (top) node
- // of an existing parse tree.
- program: null,
- // When `locations` is on, you can pass this to record the source
- // file in every node's `loc` object.
- sourceFile: null,
- // This value, if given, is stored in every node, whether
- // `locations` is on or off.
- directSourceFile: null
- };
+_dereq_("./lval");
- function setOptions(opts) {
- options = opts || {};
- for (var opt in defaultOptions) if (!Object.prototype.hasOwnProperty.call(options, opt))
- options[opt] = defaultOptions[opt];
- sourceFile = options.sourceFile || null;
- }
-
- // The `getLineInfo` function is mostly useful when the
- // `locations` option is off (for performance reasons) and you
- // want to find the line/column position for a given character
- // offset. `input` should be the code string that the offset refers
- // into.
-
- var getLineInfo = exports.getLineInfo = function(input, offset) {
- for (var line = 1, cur = 0;;) {
- lineBreak.lastIndex = cur;
- var match = lineBreak.exec(input);
- if (match && match.index < offset) {
- ++line;
- cur = match.index + match[0].length;
- } else break;
- }
- return {line: line, column: offset - cur};
- };
+_dereq_("./expression");
- // Acorn is organized as a tokenizer and a recursive-descent parser.
- // The `tokenize` export provides an interface to the tokenizer.
- // Because the tokenizer is optimized for being efficiently used by
- // the Acorn parser itself, this interface is somewhat crude and not
- // very modular. Performing another parse or call to `tokenize` will
- // reset the internal state, and invalidate existing tokenizers.
-
- exports.tokenize = function(inpt, opts) {
- input = String(inpt); inputLen = input.length;
- setOptions(opts);
- initTokenState();
-
- var t = {};
- function getToken(forceRegexp) {
- readToken(forceRegexp);
- t.start = tokStart; t.end = tokEnd;
- t.startLoc = tokStartLoc; t.endLoc = tokEndLoc;
- t.type = tokType; t.value = tokVal;
- return t;
- }
- getToken.jumpTo = function(pos, reAllowed) {
- tokPos = pos;
- if (options.locations) {
- tokCurLine = 1;
- tokLineStart = lineBreak.lastIndex = 0;
- var match;
- while ((match = lineBreak.exec(input)) && match.index < pos) {
- ++tokCurLine;
- tokLineStart = match.index + match[0].length;
- }
- }
- tokRegexpAllowed = reAllowed;
- skipSpace();
- };
- return getToken;
- };
+_dereq_("./location");
- // State is kept in (closure-)global variables. We already saw the
- // `options`, `input`, and `inputLen` variables above.
+exports.Parser = _state.Parser;
+exports.plugins = _state.plugins;
- // The current position of the tokenizer in the input.
+var _options = _dereq_("./options");
- var tokPos;
+exports.defaultOptions = _options.defaultOptions;
- // The start and end offsets of the current token.
+var _locutil = _dereq_("./locutil");
- var tokStart, tokEnd;
+exports.Position = _locutil.Position;
+exports.SourceLocation = _locutil.SourceLocation;
+exports.getLineInfo = _locutil.getLineInfo;
- // When `options.locations` is true, these hold objects
- // containing the tokens start and end line/column pairs.
+var _node = _dereq_("./node");
- var tokStartLoc, tokEndLoc;
+exports.Node = _node.Node;
- // The type and value of the current token. Token types are objects,
- // named by variables against which they can be compared, and
- // holding properties that describe them (indicating, for example,
- // the precedence of an infix operator, and the original name of a
- // keyword token). The kind of value that's held in `tokVal` depends
- // on the type of the token. For literals, it is the literal value,
- // for operators, the operator name, and so on.
+var _tokentype = _dereq_("./tokentype");
- var tokType, tokVal;
+exports.TokenType = _tokentype.TokenType;
+exports.tokTypes = _tokentype.types;
- // Interal state for the tokenizer. To distinguish between division
- // operators and regular expressions, it remembers whether the last
- // token was one that is allowed to be followed by an expression.
- // (If it is, a slash is probably a regexp, if it isn't it's a
- // division operator. See the `parseStatement` function for a
- // caveat.)
+var _tokencontext = _dereq_("./tokencontext");
- var tokRegexpAllowed;
+exports.TokContext = _tokencontext.TokContext;
+exports.tokContexts = _tokencontext.types;
- // When `options.locations` is true, these are used to keep
- // track of the current line, and know when a new line has been
- // entered.
+var _identifier = _dereq_("./identifier");
- var tokCurLine, tokLineStart;
+exports.isIdentifierChar = _identifier.isIdentifierChar;
+exports.isIdentifierStart = _identifier.isIdentifierStart;
- // These store the position of the previous token, which is useful
- // when finishing a node and assigning its `end` position.
+var _tokenize = _dereq_("./tokenize");
- var lastStart, lastEnd, lastEndLoc;
+exports.Token = _tokenize.Token;
- // This is the parser's state. `inFunction` is used to reject
- // `return` statements outside of functions, `labels` to verify that
- // `break` and `continue` have somewhere to jump to, and `strict`
- // indicates whether strict mode is on.
+var _whitespace = _dereq_("./whitespace");
- var inFunction, labels, strict;
+exports.isNewLine = _whitespace.isNewLine;
+exports.lineBreak = _whitespace.lineBreak;
+exports.lineBreakG = _whitespace.lineBreakG;
+var version = "3.1.0";
- // This function is used to raise exceptions on parse errors. It
- // takes an offset integer (into the current `input`) to indicate
- // the location of the error, attaches the position to the end
- // of the error message, and then raises a `SyntaxError` with that
- // message.
+exports.version = version;
+// The main exported interface (under `self.acorn` when in the
+// browser) is a `parse` function that takes a code string and
+// returns an abstract syntax tree as specified by [Mozilla parser
+// API][api].
+//
+// [api]: https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API
- function raise(pos, message) {
- var loc = getLineInfo(input, pos);
- message += " (" + loc.line + ":" + loc.column + ")";
- var err = new SyntaxError(message);
- err.pos = pos; err.loc = loc; err.raisedAt = tokPos;
- throw err;
- }
+function parse(input, options) {
+ return new _state.Parser(options, input).parse();
+}
- // Reused empty array added for node fields that are always empty.
+// This function tries to parse a single expression at a given
+// offset in a string. Useful for parsing mixed-language formats
+// that embed JavaScript expressions.
- var empty = [];
+function parseExpressionAt(input, pos, options) {
+ var p = new _state.Parser(options, input, pos);
+ p.nextToken();
+ return p.parseExpression();
+}
- // ## Token types
+// Acorn is organized as a tokenizer and a recursive-descent parser.
+// The `tokenizer` export provides an interface to the tokenizer.
- // The assignment of fine-grained, information-carrying type objects
- // allows the tokenizer to store the information it has about a
- // token in a way that is very cheap for the parser to look up.
+function tokenizer(input, options) {
+ return new _state.Parser(options, input);
+}
- // All token type variables start with an underscore, to make them
- // easy to recognize.
+},{"./expression":1,"./identifier":2,"./location":4,"./locutil":5,"./lval":6,"./node":7,"./options":8,"./parseutil":9,"./state":10,"./statement":11,"./tokencontext":12,"./tokenize":13,"./tokentype":14,"./whitespace":16}],4:[function(_dereq_,module,exports){
+"use strict";
- // These are the general types. The `type` property is only used to
- // make them recognizeable when debugging.
+var _state = _dereq_("./state");
- var _num = {type: "num"}, _regexp = {type: "regexp"}, _string = {type: "string"};
- var _name = {type: "name"}, _eof = {type: "eof"};
+var _locutil = _dereq_("./locutil");
- // Keyword tokens. The `keyword` property (also used in keyword-like
- // operators) indicates that the token originated from an
- // identifier-like word, which is used when parsing property names.
- //
- // The `beforeExpr` property is used to disambiguate between regular
- // expressions and divisions. It is set on all token types that can
- // be followed by an expression (thus, a slash after them would be a
- // regular expression).
- //
- // `isLoop` marks a keyword as starting a loop, which is important
- // to know when parsing a label, in order to allow or disallow
- // continue jumps to that label.
-
- var _break = {keyword: "break"}, _case = {keyword: "case", beforeExpr: true}, _catch = {keyword: "catch"};
- var _continue = {keyword: "continue"}, _debugger = {keyword: "debugger"}, _default = {keyword: "default"};
- var _do = {keyword: "do", isLoop: true}, _else = {keyword: "else", beforeExpr: true};
- var _finally = {keyword: "finally"}, _for = {keyword: "for", isLoop: true}, _function = {keyword:
"function"};
- var _if = {keyword: "if"}, _return = {keyword: "return", beforeExpr: true}, _switch = {keyword: "switch"};
- var _throw = {keyword: "throw", beforeExpr: true}, _try = {keyword: "try"}, _var = {keyword: "var"};
- var _while = {keyword: "while", isLoop: true}, _with = {keyword: "with"}, _new = {keyword: "new",
beforeExpr: true};
- var _this = {keyword: "this"}, _let = {keyword: "let"}, _const = {keyword: "const"};
-
- // The keywords that denote values.
-
- var _null = {keyword: "null", atomValue: null}, _true = {keyword: "true", atomValue: true};
- var _false = {keyword: "false", atomValue: false};
-
- // Some keywords are treated as regular operators. `in` sometimes
- // (when parsing `for`) needs to be tested against specifically, so
- // we assign a variable name to it for quick comparing.
-
- var _in = {keyword: "in", binop: 7, beforeExpr: true};
-
- // Map keyword names to token types.
-
- var keywordTypes = {"break": _break, "case": _case, "catch": _catch,
- "continue": _continue, "debugger": _debugger, "default": _default,
- "do": _do, "else": _else, "finally": _finally, "for": _for,
- "function": _function, "if": _if, "return": _return, "switch": _switch,
- "throw": _throw, "try": _try, "var": _var, "while": _while, "with": _with,
- "null": _null, "true": _true, "false": _false, "new": _new, "in": _in,
- "instanceof": {keyword: "instanceof", binop: 7, beforeExpr: true}, "this": _this,
- "typeof": {keyword: "typeof", prefix: true, beforeExpr: true},
- "void": {keyword: "void", prefix: true, beforeExpr: true},
- "delete": {keyword: "delete", prefix: true, beforeExpr: true},
- "let": _let, "const": _const};
-
- // Punctuation token types. Again, the `type` property is purely for debugging.
-
- var _bracketL = {type: "[", beforeExpr: true}, _bracketR = {type: "]"}, _braceL = {type: "{", beforeExpr:
true};
- var _braceR = {type: "}"}, _parenL = {type: "(", beforeExpr: true}, _parenR = {type: ")"};
- var _comma = {type: ",", beforeExpr: true}, _semi = {type: ";", beforeExpr: true};
- var _colon = {type: ":", beforeExpr: true}, _dot = {type: "."}, _question = {type: "?", beforeExpr: true};
+var pp = _state.Parser.prototype;
- // Operators. These carry several kinds of properties to help the
- // parser use them properly (the presence of these properties is
- // what categorizes them as operators).
- //
- // `binop`, when present, specifies that this operator is a binary
- // operator, and will refer to its precedence.
- //
- // `prefix` and `postfix` mark the operator as a prefix or postfix
- // unary operator. `isUpdate` specifies that the node produced by
- // the operator should be of type UpdateExpression rather than
- // simply UnaryExpression (`++` and `--`).
- //
- // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as
- // binary operators with a very low precedence, that should result
- // in AssignmentExpression nodes.
+// This function is used to raise exceptions on parse errors. It
+// takes an offset integer (into the current `input`) to indicate
+// the location of the error, attaches the position to the end
+// of the error message, and then raises a `SyntaxError` with that
+// message.
- var _slash = {binop: 10, beforeExpr: true}, _eq = {isAssign: true, beforeExpr: true};
- var _assign = {isAssign: true, beforeExpr: true};
- var _incDec = {postfix: true, prefix: true, isUpdate: true}, _prefix = {prefix: true, beforeExpr: true};
- var _logicalOR = {binop: 1, beforeExpr: true};
- var _logicalAND = {binop: 2, beforeExpr: true};
- var _bitwiseOR = {binop: 3, beforeExpr: true};
- var _bitwiseXOR = {binop: 4, beforeExpr: true};
- var _bitwiseAND = {binop: 5, beforeExpr: true};
- var _equality = {binop: 6, beforeExpr: true};
- var _relational = {binop: 7, beforeExpr: true};
- var _bitShift = {binop: 8, beforeExpr: true};
- var _plusMin = {binop: 9, prefix: true, beforeExpr: true};
- var _multiplyModulo = {binop: 10, beforeExpr: true};
-
- // Provide access to the token types for external users of the
- // tokenizer.
-
- exports.tokTypes = {bracketL: _bracketL, bracketR: _bracketR, braceL: _braceL, braceR: _braceR,
- parenL: _parenL, parenR: _parenR, comma: _comma, semi: _semi, colon: _colon,
- dot: _dot, question: _question, slash: _slash, eq: _eq, name: _name, eof: _eof,
- num: _num, regexp: _regexp, string: _string};
- for (var kw in keywordTypes) exports.tokTypes["_" + kw] = keywordTypes[kw];
-
- // This is a trick taken from Esprima. It turns out that, on
- // non-Chrome browsers, to check whether a string is in a set, a
- // predicate containing a big ugly `switch` statement is faster than
- // a regular expression, and on Chrome the two are about on par.
- // This function uses `eval` (non-lexical) to produce such a
- // predicate from a space-separated string of words.
- //
- // It starts by sorting the words by length.
-
- function makePredicate(words) {
- words = words.split(" ");
- var f = "", cats = [];
- out: for (var i = 0; i < words.length; ++i) {
- for (var j = 0; j < cats.length; ++j)
- if (cats[j][0].length == words[i].length) {
- cats[j].push(words[i]);
- continue out;
- }
- cats.push([words[i]]);
- }
- function compareTo(arr) {
- if (arr.length == 1) return f += "return str === " + JSON.stringify(arr[0]) + ";";
- f += "switch(str){";
- for (var i = 0; i < arr.length; ++i) f += "case " + JSON.stringify(arr[i]) + ":";
- f += "return true}return false;";
- }
-
- // When there are more than three length categories, an outer
- // switch first dispatches on the lengths, to save on comparisons.
+pp.raise = function (pos, message) {
+ var loc = _locutil.getLineInfo(this.input, pos);
+ message += " (" + loc.line + ":" + loc.column + ")";
+ var err = new SyntaxError(message);
+ err.pos = pos;err.loc = loc;err.raisedAt = this.pos;
+ throw err;
+};
- if (cats.length > 3) {
- cats.sort(function(a, b) {return b.length - a.length;});
- f += "switch(str.length){";
- for (var i = 0; i < cats.length; ++i) {
- var cat = cats[i];
- f += "case " + cat[0].length + ":";
- compareTo(cat);
- }
- f += "}";
-
- // Otherwise, simply generate a flat `switch` statement.
+pp.raiseRecoverable = pp.raise;
- } else {
- compareTo(words);
- }
- return new Function("str", f);
+pp.curPosition = function () {
+ if (this.options.locations) {
+ return new _locutil.Position(this.curLine, this.pos - this.lineStart);
}
+};
- // The ECMAScript 3 reserved word list.
+},{"./locutil":5,"./state":10}],5:[function(_dereq_,module,exports){
+"use strict";
- var isReservedWord3 = makePredicate("abstract boolean byte char class double enum export extends final
float goto implements import int interface long native package private protected public short static super
synchronized throws transient volatile");
+exports.__esModule = true;
+exports.getLineInfo = getLineInfo;
- // ECMAScript 5 reserved words.
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new
TypeError("Cannot call a class as a function"); } }
- var isReservedWord5 = makePredicate("class enum extends super const export import");
+var _whitespace = _dereq_("./whitespace");
- // The additional reserved words in strict mode.
+// These are used when `options.locations` is on, for the
+// `startLoc` and `endLoc` properties.
- var isStrictReservedWord = makePredicate("implements interface let package private protected public static
yield");
+var Position = (function () {
+ function Position(line, col) {
+ _classCallCheck(this, Position);
- // The forbidden variable names in strict mode.
+ this.line = line;
+ this.column = col;
+ }
- var isStrictBadIdWord = makePredicate("eval arguments");
+ Position.prototype.offset = function offset(n) {
+ return new Position(this.line, this.column + n);
+ };
- // And the keywords.
+ return Position;
+})();
- var isKeyword = makePredicate("break case catch continue debugger default do else finally for function if
return switch throw try var while with null true false instanceof typeof void delete new in this let const");
+exports.Position = Position;
- // ## Character categories
+var SourceLocation = function SourceLocation(p, start, end) {
+ _classCallCheck(this, SourceLocation);
- // Big ugly regular expressions that match characters in the
- // whitespace, identifier, and identifier-start categories. These
- // are only applied when a character is found to actually have a
- // code point above 128.
+ this.start = start;
+ this.end = end;
+ if (p.sourceFile !== null) this.source = p.sourceFile;
+}
- var nonASCIIwhitespace = /[\u1680\u180e\u2000-\u200a\u202f\u205f\u3000\ufeff]/;
- var nonASCIIidentifierStartChars =
"\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u0527\u0531-\u0556\u0559\u0561-\u0587\u05d0-\u05ea\u05f0-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u08a0\u08a2-\u08ac\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0977\u0979-\u097f\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\
u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c33\u0c35-\u0c39\u0c3d\u0c58\u0c59\u0c60\u0c61\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d05-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d60\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e87\u0e88\u0e8a\u0e8d\u0e94-\u0e97\u0e99-\u0e9f\u0ea1-\u0ea3\u0ea5\u0ea7\u0eaa\u0eab\u0ead-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u1
2be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f4\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f0\u1700-\u170c\u170e-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1877\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191c\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19c1-\u19c7\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4b\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1ce9-\u1cec\u1cee-\u1cf1\u1cf5\u1cf6\u1d00-\u1dbf\u1e00-\u1f15\u1f18-\u1f1d\u1f20-\u1f45\u1f48-\u1f4d\u1f50-\u1f57\u1f59\u1f5b\u1f5d\u1f5f-\u1f7d\u1f80-\u1fb4\u1fb6-\u1fbc\u1fbe\u1fc2-\u1fc4\u1fc6-\u1fcc\u1fd0-\u1fd3\u1fd6-\u1fdb\u1fe0-\u1fec\u1ff2-\u1ff4\u1ff6-\u1ffc\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2119-\u211d\u2124\u2126\u2128\u212a-\u212d\u212f-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2c2e\u2c30-\u2c5e\u2c60-\u2ce4\u2ceb-\u
2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u2e2f\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309d-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312d\u3131-\u318e\u31a0-\u31ba\u31f0-\u31ff\u3400-\u4db5\u4e00-\u9fcc\ua000-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua697\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua78e\ua790-\ua793\ua7a0-\ua7aa\ua7f8-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa80-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uabc0-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb0
0-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc";
- var nonASCIIidentifierChars =
"\u0300-\u036f\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u0620-\u0649\u0672-\u06d3\u06e7-\u06e8\u06fb-\u06fc\u0730-\u074a\u0800-\u0814\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0840-\u0857\u08e4-\u08fe\u0900-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962-\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09d7\u09df-\u09e0\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2-\u0ae3\u0ae6-\u0aef\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b56\u0b57\u0b5f-\u0b60\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c01-\u0c03\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62-\u0c63\u0c66-\u0c6f\u0c82\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2-\u0ce3\u0ce6-\u0cef\u0d02\u0d03\u0d46-\u0d48\u0d57\u0d62-\u0d63\u0d66-\u0d6f\u0d82\u0d83\u0dca\u0dcf-\u0dd
4\u0dd6\u0dd8-\u0ddf\u0df2\u0df3\u0e34-\u0e3a\u0e40-\u0e45\u0e50-\u0e59\u0eb4-\u0eb9\u0ec8-\u0ecd\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f41-\u0f47\u0f71-\u0f84\u0f86-\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u1000-\u1029\u1040-\u1049\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u170e-\u1710\u1720-\u1730\u1740-\u1750\u1772\u1773\u1780-\u17b2\u17dd\u17e0-\u17e9\u180b-\u180d\u1810-\u1819\u1920-\u192b\u1930-\u193b\u1951-\u196d\u19b0-\u19c0\u19c8-\u19c9\u19d0-\u19d9\u1a00-\u1a15\u1a20-\u1a53\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1b46-\u1b4b\u1b50-\u1b59\u1b6b-\u1b73\u1bb0-\u1bb9\u1be6-\u1bf3\u1c00-\u1c22\u1c40-\u1c49\u1c5b-\u1c7d\u1cd0-\u1cd2\u1d00-\u1dbe\u1e01-\u1f15\u200c\u200d\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2d81-\u2d96\u2de0-\u2dff\u3021-\u3028\u3099\u309a\ua640-\ua66d\ua674-\ua67d\ua69f\ua6f0-\ua6f1\ua7f8-\ua800\ua806\ua80b\ua823-\ua827\ua880-\ua881\ua8b4-\ua8c4\ua8d0-\ua8d9\ua8f3-\ua8f7\ua900-\ua909\ua926-\ua92d\ua93
0-\ua945\ua980-\ua983\ua9b3-\ua9c0\uaa00-\uaa27\uaa40-\uaa41\uaa4c-\uaa4d\uaa50-\uaa59\uaa7b\uaae0-\uaae9\uaaf2-\uaaf3\uabc0-\uabe1\uabec\uabed\uabf0-\uabf9\ufb20-\ufb28\ufe00-\ufe0f\ufe20-\ufe26\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f";
- var nonASCIIidentifierStart = new RegExp("[" + nonASCIIidentifierStartChars + "]");
- var nonASCIIidentifier = new RegExp("[" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + "]");
+// The `getLineInfo` function is mostly useful when the
+// `locations` option is off (for performance reasons) and you
+// want to find the line/column position for a given character
+// offset. `input` should be the code string that the offset refers
+// into.
- // Whether a single character denotes a newline.
+;
- var newline = /[\n\r\u2028\u2029]/;
+exports.SourceLocation = SourceLocation;
- // Matches a whole line break (where CRLF is considered a single
- // line break). Used to count lines.
+function getLineInfo(input, offset) {
+ for (var line = 1, cur = 0;;) {
+ _whitespace.lineBreakG.lastIndex = cur;
+ var match = _whitespace.lineBreakG.exec(input);
+ if (match && match.index < offset) {
+ ++line;
+ cur = match.index + match[0].length;
+ } else {
+ return new Position(line, offset - cur);
+ }
+ }
+}
- var lineBreak = /\r\n|[\n\r\u2028\u2029]/g;
+},{"./whitespace":16}],6:[function(_dereq_,module,exports){
+"use strict";
- // Test whether a given character code starts an identifier.
+var _tokentype = _dereq_("./tokentype");
- var isIdentifierStart = exports.isIdentifierStart = function(code) {
- if (code < 65) return code === 36;
- if (code < 91) return true;
- if (code < 97) return code === 95;
- if (code < 123)return true;
- return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code));
- };
+var _state = _dereq_("./state");
- // Test whether a given character is part of an identifier.
+var _util = _dereq_("./util");
- var isIdentifierChar = exports.isIdentifierChar = function(code) {
- if (code < 48) return code === 36;
- if (code < 58) return true;
- if (code < 65) return false;
- if (code < 91) return true;
- if (code < 97) return code === 95;
- if (code < 123)return true;
- return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code));
- };
+var pp = _state.Parser.prototype;
- // ## Tokenizer
+// Convert existing expression atom to assignable pattern
+// if possible.
- // These are used when `options.locations` is on, for the
- // `tokStartLoc` and `tokEndLoc` properties.
+pp.toAssignable = function (node, isBinding) {
+ if (this.options.ecmaVersion >= 6 && node) {
+ switch (node.type) {
+ case "Identifier":
+ case "ObjectPattern":
+ case "ArrayPattern":
+ break;
- function line_loc_t() {
- this.line = tokCurLine;
- this.column = tokPos - tokLineStart;
- }
+ case "ObjectExpression":
+ node.type = "ObjectPattern";
+ for (var i = 0; i < node.properties.length; i++) {
+ var prop = node.properties[i];
+ if (prop.kind !== "init") this.raise(prop.key.start, "Object pattern can't contain getter or
setter");
+ this.toAssignable(prop.value, isBinding);
+ }
+ break;
- // Reset the token state. Used at the start of a parse.
+ case "ArrayExpression":
+ node.type = "ArrayPattern";
+ this.toAssignableList(node.elements, isBinding);
+ break;
- function initTokenState() {
- tokCurLine = 1;
- tokPos = tokLineStart = 0;
- tokRegexpAllowed = true;
- skipSpace();
- }
+ case "AssignmentExpression":
+ if (node.operator === "=") {
+ node.type = "AssignmentPattern";
+ delete node.operator;
+ // falls through to AssignmentPattern
+ } else {
+ this.raise(node.left.end, "Only '=' operator can be used for specifying default value.");
+ break;
+ }
- // Called at the end of every token. Sets `tokEnd`, `tokVal`, and
- // `tokRegexpAllowed`, and skips the space after the token, so that
- // the next one's `tokStart` will point at the right position.
+ case "AssignmentPattern":
+ if (node.right.type === "YieldExpression") this.raise(node.right.start, "Yield expression cannot be
a default value");
+ break;
- function finishToken(type, val) {
- tokEnd = tokPos;
- if (options.locations) tokEndLoc = new line_loc_t;
- tokType = type;
- skipSpace();
- tokVal = val;
- tokRegexpAllowed = type.beforeExpr;
- }
+ case "ParenthesizedExpression":
+ node.expression = this.toAssignable(node.expression, isBinding);
+ break;
- function skipBlockComment() {
- var startLoc = options.onComment && options.locations && new line_loc_t;
- var start = tokPos, end = input.indexOf("*/", tokPos += 2);
- if (end === -1) raise(tokPos - 2, "Unterminated comment");
- tokPos = end + 2;
- if (options.locations) {
- lineBreak.lastIndex = start;
- var match;
- while ((match = lineBreak.exec(input)) && match.index < tokPos) {
- ++tokCurLine;
- tokLineStart = match.index + match[0].length;
- }
- }
- if (options.onComment)
- options.onComment(true, input.slice(start + 2, end), start, tokPos,
- startLoc, options.locations && new line_loc_t);
- }
-
- function skipLineComment() {
- var start = tokPos;
- var startLoc = options.onComment && options.locations && new line_loc_t;
- var ch = input.charCodeAt(tokPos+=2);
- while (tokPos < inputLen && ch !== 10 && ch !== 13 && ch !== 8232 && ch !== 8233) {
- ++tokPos;
- ch = input.charCodeAt(tokPos);
+ case "MemberExpression":
+ if (!isBinding) break;
+
+ default:
+ this.raise(node.start, "Assigning to rvalue");
}
- if (options.onComment)
- options.onComment(false, input.slice(start + 2, tokPos), start, tokPos,
- startLoc, options.locations && new line_loc_t);
- }
-
- // Called at the start of the parse and after every token. Skips
- // whitespace and comments, and.
-
- function skipSpace() {
- while (tokPos < inputLen) {
- var ch = input.charCodeAt(tokPos);
- if (ch === 32) { // ' '
- ++tokPos;
- } else if (ch === 13) {
- ++tokPos;
- var next = input.charCodeAt(tokPos);
- if (next === 10) {
- ++tokPos;
- }
- if (options.locations) {
- ++tokCurLine;
- tokLineStart = tokPos;
- }
- } else if (ch === 10 || ch === 8232 || ch === 8233) {
- ++tokPos;
- if (options.locations) {
- ++tokCurLine;
- tokLineStart = tokPos;
- }
- } else if (ch > 8 && ch < 14) {
- ++tokPos;
- } else if (ch === 47) { // '/'
- var next = input.charCodeAt(tokPos + 1);
- if (next === 42) { // '*'
- skipBlockComment();
- } else if (next === 47) { // '/'
- skipLineComment();
- } else break;
- } else if (ch === 160) { // '\xa0'
- ++tokPos;
- } else if (ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {
- ++tokPos;
- } else {
- break;
- }
+ }
+ return node;
+};
+
+// Convert list of expression atoms to binding list.
+
+pp.toAssignableList = function (exprList, isBinding) {
+ var end = exprList.length;
+ if (end) {
+ var last = exprList[end - 1];
+ if (last && last.type == "RestElement") {
+ --end;
+ } else if (last && last.type == "SpreadElement") {
+ last.type = "RestElement";
+ var arg = last.argument;
+ this.toAssignable(arg, isBinding);
+ if (arg.type !== "Identifier" && arg.type !== "MemberExpression" && arg.type !== "ArrayPattern")
this.unexpected(arg.start);
+ --end;
}
+
+ if (isBinding && last.type === "RestElement" && last.argument.type !== "Identifier")
this.unexpected(last.argument.start);
+ }
+ for (var i = 0; i < end; i++) {
+ var elt = exprList[i];
+ if (elt) this.toAssignable(elt, isBinding);
}
+ return exprList;
+};
- // ### Token reading
+// Parses spread element.
- // This is the function that is called to fetch the next token. It
- // is somewhat obscure, because it works in character codes rather
- // than characters, and because operator parsing has been inlined
- // into it.
- //
- // All in the name of speed.
- //
- // The `forceRegexp` parameter is used in the one case where the
- // `tokRegexpAllowed` trick does not work. See `parseStatement`.
+pp.parseSpread = function (refDestructuringErrors) {
+ var node = this.startNode();
+ this.next();
+ node.argument = this.parseMaybeAssign(refDestructuringErrors);
+ return this.finishNode(node, "SpreadElement");
+};
- function readToken_dot() {
- var next = input.charCodeAt(tokPos + 1);
- if (next >= 48 && next <= 57) return readNumber(true);
- ++tokPos;
- return finishToken(_dot);
- }
+pp.parseRest = function (allowNonIdent) {
+ var node = this.startNode();
+ this.next();
- function readToken_slash() { // '/'
- var next = input.charCodeAt(tokPos + 1);
- if (tokRegexpAllowed) {++tokPos; return readRegexp();}
- if (next === 61) return finishOp(_assign, 2);
- return finishOp(_slash, 1);
- }
+ // RestElement inside of a function parameter must be an identifier
+ if (allowNonIdent) node.argument = this.type === _tokentype.types.name ? this.parseIdent() :
this.unexpected();else node.argument = this.type === _tokentype.types.name || this.type ===
_tokentype.types.bracketL ? this.parseBindingAtom() : this.unexpected();
- function readToken_mult_modulo() { // '%*'
- var next = input.charCodeAt(tokPos + 1);
- if (next === 61) return finishOp(_assign, 2);
- return finishOp(_multiplyModulo, 1);
- }
+ return this.finishNode(node, "RestElement");
+};
- function readToken_pipe_amp(code) { // '|&'
- var next = input.charCodeAt(tokPos + 1);
- if (next === code) return finishOp(code === 124 ? _logicalOR : _logicalAND, 2);
- if (next === 61) return finishOp(_assign, 2);
- return finishOp(code === 124 ? _bitwiseOR : _bitwiseAND, 1);
- }
+// Parses lvalue (assignable) atom.
- function readToken_caret() { // '^'
- var next = input.charCodeAt(tokPos + 1);
- if (next === 61) return finishOp(_assign, 2);
- return finishOp(_bitwiseXOR, 1);
- }
+pp.parseBindingAtom = function () {
+ if (this.options.ecmaVersion < 6) return this.parseIdent();
+ switch (this.type) {
+ case _tokentype.types.name:
+ return this.parseIdent();
- function readToken_plus_min(code) { // '+-'
- var next = input.charCodeAt(tokPos + 1);
- if (next === code) {
- if (next == 45 && input.charCodeAt(tokPos + 2) == 62 &&
- newline.test(input.slice(lastEnd, tokPos))) {
- // A `-->` line comment
- tokPos += 3;
- skipLineComment();
- skipSpace();
- return readToken();
- }
- return finishOp(_incDec, 2);
+ case _tokentype.types.bracketL:
+ var node = this.startNode();
+ this.next();
+ node.elements = this.parseBindingList(_tokentype.types.bracketR, true, true);
+ return this.finishNode(node, "ArrayPattern");
+
+ case _tokentype.types.braceL:
+ return this.parseObj(true);
+
+ default:
+ this.unexpected();
+ }
+};
+
+pp.parseBindingList = function (close, allowEmpty, allowTrailingComma, allowNonIdent) {
+ var elts = [],
+ first = true;
+ while (!this.eat(close)) {
+ if (first) first = false;else this.expect(_tokentype.types.comma);
+ if (allowEmpty && this.type === _tokentype.types.comma) {
+ elts.push(null);
+ } else if (allowTrailingComma && this.afterTrailingComma(close)) {
+ break;
+ } else if (this.type === _tokentype.types.ellipsis) {
+ var rest = this.parseRest(allowNonIdent);
+ this.parseBindingListItem(rest);
+ elts.push(rest);
+ if (this.type === _tokentype.types.comma) this.raise(this.start, "Comma is not permitted after the
rest element");
+ this.expect(close);
+ break;
+ } else {
+ var elem = this.parseMaybeDefault(this.start, this.startLoc);
+ this.parseBindingListItem(elem);
+ elts.push(elem);
}
- if (next === 61) return finishOp(_assign, 2);
- return finishOp(_plusMin, 1);
}
+ return elts;
+};
+
+pp.parseBindingListItem = function (param) {
+ return param;
+};
+
+// Parses assignment pattern around given atom if possible.
+
+pp.parseMaybeDefault = function (startPos, startLoc, left) {
+ left = left || this.parseBindingAtom();
+ if (this.options.ecmaVersion < 6 || !this.eat(_tokentype.types.eq)) return left;
+ var node = this.startNodeAt(startPos, startLoc);
+ node.left = left;
+ node.right = this.parseMaybeAssign();
+ return this.finishNode(node, "AssignmentPattern");
+};
+
+// Verify that a node is an lval — something that can be assigned
+// to.
+
+pp.checkLVal = function (expr, isBinding, checkClashes) {
+ switch (expr.type) {
+ case "Identifier":
+ if (this.strict && this.reservedWordsStrictBind.test(expr.name)) this.raiseRecoverable(expr.start,
(isBinding ? "Binding " : "Assigning to ") + expr.name + " in strict mode");
+ if (checkClashes) {
+ if (_util.has(checkClashes, expr.name)) this.raiseRecoverable(expr.start, "Argument name clash");
+ checkClashes[expr.name] = true;
+ }
+ break;
- function readToken_lt_gt(code) { // '<>'
- var next = input.charCodeAt(tokPos + 1);
- var size = 1;
- if (next === code) {
- size = code === 62 && input.charCodeAt(tokPos + 2) === 62 ? 3 : 2;
- if (input.charCodeAt(tokPos + size) === 61) return finishOp(_assign, size + 1);
- return finishOp(_bitShift, size);
- }
- if (next == 33 && code == 60 && input.charCodeAt(tokPos + 2) == 45 &&
- input.charCodeAt(tokPos + 3) == 45) {
- // `<!--`, an XML-style comment that should be interpreted as a line comment
- tokPos += 4;
- skipLineComment();
- skipSpace();
- return readToken();
- }
- if (next === 61)
- size = input.charCodeAt(tokPos + 2) === 61 ? 3 : 2;
- return finishOp(_relational, size);
- }
-
- function readToken_eq_excl(code) { // '=!'
- var next = input.charCodeAt(tokPos + 1);
- if (next === 61) return finishOp(_equality, input.charCodeAt(tokPos + 2) === 61 ? 3 : 2);
- return finishOp(code === 61 ? _eq : _prefix, 1);
- }
-
- function getTokenFromCode(code) {
- switch(code) {
- // The interpretation of a dot depends on whether it is followed
- // by a digit.
- case 46: // '.'
- return readToken_dot();
-
- // Punctuation tokens.
- case 40: ++tokPos; return finishToken(_parenL);
- case 41: ++tokPos; return finishToken(_parenR);
- case 59: ++tokPos; return finishToken(_semi);
- case 44: ++tokPos; return finishToken(_comma);
- case 91: ++tokPos; return finishToken(_bracketL);
- case 93: ++tokPos; return finishToken(_bracketR);
- case 123: ++tokPos; return finishToken(_braceL);
- case 125: ++tokPos; return finishToken(_braceR);
- case 58: ++tokPos; return finishToken(_colon);
- case 63: ++tokPos; return finishToken(_question);
-
- // '0x' is a hexadecimal number.
- case 48: // '0'
- var next = input.charCodeAt(tokPos + 1);
- if (next === 120 || next === 88) return readHexNumber();
- // Anything else beginning with a digit is an integer, octal
- // number, or float.
- case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9
- return readNumber(false);
-
- // Quotes produce strings.
- case 34: case 39: // '"', "'"
- return readString(code);
+ case "MemberExpression":
+ if (isBinding) this.raiseRecoverable(expr.start, (isBinding ? "Binding" : "Assigning to") + " member
expression");
+ break;
- // Operators are parsed inline in tiny state machines. '=' (61) is
- // often referred to. `finishOp` simply skips the amount of
- // characters it is given as second argument, and returns a token
- // of the type given by its first argument.
+ case "ObjectPattern":
+ for (var i = 0; i < expr.properties.length; i++) {
+ this.checkLVal(expr.properties[i].value, isBinding, checkClashes);
+ }break;
- case 47: // '/'
- return readToken_slash(code);
+ case "ArrayPattern":
+ for (var i = 0; i < expr.elements.length; i++) {
+ var elem = expr.elements[i];
+ if (elem) this.checkLVal(elem, isBinding, checkClashes);
+ }
+ break;
- case 37: case 42: // '%*'
- return readToken_mult_modulo();
+ case "AssignmentPattern":
+ this.checkLVal(expr.left, isBinding, checkClashes);
+ break;
- case 124: case 38: // '|&'
- return readToken_pipe_amp(code);
+ case "RestElement":
+ this.checkLVal(expr.argument, isBinding, checkClashes);
+ break;
- case 94: // '^'
- return readToken_caret();
+ case "ParenthesizedExpression":
+ this.checkLVal(expr.expression, isBinding, checkClashes);
+ break;
- case 43: case 45: // '+-'
- return readToken_plus_min(code);
+ default:
+ this.raise(expr.start, (isBinding ? "Binding" : "Assigning to") + " rvalue");
+ }
+};
+
+},{"./state":10,"./tokentype":14,"./util":15}],7:[function(_dereq_,module,exports){
+"use strict";
+
+exports.__esModule = true;
+
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new
TypeError("Cannot call a class as a function"); } }
+
+var _state = _dereq_("./state");
+
+var _locutil = _dereq_("./locutil");
+
+var Node = function Node(parser, pos, loc) {
+ _classCallCheck(this, Node);
+
+ this.type = "";
+ this.start = pos;
+ this.end = 0;
+ if (parser.options.locations) this.loc = new _locutil.SourceLocation(parser, loc);
+ if (parser.options.directSourceFile) this.sourceFile = parser.options.directSourceFile;
+ if (parser.options.ranges) this.range = [pos, 0];
+}
+
+// Start an AST node, attaching a start offset.
+
+;
+
+exports.Node = Node;
+var pp = _state.Parser.prototype;
+
+pp.startNode = function () {
+ return new Node(this, this.start, this.startLoc);
+};
+
+pp.startNodeAt = function (pos, loc) {
+ return new Node(this, pos, loc);
+};
+
+// Finish an AST node, adding `type` and `end` properties.
+
+function finishNodeAt(node, type, pos, loc) {
+ node.type = type;
+ node.end = pos;
+ if (this.options.locations) node.loc.end = loc;
+ if (this.options.ranges) node.range[1] = pos;
+ return node;
+}
+
+pp.finishNode = function (node, type) {
+ return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc);
+};
+
+// Finish node at given position
+
+pp.finishNodeAt = function (node, type, pos, loc) {
+ return finishNodeAt.call(this, node, type, pos, loc);
+};
+
+},{"./locutil":5,"./state":10}],8:[function(_dereq_,module,exports){
+"use strict";
+
+exports.__esModule = true;
+exports.getOptions = getOptions;
+
+var _util = _dereq_("./util");
+
+var _locutil = _dereq_("./locutil");
+
+// A second optional argument can be given to further configure
+// the parser process. These options are recognized:
+
+var defaultOptions = {
+ // `ecmaVersion` indicates the ECMAScript version to parse. Must
+ // be either 3, or 5, or 6. This influences support for strict
+ // mode, the set of reserved words, support for getters and
+ // setters and other features. The default is 6.
+ ecmaVersion: 6,
+ // Source type ("script" or "module") for different semantics
+ sourceType: "script",
+ // `onInsertedSemicolon` can be a callback that will be called
+ // when a semicolon is automatically inserted. It will be passed
+ // th position of the comma as an offset, and if `locations` is
+ // enabled, it is given the location as a `{line, column}` object
+ // as second argument.
+ onInsertedSemicolon: null,
+ // `onTrailingComma` is similar to `onInsertedSemicolon`, but for
+ // trailing commas.
+ onTrailingComma: null,
+ // By default, reserved words are only enforced if ecmaVersion >= 5.
+ // Set `allowReserved` to a boolean value to explicitly turn this on
+ // an off. When this option has the value "never", reserved words
+ // and keywords can also not be used as property names.
+ allowReserved: null,
+ // When enabled, a return at the top level is not considered an
+ // error.
+ allowReturnOutsideFunction: false,
+ // When enabled, import/export statements are not constrained to
+ // appearing at the top of the program.
+ allowImportExportEverywhere: false,
+ // When enabled, hashbang directive in the beginning of file
+ // is allowed and treated as a line comment.
+ allowHashBang: false,
+ // When `locations` is on, `loc` properties holding objects with
+ // `start` and `end` properties in `{line, column}` form (with
+ // line being 1-based and column 0-based) will be attached to the
+ // nodes.
+ locations: false,
+ // A function can be passed as `onToken` option, which will
+ // cause Acorn to call that function with object in the same
+ // format as tokens returned from `tokenizer().getToken()`. Note
+ // that you are not allowed to call the parser from the
+ // callback—that will corrupt its internal state.
+ onToken: null,
+ // A function can be passed as `onComment` option, which will
+ // cause Acorn to call that function with `(block, text, start,
+ // end)` parameters whenever a comment is skipped. `block` is a
+ // boolean indicating whether this is a block (`/* */`) comment,
+ // `text` is the content of the comment, and `start` and `end` are
+ // character offsets that denote the start and end of the comment.
+ // When the `locations` option is on, two more parameters are
+ // passed, the full `{line, column}` locations of the start and
+ // end of the comments. Note that you are not allowed to call the
+ // parser from the callback—that will corrupt its internal state.
+ onComment: null,
+ // Nodes have their start and end characters offsets recorded in
+ // `start` and `end` properties (directly on the node, rather than
+ // the `loc` object, which holds line/column data. To also add a
+ // [semi-standardized][range] `range` property holding a `[start,
+ // end]` array with the same numbers, set the `ranges` option to
+ // `true`.
+ //
+ // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678
+ ranges: false,
+ // It is possible to parse multiple files into a single AST by
+ // passing the tree produced by parsing the first file as
+ // `program` option in subsequent parses. This will add the
+ // toplevel forms of the parsed file to the `Program` (top) node
+ // of an existing parse tree.
+ program: null,
+ // When `locations` is on, you can pass this to record the source
+ // file in every node's `loc` object.
+ sourceFile: null,
+ // This value, if given, is stored in every node, whether
+ // `locations` is on or off.
+ directSourceFile: null,
+ // When enabled, parenthesized expressions are represented by
+ // (non-standard) ParenthesizedExpression nodes
+ preserveParens: false,
+ plugins: {}
+};
+
+exports.defaultOptions = defaultOptions;
+// Interpret and default an options object
+
+function getOptions(opts) {
+ var options = {};
+ for (var opt in defaultOptions) {
+ options[opt] = opts && _util.has(opts, opt) ? opts[opt] : defaultOptions[opt];
+ }if (options.allowReserved == null) options.allowReserved = options.ecmaVersion < 5;
+
+ if (_util.isArray(options.onToken)) {
+ (function () {
+ var tokens = options.onToken;
+ options.onToken = function (token) {
+ return tokens.push(token);
+ };
+ })();
+ }
+ if (_util.isArray(options.onComment)) options.onComment = pushComment(options, options.onComment);
+
+ return options;
+}
+
+function pushComment(options, array) {
+ return function (block, text, start, end, startLoc, endLoc) {
+ var comment = {
+ type: block ? 'Block' : 'Line',
+ value: text,
+ start: start,
+ end: end
+ };
+ if (options.locations) comment.loc = new _locutil.SourceLocation(this, startLoc, endLoc);
+ if (options.ranges) comment.range = [start, end];
+ array.push(comment);
+ };
+}
- case 60: case 62: // '<>'
- return readToken_lt_gt(code);
+},{"./locutil":5,"./util":15}],9:[function(_dereq_,module,exports){
+"use strict";
- case 61: case 33: // '=!'
- return readToken_eq_excl(code);
+var _tokentype = _dereq_("./tokentype");
- case 126: // '~'
- return finishOp(_prefix, 1);
- }
+var _state = _dereq_("./state");
+
+var _whitespace = _dereq_("./whitespace");
+
+var pp = _state.Parser.prototype;
+
+// ## Parser utilities
+// Test whether a statement node is the string literal `"use strict"`.
+
+pp.isUseStrict = function (stmt) {
+ return this.options.ecmaVersion >= 5 && stmt.type === "ExpressionStatement" && stmt.expression.type ===
"Literal" && stmt.expression.raw.slice(1, -1) === "use strict";
+};
+
+// Predicate that tests whether the next token is of the given
+// type, and if yes, consumes it as a side effect.
+
+pp.eat = function (type) {
+ if (this.type === type) {
+ this.next();
+ return true;
+ } else {
return false;
}
+};
- function readToken(forceRegexp) {
- if (!forceRegexp) tokStart = tokPos;
- else tokPos = tokStart + 1;
- if (options.locations) tokStartLoc = new line_loc_t;
- if (forceRegexp) return readRegexp();
- if (tokPos >= inputLen) return finishToken(_eof);
+// Tests whether parsed token is a contextual keyword.
- var code = input.charCodeAt(tokPos);
- // Identifier or keyword. '\uXXXX' sequences are allowed in
- // identifiers, so '\' also dispatches to that.
- if (isIdentifierStart(code) || code === 92 /* '\' */) return readWord();
+pp.isContextual = function (name) {
+ return this.type === _tokentype.types.name && this.value === name;
+};
- var tok = getTokenFromCode(code);
+// Consumes contextual keyword if possible.
- if (tok === false) {
- // If we are here, we either found a non-ASCII identifier
- // character, or something that's entirely disallowed.
- var ch = String.fromCharCode(code);
- if (ch === "\\" || nonASCIIidentifierStart.test(ch)) return readWord();
- raise(tokPos, "Unexpected character '" + ch + "'");
- }
- return tok;
- }
-
- function finishOp(type, size) {
- var str = input.slice(tokPos, tokPos + size);
- tokPos += size;
- finishToken(type, str);
- }
-
- // Parse a regular expression. Some context-awareness is necessary,
- // since a '/' inside a '[]' set does not end the expression.
-
- function readRegexp() {
- var content = "", escaped, inClass, start = tokPos;
- for (;;) {
- if (tokPos >= inputLen) raise(start, "Unterminated regular expression");
- var ch = input.charAt(tokPos);
- if (newline.test(ch)) raise(start, "Unterminated regular expression");
- if (!escaped) {
- if (ch === "[") inClass = true;
- else if (ch === "]" && inClass) inClass = false;
- else if (ch === "/" && !inClass) break;
- escaped = ch === "\\";
- } else escaped = false;
- ++tokPos;
- }
- var content = input.slice(start, tokPos);
- ++tokPos;
- // Need to use `readWord1` because '\uXXXX' sequences are allowed
- // here (don't ask).
- var mods = readWord1();
- if (mods && !/^[gmsiy]*$/.test(mods)) raise(start, "Invalid regexp flag");
- return finishToken(_regexp, new RegExp(content, mods));
- }
-
- // Read an integer in the given radix. Return null if zero digits
- // were read, the integer value otherwise. When `len` is given, this
- // will return `null` unless the integer has exactly `len` digits.
-
- function readInt(radix, len) {
- var start = tokPos, total = 0;
- for (var i = 0, e = len == null ? Infinity : len; i < e; ++i) {
- var code = input.charCodeAt(tokPos), val;
- if (code >= 97) val = code - 97 + 10; // a
- else if (code >= 65) val = code - 65 + 10; // A
- else if (code >= 48 && code <= 57) val = code - 48; // 0-9
- else val = Infinity;
- if (val >= radix) break;
- ++tokPos;
- total = total * radix + val;
- }
- if (tokPos === start || len != null && tokPos - start !== len) return null;
+pp.eatContextual = function (name) {
+ return this.value === name && this.eat(_tokentype.types.name);
+};
- return total;
- }
+// Asserts that following token is given contextual keyword.
- function readHexNumber() {
- tokPos += 2; // 0x
- var val = readInt(16);
- if (val == null) raise(tokStart + 2, "Expected hexadecimal number");
- if (isIdentifierStart(input.charCodeAt(tokPos))) raise(tokPos, "Identifier directly after number");
- return finishToken(_num, val);
- }
+pp.expectContextual = function (name) {
+ if (!this.eatContextual(name)) this.unexpected();
+};
- // Read an integer, octal integer, or floating-point number.
+// Test whether a semicolon can be inserted at the current position.
- function readNumber(startsWithDot) {
- var start = tokPos, isFloat = false, octal = input.charCodeAt(tokPos) === 48;
- if (!startsWithDot && readInt(10) === null) raise(start, "Invalid number");
- if (input.charCodeAt(tokPos) === 46) {
- ++tokPos;
- readInt(10);
- isFloat = true;
- }
- var next = input.charCodeAt(tokPos);
- if (next === 69 || next === 101) { // 'eE'
- next = input.charCodeAt(++tokPos);
- if (next === 43 || next === 45) ++tokPos; // '+-'
- if (readInt(10) === null) raise(start, "Invalid number");
- isFloat = true;
- }
- if (isIdentifierStart(input.charCodeAt(tokPos))) raise(tokPos, "Identifier directly after number");
-
- var str = input.slice(start, tokPos), val;
- if (isFloat) val = parseFloat(str);
- else if (!octal || str.length === 1) val = parseInt(str, 10);
- else if (/[89]/.test(str) || strict) raise(start, "Invalid number");
- else val = parseInt(str, 8);
- return finishToken(_num, val);
- }
-
- // Read a string value, interpreting backslash-escapes.
-
- function readString(quote) {
- tokPos++;
- var out = "";
- for (;;) {
- if (tokPos >= inputLen) raise(tokStart, "Unterminated string constant");
- var ch = input.charCodeAt(tokPos);
- if (ch === quote) {
- ++tokPos;
- return finishToken(_string, out);
- }
- if (ch === 92) { // '\'
- ch = input.charCodeAt(++tokPos);
- var octal = /^[0-7]+/.exec(input.slice(tokPos, tokPos + 3));
- if (octal) octal = octal[0];
- while (octal && parseInt(octal, 8) > 255) octal = octal.slice(0, -1);
- if (octal === "0") octal = null;
- ++tokPos;
- if (octal) {
- if (strict) raise(tokPos - 2, "Octal literal in strict mode");
- out += String.fromCharCode(parseInt(octal, 8));
- tokPos += octal.length - 1;
- } else {
- switch (ch) {
- case 110: out += "\n"; break; // 'n' -> '\n'
- case 114: out += "\r"; break; // 'r' -> '\r'
- case 120: out += String.fromCharCode(readHexChar(2)); break; // 'x'
- case 117: out += String.fromCharCode(readHexChar(4)); break; // 'u'
- case 85: out += String.fromCharCode(readHexChar(8)); break; // 'U'
- case 116: out += "\t"; break; // 't' -> '\t'
- case 98: out += "\b"; break; // 'b' -> '\b'
- case 118: out += "\u000b"; break; // 'v' -> '\u000b'
- case 102: out += "\f"; break; // 'f' -> '\f'
- case 48: out += "\0"; break; // 0 -> '\0'
- case 13: if (input.charCodeAt(tokPos) === 10) ++tokPos; // '\r\n'
- case 10: // ' \n'
- if (options.locations) { tokLineStart = tokPos; ++tokCurLine; }
- break;
- default: out += String.fromCharCode(ch); break;
- }
- }
- } else {
- if (ch === 13 || ch === 10 || ch === 8232 || ch === 8233) raise(tokStart, "Unterminated string
constant");
- out += String.fromCharCode(ch); // '\'
- ++tokPos;
- }
- }
+pp.canInsertSemicolon = function () {
+ return this.type === _tokentype.types.eof || this.type === _tokentype.types.braceR ||
_whitespace.lineBreak.test(this.input.slice(this.lastTokEnd, this.start));
+};
+
+pp.insertSemicolon = function () {
+ if (this.canInsertSemicolon()) {
+ if (this.options.onInsertedSemicolon) this.options.onInsertedSemicolon(this.lastTokEnd,
this.lastTokEndLoc);
+ return true;
}
+};
+
+// Consume a semicolon, or, failing that, see if we are allowed to
+// pretend that there is a semicolon at this position.
- // Used to read character escape sequences ('\x', '\u', '\U').
+pp.semicolon = function () {
+ if (!this.eat(_tokentype.types.semi) && !this.insertSemicolon()) this.unexpected();
+};
- function readHexChar(len) {
- var n = readInt(16, len);
- if (n === null) raise(tokStart, "Bad character escape sequence");
- return n;
+pp.afterTrailingComma = function (tokType) {
+ if (this.type == tokType) {
+ if (this.options.onTrailingComma) this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc);
+ this.next();
+ return true;
}
+};
- // Used to signal to callers of `readWord1` whether the word
- // contained any escape sequences. This is needed because words with
- // escape sequences must not be interpreted as keywords.
+// Expect a token of a given type. If found, consume it, otherwise,
+// raise an unexpected token error.
- var containsEsc;
+pp.expect = function (type) {
+ this.eat(type) || this.unexpected();
+};
- // Read an identifier, and return it as a string. Sets `containsEsc`
- // to whether the word contained a '\u' escape.
- //
- // Only builds up the word character-by-character when it actually
- // containeds an escape, as a micro-optimization.
-
- function readWord1() {
- containsEsc = false;
- var word, first = true, start = tokPos;
- for (;;) {
- var ch = input.charCodeAt(tokPos);
- if (isIdentifierChar(ch)) {
- if (containsEsc) word += input.charAt(tokPos);
- ++tokPos;
- } else if (ch === 92) { // "\"
- if (!containsEsc) word = input.slice(start, tokPos);
- containsEsc = true;
- if (input.charCodeAt(++tokPos) != 117) // "u"
- raise(tokPos, "Expecting Unicode escape sequence \\uXXXX");
- ++tokPos;
- var esc = readHexChar(4);
- var escStr = String.fromCharCode(esc);
- if (!escStr) raise(tokPos - 1, "Invalid Unicode escape");
- if (!(first ? isIdentifierStart(esc) : isIdentifierChar(esc)))
- raise(tokPos - 4, "Invalid Unicode escape");
- word += escStr;
- } else {
- break;
- }
- first = false;
- }
- return containsEsc ? word : input.slice(start, tokPos);
- }
+// Raise an unexpected token error.
- // Read an identifier or keyword token. Will check for reserved
- // words when necessary.
+pp.unexpected = function (pos) {
+ this.raise(pos != null ? pos : this.start, "Unexpected token");
+};
- function readWord() {
- var word = readWord1();
- var type = _name;
- if (!containsEsc) {
- if (isKeyword(word)) type = keywordTypes[word];
- else if (options.forbidReserved &&
- (options.ecmaVersion === 3 ? isReservedWord3 : isReservedWord5)(word) ||
- strict && isStrictReservedWord(word))
- raise(tokStart, "The keyword '" + word + "' is reserved");
- }
- return finishToken(type, word);
- }
+pp.checkPatternErrors = function (refDestructuringErrors, andThrow) {
+ var pos = refDestructuringErrors && refDestructuringErrors.trailingComma;
+ if (!andThrow) return !!pos;
+ if (pos) this.raise(pos, "Comma is not permitted after the rest element");
+};
- // ## Parser
+pp.checkExpressionErrors = function (refDestructuringErrors, andThrow) {
+ var pos = refDestructuringErrors && refDestructuringErrors.shorthandAssign;
+ if (!andThrow) return !!pos;
+ if (pos) this.raise(pos, "Shorthand property assignments are valid only in destructuring patterns");
+};
- // A recursive descent parser operates by defining functions for all
- // syntactic elements, and recursively calling those, each function
- // advancing the input stream and returning an AST node. Precedence
- // of constructs (for example, the fact that `!x[1]` means `!(x[1])`
- // instead of `(!x)[1]` is handled by the fact that the parser
- // function that parses unary prefix operators is called first, and
- // in turn calls the function that parses `[]` subscripts — that
- // way, it'll receive the node for `x[1]` already parsed, and wraps
- // *that* in the unary operator node.
- //
- // Acorn uses an [operator precedence parser][opp] to handle binary
- // operator precedence, because it is much more compact than using
- // the technique outlined above, which uses different, nesting
- // functions to specify precedence, for all of the ten binary
- // precedence levels that JavaScript defines.
- //
- // [opp]: http://en.wikipedia.org/wiki/Operator-precedence_parser
+},{"./state":10,"./tokentype":14,"./whitespace":16}],10:[function(_dereq_,module,exports){
+"use strict";
- // ### Parser utilities
+exports.__esModule = true;
- // Continue to the next token.
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new
TypeError("Cannot call a class as a function"); } }
- function next() {
- lastStart = tokStart;
- lastEnd = tokEnd;
- lastEndLoc = tokEndLoc;
- readToken();
- }
+var _identifier = _dereq_("./identifier");
- // Enter strict mode. Re-reads the next token to please pedantic
- // tests ("use strict"; 010; -- should fail).
+var _tokentype = _dereq_("./tokentype");
- function setStrict(strct) {
- strict = strct;
- tokPos = lastEnd;
- if (options.locations) {
- while (tokPos < tokLineStart) {
- tokLineStart = input.lastIndexOf("\n", tokLineStart - 2) + 1;
- --tokCurLine;
- }
- }
- skipSpace();
- readToken();
- }
+var _whitespace = _dereq_("./whitespace");
- // Start an AST node, attaching a start offset.
+var _options = _dereq_("./options");
- function node_t() {
- this.type = null;
- this.start = tokStart;
- this.end = null;
- }
+// Registered plugins
+var plugins = {};
- function node_loc_t() {
- this.start = tokStartLoc;
- this.end = null;
- if (sourceFile !== null) this.source = sourceFile;
- }
+exports.plugins = plugins;
+function keywordRegexp(words) {
+ return new RegExp("^(" + words.replace(/ /g, "|") + ")$");
+}
- function startNode() {
- var node = new node_t();
- if (options.locations)
- node.loc = new node_loc_t();
- if (options.directSourceFile)
- node.sourceFile = options.directSourceFile;
- if (options.ranges)
- node.range = [tokStart, 0];
- return node;
- }
+var Parser = (function () {
+ function Parser(options, input, startPos) {
+ _classCallCheck(this, Parser);
+
+ this.options = options = _options.getOptions(options);
+ this.sourceFile = options.sourceFile;
+ this.keywords = keywordRegexp(_identifier.keywords[options.ecmaVersion >= 6 ? 6 : 5]);
+ var reserved = options.allowReserved ? "" : _identifier.reservedWords[options.ecmaVersion] +
(options.sourceType == "module" ? " await" : "");
+ this.reservedWords = keywordRegexp(reserved);
+ var reservedStrict = (reserved ? reserved + " " : "") + _identifier.reservedWords.strict;
+ this.reservedWordsStrict = keywordRegexp(reservedStrict);
+ this.reservedWordsStrictBind = keywordRegexp(reservedStrict + " " +
_identifier.reservedWords.strictBind);
+ this.input = String(input);
+
+ // Used to signal to callers of `readWord1` whether the word
+ // contained any escape sequences. This is needed because words with
+ // escape sequences must not be interpreted as keywords.
+ this.containsEsc = false;
- // Start a node whose start offset information should be based on
- // the start of another node. For example, a binary operator node is
- // only started after its left-hand side has already been parsed.
+ // Load plugins
+ this.loadPlugins(options.plugins);
- function startNodeFrom(other) {
- var node = new node_t();
- node.start = other.start;
- if (options.locations) {
- node.loc = new node_loc_t();
- node.loc.start = other.loc.start;
+ // Set up token state
+
+ // The current position of the tokenizer in the input.
+ if (startPos) {
+ this.pos = startPos;
+ this.lineStart = Math.max(0, this.input.lastIndexOf("\n", startPos));
+ this.curLine = this.input.slice(0, this.lineStart).split(_whitespace.lineBreak).length;
+ } else {
+ this.pos = this.lineStart = 0;
+ this.curLine = 1;
}
- if (options.ranges)
- node.range = [other.range[0], 0];
- return node;
- }
+ // Properties of the current token:
+ // Its type
+ this.type = _tokentype.types.eof;
+ // For tokens that include more information than their type, the value
+ this.value = null;
+ // Its start and end offset
+ this.start = this.end = this.pos;
+ // And, if locations are used, the {line, column} object
+ // corresponding to those offsets
+ this.startLoc = this.endLoc = this.curPosition();
- // Finish an AST node, adding `type` and `end` properties.
+ // Position information for the previous token
+ this.lastTokEndLoc = this.lastTokStartLoc = null;
+ this.lastTokStart = this.lastTokEnd = this.pos;
- function finishNode(node, type) {
- node.type = type;
- node.end = lastEnd;
- if (options.locations)
- node.loc.end = lastEndLoc;
- if (options.ranges)
- node.range[1] = lastEnd;
- return node;
- }
+ // The context stack is used to superficially track syntactic
+ // context to predict whether a regular expression is allowed in a
+ // given position.
+ this.context = this.initialContext();
+ this.exprAllowed = true;
- // Test whether a statement node is the string literal `"use strict"`.
+ // Figure out if it's a module code.
+ this.strict = this.inModule = options.sourceType === "module";
- function isUseStrict(stmt) {
- return options.ecmaVersion >= 5 && stmt.type === "ExpressionStatement" &&
- stmt.expression.type === "Literal" && stmt.expression.value === "use strict";
- }
+ // Used to signify the start of a potential arrow function
+ this.potentialArrowAt = -1;
- // Predicate that tests whether the next token is of the given
- // type, and if yes, consumes it as a side effect.
+ // Flags to track whether we are in a function, a generator.
+ this.inFunction = this.inGenerator = false;
+ // Labels in scope.
+ this.labels = [];
- function eat(type) {
- if (tokType === type) {
- next();
- return true;
- }
+ // If enabled, skip leading hashbang line.
+ if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === '#!') this.skipLineComment(2);
}
- // Test whether a semicolon can be inserted at the current position.
+ // DEPRECATED Kept for backwards compatibility until 3.0 in case a plugin uses them
- function canInsertSemicolon() {
- return !options.strictSemicolons &&
- (tokType === _eof || tokType === _braceR || newline.test(input.slice(lastEnd, tokStart)));
- }
+ Parser.prototype.isKeyword = function isKeyword(word) {
+ return this.keywords.test(word);
+ };
- // Consume a semicolon, or, failing that, see if we are allowed to
- // pretend that there is a semicolon at this position.
+ Parser.prototype.isReservedWord = function isReservedWord(word) {
+ return this.reservedWords.test(word);
+ };
- function semicolon() {
- if (!eat(_semi) && !canInsertSemicolon()) unexpected();
- }
+ Parser.prototype.extend = function extend(name, f) {
+ this[name] = f(this[name]);
+ };
+
+ Parser.prototype.loadPlugins = function loadPlugins(pluginConfigs) {
+ for (var _name in pluginConfigs) {
+ var plugin = plugins[_name];
+ if (!plugin) throw new Error("Plugin '" + _name + "' not found");
+ plugin(this, pluginConfigs[_name]);
+ }
+ };
- // Expect a token of a given type. If found, consume it, otherwise,
- // raise an unexpected token error.
+ Parser.prototype.parse = function parse() {
+ var node = this.options.program || this.startNode();
+ this.nextToken();
+ return this.parseTopLevel(node);
+ };
- function expect(type) {
- if (tokType === type) next();
- else unexpected();
- }
+ return Parser;
+})();
- // Raise an unexpected token error.
+exports.Parser = Parser;
- function unexpected() {
- raise(tokStart, "Unexpected token");
- }
+},{"./identifier":2,"./options":8,"./tokentype":14,"./whitespace":16}],11:[function(_dereq_,module,exports){
+"use strict";
- // Verify that a node is an lval — something that can be assigned
- // to.
+var _tokentype = _dereq_("./tokentype");
- function checkLVal(expr) {
- if (expr.type !== "Identifier" && expr.type !== "MemberExpression")
- raise(expr.start, "Assigning to rvalue");
- if (strict && expr.type === "Identifier" && isStrictBadIdWord(expr.name))
- raise(expr.start, "Assigning to " + expr.name + " in strict mode");
- }
+var _state = _dereq_("./state");
+
+var _whitespace = _dereq_("./whitespace");
- // ### Statement parsing
+var _identifier = _dereq_("./identifier");
- // Parse a program. Initializes the parser, reads any number of
- // statements, and wraps them in a Program node. Optionally takes a
- // `program` argument. If present, the statements will be appended
- // to its body instead of creating a new node.
+var pp = _state.Parser.prototype;
- function parseTopLevel(program) {
- lastStart = lastEnd = tokPos;
- if (options.locations) lastEndLoc = new line_loc_t;
- inFunction = strict = null;
- labels = [];
- readToken();
+// ### Statement parsing
- var node = program || startNode(), first = true;
- if (!program) node.body = [];
- while (tokType !== _eof) {
- var stmt = parseStatement();
- node.body.push(stmt);
- if (first && isUseStrict(stmt)) setStrict(true);
+// Parse a program. Initializes the parser, reads any number of
+// statements, and wraps them in a Program node. Optionally takes a
+// `program` argument. If present, the statements will be appended
+// to its body instead of creating a new node.
+
+pp.parseTopLevel = function (node) {
+ var first = true;
+ if (!node.body) node.body = [];
+ while (this.type !== _tokentype.types.eof) {
+ var stmt = this.parseStatement(true, true);
+ node.body.push(stmt);
+ if (first) {
+ if (this.isUseStrict(stmt)) this.setStrict(true);
first = false;
}
- return finishNode(node, "Program");
}
+ this.next();
+ if (this.options.ecmaVersion >= 6) {
+ node.sourceType = this.options.sourceType;
+ }
+ return this.finishNode(node, "Program");
+};
- var loopLabel = {kind: "loop"}, switchLabel = {kind: "switch"};
+var loopLabel = { kind: "loop" },
+ switchLabel = { kind: "switch" };
- // Parse a single statement.
- //
- // If expecting a statement and finding a slash operator, parse a
- // regular expression literal. This is to handle cases like
- // `if (foo) /blah/.exec(foo);`, where looking at the previous token
- // does not help.
-
- function parseStatement() {
- if (tokType === _slash || tokType === _assign && tokVal == "/=")
- readToken(true);
-
- var starttype = tokType, node = startNode();
-
- // Most types of statements are recognized by the keyword they
- // start with. Many are trivial to parse, some require a bit of
- // complexity.
-
- switch (starttype) {
- case _break: case _continue:
- next();
- var isBreak = starttype === _break;
- if (eat(_semi) || canInsertSemicolon()) node.label = null;
- else if (tokType !== _name) unexpected();
- else {
- node.label = parseIdent();
- semicolon();
- }
+pp.isLet = function () {
+ if (this.type !== _tokentype.types.name || this.options.ecmaVersion < 6 || this.value != "let") return
false;
+ _whitespace.skipWhiteSpace.lastIndex = this.pos;
+ var skip = _whitespace.skipWhiteSpace.exec(this.input);
+ var next = this.pos + skip[0].length,
+ nextCh = this.input.charCodeAt(next);
+ if (nextCh === 91 || nextCh == 123) return true; // '{' and '['
+ if (_identifier.isIdentifierStart(nextCh, true)) {
+ for (var pos = next + 1; _identifier.isIdentifierChar(this.input.charCodeAt(pos, true)); ++pos) {}
+ var ident = this.input.slice(next, pos);
+ if (!this.isKeyword(ident)) return true;
+ }
+ return false;
+};
- // Verify that there is an actual destination to break or
- // continue to.
- for (var i = 0; i < labels.length; ++i) {
- var lab = labels[i];
- if (node.label == null || lab.name === node.label.name) {
- if (lab.kind != null && (isBreak || lab.kind === "loop")) break;
- if (node.label && isBreak) break;
- }
- }
- if (i === labels.length) raise(node.start, "Unsyntactic " + starttype.keyword);
- return finishNode(node, isBreak ? "BreakStatement" : "ContinueStatement");
-
- case _debugger:
- next();
- semicolon();
- return finishNode(node, "DebuggerStatement");
-
- case _do:
- next();
- labels.push(loopLabel);
- node.body = parseStatement();
- labels.pop();
- expect(_while);
- node.test = parseParenExpression();
- semicolon();
- return finishNode(node, "DoWhileStatement");
-
- // Disambiguating between a `for` and a `for`/`in` loop is
- // non-trivial. Basically, we have to parse the init `var`
- // statement or expression, disallowing the `in` operator (see
- // the second parameter to `parseExpression`), and then check
- // whether the next token is `in`. When there is no init part
- // (semicolon immediately after the opening parenthesis), it is
- // a regular `for` loop.
-
- case _for:
- next();
- labels.push(loopLabel);
- expect(_parenL);
- if (tokType === _semi) return parseFor(node, null);
- if (tokType === _var || tokType === _let) {
- var init = startNode();
- next();
- parseVar(init, true, tokType === _var ? 'var' : 'let');
- finishNode(init, "VariableDeclaration");
- if (init.declarations.length === 1 && eat(_in))
- return parseForIn(node, init);
- return parseFor(node, init);
- }
- var init = parseExpression(false, true);
- if (eat(_in)) {checkLVal(init); return parseForIn(node, init);}
- return parseFor(node, init);
-
- case _function:
- next();
- return parseFunction(node, true);
-
- case _if:
- next();
- node.test = parseParenExpression();
- node.consequent = parseStatement();
- node.alternate = eat(_else) ? parseStatement() : null;
- return finishNode(node, "IfStatement");
-
- case _return:
- if (!inFunction) raise(tokStart, "'return' outside of function");
- next();
-
- // In `return` (and `break`/`continue`), the keywords with
- // optional arguments, we eagerly look for a semicolon or the
- // possibility to insert one.
-
- if (eat(_semi) || canInsertSemicolon()) node.argument = null;
- else { node.argument = parseExpression(); semicolon(); }
- return finishNode(node, "ReturnStatement");
-
- case _switch:
- next();
- node.discriminant = parseParenExpression();
- node.cases = [];
- expect(_braceL);
- labels.push(switchLabel);
-
- // Statements under must be grouped (by label) in SwitchCase
- // nodes. `cur` is used to keep the node that we are currently
- // adding statements to.
-
- for (var cur, sawDefault; tokType != _braceR;) {
- if (tokType === _case || tokType === _default) {
- var isCase = tokType === _case;
- if (cur) finishNode(cur, "SwitchCase");
- node.cases.push(cur = startNode());
- cur.consequent = [];
- next();
- if (isCase) cur.test = parseExpression();
- else {
- if (sawDefault) raise(lastStart, "Multiple default clauses"); sawDefault = true;
- cur.test = null;
- }
- expect(_colon);
- } else {
- if (!cur) unexpected();
- cur.consequent.push(parseStatement());
- }
- }
- if (cur) finishNode(cur, "SwitchCase");
- next(); // Closing brace
- labels.pop();
- return finishNode(node, "SwitchStatement");
-
- case _throw:
- next();
- if (newline.test(input.slice(lastEnd, tokStart)))
- raise(lastEnd, "Illegal newline after throw");
- node.argument = parseExpression();
- semicolon();
- return finishNode(node, "ThrowStatement");
-
- case _try:
- next();
- node.block = parseBlock();
- node.handler = null;
- if (tokType === _catch) {
- var clause = startNode();
- next();
- expect(_parenL);
- clause.param = parseIdent();
- if (strict && isStrictBadIdWord(clause.param.name))
- raise(clause.param.start, "Binding " + clause.param.name + " in strict mode");
- expect(_parenR);
- clause.guard = null;
- clause.body = parseBlock();
- node.handler = finishNode(clause, "CatchClause");
- }
- node.guardedHandlers = empty;
- node.finalizer = eat(_finally) ? parseBlock() : null;
- if (!node.handler && !node.finalizer)
- raise(node.start, "Missing catch or finally clause");
- return finishNode(node, "TryStatement");
-
- case _var:
- next();
- parseVar(node, false, 'var');
- semicolon();
- return finishNode(node, "VariableDeclaration");
-
- case _let:
- next();
- if (eat(_parenL)) {
- parseLetStatementOrExpression(node);
- expect(_paranR);
- semicolon();
- return finishNode(node, node.type);
- } else {
- parseVar(node, false, 'let');
- semicolon();
- return finishNode(node, "VariableDeclaration");
+// Parse a single statement.
+//
+// If expecting a statement and finding a slash operator, parse a
+// regular expression literal. This is to handle cases like
+// `if (foo) /blah/.exec(foo)`, where looking at the previous token
+// does not help.
+
+pp.parseStatement = function (declaration, topLevel) {
+ var starttype = this.type,
+ node = this.startNode(),
+ kind = undefined;
+
+ if (this.isLet()) {
+ starttype = _tokentype.types._var;
+ kind = "let";
+ }
+
+ // Most types of statements are recognized by the keyword they
+ // start with. Many are trivial to parse, some require a bit of
+ // complexity.
+
+ switch (starttype) {
+ case _tokentype.types._break:case _tokentype.types._continue:
+ return this.parseBreakContinueStatement(node, starttype.keyword);
+ case _tokentype.types._debugger:
+ return this.parseDebuggerStatement(node);
+ case _tokentype.types._do:
+ return this.parseDoStatement(node);
+ case _tokentype.types._for:
+ return this.parseForStatement(node);
+ case _tokentype.types._function:
+ if (!declaration && this.options.ecmaVersion >= 6) this.unexpected();
+ return this.parseFunctionStatement(node);
+ case _tokentype.types._class:
+ if (!declaration) this.unexpected();
+ return this.parseClass(node, true);
+ case _tokentype.types._if:
+ return this.parseIfStatement(node);
+ case _tokentype.types._return:
+ return this.parseReturnStatement(node);
+ case _tokentype.types._switch:
+ return this.parseSwitchStatement(node);
+ case _tokentype.types._throw:
+ return this.parseThrowStatement(node);
+ case _tokentype.types._try:
+ return this.parseTryStatement(node);
+ case _tokentype.types._const:case _tokentype.types._var:
+ kind = kind || this.value;
+ if (!declaration && kind != "var") this.unexpected();
+ return this.parseVarStatement(node, kind);
+ case _tokentype.types._while:
+ return this.parseWhileStatement(node);
+ case _tokentype.types._with:
+ return this.parseWithStatement(node);
+ case _tokentype.types.braceL:
+ return this.parseBlock();
+ case _tokentype.types.semi:
+ return this.parseEmptyStatement(node);
+ case _tokentype.types._export:
+ case _tokentype.types._import:
+ if (!this.options.allowImportExportEverywhere) {
+ if (!topLevel) this.raise(this.start, "'import' and 'export' may only appear at the top level");
+ if (!this.inModule) this.raise(this.start, "'import' and 'export' may appear only with 'sourceType:
module'");
}
+ return starttype === _tokentype.types._import ? this.parseImport(node) : this.parseExport(node);
- case _const:
- next();
- parseVar(node, false, 'const');
- semicolon();
- return finishNode(node, "VariableDeclaration");
-
- case _while:
- next();
- node.test = parseParenExpression();
- labels.push(loopLabel);
- node.body = parseStatement();
- labels.pop();
- return finishNode(node, "WhileStatement");
-
- case _with:
- if (strict) raise(tokStart, "'with' in strict mode");
- next();
- node.object = parseParenExpression();
- node.body = parseStatement();
- return finishNode(node, "WithStatement");
-
- case _braceL:
- return parseBlock();
-
- case _semi:
- next();
- return finishNode(node, "EmptyStatement");
-
- // If the statement does not start with a statement keyword or a
- // brace, it's an ExpressionStatement or LabeledStatement. We
- // simply start parsing an expression, and afterwards, if the
- // next token is a colon and the expression was a simple
- // Identifier node, we switch to interpreting it as a label.
-
+ // If the statement does not start with a statement keyword or a
+ // brace, it's an ExpressionStatement or LabeledStatement. We
+ // simply start parsing an expression, and afterwards, if the
+ // next token is a colon and the expression was a simple
+ // Identifier node, we switch to interpreting it as a label.
default:
- var maybeName = tokVal, expr = parseExpression();
- if (starttype === _name && expr.type === "Identifier" && eat(_colon)) {
- for (var i = 0; i < labels.length; ++i)
- if (labels[i].name === maybeName) raise(expr.start, "Label '" + maybeName + "' is already
declared");
- var kind = tokType.isLoop ? "loop" : tokType === _switch ? "switch" : null;
- labels.push({name: maybeName, kind: kind});
- node.body = parseStatement();
- labels.pop();
- node.label = expr;
- return finishNode(node, "LabeledStatement");
+ var maybeName = this.value,
+ expr = this.parseExpression();
+ if (starttype === _tokentype.types.name && expr.type === "Identifier" &&
this.eat(_tokentype.types.colon)) return this.parseLabeledStatement(node, maybeName, expr);else return
this.parseExpressionStatement(node, expr);
+ }
+};
+
+pp.parseBreakContinueStatement = function (node, keyword) {
+ var isBreak = keyword == "break";
+ this.next();
+ if (this.eat(_tokentype.types.semi) || this.insertSemicolon()) node.label = null;else if (this.type !==
_tokentype.types.name) this.unexpected();else {
+ node.label = this.parseIdent();
+ this.semicolon();
+ }
+
+ // Verify that there is an actual destination to break or
+ // continue to.
+ for (var i = 0; i < this.labels.length; ++i) {
+ var lab = this.labels[i];
+ if (node.label == null || lab.name === node.label.name) {
+ if (lab.kind != null && (isBreak || lab.kind === "loop")) break;
+ if (node.label && isBreak) break;
+ }
+ }
+ if (i === this.labels.length) this.raise(node.start, "Unsyntactic " + keyword);
+ return this.finishNode(node, isBreak ? "BreakStatement" : "ContinueStatement");
+};
+
+pp.parseDebuggerStatement = function (node) {
+ this.next();
+ this.semicolon();
+ return this.finishNode(node, "DebuggerStatement");
+};
+
+pp.parseDoStatement = function (node) {
+ this.next();
+ this.labels.push(loopLabel);
+ node.body = this.parseStatement(false);
+ this.labels.pop();
+ this.expect(_tokentype.types._while);
+ node.test = this.parseParenExpression();
+ if (this.options.ecmaVersion >= 6) this.eat(_tokentype.types.semi);else this.semicolon();
+ return this.finishNode(node, "DoWhileStatement");
+};
+
+// Disambiguating between a `for` and a `for`/`in` or `for`/`of`
+// loop is non-trivial. Basically, we have to parse the init `var`
+// statement or expression, disallowing the `in` operator (see
+// the second parameter to `parseExpression`), and then check
+// whether the next token is `in` or `of`. When there is no init
+// part (semicolon immediately after the opening parenthesis), it
+// is a regular `for` loop.
+
+pp.parseForStatement = function (node) {
+ this.next();
+ this.labels.push(loopLabel);
+ this.expect(_tokentype.types.parenL);
+ if (this.type === _tokentype.types.semi) return this.parseFor(node, null);
+ var isLet = this.isLet();
+ if (this.type === _tokentype.types._var || this.type === _tokentype.types._const || isLet) {
+ var _init = this.startNode(),
+ kind = isLet ? "let" : this.value;
+ this.next();
+ this.parseVar(_init, true, kind);
+ this.finishNode(_init, "VariableDeclaration");
+ if ((this.type === _tokentype.types._in || this.options.ecmaVersion >= 6 && this.isContextual("of")) &&
_init.declarations.length === 1 && !(kind !== "var" && _init.declarations[0].init)) return
this.parseForIn(node, _init);
+ return this.parseFor(node, _init);
+ }
+ var refDestructuringErrors = { shorthandAssign: 0, trailingComma: 0 };
+ var init = this.parseExpression(true, refDestructuringErrors);
+ if (this.type === _tokentype.types._in || this.options.ecmaVersion >= 6 && this.isContextual("of")) {
+ this.checkPatternErrors(refDestructuringErrors, true);
+ this.toAssignable(init);
+ this.checkLVal(init);
+ return this.parseForIn(node, init);
+ } else {
+ this.checkExpressionErrors(refDestructuringErrors, true);
+ }
+ return this.parseFor(node, init);
+};
+
+pp.parseFunctionStatement = function (node) {
+ this.next();
+ return this.parseFunction(node, true);
+};
+
+pp.parseIfStatement = function (node) {
+ this.next();
+ node.test = this.parseParenExpression();
+ node.consequent = this.parseStatement(false);
+ node.alternate = this.eat(_tokentype.types._else) ? this.parseStatement(false) : null;
+ return this.finishNode(node, "IfStatement");
+};
+
+pp.parseReturnStatement = function (node) {
+ if (!this.inFunction && !this.options.allowReturnOutsideFunction) this.raise(this.start, "'return' outside
of function");
+ this.next();
+
+ // In `return` (and `break`/`continue`), the keywords with
+ // optional arguments, we eagerly look for a semicolon or the
+ // possibility to insert one.
+
+ if (this.eat(_tokentype.types.semi) || this.insertSemicolon()) node.argument = null;else {
+ node.argument = this.parseExpression();this.semicolon();
+ }
+ return this.finishNode(node, "ReturnStatement");
+};
+
+pp.parseSwitchStatement = function (node) {
+ this.next();
+ node.discriminant = this.parseParenExpression();
+ node.cases = [];
+ this.expect(_tokentype.types.braceL);
+ this.labels.push(switchLabel);
+
+ // Statements under must be grouped (by label) in SwitchCase
+ // nodes. `cur` is used to keep the node that we are currently
+ // adding statements to.
+
+ for (var cur, sawDefault = false; this.type != _tokentype.types.braceR;) {
+ if (this.type === _tokentype.types._case || this.type === _tokentype.types._default) {
+ var isCase = this.type === _tokentype.types._case;
+ if (cur) this.finishNode(cur, "SwitchCase");
+ node.cases.push(cur = this.startNode());
+ cur.consequent = [];
+ this.next();
+ if (isCase) {
+ cur.test = this.parseExpression();
} else {
- node.expression = expr;
- semicolon();
- return finishNode(node, "ExpressionStatement");
+ if (sawDefault) this.raiseRecoverable(this.lastTokStart, "Multiple default clauses");
+ sawDefault = true;
+ cur.test = null;
}
+ this.expect(_tokentype.types.colon);
+ } else {
+ if (!cur) this.unexpected();
+ cur.consequent.push(this.parseStatement(true));
}
}
-
- // Used for constructs like `switch` and `if` that insist on
- // parentheses around their expression.
-
- function parseParenExpression() {
- expect(_parenL);
- var val = parseExpression();
- expect(_parenR);
- return val;
- }
-
- // Parse a semicolon-enclosed block of statements, handling `"use
- // strict"` declarations when `allowStrict` is true (used for
- // function bodies).
-
- function parseBlock(allowStrict) {
- var node = startNode(), first = true, strict = false, oldStrict;
- node.body = [];
- expect(_braceL);
- while (!eat(_braceR)) {
- var stmt = parseStatement();
- node.body.push(stmt);
- if (first && allowStrict && isUseStrict(stmt)) {
- oldStrict = strict;
- setStrict(strict = true);
+ if (cur) this.finishNode(cur, "SwitchCase");
+ this.next(); // Closing brace
+ this.labels.pop();
+ return this.finishNode(node, "SwitchStatement");
+};
+
+pp.parseThrowStatement = function (node) {
+ this.next();
+ if (_whitespace.lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) this.raise(this.lastTokEnd,
"Illegal newline after throw");
+ node.argument = this.parseExpression();
+ this.semicolon();
+ return this.finishNode(node, "ThrowStatement");
+};
+
+// Reused empty array added for node fields that are always empty.
+
+var empty = [];
+
+pp.parseTryStatement = function (node) {
+ this.next();
+ node.block = this.parseBlock();
+ node.handler = null;
+ if (this.type === _tokentype.types._catch) {
+ var clause = this.startNode();
+ this.next();
+ this.expect(_tokentype.types.parenL);
+ clause.param = this.parseBindingAtom();
+ this.checkLVal(clause.param, true);
+ this.expect(_tokentype.types.parenR);
+ clause.body = this.parseBlock();
+ node.handler = this.finishNode(clause, "CatchClause");
+ }
+ node.finalizer = this.eat(_tokentype.types._finally) ? this.parseBlock() : null;
+ if (!node.handler && !node.finalizer) this.raise(node.start, "Missing catch or finally clause");
+ return this.finishNode(node, "TryStatement");
+};
+
+pp.parseVarStatement = function (node, kind) {
+ this.next();
+ this.parseVar(node, false, kind);
+ this.semicolon();
+ return this.finishNode(node, "VariableDeclaration");
+};
+
+pp.parseWhileStatement = function (node) {
+ this.next();
+ node.test = this.parseParenExpression();
+ this.labels.push(loopLabel);
+ node.body = this.parseStatement(false);
+ this.labels.pop();
+ return this.finishNode(node, "WhileStatement");
+};
+
+pp.parseWithStatement = function (node) {
+ if (this.strict) this.raise(this.start, "'with' in strict mode");
+ this.next();
+ node.object = this.parseParenExpression();
+ node.body = this.parseStatement(false);
+ return this.finishNode(node, "WithStatement");
+};
+
+pp.parseEmptyStatement = function (node) {
+ this.next();
+ return this.finishNode(node, "EmptyStatement");
+};
+
+pp.parseLabeledStatement = function (node, maybeName, expr) {
+ for (var i = 0; i < this.labels.length; ++i) {
+ if (this.labels[i].name === maybeName) this.raise(expr.start, "Label '" + maybeName + "' is already
declared");
+ }var kind = this.type.isLoop ? "loop" : this.type === _tokentype.types._switch ? "switch" : null;
+ for (var i = this.labels.length - 1; i >= 0; i--) {
+ var label = this.labels[i];
+ if (label.statementStart == node.start) {
+ label.statementStart = this.start;
+ label.kind = kind;
+ } else break;
+ }
+ this.labels.push({ name: maybeName, kind: kind, statementStart: this.start });
+ node.body = this.parseStatement(true);
+ this.labels.pop();
+ node.label = expr;
+ return this.finishNode(node, "LabeledStatement");
+};
+
+pp.parseExpressionStatement = function (node, expr) {
+ node.expression = expr;
+ this.semicolon();
+ return this.finishNode(node, "ExpressionStatement");
+};
+
+// Parse a semicolon-enclosed block of statements, handling `"use
+// strict"` declarations when `allowStrict` is true (used for
+// function bodies).
+
+pp.parseBlock = function (allowStrict) {
+ var node = this.startNode(),
+ first = true,
+ oldStrict = undefined;
+ node.body = [];
+ this.expect(_tokentype.types.braceL);
+ while (!this.eat(_tokentype.types.braceR)) {
+ var stmt = this.parseStatement(true);
+ node.body.push(stmt);
+ if (first && allowStrict && this.isUseStrict(stmt)) {
+ oldStrict = this.strict;
+ this.setStrict(this.strict = true);
+ }
+ first = false;
+ }
+ if (oldStrict === false) this.setStrict(false);
+ return this.finishNode(node, "BlockStatement");
+};
+
+// Parse a regular `for` loop. The disambiguation code in
+// `parseStatement` will already have parsed the init statement or
+// expression.
+
+pp.parseFor = function (node, init) {
+ node.init = init;
+ this.expect(_tokentype.types.semi);
+ node.test = this.type === _tokentype.types.semi ? null : this.parseExpression();
+ this.expect(_tokentype.types.semi);
+ node.update = this.type === _tokentype.types.parenR ? null : this.parseExpression();
+ this.expect(_tokentype.types.parenR);
+ node.body = this.parseStatement(false);
+ this.labels.pop();
+ return this.finishNode(node, "ForStatement");
+};
+
+// Parse a `for`/`in` and `for`/`of` loop, which are almost
+// same from parser's perspective.
+
+pp.parseForIn = function (node, init) {
+ var type = this.type === _tokentype.types._in ? "ForInStatement" : "ForOfStatement";
+ this.next();
+ node.left = init;
+ node.right = this.parseExpression();
+ this.expect(_tokentype.types.parenR);
+ node.body = this.parseStatement(false);
+ this.labels.pop();
+ return this.finishNode(node, type);
+};
+
+// Parse a list of variable declarations.
+
+pp.parseVar = function (node, isFor, kind) {
+ node.declarations = [];
+ node.kind = kind;
+ for (;;) {
+ var decl = this.startNode();
+ this.parseVarId(decl);
+ if (this.eat(_tokentype.types.eq)) {
+ decl.init = this.parseMaybeAssign(isFor);
+ } else if (kind === "const" && !(this.type === _tokentype.types._in || this.options.ecmaVersion >= 6 &&
this.isContextual("of"))) {
+ this.unexpected();
+ } else if (decl.id.type != "Identifier" && !(isFor && (this.type === _tokentype.types._in ||
this.isContextual("of")))) {
+ this.raise(this.lastTokEnd, "Complex binding patterns require an initialization value");
+ } else {
+ decl.init = null;
+ }
+ node.declarations.push(this.finishNode(decl, "VariableDeclarator"));
+ if (!this.eat(_tokentype.types.comma)) break;
+ }
+ return node;
+};
+
+pp.parseVarId = function (decl) {
+ decl.id = this.parseBindingAtom();
+ this.checkLVal(decl.id, true);
+};
+
+// Parse a function declaration or literal (depending on the
+// `isStatement` parameter).
+
+pp.parseFunction = function (node, isStatement, allowExpressionBody) {
+ this.initFunction(node);
+ if (this.options.ecmaVersion >= 6) node.generator = this.eat(_tokentype.types.star);
+ var oldInGen = this.inGenerator;
+ this.inGenerator = node.generator;
+ if (isStatement || this.type === _tokentype.types.name) node.id = this.parseIdent();
+ this.parseFunctionParams(node);
+ this.parseFunctionBody(node, allowExpressionBody);
+ this.inGenerator = oldInGen;
+ return this.finishNode(node, isStatement ? "FunctionDeclaration" : "FunctionExpression");
+};
+
+pp.parseFunctionParams = function (node) {
+ this.expect(_tokentype.types.parenL);
+ node.params = this.parseBindingList(_tokentype.types.parenR, false, false, true);
+};
+
+// Parse a class declaration or literal (depending on the
+// `isStatement` parameter).
+
+pp.parseClass = function (node, isStatement) {
+ this.next();
+ this.parseClassId(node, isStatement);
+ this.parseClassSuper(node);
+ var classBody = this.startNode();
+ var hadConstructor = false;
+ classBody.body = [];
+ this.expect(_tokentype.types.braceL);
+ while (!this.eat(_tokentype.types.braceR)) {
+ if (this.eat(_tokentype.types.semi)) continue;
+ var method = this.startNode();
+ var isGenerator = this.eat(_tokentype.types.star);
+ var isMaybeStatic = this.type === _tokentype.types.name && this.value === "static";
+ this.parsePropertyName(method);
+ method["static"] = isMaybeStatic && this.type !== _tokentype.types.parenL;
+ if (method["static"]) {
+ if (isGenerator) this.unexpected();
+ isGenerator = this.eat(_tokentype.types.star);
+ this.parsePropertyName(method);
+ }
+ method.kind = "method";
+ var isGetSet = false;
+ if (!method.computed) {
+ var key = method.key;
+
+ if (!isGenerator && key.type === "Identifier" && this.type !== _tokentype.types.parenL && (key.name
=== "get" || key.name === "set")) {
+ isGetSet = true;
+ method.kind = key.name;
+ key = this.parsePropertyName(method);
+ }
+ if (!method["static"] && (key.type === "Identifier" && key.name === "constructor" || key.type ===
"Literal" && key.value === "constructor")) {
+ if (hadConstructor) this.raise(key.start, "Duplicate constructor in the same class");
+ if (isGetSet) this.raise(key.start, "Constructor can't have get/set modifier");
+ if (isGenerator) this.raise(key.start, "Constructor can't be a generator");
+ method.kind = "constructor";
+ hadConstructor = true;
}
- first = false;
}
- if (strict && !oldStrict) setStrict(false);
- return finishNode(node, "BlockStatement");
- }
-
- // Parse a regular `for` loop. The disambiguation code in
- // `parseStatement` will already have parsed the init statement or
- // expression.
-
- function parseFor(node, init) {
- node.init = init;
- expect(_semi);
- node.test = tokType === _semi ? null : parseExpression();
- expect(_semi);
- node.update = tokType === _parenR ? null : parseExpression();
- expect(_parenR);
- node.body = parseStatement();
- labels.pop();
- return finishNode(node, "ForStatement");
- }
-
- // Parse a `for`/`in` loop.
-
- function parseForIn(node, init) {
- node.left = init;
- node.right = parseExpression();
- expect(_parenR);
- node.body = parseStatement();
- labels.pop();
- return finishNode(node, "ForInStatement");
- }
-
- // Parse a list of variable declarations.
-
- function parseVarDecl(decls, noIn) {
- for (;;) {
- var decl = startNode();
- decl.id = parseIdent();
- if (strict && isStrictBadIdWord(decl.id.name))
- raise(decl.id.start, "Binding " + decl.id.name + " in strict mode");
- decl.init = eat(_eq) ? parseExpression(true, noIn) : null;
- decls.push(finishNode(decl, "VariableDeclarator"));
- if (!eat(_comma)) break;
+ this.parseClassMethod(classBody, method, isGenerator);
+ if (isGetSet) {
+ var paramCount = method.kind === "get" ? 0 : 1;
+ if (method.value.params.length !== paramCount) {
+ var start = method.value.start;
+ if (method.kind === "get") this.raiseRecoverable(start, "getter should have no params");else
this.raiseRecoverable(start, "setter should have exactly one param");
+ }
+ if (method.kind === "set" && method.value.params[0].type === "RestElement")
this.raise(method.value.params[0].start, "Setter cannot use rest params");
}
}
+ node.body = this.finishNode(classBody, "ClassBody");
+ return this.finishNode(node, isStatement ? "ClassDeclaration" : "ClassExpression");
+};
+
+pp.parseClassMethod = function (classBody, method, isGenerator) {
+ method.value = this.parseMethod(isGenerator);
+ classBody.body.push(this.finishNode(method, "MethodDefinition"));
+};
+
+pp.parseClassId = function (node, isStatement) {
+ node.id = this.type === _tokentype.types.name ? this.parseIdent() : isStatement ? this.unexpected() : null;
+};
+
+pp.parseClassSuper = function (node) {
+ node.superClass = this.eat(_tokentype.types._extends) ? this.parseExprSubscripts() : null;
+};
+
+// Parses module export declaration.
+
+pp.parseExport = function (node) {
+ this.next();
+ // export * from '...'
+ if (this.eat(_tokentype.types.star)) {
+ this.expectContextual("from");
+ node.source = this.type === _tokentype.types.string ? this.parseExprAtom() : this.unexpected();
+ this.semicolon();
+ return this.finishNode(node, "ExportAllDeclaration");
+ }
+ if (this.eat(_tokentype.types._default)) {
+ // export default ...
+ var parens = this.type == _tokentype.types.parenL;
+ var expr = this.parseMaybeAssign();
+ var needsSemi = true;
+ if (!parens && (expr.type == "FunctionExpression" || expr.type == "ClassExpression")) {
+ needsSemi = false;
+ if (expr.id) {
+ expr.type = expr.type == "FunctionExpression" ? "FunctionDeclaration" : "ClassDeclaration";
+ }
+ }
+ node.declaration = expr;
+ if (needsSemi) this.semicolon();
+ return this.finishNode(node, "ExportDefaultDeclaration");
+ }
+ // export var|const|let|function|class ...
+ if (this.shouldParseExportStatement()) {
+ node.declaration = this.parseStatement(true);
+ node.specifiers = [];
+ node.source = null;
+ } else {
+ // export { x, y as z } [from '...']
+ node.declaration = null;
+ node.specifiers = this.parseExportSpecifiers();
+ if (this.eatContextual("from")) {
+ node.source = this.type === _tokentype.types.string ? this.parseExprAtom() : this.unexpected();
+ } else {
+ // check for keywords used as local names
+ for (var i = 0; i < node.specifiers.length; i++) {
+ if (this.keywords.test(node.specifiers[i].local.name) ||
this.reservedWords.test(node.specifiers[i].local.name)) {
+ this.unexpected(node.specifiers[i].local.start);
+ }
+ }
- function parseVar(node, noIn, varkind) {
- node.declarations = [];
- node.kind = varkind;
- parseVarDecl(node.declarations, noIn);
- return node;
- }
-
- // Parse a list of variable declarations declared using let.
-
- function parseLetStatementOrExpression(node, noIn) {
- node.head = [];
- parseVarDecl(node.head, noIn);
- var stmt = parseStatement();
- if ("Expression" in stmt.type) {
- node.type = "LetExpression";
+ node.source = null;
+ }
+ this.semicolon();
+ }
+ return this.finishNode(node, "ExportNamedDeclaration");
+};
+
+pp.shouldParseExportStatement = function () {
+ return this.type.keyword || this.isLet();
+};
+
+// Parses a comma-separated list of module exports.
+
+pp.parseExportSpecifiers = function () {
+ var nodes = [],
+ first = true;
+ // export { x, y as z } [from '...']
+ this.expect(_tokentype.types.braceL);
+ while (!this.eat(_tokentype.types.braceR)) {
+ if (!first) {
+ this.expect(_tokentype.types.comma);
+ if (this.afterTrailingComma(_tokentype.types.braceR)) break;
+ } else first = false;
+
+ var node = this.startNode();
+ node.local = this.parseIdent(this.type === _tokentype.types._default);
+ node.exported = this.eatContextual("as") ? this.parseIdent(true) : node.local;
+ nodes.push(this.finishNode(node, "ExportSpecifier"));
+ }
+ return nodes;
+};
+
+// Parses import declaration.
+
+pp.parseImport = function (node) {
+ this.next();
+ // import '...'
+ if (this.type === _tokentype.types.string) {
+ node.specifiers = empty;
+ node.source = this.parseExprAtom();
+ } else {
+ node.specifiers = this.parseImportSpecifiers();
+ this.expectContextual("from");
+ node.source = this.type === _tokentype.types.string ? this.parseExprAtom() : this.unexpected();
+ }
+ this.semicolon();
+ return this.finishNode(node, "ImportDeclaration");
+};
+
+// Parses a comma-separated list of module imports.
+
+pp.parseImportSpecifiers = function () {
+ var nodes = [],
+ first = true;
+ if (this.type === _tokentype.types.name) {
+ // import defaultObj, { x, y as z } from '...'
+ var node = this.startNode();
+ node.local = this.parseIdent();
+ this.checkLVal(node.local, true);
+ nodes.push(this.finishNode(node, "ImportDefaultSpecifier"));
+ if (!this.eat(_tokentype.types.comma)) return nodes;
+ }
+ if (this.type === _tokentype.types.star) {
+ var node = this.startNode();
+ this.next();
+ this.expectContextual("as");
+ node.local = this.parseIdent();
+ this.checkLVal(node.local, true);
+ nodes.push(this.finishNode(node, "ImportNamespaceSpecifier"));
+ return nodes;
+ }
+ this.expect(_tokentype.types.braceL);
+ while (!this.eat(_tokentype.types.braceR)) {
+ if (!first) {
+ this.expect(_tokentype.types.comma);
+ if (this.afterTrailingComma(_tokentype.types.braceR)) break;
+ } else first = false;
+
+ var node = this.startNode();
+ node.imported = this.parseIdent(true);
+ if (this.eatContextual("as")) {
+ node.local = this.parseIdent();
} else {
- node.type = "LetStatement";
+ node.local = node.imported;
+ if (this.isKeyword(node.local.name)) this.unexpected(node.local.start);
+ if (this.reservedWordsStrict.test(node.local.name)) this.raise(node.local.start, "The keyword '" +
node.local.name + "' is reserved");
}
- node.body = stmt;
- return node;
- }
+ this.checkLVal(node.local, true);
+ nodes.push(this.finishNode(node, "ImportSpecifier"));
+ }
+ return nodes;
+};
+
+},{"./identifier":2,"./state":10,"./tokentype":14,"./whitespace":16}],12:[function(_dereq_,module,exports){
+// The algorithm used to determine whether a regexp can appear at a
+// given point in the program is loosely based on sweet.js' approach.
+// See https://github.com/mozilla/sweet.js/wiki/design
+
+"use strict";
+
+exports.__esModule = true;
+
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new
TypeError("Cannot call a class as a function"); } }
+
+var _state = _dereq_("./state");
+
+var _tokentype = _dereq_("./tokentype");
+
+var _whitespace = _dereq_("./whitespace");
+
+var TokContext = function TokContext(token, isExpr, preserveSpace, override) {
+ _classCallCheck(this, TokContext);
- // ### Expression parsing
+ this.token = token;
+ this.isExpr = !!isExpr;
+ this.preserveSpace = !!preserveSpace;
+ this.override = override;
+};
- // These nest, from the most general expression type at the top to
- // 'atomic', nondivisible expression types at the bottom. Most of
- // the functions will simply let the function(s) below them parse,
- // and, *if* the syntactic construct they handle is present, wrap
- // the AST node that the inner parser gave them in another node.
+exports.TokContext = TokContext;
+var types = {
+ b_stat: new TokContext("{", false),
+ b_expr: new TokContext("{", true),
+ b_tmpl: new TokContext("${", true),
+ p_stat: new TokContext("(", false),
+ p_expr: new TokContext("(", true),
+ q_tmpl: new TokContext("`", true, true, function (p) {
+ return p.readTmplToken();
+ }),
+ f_expr: new TokContext("function", true)
+};
- // Parse a full expression. The arguments are used to forbid comma
- // sequences (in argument lists, array literals, or object literals)
- // or the `in` operator (in for loops initalization expressions).
-
- function parseExpression(noComma, noIn) {
- var expr = parseMaybeAssign(noIn);
- if (!noComma && tokType === _comma) {
- var node = startNodeFrom(expr);
- node.expressions = [expr];
- while (eat(_comma)) node.expressions.push(parseMaybeAssign(noIn));
- return finishNode(node, "SequenceExpression");
- }
- return expr;
- }
-
- // Parse an assignment expression. This includes applications of
- // operators like `+=`.
-
- function parseMaybeAssign(noIn) {
- var left = parseMaybeConditional(noIn);
- if (tokType.isAssign) {
- var node = startNodeFrom(left);
- node.operator = tokVal;
- node.left = left;
- next();
- node.right = parseMaybeAssign(noIn);
- checkLVal(left);
- return finishNode(node, "AssignmentExpression");
- }
- return left;
- }
+exports.types = types;
+var pp = _state.Parser.prototype;
- // Parse a ternary conditional (`?:`) operator.
+pp.initialContext = function () {
+ return [types.b_stat];
+};
- function parseMaybeConditional(noIn) {
- var expr = parseExprOps(noIn);
- if (eat(_question)) {
- var node = startNodeFrom(expr);
- node.test = expr;
- node.consequent = parseExpression(true);
- expect(_colon);
- node.alternate = parseExpression(true, noIn);
- return finishNode(node, "ConditionalExpression");
- }
- return expr;
+pp.braceIsBlock = function (prevType) {
+ if (prevType === _tokentype.types.colon) {
+ var _parent = this.curContext();
+ if (_parent === types.b_stat || _parent === types.b_expr) return !_parent.isExpr;
}
+ if (prevType === _tokentype.types._return) return
_whitespace.lineBreak.test(this.input.slice(this.lastTokEnd, this.start));
+ if (prevType === _tokentype.types._else || prevType === _tokentype.types.semi || prevType ===
_tokentype.types.eof || prevType === _tokentype.types.parenR) return true;
+ if (prevType == _tokentype.types.braceL) return this.curContext() === types.b_stat;
+ return !this.exprAllowed;
+};
- // Start the precedence parser.
+pp.updateContext = function (prevType) {
+ var update = undefined,
+ type = this.type;
+ if (type.keyword && prevType == _tokentype.types.dot) this.exprAllowed = false;else if (update =
type.updateContext) update.call(this, prevType);else this.exprAllowed = type.beforeExpr;
+};
- function parseExprOps(noIn) {
- return parseExprOp(parseMaybeUnary(), -1, noIn);
+// Token-specific context update code
+
+_tokentype.types.parenR.updateContext = _tokentype.types.braceR.updateContext = function () {
+ if (this.context.length == 1) {
+ this.exprAllowed = true;
+ return;
+ }
+ var out = this.context.pop();
+ if (out === types.b_stat && this.curContext() === types.f_expr) {
+ this.context.pop();
+ this.exprAllowed = false;
+ } else if (out === types.b_tmpl) {
+ this.exprAllowed = true;
+ } else {
+ this.exprAllowed = !out.isExpr;
}
+};
- // Parse binary operators with the operator precedence parsing
- // algorithm. `left` is the left-hand side of the operator.
- // `minPrec` provides context that allows the function to stop and
- // defer further parser to one of its callers when it encounters an
- // operator that has a lower precedence than the set it is parsing.
+_tokentype.types.braceL.updateContext = function (prevType) {
+ this.context.push(this.braceIsBlock(prevType) ? types.b_stat : types.b_expr);
+ this.exprAllowed = true;
+};
- function parseExprOp(left, minPrec, noIn) {
- var prec = tokType.binop;
- if (prec != null && (!noIn || tokType !== _in)) {
- if (prec > minPrec) {
- var node = startNodeFrom(left);
- node.left = left;
- node.operator = tokVal;
- var op = tokType;
- next();
- node.right = parseExprOp(parseMaybeUnary(), prec, noIn);
- var exprNode = finishNode(node, (op === _logicalOR || op === _logicalAND) ? "LogicalExpression" :
"BinaryExpression");
- return parseExprOp(exprNode, minPrec, noIn);
- }
+_tokentype.types.dollarBraceL.updateContext = function () {
+ this.context.push(types.b_tmpl);
+ this.exprAllowed = true;
+};
+
+_tokentype.types.parenL.updateContext = function (prevType) {
+ var statementParens = prevType === _tokentype.types._if || prevType === _tokentype.types._for || prevType
=== _tokentype.types._with || prevType === _tokentype.types._while;
+ this.context.push(statementParens ? types.p_stat : types.p_expr);
+ this.exprAllowed = true;
+};
+
+_tokentype.types.incDec.updateContext = function () {
+ // tokExprAllowed stays unchanged
+};
+
+_tokentype.types._function.updateContext = function (prevType) {
+ if (prevType.beforeExpr && prevType !== _tokentype.types.semi && prevType !== _tokentype.types._else &&
(prevType !== _tokentype.types.colon || this.curContext() !== types.b_stat)) this.context.push(types.f_expr);
+ this.exprAllowed = false;
+};
+
+_tokentype.types.backQuote.updateContext = function () {
+ if (this.curContext() === types.q_tmpl) this.context.pop();else this.context.push(types.q_tmpl);
+ this.exprAllowed = false;
+};
+
+},{"./state":10,"./tokentype":14,"./whitespace":16}],13:[function(_dereq_,module,exports){
+"use strict";
+
+exports.__esModule = true;
+
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new
TypeError("Cannot call a class as a function"); } }
+
+var _identifier = _dereq_("./identifier");
+
+var _tokentype = _dereq_("./tokentype");
+
+var _state = _dereq_("./state");
+
+var _locutil = _dereq_("./locutil");
+
+var _whitespace = _dereq_("./whitespace");
+
+// Object type used to represent tokens. Note that normally, tokens
+// simply exist as properties on the parser object. This is only
+// used for the onToken callback and the external tokenizer.
+
+var Token = function Token(p) {
+ _classCallCheck(this, Token);
+
+ this.type = p.type;
+ this.value = p.value;
+ this.start = p.start;
+ this.end = p.end;
+ if (p.options.locations) this.loc = new _locutil.SourceLocation(p, p.startLoc, p.endLoc);
+ if (p.options.ranges) this.range = [p.start, p.end];
+}
+
+// ## Tokenizer
+
+;
+
+exports.Token = Token;
+var pp = _state.Parser.prototype;
+
+// Are we running under Rhino?
+var isRhino = typeof Packages == "object" && Object.prototype.toString.call(Packages) == "[object
JavaPackage]";
+
+// Move to the next token
+
+pp.next = function () {
+ if (this.options.onToken) this.options.onToken(new Token(this));
+
+ this.lastTokEnd = this.end;
+ this.lastTokStart = this.start;
+ this.lastTokEndLoc = this.endLoc;
+ this.lastTokStartLoc = this.startLoc;
+ this.nextToken();
+};
+
+pp.getToken = function () {
+ this.next();
+ return new Token(this);
+};
+
+// If we're in an ES6 environment, make parsers iterable
+if (typeof Symbol !== "undefined") pp[Symbol.iterator] = function () {
+ var self = this;
+ return { next: function next() {
+ var token = self.getToken();
+ return {
+ done: token.type === _tokentype.types.eof,
+ value: token
+ };
+ } };
+};
+
+// Toggle strict mode. Re-reads the next number or string to please
+// pedantic tests (`"use strict"; 010;` should fail).
+
+pp.setStrict = function (strict) {
+ this.strict = strict;
+ if (this.type !== _tokentype.types.num && this.type !== _tokentype.types.string) return;
+ this.pos = this.start;
+ if (this.options.locations) {
+ while (this.pos < this.lineStart) {
+ this.lineStart = this.input.lastIndexOf("\n", this.lineStart - 2) + 1;
+ --this.curLine;
}
- return left;
- }
-
- // Parse unary operators, both prefix and postfix.
-
- function parseMaybeUnary() {
- if (tokType.prefix) {
- var node = startNode(), update = tokType.isUpdate;
- node.operator = tokVal;
- node.prefix = true;
- tokRegexpAllowed = true;
- next();
- node.argument = parseMaybeUnary();
- if (update) checkLVal(node.argument);
- else if (strict && node.operator === "delete" &&
- node.argument.type === "Identifier")
- raise(node.start, "Deleting local variable in strict mode");
- return finishNode(node, update ? "UpdateExpression" : "UnaryExpression");
+ }
+ this.nextToken();
+};
+
+pp.curContext = function () {
+ return this.context[this.context.length - 1];
+};
+
+// Read a single token, updating the parser object's token-related
+// properties.
+
+pp.nextToken = function () {
+ var curContext = this.curContext();
+ if (!curContext || !curContext.preserveSpace) this.skipSpace();
+
+ this.start = this.pos;
+ if (this.options.locations) this.startLoc = this.curPosition();
+ if (this.pos >= this.input.length) return this.finishToken(_tokentype.types.eof);
+
+ if (curContext.override) return curContext.override(this);else this.readToken(this.fullCharCodeAtPos());
+};
+
+pp.readToken = function (code) {
+ // Identifier or keyword. '\uXXXX' sequences are allowed in
+ // identifiers, so '\' also dispatches to that.
+ if (_identifier.isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\' */) return
this.readWord();
+
+ return this.getTokenFromCode(code);
+};
+
+pp.fullCharCodeAtPos = function () {
+ var code = this.input.charCodeAt(this.pos);
+ if (code <= 0xd7ff || code >= 0xe000) return code;
+ var next = this.input.charCodeAt(this.pos + 1);
+ return (code << 10) + next - 0x35fdc00;
+};
+
+pp.skipBlockComment = function () {
+ var startLoc = this.options.onComment && this.curPosition();
+ var start = this.pos,
+ end = this.input.indexOf("*/", this.pos += 2);
+ if (end === -1) this.raise(this.pos - 2, "Unterminated comment");
+ this.pos = end + 2;
+ if (this.options.locations) {
+ _whitespace.lineBreakG.lastIndex = start;
+ var match = undefined;
+ while ((match = _whitespace.lineBreakG.exec(this.input)) && match.index < this.pos) {
+ ++this.curLine;
+ this.lineStart = match.index + match[0].length;
}
- var expr = parseExprSubscripts();
- while (tokType.postfix && !canInsertSemicolon()) {
- var node = startNodeFrom(expr);
- node.operator = tokVal;
- node.prefix = false;
- node.argument = expr;
- checkLVal(expr);
- next();
- expr = finishNode(node, "UpdateExpression");
+ }
+ if (this.options.onComment) this.options.onComment(true, this.input.slice(start + 2, end), start,
this.pos, startLoc, this.curPosition());
+};
+
+pp.skipLineComment = function (startSkip) {
+ var start = this.pos;
+ var startLoc = this.options.onComment && this.curPosition();
+ var ch = this.input.charCodeAt(this.pos += startSkip);
+ while (this.pos < this.input.length && ch !== 10 && ch !== 13 && ch !== 8232 && ch !== 8233) {
+ ++this.pos;
+ ch = this.input.charCodeAt(this.pos);
+ }
+ if (this.options.onComment) this.options.onComment(false, this.input.slice(start + startSkip, this.pos),
start, this.pos, startLoc, this.curPosition());
+};
+
+// Called at the start of the parse and after every token. Skips
+// whitespace and comments, and.
+
+pp.skipSpace = function () {
+ loop: while (this.pos < this.input.length) {
+ var ch = this.input.charCodeAt(this.pos);
+ switch (ch) {
+ case 32:case 160:
+ // ' '
+ ++this.pos;
+ break;
+ case 13:
+ if (this.input.charCodeAt(this.pos + 1) === 10) {
+ ++this.pos;
+ }
+ case 10:case 8232:case 8233:
+ ++this.pos;
+ if (this.options.locations) {
+ ++this.curLine;
+ this.lineStart = this.pos;
+ }
+ break;
+ case 47:
+ // '/'
+ switch (this.input.charCodeAt(this.pos + 1)) {
+ case 42:
+ // '*'
+ this.skipBlockComment();
+ break;
+ case 47:
+ this.skipLineComment(2);
+ break;
+ default:
+ break loop;
+ }
+ break;
+ default:
+ if (ch > 8 && ch < 14 || ch >= 5760 && _whitespace.nonASCIIwhitespace.test(String.fromCharCode(ch)))
{
+ ++this.pos;
+ } else {
+ break loop;
+ }
}
- return expr;
}
+};
- // Parse call, dot, and `[]`-subscript expressions.
+// Called at the end of every token. Sets `end`, `val`, and
+// maintains `context` and `exprAllowed`, and skips the space after
+// the token, so that the next one's `start` will point at the
+// right position.
- function parseExprSubscripts() {
- return parseSubscripts(parseExprAtom());
- }
+pp.finishToken = function (type, val) {
+ this.end = this.pos;
+ if (this.options.locations) this.endLoc = this.curPosition();
+ var prevType = this.type;
+ this.type = type;
+ this.value = val;
- function parseSubscripts(base, noCalls) {
- if (eat(_dot)) {
- var node = startNodeFrom(base);
- node.object = base;
- node.property = parseIdent(true);
- node.computed = false;
- return parseSubscripts(finishNode(node, "MemberExpression"), noCalls);
- } else if (eat(_bracketL)) {
- var node = startNodeFrom(base);
- node.object = base;
- node.property = parseExpression();
- node.computed = true;
- expect(_bracketR);
- return parseSubscripts(finishNode(node, "MemberExpression"), noCalls);
- } else if (!noCalls && eat(_parenL)) {
- var node = startNodeFrom(base);
- node.callee = base;
- node.arguments = parseExprList(_parenR, false);
- return parseSubscripts(finishNode(node, "CallExpression"), noCalls);
- } else return base;
- }
-
- // Parse an atomic expression — either a single token that is an
- // expression, an expression started by a keyword like `function` or
- // `new`, or an expression wrapped in punctuation like `()`, `[]`,
- // or `{}`.
-
- function parseExprAtom() {
- switch (tokType) {
- case _this:
- var node = startNode();
- next();
- return finishNode(node, "ThisExpression");
- case _name:
- return parseIdent();
- case _num: case _string: case _regexp:
- var node = startNode();
- node.value = tokVal;
- node.raw = input.slice(tokStart, tokEnd);
- next();
- return finishNode(node, "Literal");
-
- case _null: case _true: case _false:
- var node = startNode();
- node.value = tokType.atomValue;
- node.raw = tokType.keyword;
- next();
- return finishNode(node, "Literal");
-
- case _parenL:
- var tokStartLoc1 = tokStartLoc, tokStart1 = tokStart;
- next();
- var val = parseExpression();
- val.start = tokStart1;
- val.end = tokEnd;
- if (options.locations) {
- val.loc.start = tokStartLoc1;
- val.loc.end = tokEndLoc;
+ this.updateContext(prevType);
+};
+
+// ### Token reading
+
+// This is the function that is called to fetch the next token. It
+// is somewhat obscure, because it works in character codes rather
+// than characters, and because operator parsing has been inlined
+// into it.
+//
+// All in the name of speed.
+//
+pp.readToken_dot = function () {
+ var next = this.input.charCodeAt(this.pos + 1);
+ if (next >= 48 && next <= 57) return this.readNumber(true);
+ var next2 = this.input.charCodeAt(this.pos + 2);
+ if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) {
+ // 46 = dot '.'
+ this.pos += 3;
+ return this.finishToken(_tokentype.types.ellipsis);
+ } else {
+ ++this.pos;
+ return this.finishToken(_tokentype.types.dot);
+ }
+};
+
+pp.readToken_slash = function () {
+ // '/'
+ var next = this.input.charCodeAt(this.pos + 1);
+ if (this.exprAllowed) {
+ ++this.pos;return this.readRegexp();
+ }
+ if (next === 61) return this.finishOp(_tokentype.types.assign, 2);
+ return this.finishOp(_tokentype.types.slash, 1);
+};
+
+pp.readToken_mult_modulo_exp = function (code) {
+ // '%*'
+ var next = this.input.charCodeAt(this.pos + 1);
+ var size = 1;
+ var tokentype = code === 42 ? _tokentype.types.star : _tokentype.types.modulo;
+
+ // exponentiation operator ** and **=
+ if (this.options.ecmaVersion >= 7 && next === 42) {
+ ++size;
+ tokentype = _tokentype.types.starstar;
+ next = this.input.charCodeAt(this.pos + 2);
+ }
+
+ if (next === 61) return this.finishOp(_tokentype.types.assign, size + 1);
+ return this.finishOp(tokentype, size);
+};
+
+pp.readToken_pipe_amp = function (code) {
+ // '|&'
+ var next = this.input.charCodeAt(this.pos + 1);
+ if (next === code) return this.finishOp(code === 124 ? _tokentype.types.logicalOR :
_tokentype.types.logicalAND, 2);
+ if (next === 61) return this.finishOp(_tokentype.types.assign, 2);
+ return this.finishOp(code === 124 ? _tokentype.types.bitwiseOR : _tokentype.types.bitwiseAND, 1);
+};
+
+pp.readToken_caret = function () {
+ // '^'
+ var next = this.input.charCodeAt(this.pos + 1);
+ if (next === 61) return this.finishOp(_tokentype.types.assign, 2);
+ return this.finishOp(_tokentype.types.bitwiseXOR, 1);
+};
+
+pp.readToken_plus_min = function (code) {
+ // '+-'
+ var next = this.input.charCodeAt(this.pos + 1);
+ if (next === code) {
+ if (next == 45 && this.input.charCodeAt(this.pos + 2) == 62 &&
_whitespace.lineBreak.test(this.input.slice(this.lastTokEnd, this.pos))) {
+ // A `-->` line comment
+ this.skipLineComment(3);
+ this.skipSpace();
+ return this.nextToken();
+ }
+ return this.finishOp(_tokentype.types.incDec, 2);
+ }
+ if (next === 61) return this.finishOp(_tokentype.types.assign, 2);
+ return this.finishOp(_tokentype.types.plusMin, 1);
+};
+
+pp.readToken_lt_gt = function (code) {
+ // '<>'
+ var next = this.input.charCodeAt(this.pos + 1);
+ var size = 1;
+ if (next === code) {
+ size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2;
+ if (this.input.charCodeAt(this.pos + size) === 61) return this.finishOp(_tokentype.types.assign, size +
1);
+ return this.finishOp(_tokentype.types.bitShift, size);
+ }
+ if (next == 33 && code == 60 && this.input.charCodeAt(this.pos + 2) == 45 &&
this.input.charCodeAt(this.pos + 3) == 45) {
+ if (this.inModule) this.unexpected();
+ // `<!--`, an XML-style comment that should be interpreted as a line comment
+ this.skipLineComment(4);
+ this.skipSpace();
+ return this.nextToken();
+ }
+ if (next === 61) size = 2;
+ return this.finishOp(_tokentype.types.relational, size);
+};
+
+pp.readToken_eq_excl = function (code) {
+ // '=!'
+ var next = this.input.charCodeAt(this.pos + 1);
+ if (next === 61) return this.finishOp(_tokentype.types.equality, this.input.charCodeAt(this.pos + 2) ===
61 ? 3 : 2);
+ if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) {
+ // '=>'
+ this.pos += 2;
+ return this.finishToken(_tokentype.types.arrow);
+ }
+ return this.finishOp(code === 61 ? _tokentype.types.eq : _tokentype.types.prefix, 1);
+};
+
+pp.getTokenFromCode = function (code) {
+ switch (code) {
+ // The interpretation of a dot depends on whether it is followed
+ // by a digit or another two dots.
+ case 46:
+ // '.'
+ return this.readToken_dot();
+
+ // Punctuation tokens.
+ case 40:
+ ++this.pos;return this.finishToken(_tokentype.types.parenL);
+ case 41:
+ ++this.pos;return this.finishToken(_tokentype.types.parenR);
+ case 59:
+ ++this.pos;return this.finishToken(_tokentype.types.semi);
+ case 44:
+ ++this.pos;return this.finishToken(_tokentype.types.comma);
+ case 91:
+ ++this.pos;return this.finishToken(_tokentype.types.bracketL);
+ case 93:
+ ++this.pos;return this.finishToken(_tokentype.types.bracketR);
+ case 123:
+ ++this.pos;return this.finishToken(_tokentype.types.braceL);
+ case 125:
+ ++this.pos;return this.finishToken(_tokentype.types.braceR);
+ case 58:
+ ++this.pos;return this.finishToken(_tokentype.types.colon);
+ case 63:
+ ++this.pos;return this.finishToken(_tokentype.types.question);
+
+ case 96:
+ // '`'
+ if (this.options.ecmaVersion < 6) break;
+ ++this.pos;
+ return this.finishToken(_tokentype.types.backQuote);
+
+ case 48:
+ // '0'
+ var next = this.input.charCodeAt(this.pos + 1);
+ if (next === 120 || next === 88) return this.readRadixNumber(16); // '0x', '0X' - hex number
+ if (this.options.ecmaVersion >= 6) {
+ if (next === 111 || next === 79) return this.readRadixNumber(8); // '0o', '0O' - octal number
+ if (next === 98 || next === 66) return this.readRadixNumber(2); // '0b', '0B' - binary number
}
- if (options.ranges)
- val.range = [tokStart1, tokEnd];
- expect(_parenR);
- return val;
+ // Anything else beginning with a digit is an integer, octal
+ // number, or float.
+ case 49:case 50:case 51:case 52:case 53:case 54:case 55:case 56:case 57:
+ // 1-9
+ return this.readNumber(false);
- case _bracketL:
- var node = startNode();
- next();
- node.elements = parseExprList(_bracketR, true, true);
- return finishNode(node, "ArrayExpression");
+ // Quotes produce strings.
+ case 34:case 39:
+ // '"', "'"
+ return this.readString(code);
- case _braceL:
- return parseObj();
+ // Operators are parsed inline in tiny state machines. '=' (61) is
+ // often referred to. `finishOp` simply skips the amount of
+ // characters it is given as second argument, and returns a token
+ // of the type given by its first argument.
- case _function:
- var node = startNode();
- next();
- return parseFunction(node, false);
+ case 47:
+ // '/'
+ return this.readToken_slash();
- case _new:
- return parseNew();
+ case 37:case 42:
+ // '%*'
+ return this.readToken_mult_modulo_exp(code);
- default:
- unexpected();
- }
+ case 124:case 38:
+ // '|&'
+ return this.readToken_pipe_amp(code);
+
+ case 94:
+ // '^'
+ return this.readToken_caret();
+
+ case 43:case 45:
+ // '+-'
+ return this.readToken_plus_min(code);
+
+ case 60:case 62:
+ // '<>'
+ return this.readToken_lt_gt(code);
+
+ case 61:case 33:
+ // '=!'
+ return this.readToken_eq_excl(code);
+
+ case 126:
+ // '~'
+ return this.finishOp(_tokentype.types.prefix, 1);
}
- // New's precedence is slightly tricky. It must allow its argument
- // to be a `[]` or dot subscript expression, but not a call — at
- // least, not without wrapping it in parentheses. Thus, it uses the
-
- function parseNew() {
- var node = startNode();
- next();
- node.callee = parseSubscripts(parseExprAtom(), true);
- if (eat(_parenL)) node.arguments = parseExprList(_parenR, false);
- else node.arguments = empty;
- return finishNode(node, "NewExpression");
- }
-
- // Parse an object literal.
-
- function parseObj() {
- var node = startNode(), first = true, sawGetSet = false;
- node.properties = [];
- next();
- while (!eat(_braceR)) {
- if (!first) {
- expect(_comma);
- if (options.allowTrailingCommas && eat(_braceR)) break;
- } else first = false;
-
- var prop = {key: parsePropertyName()}, isGetSet = false, kind;
- if (eat(_colon)) {
- prop.value = parseExpression(true);
- kind = prop.kind = "init";
- } else if (options.ecmaVersion >= 5 && prop.key.type === "Identifier" &&
- (prop.key.name === "get" || prop.key.name === "set")) {
- isGetSet = sawGetSet = true;
- kind = prop.kind = prop.key.name;
- prop.key = parsePropertyName();
- if (tokType !== _parenL) unexpected();
- prop.value = parseFunction(startNode(), false);
- } else unexpected();
-
- // getters and setters are not allowed to clash — either with
- // each other or with an init property — and in strict mode,
- // init properties are also not allowed to be repeated.
-
- if (prop.key.type === "Identifier" && (strict || sawGetSet)) {
- for (var i = 0; i < node.properties.length; ++i) {
- var other = node.properties[i];
- if (other.key.name === prop.key.name) {
- var conflict = kind == other.kind || isGetSet && other.kind === "init" ||
- kind === "init" && (other.kind === "get" || other.kind === "set");
- if (conflict && !strict && kind === "init" && other.kind === "init") conflict = false;
- if (conflict) raise(prop.key.start, "Redefinition of property");
- }
+ this.raise(this.pos, "Unexpected character '" + codePointToString(code) + "'");
+};
+
+pp.finishOp = function (type, size) {
+ var str = this.input.slice(this.pos, this.pos + size);
+ this.pos += size;
+ return this.finishToken(type, str);
+};
+
+// Parse a regular expression. Some context-awareness is necessary,
+// since a '/' inside a '[]' set does not end the expression.
+
+function tryCreateRegexp(src, flags, throwErrorAt, parser) {
+ try {
+ return new RegExp(src, flags);
+ } catch (e) {
+ if (throwErrorAt !== undefined) {
+ if (e instanceof SyntaxError) parser.raise(throwErrorAt, "Error parsing regular expression: " +
e.message);
+ throw e;
+ }
+ }
+}
+
+var regexpUnicodeSupport = !!tryCreateRegexp("�", "u");
+
+pp.readRegexp = function () {
+ var _this = this;
+
+ var escaped = undefined,
+ inClass = undefined,
+ start = this.pos;
+ for (;;) {
+ if (this.pos >= this.input.length) this.raise(start, "Unterminated regular expression");
+ var ch = this.input.charAt(this.pos);
+ if (_whitespace.lineBreak.test(ch)) this.raise(start, "Unterminated regular expression");
+ if (!escaped) {
+ if (ch === "[") inClass = true;else if (ch === "]" && inClass) inClass = false;else if (ch === "/" &&
!inClass) break;
+ escaped = ch === "\\";
+ } else escaped = false;
+ ++this.pos;
+ }
+ var content = this.input.slice(start, this.pos);
+ ++this.pos;
+ // Need to use `readWord1` because '\uXXXX' sequences are allowed
+ // here (don't ask).
+ var mods = this.readWord1();
+ var tmp = content;
+ if (mods) {
+ var validFlags = /^[gim]*$/;
+ if (this.options.ecmaVersion >= 6) validFlags = /^[gimuy]*$/;
+ if (!validFlags.test(mods)) this.raise(start, "Invalid regular expression flag");
+ if (mods.indexOf('u') >= 0 && !regexpUnicodeSupport) {
+ // Replace each astral symbol and every Unicode escape sequence that
+ // possibly represents an astral symbol or a paired surrogate with a
+ // single ASCII symbol to avoid throwing on regular expressions that
+ // are only valid in combination with the `/u` flag.
+ // Note: replacing with the ASCII symbol `x` might cause false
+ // negatives in unlikely scenarios. For example, `[\u{61}-b]` is a
+ // perfectly valid pattern that is equivalent to `[a-b]`, but it would
+ // be replaced by `[x-b]` which throws an error.
+ tmp = tmp.replace(/\\u\{([0-9a-fA-F]+)\}/g, function (_match, code, offset) {
+ code = Number("0x" + code);
+ if (code > 0x10FFFF) _this.raise(start + offset + 3, "Code point out of bounds");
+ return "x";
+ });
+ tmp = tmp.replace(/\\u([a-fA-F0-9]{4})|[\uD800-\uDBFF][\uDC00-\uDFFF]/g, "x");
+ }
+ }
+ // Detect invalid regular expressions.
+ var value = null;
+ // Rhino's regular expression parser is flaky and throws uncatchable exceptions,
+ // so don't do detection if we are running under Rhino
+ if (!isRhino) {
+ tryCreateRegexp(tmp, undefined, start, this);
+ // Get a regular expression object for this pattern-flag pair, or `null` in
+ // case the current environment doesn't support the flags it uses.
+ value = tryCreateRegexp(content, mods);
+ }
+ return this.finishToken(_tokentype.types.regexp, { pattern: content, flags: mods, value: value });
+};
+
+// Read an integer in the given radix. Return null if zero digits
+// were read, the integer value otherwise. When `len` is given, this
+// will return `null` unless the integer has exactly `len` digits.
+
+pp.readInt = function (radix, len) {
+ var start = this.pos,
+ total = 0;
+ for (var i = 0, e = len == null ? Infinity : len; i < e; ++i) {
+ var code = this.input.charCodeAt(this.pos),
+ val = undefined;
+ if (code >= 97) val = code - 97 + 10; // a
+ else if (code >= 65) val = code - 65 + 10; // A
+ else if (code >= 48 && code <= 57) val = code - 48; // 0-9
+ else val = Infinity;
+ if (val >= radix) break;
+ ++this.pos;
+ total = total * radix + val;
+ }
+ if (this.pos === start || len != null && this.pos - start !== len) return null;
+
+ return total;
+};
+
+pp.readRadixNumber = function (radix) {
+ this.pos += 2; // 0x
+ var val = this.readInt(radix);
+ if (val == null) this.raise(this.start + 2, "Expected number in radix " + radix);
+ if (_identifier.isIdentifierStart(this.fullCharCodeAtPos())) this.raise(this.pos, "Identifier directly
after number");
+ return this.finishToken(_tokentype.types.num, val);
+};
+
+// Read an integer, octal integer, or floating-point number.
+
+pp.readNumber = function (startsWithDot) {
+ var start = this.pos,
+ isFloat = false,
+ octal = this.input.charCodeAt(this.pos) === 48;
+ if (!startsWithDot && this.readInt(10) === null) this.raise(start, "Invalid number");
+ var next = this.input.charCodeAt(this.pos);
+ if (next === 46) {
+ // '.'
+ ++this.pos;
+ this.readInt(10);
+ isFloat = true;
+ next = this.input.charCodeAt(this.pos);
+ }
+ if (next === 69 || next === 101) {
+ // 'eE'
+ next = this.input.charCodeAt(++this.pos);
+ if (next === 43 || next === 45) ++this.pos; // '+-'
+ if (this.readInt(10) === null) this.raise(start, "Invalid number");
+ isFloat = true;
+ }
+ if (_identifier.isIdentifierStart(this.fullCharCodeAtPos())) this.raise(this.pos, "Identifier directly
after number");
+
+ var str = this.input.slice(start, this.pos),
+ val = undefined;
+ if (isFloat) val = parseFloat(str);else if (!octal || str.length === 1) val = parseInt(str, 10);else if
(/[89]/.test(str) || this.strict) this.raise(start, "Invalid number");else val = parseInt(str, 8);
+ return this.finishToken(_tokentype.types.num, val);
+};
+
+// Read a string value, interpreting backslash-escapes.
+
+pp.readCodePoint = function () {
+ var ch = this.input.charCodeAt(this.pos),
+ code = undefined;
+
+ if (ch === 123) {
+ if (this.options.ecmaVersion < 6) this.unexpected();
+ var codePos = ++this.pos;
+ code = this.readHexChar(this.input.indexOf('}', this.pos) - this.pos);
+ ++this.pos;
+ if (code > 0x10FFFF) this.raise(codePos, "Code point out of bounds");
+ } else {
+ code = this.readHexChar(4);
+ }
+ return code;
+};
+
+function codePointToString(code) {
+ // UTF-16 Decoding
+ if (code <= 0xFFFF) return String.fromCharCode(code);
+ code -= 0x10000;
+ return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00);
+}
+
+pp.readString = function (quote) {
+ var out = "",
+ chunkStart = ++this.pos;
+ for (;;) {
+ if (this.pos >= this.input.length) this.raise(this.start, "Unterminated string constant");
+ var ch = this.input.charCodeAt(this.pos);
+ if (ch === quote) break;
+ if (ch === 92) {
+ // '\'
+ out += this.input.slice(chunkStart, this.pos);
+ out += this.readEscapedChar(false);
+ chunkStart = this.pos;
+ } else {
+ if (_whitespace.isNewLine(ch)) this.raise(this.start, "Unterminated string constant");
+ ++this.pos;
+ }
+ }
+ out += this.input.slice(chunkStart, this.pos++);
+ return this.finishToken(_tokentype.types.string, out);
+};
+
+// Reads template string tokens.
+
+pp.readTmplToken = function () {
+ var out = "",
+ chunkStart = this.pos;
+ for (;;) {
+ if (this.pos >= this.input.length) this.raise(this.start, "Unterminated template");
+ var ch = this.input.charCodeAt(this.pos);
+ if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) {
+ // '`', '${'
+ if (this.pos === this.start && this.type === _tokentype.types.template) {
+ if (ch === 36) {
+ this.pos += 2;
+ return this.finishToken(_tokentype.types.dollarBraceL);
+ } else {
+ ++this.pos;
+ return this.finishToken(_tokentype.types.backQuote);
}
}
- node.properties.push(prop);
+ out += this.input.slice(chunkStart, this.pos);
+ return this.finishToken(_tokentype.types.template, out);
+ }
+ if (ch === 92) {
+ // '\'
+ out += this.input.slice(chunkStart, this.pos);
+ out += this.readEscapedChar(true);
+ chunkStart = this.pos;
+ } else if (_whitespace.isNewLine(ch)) {
+ out += this.input.slice(chunkStart, this.pos);
+ ++this.pos;
+ switch (ch) {
+ case 13:
+ if (this.input.charCodeAt(this.pos) === 10) ++this.pos;
+ case 10:
+ out += "\n";
+ break;
+ default:
+ out += String.fromCharCode(ch);
+ break;
+ }
+ if (this.options.locations) {
+ ++this.curLine;
+ this.lineStart = this.pos;
+ }
+ chunkStart = this.pos;
+ } else {
+ ++this.pos;
}
- return finishNode(node, "ObjectExpression");
}
-
- function parsePropertyName() {
- if (tokType === _num || tokType === _string) return parseExprAtom();
- return parseIdent(true);
+};
+
+// Used to read escaped characters
+
+pp.readEscapedChar = function (inTemplate) {
+ var ch = this.input.charCodeAt(++this.pos);
+ ++this.pos;
+ switch (ch) {
+ case 110:
+ return "\n"; // 'n' -> '\n'
+ case 114:
+ return "\r"; // 'r' -> '\r'
+ case 120:
+ return String.fromCharCode(this.readHexChar(2)); // 'x'
+ case 117:
+ return codePointToString(this.readCodePoint()); // 'u'
+ case 116:
+ return "\t"; // 't' -> '\t'
+ case 98:
+ return "\b"; // 'b' -> '\b'
+ case 118:
+ return "\u000b"; // 'v' -> '\u000b'
+ case 102:
+ return "\f"; // 'f' -> '\f'
+ case 13:
+ if (this.input.charCodeAt(this.pos) === 10) ++this.pos; // '\r\n'
+ case 10:
+ // ' \n'
+ if (this.options.locations) {
+ this.lineStart = this.pos;++this.curLine;
+ }
+ return "";
+ default:
+ if (ch >= 48 && ch <= 55) {
+ var octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0];
+ var octal = parseInt(octalStr, 8);
+ if (octal > 255) {
+ octalStr = octalStr.slice(0, -1);
+ octal = parseInt(octalStr, 8);
+ }
+ if (octalStr !== "0" && (this.strict || inTemplate)) {
+ this.raise(this.pos - 2, "Octal literal in strict mode");
+ }
+ this.pos += octalStr.length - 1;
+ return String.fromCharCode(octal);
+ }
+ return String.fromCharCode(ch);
}
+};
- // Parse a function declaration or literal (depending on the
- // `isStatement` parameter).
+// Used to read character escape sequences ('\x', '\u', '\U').
- function parseFunction(node, isStatement) {
- if (tokType === _name) node.id = parseIdent();
- else if (isStatement) unexpected();
- else node.id = null;
- node.params = [];
- var first = true;
- expect(_parenL);
- while (!eat(_parenR)) {
- if (!first) expect(_comma); else first = false;
- node.params.push(parseIdent());
- }
+pp.readHexChar = function (len) {
+ var codePos = this.pos;
+ var n = this.readInt(16, len);
+ if (n === null) this.raise(codePos, "Bad character escape sequence");
+ return n;
+};
- // Start a new scope with regard to labels and the `inFunction`
- // flag (restore them to their old value afterwards).
- var oldInFunc = inFunction, oldLabels = labels;
- inFunction = true; labels = [];
- node.body = parseBlock(true);
- inFunction = oldInFunc; labels = oldLabels;
-
- // If this is a strict mode function, verify that argument names
- // are not repeated, and it does not try to bind the words `eval`
- // or `arguments`.
- if (strict || node.body.body.length && isUseStrict(node.body.body[0])) {
- for (var i = node.id ? -1 : 0; i < node.params.length; ++i) {
- var id = i < 0 ? node.id : node.params[i];
- if (isStrictReservedWord(id.name) || isStrictBadIdWord(id.name))
- raise(id.start, "Defining '" + id.name + "' in strict mode");
- if (i >= 0) for (var j = 0; j < i; ++j) if (id.name === node.params[j].name)
- raise(id.start, "Argument name clash in strict mode");
- }
+// Read an identifier, and return it as a string. Sets `this.containsEsc`
+// to whether the word contained a '\u' escape.
+//
+// Incrementally adds only escaped chars, adding other chunks as-is
+// as a micro-optimization.
+
+pp.readWord1 = function () {
+ this.containsEsc = false;
+ var word = "",
+ first = true,
+ chunkStart = this.pos;
+ var astral = this.options.ecmaVersion >= 6;
+ while (this.pos < this.input.length) {
+ var ch = this.fullCharCodeAtPos();
+ if (_identifier.isIdentifierChar(ch, astral)) {
+ this.pos += ch <= 0xffff ? 1 : 2;
+ } else if (ch === 92) {
+ // "\"
+ this.containsEsc = true;
+ word += this.input.slice(chunkStart, this.pos);
+ var escStart = this.pos;
+ if (this.input.charCodeAt(++this.pos) != 117) // "u"
+ this.raise(this.pos, "Expecting Unicode escape sequence \\uXXXX");
+ ++this.pos;
+ var esc = this.readCodePoint();
+ if (!(first ? _identifier.isIdentifierStart : _identifier.isIdentifierChar)(esc, astral))
this.raise(escStart, "Invalid Unicode escape");
+ word += codePointToString(esc);
+ chunkStart = this.pos;
+ } else {
+ break;
}
-
- return finishNode(node, isStatement ? "FunctionDeclaration" : "FunctionExpression");
+ first = false;
}
+ return word + this.input.slice(chunkStart, this.pos);
+};
- // Parses a comma-separated list of expressions, and returns them as
- // an array. `close` is the token type that ends the list, and
- // `allowEmpty` can be turned on to allow subsequent commas with
- // nothing in between them to be parsed as `null` (which is needed
- // for array literals).
+// Read an identifier or keyword token. Will check for reserved
+// words when necessary.
- function parseExprList(close, allowTrailingComma, allowEmpty) {
- var elts = [], first = true;
- while (!eat(close)) {
- if (!first) {
- expect(_comma);
- if (allowTrailingComma && options.allowTrailingCommas && eat(close)) break;
- } else first = false;
+pp.readWord = function () {
+ var word = this.readWord1();
+ var type = _tokentype.types.name;
+ if ((this.options.ecmaVersion >= 6 || !this.containsEsc) && this.keywords.test(word)) type =
_tokentype.keywords[word];
+ return this.finishToken(type, word);
+};
- if (allowEmpty && tokType === _comma) elts.push(null);
- else elts.push(parseExpression(true));
- }
- return elts;
- }
+},{"./identifier":2,"./locutil":5,"./state":10,"./tokentype":14,"./whitespace":16}],14:[function(_dereq_,module,exports){
+// ## Token types
- // Parse the next token as an identifier. If `liberal` is true (used
- // when parsing properties), it will also convert keywords into
- // identifiers.
+// The assignment of fine-grained, information-carrying type objects
+// allows the tokenizer to store the information it has about a
+// token in a way that is very cheap for the parser to look up.
- function parseIdent(liberal) {
- var node = startNode();
- node.name = tokType === _name ? tokVal : (liberal && !options.forbidReserved && tokType.keyword) ||
unexpected();
- tokRegexpAllowed = false;
- next();
- return finishNode(node, "Identifier");
- }
+// All token type variables start with an underscore, to make them
+// easy to recognize.
+
+// The `beforeExpr` property is used to disambiguate between regular
+// expressions and divisions. It is set on all token types that can
+// be followed by an expression (thus, a slash after them would be a
+// regular expression).
+//
+// The `startsExpr` property is used to check if the token ends a
+// `yield` expression. It is set on all token types that either can
+// directly start an expression (like a quotation mark) or can
+// continue an expression (like the body of a string).
+//
+// `isLoop` marks a keyword as starting a loop, which is important
+// to know when parsing a label, in order to allow or disallow
+// continue jumps to that label.
+
+"use strict";
+
+exports.__esModule = true;
+
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new
TypeError("Cannot call a class as a function"); } }
+
+var TokenType = function TokenType(label) {
+ var conf = arguments.length <= 1 || arguments[1] === undefined ? {} : arguments[1];
+
+ _classCallCheck(this, TokenType);
+
+ this.label = label;
+ this.keyword = conf.keyword;
+ this.beforeExpr = !!conf.beforeExpr;
+ this.startsExpr = !!conf.startsExpr;
+ this.isLoop = !!conf.isLoop;
+ this.isAssign = !!conf.isAssign;
+ this.prefix = !!conf.prefix;
+ this.postfix = !!conf.postfix;
+ this.binop = conf.binop || null;
+ this.updateContext = null;
+};
+
+exports.TokenType = TokenType;
+
+function binop(name, prec) {
+ return new TokenType(name, { beforeExpr: true, binop: prec });
+}
+var beforeExpr = { beforeExpr: true },
+ startsExpr = { startsExpr: true };
+
+var types = {
+ num: new TokenType("num", startsExpr),
+ regexp: new TokenType("regexp", startsExpr),
+ string: new TokenType("string", startsExpr),
+ name: new TokenType("name", startsExpr),
+ eof: new TokenType("eof"),
+
+ // Punctuation token types.
+ bracketL: new TokenType("[", { beforeExpr: true, startsExpr: true }),
+ bracketR: new TokenType("]"),
+ braceL: new TokenType("{", { beforeExpr: true, startsExpr: true }),
+ braceR: new TokenType("}"),
+ parenL: new TokenType("(", { beforeExpr: true, startsExpr: true }),
+ parenR: new TokenType(")"),
+ comma: new TokenType(",", beforeExpr),
+ semi: new TokenType(";", beforeExpr),
+ colon: new TokenType(":", beforeExpr),
+ dot: new TokenType("."),
+ question: new TokenType("?", beforeExpr),
+ arrow: new TokenType("=>", beforeExpr),
+ template: new TokenType("template"),
+ ellipsis: new TokenType("...", beforeExpr),
+ backQuote: new TokenType("`", startsExpr),
+ dollarBraceL: new TokenType("${", { beforeExpr: true, startsExpr: true }),
+
+ // Operators. These carry several kinds of properties to help the
+ // parser use them properly (the presence of these properties is
+ // what categorizes them as operators).
+ //
+ // `binop`, when present, specifies that this operator is a binary
+ // operator, and will refer to its precedence.
+ //
+ // `prefix` and `postfix` mark the operator as a prefix or postfix
+ // unary operator.
+ //
+ // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as
+ // binary operators with a very low precedence, that should result
+ // in AssignmentExpression nodes.
+ eq: new TokenType("=", { beforeExpr: true, isAssign: true }),
+ assign: new TokenType("_=", { beforeExpr: true, isAssign: true }),
+ incDec: new TokenType("++/--", { prefix: true, postfix: true, startsExpr: true }),
+ prefix: new TokenType("prefix", { beforeExpr: true, prefix: true, startsExpr: true }),
+ logicalOR: binop("||", 1),
+ logicalAND: binop("&&", 2),
+ bitwiseOR: binop("|", 3),
+ bitwiseXOR: binop("^", 4),
+ bitwiseAND: binop("&", 5),
+ equality: binop("==/!=", 6),
+ relational: binop("</>", 7),
+ bitShift: binop("<</>>", 8),
+ plusMin: new TokenType("+/-", { beforeExpr: true, binop: 9, prefix: true, startsExpr: true }),
+ modulo: binop("%", 10),
+ star: binop("*", 10),
+ slash: binop("/", 10),
+ starstar: new TokenType("**", { beforeExpr: true })
+};
+
+exports.types = types;
+// Map keyword names to token types.
+
+var keywords = {};
+
+exports.keywords = keywords;
+// Succinct definitions of keyword token types
+function kw(name) {
+ var options = arguments.length <= 1 || arguments[1] === undefined ? {} : arguments[1];
+
+ options.keyword = name;
+ keywords[name] = types["_" + name] = new TokenType(name, options);
+}
+
+kw("break");
+kw("case", beforeExpr);
+kw("catch");
+kw("continue");
+kw("debugger");
+kw("default", beforeExpr);
+kw("do", { isLoop: true, beforeExpr: true });
+kw("else", beforeExpr);
+kw("finally");
+kw("for", { isLoop: true });
+kw("function", startsExpr);
+kw("if");
+kw("return", beforeExpr);
+kw("switch");
+kw("throw", beforeExpr);
+kw("try");
+kw("var");
+kw("const");
+kw("while", { isLoop: true });
+kw("with");
+kw("new", { beforeExpr: true, startsExpr: true });
+kw("this", startsExpr);
+kw("super", startsExpr);
+kw("class");
+kw("extends", beforeExpr);
+kw("export");
+kw("import");
+kw("null", startsExpr);
+kw("true", startsExpr);
+kw("false", startsExpr);
+kw("in", { beforeExpr: true, binop: 7 });
+kw("instanceof", { beforeExpr: true, binop: 7 });
+kw("typeof", { beforeExpr: true, prefix: true, startsExpr: true });
+kw("void", { beforeExpr: true, prefix: true, startsExpr: true });
+kw("delete", { beforeExpr: true, prefix: true, startsExpr: true });
+
+},{}],15:[function(_dereq_,module,exports){
+"use strict";
+
+exports.__esModule = true;
+exports.isArray = isArray;
+exports.has = has;
+
+function isArray(obj) {
+ return Object.prototype.toString.call(obj) === "[object Array]";
+}
+
+// Checks if an object has a property.
+
+function has(obj, propName) {
+ return Object.prototype.hasOwnProperty.call(obj, propName);
+}
+
+},{}],16:[function(_dereq_,module,exports){
+// Matches a whole line break (where CRLF is considered a single
+// line break). Used to count lines.
+
+"use strict";
+
+exports.__esModule = true;
+exports.isNewLine = isNewLine;
+var lineBreak = /\r\n?|\n|\u2028|\u2029/;
+exports.lineBreak = lineBreak;
+var lineBreakG = new RegExp(lineBreak.source, "g");
+
+exports.lineBreakG = lineBreakG;
+
+function isNewLine(code) {
+ return code === 10 || code === 13 || code === 0x2028 || code == 0x2029;
+}
+
+var nonASCIIwhitespace = /[\u1680\u180e\u2000-\u200a\u202f\u205f\u3000\ufeff]/;
+
+exports.nonASCIIwhitespace = nonASCIIwhitespace;
+var skipWhiteSpace = /(?:\s|\/\/.*|\/\*[^]*?\*\/)*/g;
+exports.skipWhiteSpace = skipWhiteSpace;
+
+},{}]},{},[3])(3)
});
diff --git a/backends/js/deps/jshint.js b/backends/js/deps/jshint.js
index ffd1144..2414075 100644
--- a/backends/js/deps/jshint.js
+++ b/backends/js/deps/jshint.js
@@ -1,4 +1,4 @@
-/*! 2.5.11 */
+/*! 2.9.2 */
var JSHINT;
if (typeof window === 'undefined') window = {};
(function () {
@@ -128,7 +128,7 @@ function replacer(key, value) {
if (util.isUndefined(value)) {
return '' + value;
}
- if (util.isNumber(value) && (isNaN(value) || !isFinite(value))) {
+ if (util.isNumber(value) && !isFinite(value)) {
return value.toString();
}
if (util.isFunction(value) || util.isRegExp(value)) {
@@ -267,23 +267,22 @@ function objEquiv(a, b) {
return false;
// an identical 'prototype' property.
if (a.prototype !== b.prototype) return false;
- //~~~I've managed to break Object.keys through screwy arguments passing.
- // Converting to array solves the problem.
- if (isArguments(a)) {
- if (!isArguments(b)) {
- return false;
- }
+ // if one is a primitive, the other must be same
+ if (util.isPrimitive(a) || util.isPrimitive(b)) {
+ return a === b;
+ }
+ var aIsArgs = isArguments(a),
+ bIsArgs = isArguments(b);
+ if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))
+ return false;
+ if (aIsArgs) {
a = pSlice.call(a);
b = pSlice.call(b);
return _deepEqual(a, b);
}
- try {
- var ka = objectKeys(a),
- kb = objectKeys(b),
- key, i;
- } catch (e) {//happens when one is a string literal and the other isn't
- return false;
- }
+ var ka = objectKeys(a),
+ kb = objectKeys(b),
+ key, i;
// having the same number of owned properties (keys incorporates
// hasOwnProperty)
if (ka.length != kb.length)
@@ -733,69 +732,40 @@ if (typeof Object.create === 'function') {
// shim for using process in browser
var process = module.exports = {};
+var queue = [];
+var draining = false;
-process.nextTick = (function () {
- var canSetImmediate = typeof window !== 'undefined'
- && window.setImmediate;
- var canMutationObserver = typeof window !== 'undefined'
- && window.MutationObserver;
- var canPost = typeof window !== 'undefined'
- && window.postMessage && window.addEventListener
- ;
-
- if (canSetImmediate) {
- return function (f) { return window.setImmediate(f) };
+function drainQueue() {
+ if (draining) {
+ return;
}
-
- var queue = [];
-
- if (canMutationObserver) {
- var hiddenDiv = document.createElement("div");
- var observer = new MutationObserver(function () {
- var queueList = queue.slice();
- queue.length = 0;
- queueList.forEach(function (fn) {
- fn();
- });
- });
-
- observer.observe(hiddenDiv, { attributes: true });
-
- return function nextTick(fn) {
- if (!queue.length) {
- hiddenDiv.setAttribute('yes', 'no');
- }
- queue.push(fn);
- };
+ draining = true;
+ var currentQueue;
+ var len = queue.length;
+ while(len) {
+ currentQueue = queue;
+ queue = [];
+ var i = -1;
+ while (++i < len) {
+ currentQueue[i]();
+ }
+ len = queue.length;
}
-
- if (canPost) {
- window.addEventListener('message', function (ev) {
- var source = ev.source;
- if ((source === window || source === null) && ev.data === 'process-tick') {
- ev.stopPropagation();
- if (queue.length > 0) {
- var fn = queue.shift();
- fn();
- }
- }
- }, true);
-
- return function nextTick(fn) {
- queue.push(fn);
- window.postMessage('process-tick', '*');
- };
+ draining = false;
+}
+process.nextTick = function (fun) {
+ queue.push(fun);
+ if (!draining) {
+ setTimeout(drainQueue, 0);
}
-
- return function nextTick(fn) {
- setTimeout(fn, 0);
- };
-})();
+};
process.title = 'browser';
process.browser = true;
process.env = {};
process.argv = [];
+process.version = ''; // empty string to avoid regexp issues
+process.versions = {};
function noop() {}
@@ -816,6 +786,7 @@ process.cwd = function () { return '/' };
process.chdir = function (dir) {
throw new Error('process.chdir is not supported');
};
+process.umask = function() { return 0; };
},{}],8:[function(require,module,exports){
module.exports = function isBuffer(arg) {
@@ -1512,1350 +1483,12175 @@ function now() {
}
},{}],12:[function(require,module,exports){
-// Underscore.js 1.6.0
-// http://underscorejs.org
-// (c) 2009-2014 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
-// Underscore may be freely distributed under the MIT license.
-
-(function() {
-
- // Baseline setup
- // --------------
-
- // Establish the root object, `window` in the browser, or `exports` on the server.
- var root = this;
-
- // Save the previous value of the `_` variable.
- var previousUnderscore = root._;
-
- // Establish the object that gets returned to break out of a loop iteration.
- var breaker = {};
-
- // Save bytes in the minified (but not gzipped) version:
- var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype;
-
- // Create quick reference variables for speed access to core prototypes.
- var
- push = ArrayProto.push,
- slice = ArrayProto.slice,
- concat = ArrayProto.concat,
- toString = ObjProto.toString,
- hasOwnProperty = ObjProto.hasOwnProperty;
-
- // All **ECMAScript 5** native function implementations that we hope to use
- // are declared here.
- var
- nativeForEach = ArrayProto.forEach,
- nativeMap = ArrayProto.map,
- nativeReduce = ArrayProto.reduce,
- nativeReduceRight = ArrayProto.reduceRight,
- nativeFilter = ArrayProto.filter,
- nativeEvery = ArrayProto.every,
- nativeSome = ArrayProto.some,
- nativeIndexOf = ArrayProto.indexOf,
- nativeLastIndexOf = ArrayProto.lastIndexOf,
- nativeIsArray = Array.isArray,
- nativeKeys = Object.keys,
- nativeBind = FuncProto.bind;
-
- // Create a safe reference to the Underscore object for use below.
- var _ = function(obj) {
- if (obj instanceof _) return obj;
- if (!(this instanceof _)) return new _(obj);
- this._wrapped = obj;
+(function (global){
+/**
+ * @license
+ * lodash 3.7.0 (Custom Build) <https://lodash.com/>
+ * Build: `lodash modern -d -o ./index.js`
+ * Copyright 2012-2015 The Dojo Foundation <http://dojofoundation.org/>
+ * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
+ * Copyright 2009-2015 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
+ * Available under MIT license <https://lodash.com/license>
+ */
+;(function() {
+
+ /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+ var undefined;
+
+ /** Used as the semantic version number. */
+ var VERSION = '3.7.0';
+
+ /** Used to compose bitmasks for wrapper metadata. */
+ var BIND_FLAG = 1,
+ BIND_KEY_FLAG = 2,
+ CURRY_BOUND_FLAG = 4,
+ CURRY_FLAG = 8,
+ CURRY_RIGHT_FLAG = 16,
+ PARTIAL_FLAG = 32,
+ PARTIAL_RIGHT_FLAG = 64,
+ ARY_FLAG = 128,
+ REARG_FLAG = 256;
+
+ /** Used as default options for `_.trunc`. */
+ var DEFAULT_TRUNC_LENGTH = 30,
+ DEFAULT_TRUNC_OMISSION = '...';
+
+ /** Used to detect when a function becomes hot. */
+ var HOT_COUNT = 150,
+ HOT_SPAN = 16;
+
+ /** Used to indicate the type of lazy iteratees. */
+ var LAZY_DROP_WHILE_FLAG = 0,
+ LAZY_FILTER_FLAG = 1,
+ LAZY_MAP_FLAG = 2;
+
+ /** Used as the `TypeError` message for "Functions" methods. */
+ var FUNC_ERROR_TEXT = 'Expected a function';
+
+ /** Used as the internal argument placeholder. */
+ var PLACEHOLDER = '__lodash_placeholder__';
+
+ /** `Object#toString` result references. */
+ var argsTag = '[object Arguments]',
+ arrayTag = '[object Array]',
+ boolTag = '[object Boolean]',
+ dateTag = '[object Date]',
+ errorTag = '[object Error]',
+ funcTag = '[object Function]',
+ mapTag = '[object Map]',
+ numberTag = '[object Number]',
+ objectTag = '[object Object]',
+ regexpTag = '[object RegExp]',
+ setTag = '[object Set]',
+ stringTag = '[object String]',
+ weakMapTag = '[object WeakMap]';
+
+ var arrayBufferTag = '[object ArrayBuffer]',
+ float32Tag = '[object Float32Array]',
+ float64Tag = '[object Float64Array]',
+ int8Tag = '[object Int8Array]',
+ int16Tag = '[object Int16Array]',
+ int32Tag = '[object Int32Array]',
+ uint8Tag = '[object Uint8Array]',
+ uint8ClampedTag = '[object Uint8ClampedArray]',
+ uint16Tag = '[object Uint16Array]',
+ uint32Tag = '[object Uint32Array]';
+
+ /** Used to match empty string literals in compiled template source. */
+ var reEmptyStringLeading = /\b__p \+= '';/g,
+ reEmptyStringMiddle = /\b(__p \+=) '' \+/g,
+ reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g;
+
+ /** Used to match HTML entities and HTML characters. */
+ var reEscapedHtml = /&(?:amp|lt|gt|quot|#39|#96);/g,
+ reUnescapedHtml = /[&<>"'`]/g,
+ reHasEscapedHtml = RegExp(reEscapedHtml.source),
+ reHasUnescapedHtml = RegExp(reUnescapedHtml.source);
+
+ /** Used to match template delimiters. */
+ var reEscape = /<%-([\s\S]+?)%>/g,
+ reEvaluate = /<%([\s\S]+?)%>/g,
+ reInterpolate = /<%=([\s\S]+?)%>/g;
+
+ /** Used to match property names within property paths. */
+ var reIsDeepProp = /\.|\[(?:[^[\]]+|(["'])(?:(?!\1)[^\n\\]|\\.)*?)\1\]/,
+ reIsPlainProp = /^\w*$/,
+ rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\n\\]|\\.)*?)\2)\]/g;
+
+ /**
+ * Used to match `RegExp` [special
characters](http://www.regular-expressions.info/characters.html#special).
+ * In addition to special characters the forward slash is escaped to allow for
+ * easier `eval` use and `Function` compilation.
+ */
+ var reRegExpChars = /[.*+?^${}()|[\]\/\\]/g,
+ reHasRegExpChars = RegExp(reRegExpChars.source);
+
+ /** Used to match [combining diacritical
marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks). */
+ var reComboMark = /[\u0300-\u036f\ufe20-\ufe23]/g;
+
+ /** Used to match backslashes in property paths. */
+ var reEscapeChar = /\\(\\)?/g;
+
+ /** Used to match [ES template
delimiters](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-template-literal-lexical-components). */
+ var reEsTemplate = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g;
+
+ /** Used to match `RegExp` flags from their coerced string values. */
+ var reFlags = /\w*$/;
+
+ /** Used to detect hexadecimal string values. */
+ var reHasHexPrefix = /^0[xX]/;
+
+ /** Used to detect host constructors (Safari > 5). */
+ var reIsHostCtor = /^\[object .+?Constructor\]$/;
+
+ /** Used to match latin-1 supplementary letters (excluding mathematical operators). */
+ var reLatin1 = /[\xc0-\xd6\xd8-\xde\xdf-\xf6\xf8-\xff]/g;
+
+ /** Used to ensure capturing order of template delimiters. */
+ var reNoMatch = /($^)/;
+
+ /** Used to match unescaped characters in compiled string literals. */
+ var reUnescapedString = /['\n\r\u2028\u2029\\]/g;
+
+ /** Used to match words to create compound words. */
+ var reWords = (function() {
+ var upper = '[A-Z\\xc0-\\xd6\\xd8-\\xde]',
+ lower = '[a-z\\xdf-\\xf6\\xf8-\\xff]+';
+
+ return RegExp(upper + '+(?=' + upper + lower + ')|' + upper + '?' + lower + '|' + upper + '+|[0-9]+',
'g');
+ }());
+
+ /** Used to detect and test for whitespace. */
+ var whitespace = (
+ // Basic whitespace characters.
+ ' \t\x0b\f\xa0\ufeff' +
+
+ // Line terminators.
+ '\n\r\u2028\u2029' +
+
+ // Unicode category "Zs" space separators.
+ '\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000'
+ );
+
+ /** Used to assign default `context` object properties. */
+ var contextProps = [
+ 'Array', 'ArrayBuffer', 'Date', 'Error', 'Float32Array', 'Float64Array',
+ 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Math', 'Number',
+ 'Object', 'RegExp', 'Set', 'String', '_', 'clearTimeout', 'document',
+ 'isFinite', 'parseInt', 'setTimeout', 'TypeError', 'Uint8Array',
+ 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',
+ 'window'
+ ];
+
+ /** Used to make template sourceURLs easier to identify. */
+ var templateCounter = -1;
+
+ /** Used to identify `toStringTag` values of typed arrays. */
+ var typedArrayTags = {};
+ typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =
+ typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =
+ typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =
+ typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =
+ typedArrayTags[uint32Tag] = true;
+ typedArrayTags[argsTag] = typedArrayTags[arrayTag] =
+ typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =
+ typedArrayTags[dateTag] = typedArrayTags[errorTag] =
+ typedArrayTags[funcTag] = typedArrayTags[mapTag] =
+ typedArrayTags[numberTag] = typedArrayTags[objectTag] =
+ typedArrayTags[regexpTag] = typedArrayTags[setTag] =
+ typedArrayTags[stringTag] = typedArrayTags[weakMapTag] = false;
+
+ /** Used to identify `toStringTag` values supported by `_.clone`. */
+ var cloneableTags = {};
+ cloneableTags[argsTag] = cloneableTags[arrayTag] =
+ cloneableTags[arrayBufferTag] = cloneableTags[boolTag] =
+ cloneableTags[dateTag] = cloneableTags[float32Tag] =
+ cloneableTags[float64Tag] = cloneableTags[int8Tag] =
+ cloneableTags[int16Tag] = cloneableTags[int32Tag] =
+ cloneableTags[numberTag] = cloneableTags[objectTag] =
+ cloneableTags[regexpTag] = cloneableTags[stringTag] =
+ cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =
+ cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;
+ cloneableTags[errorTag] = cloneableTags[funcTag] =
+ cloneableTags[mapTag] = cloneableTags[setTag] =
+ cloneableTags[weakMapTag] = false;
+
+ /** Used as an internal `_.debounce` options object by `_.throttle`. */
+ var debounceOptions = {
+ 'leading': false,
+ 'maxWait': 0,
+ 'trailing': false
+ };
+
+ /** Used to map latin-1 supplementary letters to basic latin letters. */
+ var deburredLetters = {
+ '\xc0': 'A', '\xc1': 'A', '\xc2': 'A', '\xc3': 'A', '\xc4': 'A', '\xc5': 'A',
+ '\xe0': 'a', '\xe1': 'a', '\xe2': 'a', '\xe3': 'a', '\xe4': 'a', '\xe5': 'a',
+ '\xc7': 'C', '\xe7': 'c',
+ '\xd0': 'D', '\xf0': 'd',
+ '\xc8': 'E', '\xc9': 'E', '\xca': 'E', '\xcb': 'E',
+ '\xe8': 'e', '\xe9': 'e', '\xea': 'e', '\xeb': 'e',
+ '\xcC': 'I', '\xcd': 'I', '\xce': 'I', '\xcf': 'I',
+ '\xeC': 'i', '\xed': 'i', '\xee': 'i', '\xef': 'i',
+ '\xd1': 'N', '\xf1': 'n',
+ '\xd2': 'O', '\xd3': 'O', '\xd4': 'O', '\xd5': 'O', '\xd6': 'O', '\xd8': 'O',
+ '\xf2': 'o', '\xf3': 'o', '\xf4': 'o', '\xf5': 'o', '\xf6': 'o', '\xf8': 'o',
+ '\xd9': 'U', '\xda': 'U', '\xdb': 'U', '\xdc': 'U',
+ '\xf9': 'u', '\xfa': 'u', '\xfb': 'u', '\xfc': 'u',
+ '\xdd': 'Y', '\xfd': 'y', '\xff': 'y',
+ '\xc6': 'Ae', '\xe6': 'ae',
+ '\xde': 'Th', '\xfe': 'th',
+ '\xdf': 'ss'
+ };
+
+ /** Used to map characters to HTML entities. */
+ var htmlEscapes = {
+ '&': '&',
+ '<': '<',
+ '>': '>',
+ '"': '"',
+ "'": ''',
+ '`': '`'
+ };
+
+ /** Used to map HTML entities to characters. */
+ var htmlUnescapes = {
+ '&': '&',
+ '<': '<',
+ '>': '>',
+ '"': '"',
+ ''': "'",
+ '`': '`'
+ };
+
+ /** Used to determine if values are of the language type `Object`. */
+ var objectTypes = {
+ 'function': true,
+ 'object': true
+ };
+
+ /** Used to escape characters for inclusion in compiled string literals. */
+ var stringEscapes = {
+ '\\': '\\',
+ "'": "'",
+ '\n': 'n',
+ '\r': 'r',
+ '\u2028': 'u2028',
+ '\u2029': 'u2029'
};
- // Export the Underscore object for **Node.js**, with
- // backwards-compatibility for the old `require()` API. If we're in
- // the browser, add `_` as a global object via a string identifier,
- // for Closure Compiler "advanced" mode.
- if (typeof exports !== 'undefined') {
- if (typeof module !== 'undefined' && module.exports) {
- exports = module.exports = _;
+ /** Detect free variable `exports`. */
+ var freeExports = objectTypes[typeof exports] && exports && !exports.nodeType && exports;
+
+ /** Detect free variable `module`. */
+ var freeModule = objectTypes[typeof module] && module && !module.nodeType && module;
+
+ /** Detect free variable `global` from Node.js. */
+ var freeGlobal = freeExports && freeModule && typeof global == 'object' && global && global.Object &&
global;
+
+ /** Detect free variable `self`. */
+ var freeSelf = objectTypes[typeof self] && self && self.Object && self;
+
+ /** Detect free variable `window`. */
+ var freeWindow = objectTypes[typeof window] && window && window.Object && window;
+
+ /** Detect the popular CommonJS extension `module.exports`. */
+ var moduleExports = freeModule && freeModule.exports === freeExports && freeExports;
+
+ /**
+ * Used as a reference to the global object.
+ *
+ * The `this` value is used if it is the global object to avoid Greasemonkey's
+ * restricted `window` object, otherwise the `window` object is used.
+ */
+ var root = freeGlobal || ((freeWindow !== (this && this.window)) && freeWindow) || freeSelf || this;
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * The base implementation of `compareAscending` which compares values and
+ * sorts them in ascending order without guaranteeing a stable sort.
+ *
+ * @private
+ * @param {*} value The value to compare to `other`.
+ * @param {*} other The value to compare to `value`.
+ * @returns {number} Returns the sort order indicator for `value`.
+ */
+ function baseCompareAscending(value, other) {
+ if (value !== other) {
+ var valIsReflexive = value === value,
+ othIsReflexive = other === other;
+
+ if (value > other || !valIsReflexive || (value === undefined && othIsReflexive)) {
+ return 1;
+ }
+ if (value < other || !othIsReflexive || (other === undefined && valIsReflexive)) {
+ return -1;
+ }
}
- exports._ = _;
- } else {
- root._ = _;
+ return 0;
}
- // Current version.
- _.VERSION = '1.6.0';
+ /**
+ * The base implementation of `_.findIndex` and `_.findLastIndex` without
+ * support for callback shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to search.
+ * @param {Function} predicate The function invoked per iteration.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+ function baseFindIndex(array, predicate, fromRight) {
+ var length = array.length,
+ index = fromRight ? length : -1;
- // Collection Functions
- // --------------------
+ while ((fromRight ? index-- : ++index < length)) {
+ if (predicate(array[index], index, array)) {
+ return index;
+ }
+ }
+ return -1;
+ }
- // The cornerstone, an `each` implementation, aka `forEach`.
- // Handles objects with the built-in `forEach`, arrays, and raw objects.
- // Delegates to **ECMAScript 5**'s native `forEach` if available.
- var each = _.each = _.forEach = function(obj, iterator, context) {
- if (obj == null) return obj;
- if (nativeForEach && obj.forEach === nativeForEach) {
- obj.forEach(iterator, context);
- } else if (obj.length === +obj.length) {
- for (var i = 0, length = obj.length; i < length; i++) {
- if (iterator.call(context, obj[i], i, obj) === breaker) return;
+ /**
+ * The base implementation of `_.indexOf` without support for binary searches.
+ *
+ * @private
+ * @param {Array} array The array to search.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+ function baseIndexOf(array, value, fromIndex) {
+ if (value !== value) {
+ return indexOfNaN(array, fromIndex);
+ }
+ var index = fromIndex - 1,
+ length = array.length;
+
+ while (++index < length) {
+ if (array[index] === value) {
+ return index;
}
- } else {
- var keys = _.keys(obj);
- for (var i = 0, length = keys.length; i < length; i++) {
- if (iterator.call(context, obj[keys[i]], keys[i], obj) === breaker) return;
+ }
+ return -1;
+ }
+
+ /**
+ * The base implementation of `_.isFunction` without support for environments
+ * with incorrect `typeof` results.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ */
+ function baseIsFunction(value) {
+ // Avoid a Chakra JIT bug in compatibility modes of IE 11.
+ // See https://github.com/jashkenas/underscore/issues/1621 for more details.
+ return typeof value == 'function' || false;
+ }
+
+ /**
+ * Converts `value` to a string if it is not one. An empty string is returned
+ * for `null` or `undefined` values.
+ *
+ * @private
+ * @param {*} value The value to process.
+ * @returns {string} Returns the string.
+ */
+ function baseToString(value) {
+ if (typeof value == 'string') {
+ return value;
+ }
+ return value == null ? '' : (value + '');
+ }
+
+ /**
+ * Used by `_.max` and `_.min` as the default callback for string values.
+ *
+ * @private
+ * @param {string} string The string to inspect.
+ * @returns {number} Returns the code unit of the first character of the string.
+ */
+ function charAtCallback(string) {
+ return string.charCodeAt(0);
+ }
+
+ /**
+ * Used by `_.trim` and `_.trimLeft` to get the index of the first character
+ * of `string` that is not found in `chars`.
+ *
+ * @private
+ * @param {string} string The string to inspect.
+ * @param {string} chars The characters to find.
+ * @returns {number} Returns the index of the first character not found in `chars`.
+ */
+ function charsLeftIndex(string, chars) {
+ var index = -1,
+ length = string.length;
+
+ while (++index < length && chars.indexOf(string.charAt(index)) > -1) {}
+ return index;
+ }
+
+ /**
+ * Used by `_.trim` and `_.trimRight` to get the index of the last character
+ * of `string` that is not found in `chars`.
+ *
+ * @private
+ * @param {string} string The string to inspect.
+ * @param {string} chars The characters to find.
+ * @returns {number} Returns the index of the last character not found in `chars`.
+ */
+ function charsRightIndex(string, chars) {
+ var index = string.length;
+
+ while (index-- && chars.indexOf(string.charAt(index)) > -1) {}
+ return index;
+ }
+
+ /**
+ * Used by `_.sortBy` to compare transformed elements of a collection and stable
+ * sort them in ascending order.
+ *
+ * @private
+ * @param {Object} object The object to compare to `other`.
+ * @param {Object} other The object to compare to `object`.
+ * @returns {number} Returns the sort order indicator for `object`.
+ */
+ function compareAscending(object, other) {
+ return baseCompareAscending(object.criteria, other.criteria) || (object.index - other.index);
+ }
+
+ /**
+ * Used by `_.sortByOrder` to compare multiple properties of each element
+ * in a collection and stable sort them in the following order:
+ *
+ * If `orders` is unspecified, sort in ascending order for all properties.
+ * Otherwise, for each property, sort in ascending order if its corresponding value in
+ * orders is true, and descending order if false.
+ *
+ * @private
+ * @param {Object} object The object to compare to `other`.
+ * @param {Object} other The object to compare to `object`.
+ * @param {boolean[]} orders The order to sort by for each property.
+ * @returns {number} Returns the sort order indicator for `object`.
+ */
+ function compareMultiple(object, other, orders) {
+ var index = -1,
+ objCriteria = object.criteria,
+ othCriteria = other.criteria,
+ length = objCriteria.length,
+ ordersLength = orders.length;
+
+ while (++index < length) {
+ var result = baseCompareAscending(objCriteria[index], othCriteria[index]);
+ if (result) {
+ if (index >= ordersLength) {
+ return result;
+ }
+ return result * (orders[index] ? 1 : -1);
}
}
- return obj;
- };
+ // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications
+ // that causes it, under certain circumstances, to provide the same value for
+ // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247
+ // for more details.
+ //
+ // This also ensures a stable sort in V8 and other engines.
+ // See https://code.google.com/p/v8/issues/detail?id=90 for more details.
+ return object.index - other.index;
+ }
- // Return the results of applying the iterator to each element.
- // Delegates to **ECMAScript 5**'s native `map` if available.
- _.map = _.collect = function(obj, iterator, context) {
- var results = [];
- if (obj == null) return results;
- if (nativeMap && obj.map === nativeMap) return obj.map(iterator, context);
- each(obj, function(value, index, list) {
- results.push(iterator.call(context, value, index, list));
- });
- return results;
- };
+ /**
+ * Used by `_.deburr` to convert latin-1 supplementary letters to basic latin letters.
+ *
+ * @private
+ * @param {string} letter The matched letter to deburr.
+ * @returns {string} Returns the deburred letter.
+ */
+ function deburrLetter(letter) {
+ return deburredLetters[letter];
+ }
- var reduceError = 'Reduce of empty array with no initial value';
-
- // **Reduce** builds up a single result from a list of values, aka `inject`,
- // or `foldl`. Delegates to **ECMAScript 5**'s native `reduce` if available.
- _.reduce = _.foldl = _.inject = function(obj, iterator, memo, context) {
- var initial = arguments.length > 2;
- if (obj == null) obj = [];
- if (nativeReduce && obj.reduce === nativeReduce) {
- if (context) iterator = _.bind(iterator, context);
- return initial ? obj.reduce(iterator, memo) : obj.reduce(iterator);
- }
- each(obj, function(value, index, list) {
- if (!initial) {
- memo = value;
- initial = true;
+ /**
+ * Used by `_.escape` to convert characters to HTML entities.
+ *
+ * @private
+ * @param {string} chr The matched character to escape.
+ * @returns {string} Returns the escaped character.
+ */
+ function escapeHtmlChar(chr) {
+ return htmlEscapes[chr];
+ }
+
+ /**
+ * Used by `_.template` to escape characters for inclusion in compiled
+ * string literals.
+ *
+ * @private
+ * @param {string} chr The matched character to escape.
+ * @returns {string} Returns the escaped character.
+ */
+ function escapeStringChar(chr) {
+ return '\\' + stringEscapes[chr];
+ }
+
+ /**
+ * Gets the index at which the first occurrence of `NaN` is found in `array`.
+ *
+ * @private
+ * @param {Array} array The array to search.
+ * @param {number} fromIndex The index to search from.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {number} Returns the index of the matched `NaN`, else `-1`.
+ */
+ function indexOfNaN(array, fromIndex, fromRight) {
+ var length = array.length,
+ index = fromIndex + (fromRight ? 0 : -1);
+
+ while ((fromRight ? index-- : ++index < length)) {
+ var other = array[index];
+ if (other !== other) {
+ return index;
+ }
+ }
+ return -1;
+ }
+
+ /**
+ * Checks if `value` is object-like.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
+ */
+ function isObjectLike(value) {
+ return !!value && typeof value == 'object';
+ }
+
+ /**
+ * Used by `trimmedLeftIndex` and `trimmedRightIndex` to determine if a
+ * character code is whitespace.
+ *
+ * @private
+ * @param {number} charCode The character code to inspect.
+ * @returns {boolean} Returns `true` if `charCode` is whitespace, else `false`.
+ */
+ function isSpace(charCode) {
+ return ((charCode <= 160 && (charCode >= 9 && charCode <= 13) || charCode == 32 || charCode == 160) ||
charCode == 5760 || charCode == 6158 ||
+ (charCode >= 8192 && (charCode <= 8202 || charCode == 8232 || charCode == 8233 || charCode == 8239 ||
charCode == 8287 || charCode == 12288 || charCode == 65279)));
+ }
+
+ /**
+ * Replaces all `placeholder` elements in `array` with an internal placeholder
+ * and returns an array of their indexes.
+ *
+ * @private
+ * @param {Array} array The array to modify.
+ * @param {*} placeholder The placeholder to replace.
+ * @returns {Array} Returns the new array of placeholder indexes.
+ */
+ function replaceHolders(array, placeholder) {
+ var index = -1,
+ length = array.length,
+ resIndex = -1,
+ result = [];
+
+ while (++index < length) {
+ if (array[index] === placeholder) {
+ array[index] = PLACEHOLDER;
+ result[++resIndex] = index;
+ }
+ }
+ return result;
+ }
+
+ /**
+ * An implementation of `_.uniq` optimized for sorted arrays without support
+ * for callback shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} [iteratee] The function invoked per iteration.
+ * @returns {Array} Returns the new duplicate-value-free array.
+ */
+ function sortedUniq(array, iteratee) {
+ var seen,
+ index = -1,
+ length = array.length,
+ resIndex = -1,
+ result = [];
+
+ while (++index < length) {
+ var value = array[index],
+ computed = iteratee ? iteratee(value, index, array) : value;
+
+ if (!index || seen !== computed) {
+ seen = computed;
+ result[++resIndex] = value;
+ }
+ }
+ return result;
+ }
+
+ /**
+ * Used by `_.trim` and `_.trimLeft` to get the index of the first non-whitespace
+ * character of `string`.
+ *
+ * @private
+ * @param {string} string The string to inspect.
+ * @returns {number} Returns the index of the first non-whitespace character.
+ */
+ function trimmedLeftIndex(string) {
+ var index = -1,
+ length = string.length;
+
+ while (++index < length && isSpace(string.charCodeAt(index))) {}
+ return index;
+ }
+
+ /**
+ * Used by `_.trim` and `_.trimRight` to get the index of the last non-whitespace
+ * character of `string`.
+ *
+ * @private
+ * @param {string} string The string to inspect.
+ * @returns {number} Returns the index of the last non-whitespace character.
+ */
+ function trimmedRightIndex(string) {
+ var index = string.length;
+
+ while (index-- && isSpace(string.charCodeAt(index))) {}
+ return index;
+ }
+
+ /**
+ * Used by `_.unescape` to convert HTML entities to characters.
+ *
+ * @private
+ * @param {string} chr The matched character to unescape.
+ * @returns {string} Returns the unescaped character.
+ */
+ function unescapeHtmlChar(chr) {
+ return htmlUnescapes[chr];
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Create a new pristine `lodash` function using the given `context` object.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {Object} [context=root] The context object.
+ * @returns {Function} Returns a new `lodash` function.
+ * @example
+ *
+ * _.mixin({ 'foo': _.constant('foo') });
+ *
+ * var lodash = _.runInContext();
+ * lodash.mixin({ 'bar': lodash.constant('bar') });
+ *
+ * _.isFunction(_.foo);
+ * // => true
+ * _.isFunction(_.bar);
+ * // => false
+ *
+ * lodash.isFunction(lodash.foo);
+ * // => false
+ * lodash.isFunction(lodash.bar);
+ * // => true
+ *
+ * // using `context` to mock `Date#getTime` use in `_.now`
+ * var mock = _.runInContext({
+ * 'Date': function() {
+ * return { 'getTime': getTimeMock };
+ * }
+ * });
+ *
+ * // or creating a suped-up `defer` in Node.js
+ * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;
+ */
+ function runInContext(context) {
+ // Avoid issues with some ES3 environments that attempt to use values, named
+ // after built-in constructors like `Object`, for the creation of literals.
+ // ES5 clears this up by stating that literals must use built-in constructors.
+ // See https://es5.github.io/#x11.1.5 for more details.
+ context = context ? _.defaults(root.Object(), context, _.pick(root, contextProps)) : root;
+
+ /** Native constructor references. */
+ var Array = context.Array,
+ Date = context.Date,
+ Error = context.Error,
+ Function = context.Function,
+ Math = context.Math,
+ Number = context.Number,
+ Object = context.Object,
+ RegExp = context.RegExp,
+ String = context.String,
+ TypeError = context.TypeError;
+
+ /** Used for native method references. */
+ var arrayProto = Array.prototype,
+ objectProto = Object.prototype,
+ stringProto = String.prototype;
+
+ /** Used to detect DOM support. */
+ var document = (document = context.window) && document.document;
+
+ /** Used to resolve the decompiled source of functions. */
+ var fnToString = Function.prototype.toString;
+
+ /** Used to check objects for own properties. */
+ var hasOwnProperty = objectProto.hasOwnProperty;
+
+ /** Used to generate unique IDs. */
+ var idCounter = 0;
+
+ /**
+ * Used to resolve the
[`toStringTag`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-object.prototype.tostring)
+ * of values.
+ */
+ var objToString = objectProto.toString;
+
+ /** Used to restore the original `_` reference in `_.noConflict`. */
+ var oldDash = context._;
+
+ /** Used to detect if a method is native. */
+ var reIsNative = RegExp('^' +
+ escapeRegExp(objToString)
+ .replace(/toString|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
+ );
+
+ /** Native method references. */
+ var ArrayBuffer = isNative(ArrayBuffer = context.ArrayBuffer) && ArrayBuffer,
+ bufferSlice = isNative(bufferSlice = ArrayBuffer && new ArrayBuffer(0).slice) && bufferSlice,
+ ceil = Math.ceil,
+ clearTimeout = context.clearTimeout,
+ floor = Math.floor,
+ getOwnPropertySymbols = isNative(getOwnPropertySymbols = Object.getOwnPropertySymbols) &&
getOwnPropertySymbols,
+ getPrototypeOf = isNative(getPrototypeOf = Object.getPrototypeOf) && getPrototypeOf,
+ push = arrayProto.push,
+ preventExtensions = isNative(Object.preventExtensions = Object.preventExtensions) &&
preventExtensions,
+ propertyIsEnumerable = objectProto.propertyIsEnumerable,
+ Set = isNative(Set = context.Set) && Set,
+ setTimeout = context.setTimeout,
+ splice = arrayProto.splice,
+ Uint8Array = isNative(Uint8Array = context.Uint8Array) && Uint8Array,
+ WeakMap = isNative(WeakMap = context.WeakMap) && WeakMap;
+
+ /** Used to clone array buffers. */
+ var Float64Array = (function() {
+ // Safari 5 errors when using an array buffer to initialize a typed array
+ // where the array buffer's `byteLength` is not a multiple of the typed
+ // array's `BYTES_PER_ELEMENT`.
+ try {
+ var func = isNative(func = context.Float64Array) && func,
+ result = new func(new ArrayBuffer(10), 0, 1) && func;
+ } catch(e) {}
+ return result;
+ }());
+
+ /** Used as `baseAssign`. */
+ var nativeAssign = (function() {
+ // Avoid `Object.assign` in Firefox 34-37 which have an early implementation
+ // with a now defunct try/catch behavior. See https://bugzilla.mozilla.org/show_bug.cgi?id=1103344
+ // for more details.
+ //
+ // Use `Object.preventExtensions` on a plain object instead of simply using
+ // `Object('x')` because Chrome and IE fail to throw an error when attempting
+ // to assign values to readonly indexes of strings in strict mode.
+ var object = { '1': 0 },
+ func = preventExtensions && isNative(func = Object.assign) && func;
+
+ try { func(preventExtensions(object), 'xo'); } catch(e) {}
+ return !object[1] && func;
+ }());
+
+ /* Native method references for those with the same name as other `lodash` methods. */
+ var nativeIsArray = isNative(nativeIsArray = Array.isArray) && nativeIsArray,
+ nativeCreate = isNative(nativeCreate = Object.create) && nativeCreate,
+ nativeIsFinite = context.isFinite,
+ nativeKeys = isNative(nativeKeys = Object.keys) && nativeKeys,
+ nativeMax = Math.max,
+ nativeMin = Math.min,
+ nativeNow = isNative(nativeNow = Date.now) && nativeNow,
+ nativeNumIsFinite = isNative(nativeNumIsFinite = Number.isFinite) && nativeNumIsFinite,
+ nativeParseInt = context.parseInt,
+ nativeRandom = Math.random;
+
+ /** Used as references for `-Infinity` and `Infinity`. */
+ var NEGATIVE_INFINITY = Number.NEGATIVE_INFINITY,
+ POSITIVE_INFINITY = Number.POSITIVE_INFINITY;
+
+ /** Used as references for the maximum length and index of an array. */
+ var MAX_ARRAY_LENGTH = Math.pow(2, 32) - 1,
+ MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,
+ HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;
+
+ /** Used as the size, in bytes, of each `Float64Array` element. */
+ var FLOAT64_BYTES_PER_ELEMENT = Float64Array ? Float64Array.BYTES_PER_ELEMENT : 0;
+
+ /**
+ * Used as the [maximum
length](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-number.max_safe_integer)
+ * of an array-like value.
+ */
+ var MAX_SAFE_INTEGER = Math.pow(2, 53) - 1;
+
+ /** Used to store function metadata. */
+ var metaMap = WeakMap && new WeakMap;
+
+ /** Used to lookup unminified function names. */
+ var realNames = {};
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Creates a `lodash` object which wraps `value` to enable implicit chaining.
+ * Methods that operate on and return arrays, collections, and functions can
+ * be chained together. Methods that return a boolean or single value will
+ * automatically end the chain returning the unwrapped value. Explicit chaining
+ * may be enabled using `_.chain`. The execution of chained methods is lazy,
+ * that is, execution is deferred until `_#value` is implicitly or explicitly
+ * called.
+ *
+ * Lazy evaluation allows several methods to support shortcut fusion. Shortcut
+ * fusion is an optimization that merges iteratees to avoid creating intermediate
+ * arrays and reduce the number of iteratee executions.
+ *
+ * Chaining is supported in custom builds as long as the `_#value` method is
+ * directly or indirectly included in the build.
+ *
+ * In addition to lodash methods, wrappers have `Array` and `String` methods.
+ *
+ * The wrapper `Array` methods are:
+ * `concat`, `join`, `pop`, `push`, `reverse`, `shift`, `slice`, `sort`,
+ * `splice`, and `unshift`
+ *
+ * The wrapper `String` methods are:
+ * `replace` and `split`
+ *
+ * The wrapper methods that support shortcut fusion are:
+ * `compact`, `drop`, `dropRight`, `dropRightWhile`, `dropWhile`, `filter`,
+ * `first`, `initial`, `last`, `map`, `pluck`, `reject`, `rest`, `reverse`,
+ * `slice`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, `toArray`,
+ * and `where`
+ *
+ * The chainable wrapper methods are:
+ * `after`, `ary`, `assign`, `at`, `before`, `bind`, `bindAll`, `bindKey`,
+ * `callback`, `chain`, `chunk`, `commit`, `compact`, `concat`, `constant`,
+ * `countBy`, `create`, `curry`, `debounce`, `defaults`, `defer`, `delay`,
+ * `difference`, `drop`, `dropRight`, `dropRightWhile`, `dropWhile`, `fill`,
+ * `filter`, `flatten`, `flattenDeep`, `flow`, `flowRight`, `forEach`,
+ * `forEachRight`, `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `functions`,
+ * `groupBy`, `indexBy`, `initial`, `intersection`, `invert`, `invoke`, `keys`,
+ * `keysIn`, `map`, `mapValues`, `matches`, `matchesProperty`, `memoize`,
+ * `merge`, `mixin`, `negate`, `omit`, `once`, `pairs`, `partial`, `partialRight`,
+ * `partition`, `pick`, `plant`, `pluck`, `property`, `propertyOf`, `pull`,
+ * `pullAt`, `push`, `range`, `rearg`, `reject`, `remove`, `rest`, `reverse`,
+ * `shuffle`, `slice`, `sort`, `sortBy`, `sortByAll`, `sortByOrder`, `splice`,
+ * `spread`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, `tap`,
+ * `throttle`, `thru`, `times`, `toArray`, `toPlainObject`, `transform`,
+ * `union`, `uniq`, `unshift`, `unzip`, `values`, `valuesIn`, `where`,
+ * `without`, `wrap`, `xor`, `zip`, and `zipObject`
+ *
+ * The wrapper methods that are **not** chainable by default are:
+ * `add`, `attempt`, `camelCase`, `capitalize`, `clone`, `cloneDeep`, `deburr`,
+ * `endsWith`, `escape`, `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`,
+ * `findLast`, `findLastIndex`, `findLastKey`, `findWhere`, `first`, `has`,
+ * `identity`, `includes`, `indexOf`, `inRange`, `isArguments`, `isArray`,
+ * `isBoolean`, `isDate`, `isElement`, `isEmpty`, `isEqual`, `isError`, `isFinite`
+ * `isFunction`, `isMatch`, `isNative`, `isNaN`, `isNull`, `isNumber`, `isObject`,
+ * `isPlainObject`, `isRegExp`, `isString`, `isUndefined`, `isTypedArray`,
+ * `join`, `kebabCase`, `last`, `lastIndexOf`, `max`, `min`, `noConflict`,
+ * `noop`, `now`, `pad`, `padLeft`, `padRight`, `parseInt`, `pop`, `random`,
+ * `reduce`, `reduceRight`, `repeat`, `result`, `runInContext`, `shift`, `size`,
+ * `snakeCase`, `some`, `sortedIndex`, `sortedLastIndex`, `startCase`, `startsWith`,
+ * `sum`, `template`, `trim`, `trimLeft`, `trimRight`, `trunc`, `unescape`,
+ * `uniqueId`, `value`, and `words`
+ *
+ * The wrapper method `sample` will return a wrapped value when `n` is provided,
+ * otherwise an unwrapped value is returned.
+ *
+ * @name _
+ * @constructor
+ * @category Chain
+ * @param {*} value The value to wrap in a `lodash` instance.
+ * @returns {Object} Returns the new `lodash` wrapper instance.
+ * @example
+ *
+ * var wrapped = _([1, 2, 3]);
+ *
+ * // returns an unwrapped value
+ * wrapped.reduce(function(total, n) {
+ * return total + n;
+ * });
+ * // => 6
+ *
+ * // returns a wrapped value
+ * var squares = wrapped.map(function(n) {
+ * return n * n;
+ * });
+ *
+ * _.isArray(squares);
+ * // => false
+ *
+ * _.isArray(squares.value());
+ * // => true
+ */
+ function lodash(value) {
+ if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {
+ if (value instanceof LodashWrapper) {
+ return value;
+ }
+ if (hasOwnProperty.call(value, '__chain__') && hasOwnProperty.call(value, '__wrapped__')) {
+ return wrapperClone(value);
+ }
+ }
+ return new LodashWrapper(value);
+ }
+
+ /**
+ * The function whose prototype all chaining wrappers inherit from.
+ *
+ * @private
+ */
+ function baseLodash() {
+ // No operation performed.
+ }
+
+ /**
+ * The base constructor for creating `lodash` wrapper objects.
+ *
+ * @private
+ * @param {*} value The value to wrap.
+ * @param {boolean} [chainAll] Enable chaining for all wrapper methods.
+ * @param {Array} [actions=[]] Actions to peform to resolve the unwrapped value.
+ */
+ function LodashWrapper(value, chainAll, actions) {
+ this.__wrapped__ = value;
+ this.__actions__ = actions || [];
+ this.__chain__ = !!chainAll;
+ }
+
+ /**
+ * An object environment feature flags.
+ *
+ * @static
+ * @memberOf _
+ * @type Object
+ */
+ var support = lodash.support = {};
+
+ (function(x) {
+ var Ctor = function() { this.x = x; },
+ object = { '0': x, 'length': x },
+ props = [];
+
+ Ctor.prototype = { 'valueOf': x, 'y': x };
+ for (var key in new Ctor) { props.push(key); }
+
+ /**
+ * Detect if functions can be decompiled by `Function#toString`
+ * (all but Firefox OS certified apps, older Opera mobile browsers, and
+ * the PlayStation 3; forced `false` for Windows 8 apps).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.funcDecomp = /\bthis\b/.test(function() { return this; });
+
+ /**
+ * Detect if `Function#name` is supported (all but IE).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.funcNames = typeof Function.name == 'string';
+
+ /**
+ * Detect if the DOM is supported.
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ try {
+ support.dom = document.createDocumentFragment().nodeType === 11;
+ } catch(e) {
+ support.dom = false;
+ }
+
+ /**
+ * Detect if `arguments` object indexes are non-enumerable.
+ *
+ * In Firefox < 4, IE < 9, PhantomJS, and Safari < 5.1 `arguments` object
+ * indexes are non-enumerable. Chrome < 25 and Node.js < 0.11.0 treat
+ * `arguments` object indexes as non-enumerable and fail `hasOwnProperty`
+ * checks for indexes that exceed the number of function parameters and
+ * whose associated argument values are `0`.
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ try {
+ support.nonEnumArgs = !propertyIsEnumerable.call(arguments, 1);
+ } catch(e) {
+ support.nonEnumArgs = true;
+ }
+ }(1, 0));
+
+ /**
+ * By default, the template delimiters used by lodash are like those in
+ * embedded Ruby (ERB). Change the following template settings to use
+ * alternative delimiters.
+ *
+ * @static
+ * @memberOf _
+ * @type Object
+ */
+ lodash.templateSettings = {
+
+ /**
+ * Used to detect `data` property values to be HTML-escaped.
+ *
+ * @memberOf _.templateSettings
+ * @type RegExp
+ */
+ 'escape': reEscape,
+
+ /**
+ * Used to detect code to be evaluated.
+ *
+ * @memberOf _.templateSettings
+ * @type RegExp
+ */
+ 'evaluate': reEvaluate,
+
+ /**
+ * Used to detect `data` property values to inject.
+ *
+ * @memberOf _.templateSettings
+ * @type RegExp
+ */
+ 'interpolate': reInterpolate,
+
+ /**
+ * Used to reference the data object in the template text.
+ *
+ * @memberOf _.templateSettings
+ * @type string
+ */
+ 'variable': '',
+
+ /**
+ * Used to import variables into the compiled template.
+ *
+ * @memberOf _.templateSettings
+ * @type Object
+ */
+ 'imports': {
+
+ /**
+ * A reference to the `lodash` function.
+ *
+ * @memberOf _.templateSettings.imports
+ * @type Function
+ */
+ '_': lodash
+ }
+ };
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.
+ *
+ * @private
+ * @param {*} value The value to wrap.
+ */
+ function LazyWrapper(value) {
+ this.__wrapped__ = value;
+ this.__actions__ = null;
+ this.__dir__ = 1;
+ this.__dropCount__ = 0;
+ this.__filtered__ = false;
+ this.__iteratees__ = null;
+ this.__takeCount__ = POSITIVE_INFINITY;
+ this.__views__ = null;
+ }
+
+ /**
+ * Creates a clone of the lazy wrapper object.
+ *
+ * @private
+ * @name clone
+ * @memberOf LazyWrapper
+ * @returns {Object} Returns the cloned `LazyWrapper` object.
+ */
+ function lazyClone() {
+ var actions = this.__actions__,
+ iteratees = this.__iteratees__,
+ views = this.__views__,
+ result = new LazyWrapper(this.__wrapped__);
+
+ result.__actions__ = actions ? arrayCopy(actions) : null;
+ result.__dir__ = this.__dir__;
+ result.__filtered__ = this.__filtered__;
+ result.__iteratees__ = iteratees ? arrayCopy(iteratees) : null;
+ result.__takeCount__ = this.__takeCount__;
+ result.__views__ = views ? arrayCopy(views) : null;
+ return result;
+ }
+
+ /**
+ * Reverses the direction of lazy iteration.
+ *
+ * @private
+ * @name reverse
+ * @memberOf LazyWrapper
+ * @returns {Object} Returns the new reversed `LazyWrapper` object.
+ */
+ function lazyReverse() {
+ if (this.__filtered__) {
+ var result = new LazyWrapper(this);
+ result.__dir__ = -1;
+ result.__filtered__ = true;
} else {
- memo = iterator.call(context, memo, value, index, list);
+ result = this.clone();
+ result.__dir__ *= -1;
}
- });
- if (!initial) throw new TypeError(reduceError);
- return memo;
- };
+ return result;
+ }
+
+ /**
+ * Extracts the unwrapped value from its lazy wrapper.
+ *
+ * @private
+ * @name value
+ * @memberOf LazyWrapper
+ * @returns {*} Returns the unwrapped value.
+ */
+ function lazyValue() {
+ var array = this.__wrapped__.value();
+ if (!isArray(array)) {
+ return baseWrapperValue(array, this.__actions__);
+ }
+ var dir = this.__dir__,
+ isRight = dir < 0,
+ view = getView(0, array.length, this.__views__),
+ start = view.start,
+ end = view.end,
+ length = end - start,
+ index = isRight ? end : (start - 1),
+ takeCount = nativeMin(length, this.__takeCount__),
+ iteratees = this.__iteratees__,
+ iterLength = iteratees ? iteratees.length : 0,
+ resIndex = 0,
+ result = [];
+
+ outer:
+ while (length-- && resIndex < takeCount) {
+ index += dir;
+
+ var iterIndex = -1,
+ value = array[index];
+
+ while (++iterIndex < iterLength) {
+ var data = iteratees[iterIndex],
+ iteratee = data.iteratee,
+ type = data.type;
+
+ if (type == LAZY_DROP_WHILE_FLAG) {
+ if (data.done && (isRight ? (index > data.index) : (index < data.index))) {
+ data.count = 0;
+ data.done = false;
+ }
+ data.index = index;
+ if (!data.done) {
+ var limit = data.limit;
+ if (!(data.done = limit > -1 ? (data.count++ >= limit) : !iteratee(value))) {
+ continue outer;
+ }
+ }
+ } else {
+ var computed = iteratee(value);
+ if (type == LAZY_MAP_FLAG) {
+ value = computed;
+ } else if (!computed) {
+ if (type == LAZY_FILTER_FLAG) {
+ continue outer;
+ } else {
+ break outer;
+ }
+ }
+ }
+ }
+ result[resIndex++] = value;
+ }
+ return result;
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Creates a cache object to store key/value pairs.
+ *
+ * @private
+ * @static
+ * @name Cache
+ * @memberOf _.memoize
+ */
+ function MapCache() {
+ this.__data__ = {};
+ }
+
+ /**
+ * Removes `key` and its value from the cache.
+ *
+ * @private
+ * @name delete
+ * @memberOf _.memoize.Cache
+ * @param {string} key The key of the value to remove.
+ * @returns {boolean} Returns `true` if the entry was removed successfully, else `false`.
+ */
+ function mapDelete(key) {
+ return this.has(key) && delete this.__data__[key];
+ }
+
+ /**
+ * Gets the cached value for `key`.
+ *
+ * @private
+ * @name get
+ * @memberOf _.memoize.Cache
+ * @param {string} key The key of the value to get.
+ * @returns {*} Returns the cached value.
+ */
+ function mapGet(key) {
+ return key == '__proto__' ? undefined : this.__data__[key];
+ }
+
+ /**
+ * Checks if a cached value for `key` exists.
+ *
+ * @private
+ * @name has
+ * @memberOf _.memoize.Cache
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+ function mapHas(key) {
+ return key != '__proto__' && hasOwnProperty.call(this.__data__, key);
+ }
+
+ /**
+ * Sets `value` to `key` of the cache.
+ *
+ * @private
+ * @name set
+ * @memberOf _.memoize.Cache
+ * @param {string} key The key of the value to cache.
+ * @param {*} value The value to cache.
+ * @returns {Object} Returns the cache object.
+ */
+ function mapSet(key, value) {
+ if (key != '__proto__') {
+ this.__data__[key] = value;
+ }
+ return this;
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ *
+ * Creates a cache object to store unique values.
+ *
+ * @private
+ * @param {Array} [values] The values to cache.
+ */
+ function SetCache(values) {
+ var length = values ? values.length : 0;
+
+ this.data = { 'hash': nativeCreate(null), 'set': new Set };
+ while (length--) {
+ this.push(values[length]);
+ }
+ }
+
+ /**
+ * Checks if `value` is in `cache` mimicking the return signature of
+ * `_.indexOf` by returning `0` if the value is found, else `-1`.
+ *
+ * @private
+ * @param {Object} cache The cache to search.
+ * @param {*} value The value to search for.
+ * @returns {number} Returns `0` if `value` is found, else `-1`.
+ */
+ function cacheIndexOf(cache, value) {
+ var data = cache.data,
+ result = (typeof value == 'string' || isObject(value)) ? data.set.has(value) : data.hash[value];
+
+ return result ? 0 : -1;
+ }
- // The right-associative version of reduce, also known as `foldr`.
- // Delegates to **ECMAScript 5**'s native `reduceRight` if available.
- _.reduceRight = _.foldr = function(obj, iterator, memo, context) {
- var initial = arguments.length > 2;
- if (obj == null) obj = [];
- if (nativeReduceRight && obj.reduceRight === nativeReduceRight) {
- if (context) iterator = _.bind(iterator, context);
- return initial ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator);
- }
- var length = obj.length;
- if (length !== +length) {
- var keys = _.keys(obj);
- length = keys.length;
- }
- each(obj, function(value, index, list) {
- index = keys ? keys[--length] : --length;
- if (!initial) {
- memo = obj[index];
- initial = true;
+ /**
+ * Adds `value` to the cache.
+ *
+ * @private
+ * @name push
+ * @memberOf SetCache
+ * @param {*} value The value to cache.
+ */
+ function cachePush(value) {
+ var data = this.data;
+ if (typeof value == 'string' || isObject(value)) {
+ data.set.add(value);
} else {
- memo = iterator.call(context, memo, obj[index], index, list);
+ data.hash[value] = true;
}
- });
- if (!initial) throw new TypeError(reduceError);
- return memo;
- };
+ }
- // Return the first value which passes a truth test. Aliased as `detect`.
- _.find = _.detect = function(obj, predicate, context) {
- var result;
- any(obj, function(value, index, list) {
- if (predicate.call(context, value, index, list)) {
- result = value;
- return true;
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Copies the values of `source` to `array`.
+ *
+ * @private
+ * @param {Array} source The array to copy values from.
+ * @param {Array} [array=[]] The array to copy values to.
+ * @returns {Array} Returns `array`.
+ */
+ function arrayCopy(source, array) {
+ var index = -1,
+ length = source.length;
+
+ array || (array = Array(length));
+ while (++index < length) {
+ array[index] = source[index];
}
- });
- return result;
- };
+ return array;
+ }
- // Return all the elements that pass a truth test.
- // Delegates to **ECMAScript 5**'s native `filter` if available.
- // Aliased as `select`.
- _.filter = _.select = function(obj, predicate, context) {
- var results = [];
- if (obj == null) return results;
- if (nativeFilter && obj.filter === nativeFilter) return obj.filter(predicate, context);
- each(obj, function(value, index, list) {
- if (predicate.call(context, value, index, list)) results.push(value);
- });
- return results;
- };
+ /**
+ * A specialized version of `_.forEach` for arrays without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns `array`.
+ */
+ function arrayEach(array, iteratee) {
+ var index = -1,
+ length = array.length;
- // Return all the elements for which a truth test fails.
- _.reject = function(obj, predicate, context) {
- return _.filter(obj, function(value, index, list) {
- return !predicate.call(context, value, index, list);
- }, context);
- };
+ while (++index < length) {
+ if (iteratee(array[index], index, array) === false) {
+ break;
+ }
+ }
+ return array;
+ }
- // Determine whether all of the elements match a truth test.
- // Delegates to **ECMAScript 5**'s native `every` if available.
- // Aliased as `all`.
- _.every = _.all = function(obj, predicate, context) {
- predicate || (predicate = _.identity);
- var result = true;
- if (obj == null) return result;
- if (nativeEvery && obj.every === nativeEvery) return obj.every(predicate, context);
- each(obj, function(value, index, list) {
- if (!(result = result && predicate.call(context, value, index, list))) return breaker;
- });
- return !!result;
- };
+ /**
+ * A specialized version of `_.forEachRight` for arrays without support for
+ * callback shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns `array`.
+ */
+ function arrayEachRight(array, iteratee) {
+ var length = array.length;
- // Determine if at least one element in the object matches a truth test.
- // Delegates to **ECMAScript 5**'s native `some` if available.
- // Aliased as `any`.
- var any = _.some = _.any = function(obj, predicate, context) {
- predicate || (predicate = _.identity);
- var result = false;
- if (obj == null) return result;
- if (nativeSome && obj.some === nativeSome) return obj.some(predicate, context);
- each(obj, function(value, index, list) {
- if (result || (result = predicate.call(context, value, index, list))) return breaker;
- });
- return !!result;
- };
+ while (length--) {
+ if (iteratee(array[length], length, array) === false) {
+ break;
+ }
+ }
+ return array;
+ }
- // Determine if the array or object contains a given value (using `===`).
- // Aliased as `include`.
- _.contains = _.include = function(obj, target) {
- if (obj == null) return false;
- if (nativeIndexOf && obj.indexOf === nativeIndexOf) return obj.indexOf(target) != -1;
- return any(obj, function(value) {
- return value === target;
- });
- };
+ /**
+ * A specialized version of `_.every` for arrays without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {boolean} Returns `true` if all elements pass the predicate check,
+ * else `false`.
+ */
+ function arrayEvery(array, predicate) {
+ var index = -1,
+ length = array.length;
- // Invoke a method (with arguments) on every item in a collection.
- _.invoke = function(obj, method) {
- var args = slice.call(arguments, 2);
- var isFunc = _.isFunction(method);
- return _.map(obj, function(value) {
- return (isFunc ? method : value[method]).apply(value, args);
- });
- };
+ while (++index < length) {
+ if (!predicate(array[index], index, array)) {
+ return false;
+ }
+ }
+ return true;
+ }
- // Convenience version of a common use case of `map`: fetching a property.
- _.pluck = function(obj, key) {
- return _.map(obj, _.property(key));
- };
+ /**
+ * A specialized version of `_.filter` for arrays without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {Array} Returns the new filtered array.
+ */
+ function arrayFilter(array, predicate) {
+ var index = -1,
+ length = array.length,
+ resIndex = -1,
+ result = [];
+
+ while (++index < length) {
+ var value = array[index];
+ if (predicate(value, index, array)) {
+ result[++resIndex] = value;
+ }
+ }
+ return result;
+ }
- // Convenience version of a common use case of `filter`: selecting only objects
- // containing specific `key:value` pairs.
- _.where = function(obj, attrs) {
- return _.filter(obj, _.matches(attrs));
- };
+ /**
+ * A specialized version of `_.map` for arrays without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns the new mapped array.
+ */
+ function arrayMap(array, iteratee) {
+ var index = -1,
+ length = array.length,
+ result = Array(length);
- // Convenience version of a common use case of `find`: getting the first object
- // containing specific `key:value` pairs.
- _.findWhere = function(obj, attrs) {
- return _.find(obj, _.matches(attrs));
- };
+ while (++index < length) {
+ result[index] = iteratee(array[index], index, array);
+ }
+ return result;
+ }
- // Return the maximum element or (element-based computation).
- // Can't optimize arrays of integers longer than 65,535 elements.
- // See [WebKit Bug 80797](https://bugs.webkit.org/show_bug.cgi?id=80797)
- _.max = function(obj, iterator, context) {
- if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) {
- return Math.max.apply(Math, obj);
+ /**
+ * A specialized version of `_.max` for arrays without support for iteratees.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @returns {*} Returns the maximum value.
+ */
+ function arrayMax(array) {
+ var index = -1,
+ length = array.length,
+ result = NEGATIVE_INFINITY;
+
+ while (++index < length) {
+ var value = array[index];
+ if (value > result) {
+ result = value;
+ }
+ }
+ return result;
}
- var result = -Infinity, lastComputed = -Infinity;
- each(obj, function(value, index, list) {
- var computed = iterator ? iterator.call(context, value, index, list) : value;
- if (computed > lastComputed) {
- result = value;
- lastComputed = computed;
+
+ /**
+ * A specialized version of `_.min` for arrays without support for iteratees.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @returns {*} Returns the minimum value.
+ */
+ function arrayMin(array) {
+ var index = -1,
+ length = array.length,
+ result = POSITIVE_INFINITY;
+
+ while (++index < length) {
+ var value = array[index];
+ if (value < result) {
+ result = value;
+ }
}
- });
- return result;
- };
+ return result;
+ }
+
+ /**
+ * A specialized version of `_.reduce` for arrays without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {*} [accumulator] The initial value.
+ * @param {boolean} [initFromArray] Specify using the first element of `array`
+ * as the initial value.
+ * @returns {*} Returns the accumulated value.
+ */
+ function arrayReduce(array, iteratee, accumulator, initFromArray) {
+ var index = -1,
+ length = array.length;
- // Return the minimum element (or element-based computation).
- _.min = function(obj, iterator, context) {
- if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) {
- return Math.min.apply(Math, obj);
+ if (initFromArray && length) {
+ accumulator = array[++index];
+ }
+ while (++index < length) {
+ accumulator = iteratee(accumulator, array[index], index, array);
+ }
+ return accumulator;
}
- var result = Infinity, lastComputed = Infinity;
- each(obj, function(value, index, list) {
- var computed = iterator ? iterator.call(context, value, index, list) : value;
- if (computed < lastComputed) {
- result = value;
- lastComputed = computed;
+
+ /**
+ * A specialized version of `_.reduceRight` for arrays without support for
+ * callback shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {*} [accumulator] The initial value.
+ * @param {boolean} [initFromArray] Specify using the last element of `array`
+ * as the initial value.
+ * @returns {*} Returns the accumulated value.
+ */
+ function arrayReduceRight(array, iteratee, accumulator, initFromArray) {
+ var length = array.length;
+ if (initFromArray && length) {
+ accumulator = array[--length];
}
- });
- return result;
- };
+ while (length--) {
+ accumulator = iteratee(accumulator, array[length], length, array);
+ }
+ return accumulator;
+ }
- // Shuffle an array, using the modern version of the
- // [Fisher-Yates shuffle](http://en.wikipedia.org/wiki/Fisher–Yates_shuffle).
- _.shuffle = function(obj) {
- var rand;
- var index = 0;
- var shuffled = [];
- each(obj, function(value) {
- rand = _.random(index++);
- shuffled[index - 1] = shuffled[rand];
- shuffled[rand] = value;
- });
- return shuffled;
- };
+ /**
+ * A specialized version of `_.some` for arrays without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {boolean} Returns `true` if any element passes the predicate check,
+ * else `false`.
+ */
+ function arraySome(array, predicate) {
+ var index = -1,
+ length = array.length;
- // Sample **n** random values from a collection.
- // If **n** is not specified, returns a single random element.
- // The internal `guard` argument allows it to work with `map`.
- _.sample = function(obj, n, guard) {
- if (n == null || guard) {
- if (obj.length !== +obj.length) obj = _.values(obj);
- return obj[_.random(obj.length - 1)];
+ while (++index < length) {
+ if (predicate(array[index], index, array)) {
+ return true;
+ }
+ }
+ return false;
}
- return _.shuffle(obj).slice(0, Math.max(0, n));
- };
- // An internal function to generate lookup iterators.
- var lookupIterator = function(value) {
- if (value == null) return _.identity;
- if (_.isFunction(value)) return value;
- return _.property(value);
- };
+ /**
+ * A specialized version of `_.sum` for arrays without support for iteratees.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @returns {number} Returns the sum.
+ */
+ function arraySum(array) {
+ var length = array.length,
+ result = 0;
- // Sort the object's values by a criterion produced by an iterator.
- _.sortBy = function(obj, iterator, context) {
- iterator = lookupIterator(iterator);
- return _.pluck(_.map(obj, function(value, index, list) {
- return {
- value: value,
- index: index,
- criteria: iterator.call(context, value, index, list)
+ while (length--) {
+ result += +array[length] || 0;
+ }
+ return result;
+ }
+
+ /**
+ * Used by `_.defaults` to customize its `_.assign` use.
+ *
+ * @private
+ * @param {*} objectValue The destination object property value.
+ * @param {*} sourceValue The source object property value.
+ * @returns {*} Returns the value to assign to the destination object.
+ */
+ function assignDefaults(objectValue, sourceValue) {
+ return objectValue === undefined ? sourceValue : objectValue;
+ }
+
+ /**
+ * Used by `_.template` to customize its `_.assign` use.
+ *
+ * **Note:** This function is like `assignDefaults` except that it ignores
+ * inherited property values when checking if a property is `undefined`.
+ *
+ * @private
+ * @param {*} objectValue The destination object property value.
+ * @param {*} sourceValue The source object property value.
+ * @param {string} key The key associated with the object and source values.
+ * @param {Object} object The destination object.
+ * @returns {*} Returns the value to assign to the destination object.
+ */
+ function assignOwnDefaults(objectValue, sourceValue, key, object) {
+ return (objectValue === undefined || !hasOwnProperty.call(object, key))
+ ? sourceValue
+ : objectValue;
+ }
+
+ /**
+ * A specialized version of `_.assign` for customizing assigned values without
+ * support for argument juggling, multiple sources, and `this` binding `customizer`
+ * functions.
+ *
+ * @private
+ * @param {Object} object The destination object.
+ * @param {Object} source The source object.
+ * @param {Function} customizer The function to customize assigned values.
+ * @returns {Object} Returns `object`.
+ */
+ function assignWith(object, source, customizer) {
+ var props = keys(source);
+ push.apply(props, getSymbols(source));
+
+ var index = -1,
+ length = props.length;
+
+ while (++index < length) {
+ var key = props[index],
+ value = object[key],
+ result = customizer(value, source[key], key, object, source);
+
+ if ((result === result ? (result !== value) : (value === value)) ||
+ (value === undefined && !(key in object))) {
+ object[key] = result;
+ }
+ }
+ return object;
+ }
+
+ /**
+ * The base implementation of `_.assign` without support for argument juggling,
+ * multiple sources, and `customizer` functions.
+ *
+ * @private
+ * @param {Object} object The destination object.
+ * @param {Object} source The source object.
+ * @returns {Object} Returns `object`.
+ */
+ var baseAssign = nativeAssign || function(object, source) {
+ return source == null
+ ? object
+ : baseCopy(source, getSymbols(source), baseCopy(source, keys(source), object));
+ };
+
+ /**
+ * The base implementation of `_.at` without support for string collections
+ * and individual key arguments.
+ *
+ * @private
+ * @param {Array|Object} collection The collection to iterate over.
+ * @param {number[]|string[]} props The property names or indexes of elements to pick.
+ * @returns {Array} Returns the new array of picked elements.
+ */
+ function baseAt(collection, props) {
+ var index = -1,
+ length = collection.length,
+ isArr = isLength(length),
+ propsLength = props.length,
+ result = Array(propsLength);
+
+ while(++index < propsLength) {
+ var key = props[index];
+ if (isArr) {
+ result[index] = isIndex(key, length) ? collection[key] : undefined;
+ } else {
+ result[index] = collection[key];
+ }
+ }
+ return result;
+ }
+
+ /**
+ * Copies properties of `source` to `object`.
+ *
+ * @private
+ * @param {Object} source The object to copy properties from.
+ * @param {Array} props The property names to copy.
+ * @param {Object} [object={}] The object to copy properties to.
+ * @returns {Object} Returns `object`.
+ */
+ function baseCopy(source, props, object) {
+ object || (object = {});
+
+ var index = -1,
+ length = props.length;
+
+ while (++index < length) {
+ var key = props[index];
+ object[key] = source[key];
+ }
+ return object;
+ }
+
+ /**
+ * The base implementation of `_.callback` which supports specifying the
+ * number of arguments to provide to `func`.
+ *
+ * @private
+ * @param {*} [func=_.identity] The value to convert to a callback.
+ * @param {*} [thisArg] The `this` binding of `func`.
+ * @param {number} [argCount] The number of arguments to provide to `func`.
+ * @returns {Function} Returns the callback.
+ */
+ function baseCallback(func, thisArg, argCount) {
+ var type = typeof func;
+ if (type == 'function') {
+ return thisArg === undefined
+ ? func
+ : bindCallback(func, thisArg, argCount);
+ }
+ if (func == null) {
+ return identity;
+ }
+ if (type == 'object') {
+ return baseMatches(func);
+ }
+ return thisArg === undefined
+ ? property(func)
+ : baseMatchesProperty(func, thisArg);
+ }
+
+ /**
+ * The base implementation of `_.clone` without support for argument juggling
+ * and `this` binding `customizer` functions.
+ *
+ * @private
+ * @param {*} value The value to clone.
+ * @param {boolean} [isDeep] Specify a deep clone.
+ * @param {Function} [customizer] The function to customize cloning values.
+ * @param {string} [key] The key of `value`.
+ * @param {Object} [object] The object `value` belongs to.
+ * @param {Array} [stackA=[]] Tracks traversed source objects.
+ * @param {Array} [stackB=[]] Associates clones with source counterparts.
+ * @returns {*} Returns the cloned value.
+ */
+ function baseClone(value, isDeep, customizer, key, object, stackA, stackB) {
+ var result;
+ if (customizer) {
+ result = object ? customizer(value, key, object) : customizer(value);
+ }
+ if (result !== undefined) {
+ return result;
+ }
+ if (!isObject(value)) {
+ return value;
+ }
+ var isArr = isArray(value);
+ if (isArr) {
+ result = initCloneArray(value);
+ if (!isDeep) {
+ return arrayCopy(value, result);
+ }
+ } else {
+ var tag = objToString.call(value),
+ isFunc = tag == funcTag;
+
+ if (tag == objectTag || tag == argsTag || (isFunc && !object)) {
+ result = initCloneObject(isFunc ? {} : value);
+ if (!isDeep) {
+ return baseAssign(result, value);
+ }
+ } else {
+ return cloneableTags[tag]
+ ? initCloneByTag(value, tag, isDeep)
+ : (object ? value : {});
+ }
+ }
+ // Check for circular references and return corresponding clone.
+ stackA || (stackA = []);
+ stackB || (stackB = []);
+
+ var length = stackA.length;
+ while (length--) {
+ if (stackA[length] == value) {
+ return stackB[length];
+ }
+ }
+ // Add the source value to the stack of traversed objects and associate it with its clone.
+ stackA.push(value);
+ stackB.push(result);
+
+ // Recursively populate clone (susceptible to call stack limits).
+ (isArr ? arrayEach : baseForOwn)(value, function(subValue, key) {
+ result[key] = baseClone(subValue, isDeep, customizer, key, value, stackA, stackB);
+ });
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.create` without support for assigning
+ * properties to the created object.
+ *
+ * @private
+ * @param {Object} prototype The object to inherit from.
+ * @returns {Object} Returns the new object.
+ */
+ var baseCreate = (function() {
+ function Object() {}
+ return function(prototype) {
+ if (isObject(prototype)) {
+ Object.prototype = prototype;
+ var result = new Object;
+ Object.prototype = null;
+ }
+ return result || context.Object();
};
- }).sort(function(left, right) {
- var a = left.criteria;
- var b = right.criteria;
- if (a !== b) {
- if (a > b || a === void 0) return 1;
- if (a < b || b === void 0) return -1;
- }
- return left.index - right.index;
- }), 'value');
- };
+ }());
- // An internal function used for aggregate "group by" operations.
- var group = function(behavior) {
- return function(obj, iterator, context) {
- var result = {};
- iterator = lookupIterator(iterator);
- each(obj, function(value, index) {
- var key = iterator.call(context, value, index, obj);
- behavior(result, key, value);
+ /**
+ * The base implementation of `_.delay` and `_.defer` which accepts an index
+ * of where to slice the arguments to provide to `func`.
+ *
+ * @private
+ * @param {Function} func The function to delay.
+ * @param {number} wait The number of milliseconds to delay invocation.
+ * @param {Object} args The arguments provide to `func`.
+ * @returns {number} Returns the timer id.
+ */
+ function baseDelay(func, wait, args) {
+ if (typeof func != 'function') {
+ throw new TypeError(FUNC_ERROR_TEXT);
+ }
+ return setTimeout(function() { func.apply(undefined, args); }, wait);
+ }
+
+ /**
+ * The base implementation of `_.difference` which accepts a single array
+ * of values to exclude.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Array} values The values to exclude.
+ * @returns {Array} Returns the new array of filtered values.
+ */
+ function baseDifference(array, values) {
+ var length = array ? array.length : 0,
+ result = [];
+
+ if (!length) {
+ return result;
+ }
+ var index = -1,
+ indexOf = getIndexOf(),
+ isCommon = indexOf == baseIndexOf,
+ cache = (isCommon && values.length >= 200) ? createCache(values) : null,
+ valuesLength = values.length;
+
+ if (cache) {
+ indexOf = cacheIndexOf;
+ isCommon = false;
+ values = cache;
+ }
+ outer:
+ while (++index < length) {
+ var value = array[index];
+
+ if (isCommon && value === value) {
+ var valuesIndex = valuesLength;
+ while (valuesIndex--) {
+ if (values[valuesIndex] === value) {
+ continue outer;
+ }
+ }
+ result.push(value);
+ }
+ else if (indexOf(values, value, 0) < 0) {
+ result.push(value);
+ }
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.forEach` without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array|Object|string} Returns `collection`.
+ */
+ var baseEach = createBaseEach(baseForOwn);
+
+ /**
+ * The base implementation of `_.forEachRight` without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array|Object|string} Returns `collection`.
+ */
+ var baseEachRight = createBaseEach(baseForOwnRight, true);
+
+ /**
+ * The base implementation of `_.every` without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {boolean} Returns `true` if all elements pass the predicate check,
+ * else `false`
+ */
+ function baseEvery(collection, predicate) {
+ var result = true;
+ baseEach(collection, function(value, index, collection) {
+ result = !!predicate(value, index, collection);
+ return result;
});
return result;
+ }
+
+ /**
+ * The base implementation of `_.fill` without an iteratee call guard.
+ *
+ * @private
+ * @param {Array} array The array to fill.
+ * @param {*} value The value to fill `array` with.
+ * @param {number} [start=0] The start position.
+ * @param {number} [end=array.length] The end position.
+ * @returns {Array} Returns `array`.
+ */
+ function baseFill(array, value, start, end) {
+ var length = array.length;
+
+ start = start == null ? 0 : (+start || 0);
+ if (start < 0) {
+ start = -start > length ? 0 : (length + start);
+ }
+ end = (end === undefined || end > length) ? length : (+end || 0);
+ if (end < 0) {
+ end += length;
+ }
+ length = start > end ? 0 : (end >>> 0);
+ start >>>= 0;
+
+ while (start < length) {
+ array[start++] = value;
+ }
+ return array;
+ }
+
+ /**
+ * The base implementation of `_.filter` without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {Array} Returns the new filtered array.
+ */
+ function baseFilter(collection, predicate) {
+ var result = [];
+ baseEach(collection, function(value, index, collection) {
+ if (predicate(value, index, collection)) {
+ result.push(value);
+ }
+ });
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.find`, `_.findLast`, `_.findKey`, and `_.findLastKey`,
+ * without support for callback shorthands and `this` binding, which iterates
+ * over `collection` using the provided `eachFunc`.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to search.
+ * @param {Function} predicate The function invoked per iteration.
+ * @param {Function} eachFunc The function to iterate over `collection`.
+ * @param {boolean} [retKey] Specify returning the key of the found element
+ * instead of the element itself.
+ * @returns {*} Returns the found element or its key, else `undefined`.
+ */
+ function baseFind(collection, predicate, eachFunc, retKey) {
+ var result;
+ eachFunc(collection, function(value, key, collection) {
+ if (predicate(value, key, collection)) {
+ result = retKey ? key : value;
+ return false;
+ }
+ });
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.flatten` with added support for restricting
+ * flattening and specifying the start index.
+ *
+ * @private
+ * @param {Array} array The array to flatten.
+ * @param {boolean} isDeep Specify a deep flatten.
+ * @param {boolean} isStrict Restrict flattening to arrays and `arguments` objects.
+ * @returns {Array} Returns the new flattened array.
+ */
+ function baseFlatten(array, isDeep, isStrict) {
+ var index = -1,
+ length = array.length,
+ resIndex = -1,
+ result = [];
+
+ while (++index < length) {
+ var value = array[index];
+
+ if (isObjectLike(value) && isLength(value.length) && (isArray(value) || isArguments(value))) {
+ if (isDeep) {
+ // Recursively flatten arrays (susceptible to call stack limits).
+ value = baseFlatten(value, isDeep, isStrict);
+ }
+ var valIndex = -1,
+ valLength = value.length;
+
+ result.length += valLength;
+ while (++valIndex < valLength) {
+ result[++resIndex] = value[valIndex];
+ }
+ } else if (!isStrict) {
+ result[++resIndex] = value;
+ }
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `baseForIn` and `baseForOwn` which iterates
+ * over `object` properties returned by `keysFunc` invoking `iteratee` for
+ * each property. Iteratee functions may exit iteration early by explicitly
+ * returning `false`.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {Function} keysFunc The function to get the keys of `object`.
+ * @returns {Object} Returns `object`.
+ */
+ var baseFor = createBaseFor();
+
+ /**
+ * This function is like `baseFor` except that it iterates over properties
+ * in the opposite order.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {Function} keysFunc The function to get the keys of `object`.
+ * @returns {Object} Returns `object`.
+ */
+ var baseForRight = createBaseFor(true);
+
+ /**
+ * The base implementation of `_.forIn` without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Object} Returns `object`.
+ */
+ function baseForIn(object, iteratee) {
+ return baseFor(object, iteratee, keysIn);
+ }
+
+ /**
+ * The base implementation of `_.forOwn` without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Object} Returns `object`.
+ */
+ function baseForOwn(object, iteratee) {
+ return baseFor(object, iteratee, keys);
+ }
+
+ /**
+ * The base implementation of `_.forOwnRight` without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Object} Returns `object`.
+ */
+ function baseForOwnRight(object, iteratee) {
+ return baseForRight(object, iteratee, keys);
+ }
+
+ /**
+ * The base implementation of `_.functions` which creates an array of
+ * `object` function property names filtered from those provided.
+ *
+ * @private
+ * @param {Object} object The object to inspect.
+ * @param {Array} props The property names to filter.
+ * @returns {Array} Returns the new array of filtered property names.
+ */
+ function baseFunctions(object, props) {
+ var index = -1,
+ length = props.length,
+ resIndex = -1,
+ result = [];
+
+ while (++index < length) {
+ var key = props[index];
+ if (isFunction(object[key])) {
+ result[++resIndex] = key;
+ }
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `get` without support for string paths
+ * and default values.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @param {Array} path The path of the property to get.
+ * @param {string} [pathKey] The key representation of path.
+ * @returns {*} Returns the resolved value.
+ */
+ function baseGet(object, path, pathKey) {
+ if (object == null) {
+ return;
+ }
+ if (pathKey !== undefined && pathKey in toObject(object)) {
+ path = [pathKey];
+ }
+ var index = -1,
+ length = path.length;
+
+ while (object != null && ++index < length) {
+ var result = object = object[path[index]];
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.isEqual` without support for `this` binding
+ * `customizer` functions.
+ *
+ * @private
+ * @param {*} value The value to compare.
+ * @param {*} other The other value to compare.
+ * @param {Function} [customizer] The function to customize comparing values.
+ * @param {boolean} [isLoose] Specify performing partial comparisons.
+ * @param {Array} [stackA] Tracks traversed `value` objects.
+ * @param {Array} [stackB] Tracks traversed `other` objects.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ */
+ function baseIsEqual(value, other, customizer, isLoose, stackA, stackB) {
+ // Exit early for identical values.
+ if (value === other) {
+ // Treat `+0` vs. `-0` as not equal.
+ return value !== 0 || (1 / value == 1 / other);
+ }
+ var valType = typeof value,
+ othType = typeof other;
+
+ // Exit early for unlike primitive values.
+ if ((valType != 'function' && valType != 'object' && othType != 'function' && othType != 'object') ||
+ value == null || other == null) {
+ // Return `false` unless both values are `NaN`.
+ return value !== value && other !== other;
+ }
+ return baseIsEqualDeep(value, other, baseIsEqual, customizer, isLoose, stackA, stackB);
+ }
+
+ /**
+ * A specialized version of `baseIsEqual` for arrays and objects which performs
+ * deep comparisons and tracks traversed objects enabling objects with circular
+ * references to be compared.
+ *
+ * @private
+ * @param {Object} object The object to compare.
+ * @param {Object} other The other object to compare.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Function} [customizer] The function to customize comparing objects.
+ * @param {boolean} [isLoose] Specify performing partial comparisons.
+ * @param {Array} [stackA=[]] Tracks traversed `value` objects.
+ * @param {Array} [stackB=[]] Tracks traversed `other` objects.
+ * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+ */
+ function baseIsEqualDeep(object, other, equalFunc, customizer, isLoose, stackA, stackB) {
+ var objIsArr = isArray(object),
+ othIsArr = isArray(other),
+ objTag = arrayTag,
+ othTag = arrayTag;
+
+ if (!objIsArr) {
+ objTag = objToString.call(object);
+ if (objTag == argsTag) {
+ objTag = objectTag;
+ } else if (objTag != objectTag) {
+ objIsArr = isTypedArray(object);
+ }
+ }
+ if (!othIsArr) {
+ othTag = objToString.call(other);
+ if (othTag == argsTag) {
+ othTag = objectTag;
+ } else if (othTag != objectTag) {
+ othIsArr = isTypedArray(other);
+ }
+ }
+ var objIsObj = objTag == objectTag,
+ othIsObj = othTag == objectTag,
+ isSameTag = objTag == othTag;
+
+ if (isSameTag && !(objIsArr || objIsObj)) {
+ return equalByTag(object, other, objTag);
+ }
+ if (!isLoose) {
+ var valWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
+ othWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
+
+ if (valWrapped || othWrapped) {
+ return equalFunc(valWrapped ? object.value() : object, othWrapped ? other.value() : other,
customizer, isLoose, stackA, stackB);
+ }
+ }
+ if (!isSameTag) {
+ return false;
+ }
+ // Assume cyclic values are equal.
+ // For more information on detecting circular references see https://es5.github.io/#JO.
+ stackA || (stackA = []);
+ stackB || (stackB = []);
+
+ var length = stackA.length;
+ while (length--) {
+ if (stackA[length] == object) {
+ return stackB[length] == other;
+ }
+ }
+ // Add `object` and `other` to the stack of traversed objects.
+ stackA.push(object);
+ stackB.push(other);
+
+ var result = (objIsArr ? equalArrays : equalObjects)(object, other, equalFunc, customizer, isLoose,
stackA, stackB);
+
+ stackA.pop();
+ stackB.pop();
+
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.isMatch` without support for callback
+ * shorthands and `this` binding.
+ *
+ * @private
+ * @param {Object} object The object to inspect.
+ * @param {Array} props The source property names to match.
+ * @param {Array} values The source values to match.
+ * @param {Array} strictCompareFlags Strict comparison flags for source values.
+ * @param {Function} [customizer] The function to customize comparing objects.
+ * @returns {boolean} Returns `true` if `object` is a match, else `false`.
+ */
+ function baseIsMatch(object, props, values, strictCompareFlags, customizer) {
+ var index = -1,
+ length = props.length,
+ noCustomizer = !customizer;
+
+ while (++index < length) {
+ if ((noCustomizer && strictCompareFlags[index])
+ ? values[index] !== object[props[index]]
+ : !(props[index] in object)
+ ) {
+ return false;
+ }
+ }
+ index = -1;
+ while (++index < length) {
+ var key = props[index],
+ objValue = object[key],
+ srcValue = values[index];
+
+ if (noCustomizer && strictCompareFlags[index]) {
+ var result = objValue !== undefined || (key in object);
+ } else {
+ result = customizer ? customizer(objValue, srcValue, key) : undefined;
+ if (result === undefined) {
+ result = baseIsEqual(srcValue, objValue, customizer, true);
+ }
+ }
+ if (!result) {
+ return false;
+ }
+ }
+ return true;
+ }
+
+ /**
+ * The base implementation of `_.map` without support for callback shorthands
+ * and `this` binding.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns the new mapped array.
+ */
+ function baseMap(collection, iteratee) {
+ var index = -1,
+ length = getLength(collection),
+ result = isLength(length) ? Array(length) : [];
+
+ baseEach(collection, function(value, key, collection) {
+ result[++index] = iteratee(value, key, collection);
+ });
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.matches` which does not clone `source`.
+ *
+ * @private
+ * @param {Object} source The object of property values to match.
+ * @returns {Function} Returns the new function.
+ */
+ function baseMatches(source) {
+ var props = keys(source),
+ length = props.length;
+
+ if (!length) {
+ return constant(true);
+ }
+ if (length == 1) {
+ var key = props[0],
+ value = source[key];
+
+ if (isStrictComparable(value)) {
+ return function(object) {
+ if (object == null) {
+ return false;
+ }
+ return object[key] === value && (value !== undefined || (key in toObject(object)));
+ };
+ }
+ }
+ var values = Array(length),
+ strictCompareFlags = Array(length);
+
+ while (length--) {
+ value = source[props[length]];
+ values[length] = value;
+ strictCompareFlags[length] = isStrictComparable(value);
+ }
+ return function(object) {
+ return object != null && baseIsMatch(toObject(object), props, values, strictCompareFlags);
+ };
+ }
+
+ /**
+ * The base implementation of `_.matchesProperty` which does not which does
+ * not clone `value`.
+ *
+ * @private
+ * @param {string} path The path of the property to get.
+ * @param {*} value The value to compare.
+ * @returns {Function} Returns the new function.
+ */
+ function baseMatchesProperty(path, value) {
+ var isArr = isArray(path),
+ isCommon = isKey(path) && isStrictComparable(value),
+ pathKey = (path + '');
+
+ path = toPath(path);
+ return function(object) {
+ if (object == null) {
+ return false;
+ }
+ var key = pathKey;
+ object = toObject(object);
+ if ((isArr || !isCommon) && !(key in object)) {
+ object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
+ if (object == null) {
+ return false;
+ }
+ key = last(path);
+ object = toObject(object);
+ }
+ return object[key] === value
+ ? (value !== undefined || (key in object))
+ : baseIsEqual(value, object[key], null, true);
+ };
+ }
+
+ /**
+ * The base implementation of `_.merge` without support for argument juggling,
+ * multiple sources, and `this` binding `customizer` functions.
+ *
+ * @private
+ * @param {Object} object The destination object.
+ * @param {Object} source The source object.
+ * @param {Function} [customizer] The function to customize merging properties.
+ * @param {Array} [stackA=[]] Tracks traversed source objects.
+ * @param {Array} [stackB=[]] Associates values with source counterparts.
+ * @returns {Object} Returns `object`.
+ */
+ function baseMerge(object, source, customizer, stackA, stackB) {
+ if (!isObject(object)) {
+ return object;
+ }
+ var isSrcArr = isLength(source.length) && (isArray(source) || isTypedArray(source));
+ if (!isSrcArr) {
+ var props = keys(source);
+ push.apply(props, getSymbols(source));
+ }
+ arrayEach(props || source, function(srcValue, key) {
+ if (props) {
+ key = srcValue;
+ srcValue = source[key];
+ }
+ if (isObjectLike(srcValue)) {
+ stackA || (stackA = []);
+ stackB || (stackB = []);
+ baseMergeDeep(object, source, key, baseMerge, customizer, stackA, stackB);
+ }
+ else {
+ var value = object[key],
+ result = customizer ? customizer(value, srcValue, key, object, source) : undefined,
+ isCommon = result === undefined;
+
+ if (isCommon) {
+ result = srcValue;
+ }
+ if ((isSrcArr || result !== undefined) &&
+ (isCommon || (result === result ? (result !== value) : (value === value)))) {
+ object[key] = result;
+ }
+ }
+ });
+ return object;
+ }
+
+ /**
+ * A specialized version of `baseMerge` for arrays and objects which performs
+ * deep merges and tracks traversed objects enabling objects with circular
+ * references to be merged.
+ *
+ * @private
+ * @param {Object} object The destination object.
+ * @param {Object} source The source object.
+ * @param {string} key The key of the value to merge.
+ * @param {Function} mergeFunc The function to merge values.
+ * @param {Function} [customizer] The function to customize merging properties.
+ * @param {Array} [stackA=[]] Tracks traversed source objects.
+ * @param {Array} [stackB=[]] Associates values with source counterparts.
+ * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+ */
+ function baseMergeDeep(object, source, key, mergeFunc, customizer, stackA, stackB) {
+ var length = stackA.length,
+ srcValue = source[key];
+
+ while (length--) {
+ if (stackA[length] == srcValue) {
+ object[key] = stackB[length];
+ return;
+ }
+ }
+ var value = object[key],
+ result = customizer ? customizer(value, srcValue, key, object, source) : undefined,
+ isCommon = result === undefined;
+
+ if (isCommon) {
+ result = srcValue;
+ if (isLength(srcValue.length) && (isArray(srcValue) || isTypedArray(srcValue))) {
+ result = isArray(value)
+ ? value
+ : (getLength(value) ? arrayCopy(value) : []);
+ }
+ else if (isPlainObject(srcValue) || isArguments(srcValue)) {
+ result = isArguments(value)
+ ? toPlainObject(value)
+ : (isPlainObject(value) ? value : {});
+ }
+ else {
+ isCommon = false;
+ }
+ }
+ // Add the source value to the stack of traversed objects and associate
+ // it with its merged value.
+ stackA.push(srcValue);
+ stackB.push(result);
+
+ if (isCommon) {
+ // Recursively merge objects and arrays (susceptible to call stack limits).
+ object[key] = mergeFunc(result, srcValue, customizer, stackA, stackB);
+ } else if (result === result ? (result !== value) : (value === value)) {
+ object[key] = result;
+ }
+ }
+
+ /**
+ * The base implementation of `_.property` without support for deep paths.
+ *
+ * @private
+ * @param {string} key The key of the property to get.
+ * @returns {Function} Returns the new function.
+ */
+ function baseProperty(key) {
+ return function(object) {
+ return object == null ? undefined : object[key];
+ };
+ }
+
+ /**
+ * A specialized version of `baseProperty` which supports deep paths.
+ *
+ * @private
+ * @param {Array|string} path The path of the property to get.
+ * @returns {Function} Returns the new function.
+ */
+ function basePropertyDeep(path) {
+ var pathKey = (path + '');
+ path = toPath(path);
+ return function(object) {
+ return baseGet(object, path, pathKey);
+ };
+ }
+
+ /**
+ * The base implementation of `_.pullAt` without support for individual
+ * index arguments and capturing the removed elements.
+ *
+ * @private
+ * @param {Array} array The array to modify.
+ * @param {number[]} indexes The indexes of elements to remove.
+ * @returns {Array} Returns `array`.
+ */
+ function basePullAt(array, indexes) {
+ var length = indexes.length;
+ while (length--) {
+ var index = parseFloat(indexes[length]);
+ if (index != previous && isIndex(index)) {
+ var previous = index;
+ splice.call(array, index, 1);
+ }
+ }
+ return array;
+ }
+
+ /**
+ * The base implementation of `_.random` without support for argument juggling
+ * and returning floating-point numbers.
+ *
+ * @private
+ * @param {number} min The minimum possible value.
+ * @param {number} max The maximum possible value.
+ * @returns {number} Returns the random number.
+ */
+ function baseRandom(min, max) {
+ return min + floor(nativeRandom() * (max - min + 1));
+ }
+
+ /**
+ * The base implementation of `_.reduce` and `_.reduceRight` without support
+ * for callback shorthands and `this` binding, which iterates over `collection`
+ * using the provided `eachFunc`.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {*} accumulator The initial value.
+ * @param {boolean} initFromCollection Specify using the first or last element
+ * of `collection` as the initial value.
+ * @param {Function} eachFunc The function to iterate over `collection`.
+ * @returns {*} Returns the accumulated value.
+ */
+ function baseReduce(collection, iteratee, accumulator, initFromCollection, eachFunc) {
+ eachFunc(collection, function(value, index, collection) {
+ accumulator = initFromCollection
+ ? (initFromCollection = false, value)
+ : iteratee(accumulator, value, index, collection);
+ });
+ return accumulator;
+ }
+
+ /**
+ * The base implementation of `setData` without support for hot loop detection.
+ *
+ * @private
+ * @param {Function} func The function to associate metadata with.
+ * @param {*} data The metadata.
+ * @returns {Function} Returns `func`.
+ */
+ var baseSetData = !metaMap ? identity : function(func, data) {
+ metaMap.set(func, data);
+ return func;
};
- };
- // Groups the object's values by a criterion. Pass either a string attribute
- // to group by, or a function that returns the criterion.
- _.groupBy = group(function(result, key, value) {
- _.has(result, key) ? result[key].push(value) : result[key] = [value];
- });
+ /**
+ * The base implementation of `_.slice` without an iteratee call guard.
+ *
+ * @private
+ * @param {Array} array The array to slice.
+ * @param {number} [start=0] The start position.
+ * @param {number} [end=array.length] The end position.
+ * @returns {Array} Returns the slice of `array`.
+ */
+ function baseSlice(array, start, end) {
+ var index = -1,
+ length = array.length;
- // Indexes the object's values by a criterion, similar to `groupBy`, but for
- // when you know that your index values will be unique.
- _.indexBy = group(function(result, key, value) {
- result[key] = value;
- });
+ start = start == null ? 0 : (+start || 0);
+ if (start < 0) {
+ start = -start > length ? 0 : (length + start);
+ }
+ end = (end === undefined || end > length) ? length : (+end || 0);
+ if (end < 0) {
+ end += length;
+ }
+ length = start > end ? 0 : ((end - start) >>> 0);
+ start >>>= 0;
- // Counts instances of an object that group by a certain criterion. Pass
- // either a string attribute to count by, or a function that returns the
- // criterion.
- _.countBy = group(function(result, key) {
- _.has(result, key) ? result[key]++ : result[key] = 1;
- });
+ var result = Array(length);
+ while (++index < length) {
+ result[index] = array[index + start];
+ }
+ return result;
+ }
- // Use a comparator function to figure out the smallest index at which
- // an object should be inserted so as to maintain order. Uses binary search.
- _.sortedIndex = function(array, obj, iterator, context) {
- iterator = lookupIterator(iterator);
- var value = iterator.call(context, obj);
- var low = 0, high = array.length;
- while (low < high) {
- var mid = (low + high) >>> 1;
- iterator.call(context, array[mid]) < value ? low = mid + 1 : high = mid;
- }
- return low;
- };
+ /**
+ * The base implementation of `_.some` without support for callback shorthands
+ * and `this` binding.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {boolean} Returns `true` if any element passes the predicate check,
+ * else `false`.
+ */
+ function baseSome(collection, predicate) {
+ var result;
- // Safely create a real, live array from anything iterable.
- _.toArray = function(obj) {
- if (!obj) return [];
- if (_.isArray(obj)) return slice.call(obj);
- if (obj.length === +obj.length) return _.map(obj, _.identity);
- return _.values(obj);
- };
+ baseEach(collection, function(value, index, collection) {
+ result = predicate(value, index, collection);
+ return !result;
+ });
+ return !!result;
+ }
- // Return the number of elements in an object.
- _.size = function(obj) {
- if (obj == null) return 0;
- return (obj.length === +obj.length) ? obj.length : _.keys(obj).length;
- };
+ /**
+ * The base implementation of `_.sortBy` which uses `comparer` to define
+ * the sort order of `array` and replaces criteria objects with their
+ * corresponding values.
+ *
+ * @private
+ * @param {Array} array The array to sort.
+ * @param {Function} comparer The function to define sort order.
+ * @returns {Array} Returns `array`.
+ */
+ function baseSortBy(array, comparer) {
+ var length = array.length;
- // Array Functions
- // ---------------
-
- // Get the first element of an array. Passing **n** will return the first N
- // values in the array. Aliased as `head` and `take`. The **guard** check
- // allows it to work with `_.map`.
- _.first = _.head = _.take = function(array, n, guard) {
- if (array == null) return void 0;
- if ((n == null) || guard) return array[0];
- if (n < 0) return [];
- return slice.call(array, 0, n);
- };
+ array.sort(comparer);
+ while (length--) {
+ array[length] = array[length].value;
+ }
+ return array;
+ }
- // Returns everything but the last entry of the array. Especially useful on
- // the arguments object. Passing **n** will return all the values in
- // the array, excluding the last N. The **guard** check allows it to work with
- // `_.map`.
- _.initial = function(array, n, guard) {
- return slice.call(array, 0, array.length - ((n == null) || guard ? 1 : n));
- };
+ /**
+ * The base implementation of `_.sortByOrder` without param guards.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
+ * @param {boolean[]} orders The sort orders of `iteratees`.
+ * @returns {Array} Returns the new sorted array.
+ */
+ function baseSortByOrder(collection, iteratees, orders) {
+ var callback = getCallback(),
+ index = -1;
- // Get the last element of an array. Passing **n** will return the last N
- // values in the array. The **guard** check allows it to work with `_.map`.
- _.last = function(array, n, guard) {
- if (array == null) return void 0;
- if ((n == null) || guard) return array[array.length - 1];
- return slice.call(array, Math.max(array.length - n, 0));
- };
+ iteratees = arrayMap(iteratees, function(iteratee) { return callback(iteratee); });
- // Returns everything but the first entry of the array. Aliased as `tail` and `drop`.
- // Especially useful on the arguments object. Passing an **n** will return
- // the rest N values in the array. The **guard**
- // check allows it to work with `_.map`.
- _.rest = _.tail = _.drop = function(array, n, guard) {
- return slice.call(array, (n == null) || guard ? 1 : n);
- };
+ var result = baseMap(collection, function(value) {
+ var criteria = arrayMap(iteratees, function(iteratee) { return iteratee(value); });
+ return { 'criteria': criteria, 'index': ++index, 'value': value };
+ });
- // Trim out all falsy values from an array.
- _.compact = function(array) {
- return _.filter(array, _.identity);
- };
+ return baseSortBy(result, function(object, other) {
+ return compareMultiple(object, other, orders);
+ });
+ }
- // Internal implementation of a recursive `flatten` function.
- var flatten = function(input, shallow, output) {
- if (shallow && _.every(input, _.isArray)) {
- return concat.apply(output, input);
+ /**
+ * The base implementation of `_.sum` without support for callback shorthands
+ * and `this` binding.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {number} Returns the sum.
+ */
+ function baseSum(collection, iteratee) {
+ var result = 0;
+ baseEach(collection, function(value, index, collection) {
+ result += +iteratee(value, index, collection) || 0;
+ });
+ return result;
}
- each(input, function(value) {
- if (_.isArray(value) || _.isArguments(value)) {
- shallow ? push.apply(output, value) : flatten(value, shallow, output);
+
+ /**
+ * The base implementation of `_.uniq` without support for callback shorthands
+ * and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} [iteratee] The function invoked per iteration.
+ * @returns {Array} Returns the new duplicate-value-free array.
+ */
+ function baseUniq(array, iteratee) {
+ var index = -1,
+ indexOf = getIndexOf(),
+ length = array.length,
+ isCommon = indexOf == baseIndexOf,
+ isLarge = isCommon && length >= 200,
+ seen = isLarge ? createCache() : null,
+ result = [];
+
+ if (seen) {
+ indexOf = cacheIndexOf;
+ isCommon = false;
} else {
- output.push(value);
+ isLarge = false;
+ seen = iteratee ? [] : result;
+ }
+ outer:
+ while (++index < length) {
+ var value = array[index],
+ computed = iteratee ? iteratee(value, index, array) : value;
+
+ if (isCommon && value === value) {
+ var seenIndex = seen.length;
+ while (seenIndex--) {
+ if (seen[seenIndex] === computed) {
+ continue outer;
+ }
+ }
+ if (iteratee) {
+ seen.push(computed);
+ }
+ result.push(value);
+ }
+ else if (indexOf(seen, computed, 0) < 0) {
+ if (iteratee || isLarge) {
+ seen.push(computed);
+ }
+ result.push(value);
+ }
}
- });
- return output;
- };
+ return result;
+ }
- // Flatten out an array, either recursively (by default), or just one level.
- _.flatten = function(array, shallow) {
- return flatten(array, shallow, []);
- };
+ /**
+ * The base implementation of `_.values` and `_.valuesIn` which creates an
+ * array of `object` property values corresponding to the property names
+ * of `props`.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @param {Array} props The property names to get values for.
+ * @returns {Object} Returns the array of property values.
+ */
+ function baseValues(object, props) {
+ var index = -1,
+ length = props.length,
+ result = Array(length);
- // Return a version of the array that does not contain the specified value(s).
- _.without = function(array) {
- return _.difference(array, slice.call(arguments, 1));
- };
+ while (++index < length) {
+ result[index] = object[props[index]];
+ }
+ return result;
+ }
- // Split an array into two arrays: one whose elements all satisfy the given
- // predicate, and one whose elements all do not satisfy the predicate.
- _.partition = function(array, predicate) {
- var pass = [], fail = [];
- each(array, function(elem) {
- (predicate(elem) ? pass : fail).push(elem);
- });
- return [pass, fail];
- };
+ /**
+ * The base implementation of `_.dropRightWhile`, `_.dropWhile`, `_.takeRightWhile`,
+ * and `_.takeWhile` without support for callback shorthands and `this` binding.
+ *
+ * @private
+ * @param {Array} array The array to query.
+ * @param {Function} predicate The function invoked per iteration.
+ * @param {boolean} [isDrop] Specify dropping elements instead of taking them.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Array} Returns the slice of `array`.
+ */
+ function baseWhile(array, predicate, isDrop, fromRight) {
+ var length = array.length,
+ index = fromRight ? length : -1;
- // Produce a duplicate-free version of the array. If the array has already
- // been sorted, you have the option of using a faster algorithm.
- // Aliased as `unique`.
- _.uniq = _.unique = function(array, isSorted, iterator, context) {
- if (_.isFunction(isSorted)) {
- context = iterator;
- iterator = isSorted;
- isSorted = false;
- }
- var initial = iterator ? _.map(array, iterator, context) : array;
- var results = [];
- var seen = [];
- each(initial, function(value, index) {
- if (isSorted ? (!index || seen[seen.length - 1] !== value) : !_.contains(seen, value)) {
- seen.push(value);
- results.push(array[index]);
+ while ((fromRight ? index-- : ++index < length) && predicate(array[index], index, array)) {}
+ return isDrop
+ ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))
+ : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));
+ }
+
+ /**
+ * The base implementation of `wrapperValue` which returns the result of
+ * performing a sequence of actions on the unwrapped `value`, where each
+ * successive action is supplied the return value of the previous.
+ *
+ * @private
+ * @param {*} value The unwrapped value.
+ * @param {Array} actions Actions to peform to resolve the unwrapped value.
+ * @returns {*} Returns the resolved value.
+ */
+ function baseWrapperValue(value, actions) {
+ var result = value;
+ if (result instanceof LazyWrapper) {
+ result = result.value();
}
- });
- return results;
- };
+ var index = -1,
+ length = actions.length;
- // Produce an array that contains the union: each distinct element from all of
- // the passed-in arrays.
- _.union = function() {
- return _.uniq(_.flatten(arguments, true));
- };
+ while (++index < length) {
+ var args = [result],
+ action = actions[index];
+
+ push.apply(args, action.args);
+ result = action.func.apply(action.thisArg, args);
+ }
+ return result;
+ }
- // Produce an array that contains every item shared between all the
- // passed-in arrays.
- _.intersection = function(array) {
- var rest = slice.call(arguments, 1);
- return _.filter(_.uniq(array), function(item) {
- return _.every(rest, function(other) {
- return _.contains(other, item);
+ /**
+ * Performs a binary search of `array` to determine the index at which `value`
+ * should be inserted into `array` in order to maintain its sort order.
+ *
+ * @private
+ * @param {Array} array The sorted array to inspect.
+ * @param {*} value The value to evaluate.
+ * @param {boolean} [retHighest] Specify returning the highest qualified index.
+ * @returns {number} Returns the index at which `value` should be inserted
+ * into `array`.
+ */
+ function binaryIndex(array, value, retHighest) {
+ var low = 0,
+ high = array ? array.length : low;
+
+ if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {
+ while (low < high) {
+ var mid = (low + high) >>> 1,
+ computed = array[mid];
+
+ if (retHighest ? (computed <= value) : (computed < value)) {
+ low = mid + 1;
+ } else {
+ high = mid;
+ }
+ }
+ return high;
+ }
+ return binaryIndexBy(array, value, identity, retHighest);
+ }
+
+ /**
+ * This function is like `binaryIndex` except that it invokes `iteratee` for
+ * `value` and each element of `array` to compute their sort ranking. The
+ * iteratee is invoked with one argument; (value).
+ *
+ * @private
+ * @param {Array} array The sorted array to inspect.
+ * @param {*} value The value to evaluate.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {boolean} [retHighest] Specify returning the highest qualified index.
+ * @returns {number} Returns the index at which `value` should be inserted
+ * into `array`.
+ */
+ function binaryIndexBy(array, value, iteratee, retHighest) {
+ value = iteratee(value);
+
+ var low = 0,
+ high = array ? array.length : 0,
+ valIsNaN = value !== value,
+ valIsUndef = value === undefined;
+
+ while (low < high) {
+ var mid = floor((low + high) / 2),
+ computed = iteratee(array[mid]),
+ isReflexive = computed === computed;
+
+ if (valIsNaN) {
+ var setLow = isReflexive || retHighest;
+ } else if (valIsUndef) {
+ setLow = isReflexive && (retHighest || computed !== undefined);
+ } else {
+ setLow = retHighest ? (computed <= value) : (computed < value);
+ }
+ if (setLow) {
+ low = mid + 1;
+ } else {
+ high = mid;
+ }
+ }
+ return nativeMin(high, MAX_ARRAY_INDEX);
+ }
+
+ /**
+ * A specialized version of `baseCallback` which only supports `this` binding
+ * and specifying the number of arguments to provide to `func`.
+ *
+ * @private
+ * @param {Function} func The function to bind.
+ * @param {*} thisArg The `this` binding of `func`.
+ * @param {number} [argCount] The number of arguments to provide to `func`.
+ * @returns {Function} Returns the callback.
+ */
+ function bindCallback(func, thisArg, argCount) {
+ if (typeof func != 'function') {
+ return identity;
+ }
+ if (thisArg === undefined) {
+ return func;
+ }
+ switch (argCount) {
+ case 1: return function(value) {
+ return func.call(thisArg, value);
+ };
+ case 3: return function(value, index, collection) {
+ return func.call(thisArg, value, index, collection);
+ };
+ case 4: return function(accumulator, value, index, collection) {
+ return func.call(thisArg, accumulator, value, index, collection);
+ };
+ case 5: return function(value, other, key, object, source) {
+ return func.call(thisArg, value, other, key, object, source);
+ };
+ }
+ return function() {
+ return func.apply(thisArg, arguments);
+ };
+ }
+
+ /**
+ * Creates a clone of the given array buffer.
+ *
+ * @private
+ * @param {ArrayBuffer} buffer The array buffer to clone.
+ * @returns {ArrayBuffer} Returns the cloned array buffer.
+ */
+ function bufferClone(buffer) {
+ return bufferSlice.call(buffer, 0);
+ }
+ if (!bufferSlice) {
+ // PhantomJS has `ArrayBuffer` and `Uint8Array` but not `Float64Array`.
+ bufferClone = !(ArrayBuffer && Uint8Array) ? constant(null) : function(buffer) {
+ var byteLength = buffer.byteLength,
+ floatLength = Float64Array ? floor(byteLength / FLOAT64_BYTES_PER_ELEMENT) : 0,
+ offset = floatLength * FLOAT64_BYTES_PER_ELEMENT,
+ result = new ArrayBuffer(byteLength);
+
+ if (floatLength) {
+ var view = new Float64Array(result, 0, floatLength);
+ view.set(new Float64Array(buffer, 0, floatLength));
+ }
+ if (byteLength != offset) {
+ view = new Uint8Array(result, offset);
+ view.set(new Uint8Array(buffer, offset));
+ }
+ return result;
+ };
+ }
+
+ /**
+ * Creates an array that is the composition of partially applied arguments,
+ * placeholders, and provided arguments into a single array of arguments.
+ *
+ * @private
+ * @param {Array|Object} args The provided arguments.
+ * @param {Array} partials The arguments to prepend to those provided.
+ * @param {Array} holders The `partials` placeholder indexes.
+ * @returns {Array} Returns the new array of composed arguments.
+ */
+ function composeArgs(args, partials, holders) {
+ var holdersLength = holders.length,
+ argsIndex = -1,
+ argsLength = nativeMax(args.length - holdersLength, 0),
+ leftIndex = -1,
+ leftLength = partials.length,
+ result = Array(argsLength + leftLength);
+
+ while (++leftIndex < leftLength) {
+ result[leftIndex] = partials[leftIndex];
+ }
+ while (++argsIndex < holdersLength) {
+ result[holders[argsIndex]] = args[argsIndex];
+ }
+ while (argsLength--) {
+ result[leftIndex++] = args[argsIndex++];
+ }
+ return result;
+ }
+
+ /**
+ * This function is like `composeArgs` except that the arguments composition
+ * is tailored for `_.partialRight`.
+ *
+ * @private
+ * @param {Array|Object} args The provided arguments.
+ * @param {Array} partials The arguments to append to those provided.
+ * @param {Array} holders The `partials` placeholder indexes.
+ * @returns {Array} Returns the new array of composed arguments.
+ */
+ function composeArgsRight(args, partials, holders) {
+ var holdersIndex = -1,
+ holdersLength = holders.length,
+ argsIndex = -1,
+ argsLength = nativeMax(args.length - holdersLength, 0),
+ rightIndex = -1,
+ rightLength = partials.length,
+ result = Array(argsLength + rightLength);
+
+ while (++argsIndex < argsLength) {
+ result[argsIndex] = args[argsIndex];
+ }
+ var pad = argsIndex;
+ while (++rightIndex < rightLength) {
+ result[pad + rightIndex] = partials[rightIndex];
+ }
+ while (++holdersIndex < holdersLength) {
+ result[pad + holders[holdersIndex]] = args[argsIndex++];
+ }
+ return result;
+ }
+
+ /**
+ * Creates a function that aggregates a collection, creating an accumulator
+ * object composed from the results of running each element in the collection
+ * through an iteratee.
+ *
+ * **Note:** This function is used to create `_.countBy`, `_.groupBy`, `_.indexBy`,
+ * and `_.partition`.
+ *
+ * @private
+ * @param {Function} setter The function to set keys and values of the accumulator object.
+ * @param {Function} [initializer] The function to initialize the accumulator object.
+ * @returns {Function} Returns the new aggregator function.
+ */
+ function createAggregator(setter, initializer) {
+ return function(collection, iteratee, thisArg) {
+ var result = initializer ? initializer() : {};
+ iteratee = getCallback(iteratee, thisArg, 3);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ var value = collection[index];
+ setter(result, value, iteratee(value, index, collection), collection);
+ }
+ } else {
+ baseEach(collection, function(value, key, collection) {
+ setter(result, value, iteratee(value, key, collection), collection);
+ });
+ }
+ return result;
+ };
+ }
+
+ /**
+ * Creates a function that assigns properties of source object(s) to a given
+ * destination object.
+ *
+ * **Note:** This function is used to create `_.assign`, `_.defaults`, and `_.merge`.
+ *
+ * @private
+ * @param {Function} assigner The function to assign values.
+ * @returns {Function} Returns the new assigner function.
+ */
+ function createAssigner(assigner) {
+ return restParam(function(object, sources) {
+ var index = -1,
+ length = object == null ? 0 : sources.length,
+ customizer = length > 2 && sources[length - 2],
+ guard = length > 2 && sources[2],
+ thisArg = length > 1 && sources[length - 1];
+
+ if (typeof customizer == 'function') {
+ customizer = bindCallback(customizer, thisArg, 5);
+ length -= 2;
+ } else {
+ customizer = typeof thisArg == 'function' ? thisArg : null;
+ length -= (customizer ? 1 : 0);
+ }
+ if (guard && isIterateeCall(sources[0], sources[1], guard)) {
+ customizer = length < 3 ? null : customizer;
+ length = 1;
+ }
+ while (++index < length) {
+ var source = sources[index];
+ if (source) {
+ assigner(object, source, customizer);
+ }
+ }
+ return object;
});
- });
- };
+ }
- // Take the difference between one array and a number of other arrays.
- // Only the elements present in just the first array will remain.
- _.difference = function(array) {
- var rest = concat.apply(ArrayProto, slice.call(arguments, 1));
- return _.filter(array, function(value){ return !_.contains(rest, value); });
- };
+ /**
+ * Creates a `baseEach` or `baseEachRight` function.
+ *
+ * @private
+ * @param {Function} eachFunc The function to iterate over a collection.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Function} Returns the new base function.
+ */
+ function createBaseEach(eachFunc, fromRight) {
+ return function(collection, iteratee) {
+ var length = collection ? getLength(collection) : 0;
+ if (!isLength(length)) {
+ return eachFunc(collection, iteratee);
+ }
+ var index = fromRight ? length : -1,
+ iterable = toObject(collection);
- // Zip together multiple lists into a single array -- elements that share
- // an index go together.
- _.zip = function() {
- var length = _.max(_.pluck(arguments, 'length').concat(0));
- var results = new Array(length);
- for (var i = 0; i < length; i++) {
- results[i] = _.pluck(arguments, '' + i);
+ while ((fromRight ? index-- : ++index < length)) {
+ if (iteratee(iterable[index], index, iterable) === false) {
+ break;
+ }
+ }
+ return collection;
+ };
}
- return results;
- };
- // Converts lists into objects. Pass either a single array of `[key, value]`
- // pairs, or two parallel arrays of the same length -- one of keys, and one of
- // the corresponding values.
- _.object = function(list, values) {
- if (list == null) return {};
- var result = {};
- for (var i = 0, length = list.length; i < length; i++) {
- if (values) {
- result[list[i]] = values[i];
- } else {
- result[list[i][0]] = list[i][1];
+ /**
+ * Creates a base function for `_.forIn` or `_.forInRight`.
+ *
+ * @private
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Function} Returns the new base function.
+ */
+ function createBaseFor(fromRight) {
+ return function(object, iteratee, keysFunc) {
+ var iterable = toObject(object),
+ props = keysFunc(object),
+ length = props.length,
+ index = fromRight ? length : -1;
+
+ while ((fromRight ? index-- : ++index < length)) {
+ var key = props[index];
+ if (iteratee(iterable[key], key, iterable) === false) {
+ break;
+ }
+ }
+ return object;
+ };
+ }
+
+ /**
+ * Creates a function that wraps `func` and invokes it with the `this`
+ * binding of `thisArg`.
+ *
+ * @private
+ * @param {Function} func The function to bind.
+ * @param {*} [thisArg] The `this` binding of `func`.
+ * @returns {Function} Returns the new bound function.
+ */
+ function createBindWrapper(func, thisArg) {
+ var Ctor = createCtorWrapper(func);
+
+ function wrapper() {
+ var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
+ return fn.apply(thisArg, arguments);
}
+ return wrapper;
+ }
+
+ /**
+ * Creates a `Set` cache object to optimize linear searches of large arrays.
+ *
+ * @private
+ * @param {Array} [values] The values to cache.
+ * @returns {null|Object} Returns the new cache object if `Set` is supported, else `null`.
+ */
+ var createCache = !(nativeCreate && Set) ? constant(null) : function(values) {
+ return new SetCache(values);
+ };
+
+ /**
+ * Creates a function that produces compound words out of the words in a
+ * given string.
+ *
+ * @private
+ * @param {Function} callback The function to combine each word.
+ * @returns {Function} Returns the new compounder function.
+ */
+ function createCompounder(callback) {
+ return function(string) {
+ var index = -1,
+ array = words(deburr(string)),
+ length = array.length,
+ result = '';
+
+ while (++index < length) {
+ result = callback(result, array[index], index);
+ }
+ return result;
+ };
+ }
+
+ /**
+ * Creates a function that produces an instance of `Ctor` regardless of
+ * whether it was invoked as part of a `new` expression or by `call` or `apply`.
+ *
+ * @private
+ * @param {Function} Ctor The constructor to wrap.
+ * @returns {Function} Returns the new wrapped function.
+ */
+ function createCtorWrapper(Ctor) {
+ return function() {
+ var thisBinding = baseCreate(Ctor.prototype),
+ result = Ctor.apply(thisBinding, arguments);
+
+ // Mimic the constructor's `return` behavior.
+ // See https://es5.github.io/#x13.2.2 for more details.
+ return isObject(result) ? result : thisBinding;
+ };
+ }
+
+ /**
+ * Creates a `_.curry` or `_.curryRight` function.
+ *
+ * @private
+ * @param {boolean} flag The curry bit flag.
+ * @returns {Function} Returns the new curry function.
+ */
+ function createCurry(flag) {
+ function curryFunc(func, arity, guard) {
+ if (guard && isIterateeCall(func, arity, guard)) {
+ arity = null;
+ }
+ var result = createWrapper(func, flag, null, null, null, null, null, arity);
+ result.placeholder = curryFunc.placeholder;
+ return result;
+ }
+ return curryFunc;
+ }
+
+ /**
+ * Creates a `_.max` or `_.min` function.
+ *
+ * @private
+ * @param {Function} arrayFunc The function to get the extremum value from an array.
+ * @param {boolean} [isMin] Specify returning the minimum, instead of the maximum,
+ * extremum value.
+ * @returns {Function} Returns the new extremum function.
+ */
+ function createExtremum(arrayFunc, isMin) {
+ return function(collection, iteratee, thisArg) {
+ if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {
+ iteratee = null;
+ }
+ var func = getCallback(),
+ noIteratee = iteratee == null;
+
+ if (!(func === baseCallback && noIteratee)) {
+ noIteratee = false;
+ iteratee = func(iteratee, thisArg, 3);
+ }
+ if (noIteratee) {
+ var isArr = isArray(collection);
+ if (!isArr && isString(collection)) {
+ iteratee = charAtCallback;
+ } else {
+ return arrayFunc(isArr ? collection : toIterable(collection));
+ }
+ }
+ return extremumBy(collection, iteratee, isMin);
+ };
+ }
+
+ /**
+ * Creates a `_.find` or `_.findLast` function.
+ *
+ * @private
+ * @param {Function} eachFunc The function to iterate over a collection.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Function} Returns the new find function.
+ */
+ function createFind(eachFunc, fromRight) {
+ return function(collection, predicate, thisArg) {
+ predicate = getCallback(predicate, thisArg, 3);
+ if (isArray(collection)) {
+ var index = baseFindIndex(collection, predicate, fromRight);
+ return index > -1 ? collection[index] : undefined;
+ }
+ return baseFind(collection, predicate, eachFunc);
+ }
+ }
+
+ /**
+ * Creates a `_.findIndex` or `_.findLastIndex` function.
+ *
+ * @private
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Function} Returns the new find function.
+ */
+ function createFindIndex(fromRight) {
+ return function(array, predicate, thisArg) {
+ if (!(array && array.length)) {
+ return -1;
+ }
+ predicate = getCallback(predicate, thisArg, 3);
+ return baseFindIndex(array, predicate, fromRight);
+ };
+ }
+
+ /**
+ * Creates a `_.findKey` or `_.findLastKey` function.
+ *
+ * @private
+ * @param {Function} objectFunc The function to iterate over an object.
+ * @returns {Function} Returns the new find function.
+ */
+ function createFindKey(objectFunc) {
+ return function(object, predicate, thisArg) {
+ predicate = getCallback(predicate, thisArg, 3);
+ return baseFind(object, predicate, objectFunc, true);
+ };
+ }
+
+ /**
+ * Creates a `_.flow` or `_.flowRight` function.
+ *
+ * @private
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Function} Returns the new flow function.
+ */
+ function createFlow(fromRight) {
+ return function() {
+ var length = arguments.length;
+ if (!length) {
+ return function() { return arguments[0]; };
+ }
+ var wrapper,
+ index = fromRight ? length : -1,
+ leftIndex = 0,
+ funcs = Array(length);
+
+ while ((fromRight ? index-- : ++index < length)) {
+ var func = funcs[leftIndex++] = arguments[index];
+ if (typeof func != 'function') {
+ throw new TypeError(FUNC_ERROR_TEXT);
+ }
+ var funcName = wrapper ? '' : getFuncName(func);
+ wrapper = funcName == 'wrapper' ? new LodashWrapper([]) : wrapper;
+ }
+ index = wrapper ? -1 : length;
+ while (++index < length) {
+ func = funcs[index];
+ funcName = getFuncName(func);
+
+ var data = funcName == 'wrapper' ? getData(func) : null;
+ if (data && isLaziable(data[0])) {
+ wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);
+ } else {
+ wrapper = (func.length == 1 && isLaziable(func)) ? wrapper[funcName]() : wrapper.thru(func);
+ }
+ }
+ return function() {
+ var args = arguments;
+ if (wrapper && args.length == 1 && isArray(args[0])) {
+ return wrapper.plant(args[0]).value();
+ }
+ var index = 0,
+ result = funcs[index].apply(this, args);
+
+ while (++index < length) {
+ result = funcs[index].call(this, result);
+ }
+ return result;
+ };
+ };
+ }
+
+ /**
+ * Creates a function for `_.forEach` or `_.forEachRight`.
+ *
+ * @private
+ * @param {Function} arrayFunc The function to iterate over an array.
+ * @param {Function} eachFunc The function to iterate over a collection.
+ * @returns {Function} Returns the new each function.
+ */
+ function createForEach(arrayFunc, eachFunc) {
+ return function(collection, iteratee, thisArg) {
+ return (typeof iteratee == 'function' && thisArg === undefined && isArray(collection))
+ ? arrayFunc(collection, iteratee)
+ : eachFunc(collection, bindCallback(iteratee, thisArg, 3));
+ };
+ }
+
+ /**
+ * Creates a function for `_.forIn` or `_.forInRight`.
+ *
+ * @private
+ * @param {Function} objectFunc The function to iterate over an object.
+ * @returns {Function} Returns the new each function.
+ */
+ function createForIn(objectFunc) {
+ return function(object, iteratee, thisArg) {
+ if (typeof iteratee != 'function' || thisArg !== undefined) {
+ iteratee = bindCallback(iteratee, thisArg, 3);
+ }
+ return objectFunc(object, iteratee, keysIn);
+ };
+ }
+
+ /**
+ * Creates a function for `_.forOwn` or `_.forOwnRight`.
+ *
+ * @private
+ * @param {Function} objectFunc The function to iterate over an object.
+ * @returns {Function} Returns the new each function.
+ */
+ function createForOwn(objectFunc) {
+ return function(object, iteratee, thisArg) {
+ if (typeof iteratee != 'function' || thisArg !== undefined) {
+ iteratee = bindCallback(iteratee, thisArg, 3);
+ }
+ return objectFunc(object, iteratee);
+ };
+ }
+
+ /**
+ * Creates a function for `_.padLeft` or `_.padRight`.
+ *
+ * @private
+ * @param {boolean} [fromRight] Specify padding from the right.
+ * @returns {Function} Returns the new pad function.
+ */
+ function createPadDir(fromRight) {
+ return function(string, length, chars) {
+ string = baseToString(string);
+ return string && ((fromRight ? string : '') + createPadding(string, length, chars) + (fromRight ? ''
: string));
+ };
+ }
+
+ /**
+ * Creates a `_.partial` or `_.partialRight` function.
+ *
+ * @private
+ * @param {boolean} flag The partial bit flag.
+ * @returns {Function} Returns the new partial function.
+ */
+ function createPartial(flag) {
+ var partialFunc = restParam(function(func, partials) {
+ var holders = replaceHolders(partials, partialFunc.placeholder);
+ return createWrapper(func, flag, null, partials, holders);
+ });
+ return partialFunc;
+ }
+
+ /**
+ * Creates a function for `_.reduce` or `_.reduceRight`.
+ *
+ * @private
+ * @param {Function} arrayFunc The function to iterate over an array.
+ * @param {Function} eachFunc The function to iterate over a collection.
+ * @returns {Function} Returns the new each function.
+ */
+ function createReduce(arrayFunc, eachFunc) {
+ return function(collection, iteratee, accumulator, thisArg) {
+ var initFromArray = arguments.length < 3;
+ return (typeof iteratee == 'function' && thisArg === undefined && isArray(collection))
+ ? arrayFunc(collection, iteratee, accumulator, initFromArray)
+ : baseReduce(collection, getCallback(iteratee, thisArg, 4), accumulator, initFromArray, eachFunc);
+ };
+ }
+
+ /**
+ * Creates a function that wraps `func` and invokes it with optional `this`
+ * binding of, partial application, and currying.
+ *
+ * @private
+ * @param {Function|string} func The function or method name to reference.
+ * @param {number} bitmask The bitmask of flags. See `createWrapper` for more details.
+ * @param {*} [thisArg] The `this` binding of `func`.
+ * @param {Array} [partials] The arguments to prepend to those provided to the new function.
+ * @param {Array} [holders] The `partials` placeholder indexes.
+ * @param {Array} [partialsRight] The arguments to append to those provided to the new function.
+ * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.
+ * @param {Array} [argPos] The argument positions of the new function.
+ * @param {number} [ary] The arity cap of `func`.
+ * @param {number} [arity] The arity of `func`.
+ * @returns {Function} Returns the new wrapped function.
+ */
+ function createHybridWrapper(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,
argPos, ary, arity) {
+ var isAry = bitmask & ARY_FLAG,
+ isBind = bitmask & BIND_FLAG,
+ isBindKey = bitmask & BIND_KEY_FLAG,
+ isCurry = bitmask & CURRY_FLAG,
+ isCurryBound = bitmask & CURRY_BOUND_FLAG,
+ isCurryRight = bitmask & CURRY_RIGHT_FLAG;
+
+ var Ctor = !isBindKey && createCtorWrapper(func),
+ key = func;
+
+ function wrapper() {
+ // Avoid `arguments` object use disqualifying optimizations by
+ // converting it to an array before providing it to other functions.
+ var length = arguments.length,
+ index = length,
+ args = Array(length);
+
+ while (index--) {
+ args[index] = arguments[index];
+ }
+ if (partials) {
+ args = composeArgs(args, partials, holders);
+ }
+ if (partialsRight) {
+ args = composeArgsRight(args, partialsRight, holdersRight);
+ }
+ if (isCurry || isCurryRight) {
+ var placeholder = wrapper.placeholder,
+ argsHolders = replaceHolders(args, placeholder);
+
+ length -= argsHolders.length;
+ if (length < arity) {
+ var newArgPos = argPos ? arrayCopy(argPos) : null,
+ newArity = nativeMax(arity - length, 0),
+ newsHolders = isCurry ? argsHolders : null,
+ newHoldersRight = isCurry ? null : argsHolders,
+ newPartials = isCurry ? args : null,
+ newPartialsRight = isCurry ? null : args;
+
+ bitmask |= (isCurry ? PARTIAL_FLAG : PARTIAL_RIGHT_FLAG);
+ bitmask &= ~(isCurry ? PARTIAL_RIGHT_FLAG : PARTIAL_FLAG);
+
+ if (!isCurryBound) {
+ bitmask &= ~(BIND_FLAG | BIND_KEY_FLAG);
+ }
+ var newData = [func, bitmask, thisArg, newPartials, newsHolders, newPartialsRight,
newHoldersRight, newArgPos, ary, newArity],
+ result = createHybridWrapper.apply(undefined, newData);
+
+ if (isLaziable(func)) {
+ setData(result, newData);
+ }
+ result.placeholder = placeholder;
+ return result;
+ }
+ }
+ var thisBinding = isBind ? thisArg : this;
+ if (isBindKey) {
+ func = thisBinding[key];
+ }
+ if (argPos) {
+ args = reorder(args, argPos);
+ }
+ if (isAry && ary < args.length) {
+ args.length = ary;
+ }
+ var fn = (this && this !== root && this instanceof wrapper) ? (Ctor || createCtorWrapper(func)) :
func;
+ return fn.apply(thisBinding, args);
+ }
+ return wrapper;
+ }
+
+ /**
+ * Creates the padding required for `string` based on the given `length`.
+ * The `chars` string is truncated if the number of characters exceeds `length`.
+ *
+ * @private
+ * @param {string} string The string to create padding for.
+ * @param {number} [length=0] The padding length.
+ * @param {string} [chars=' '] The string used as padding.
+ * @returns {string} Returns the pad for `string`.
+ */
+ function createPadding(string, length, chars) {
+ var strLength = string.length;
+ length = +length;
+
+ if (strLength >= length || !nativeIsFinite(length)) {
+ return '';
+ }
+ var padLength = length - strLength;
+ chars = chars == null ? ' ' : (chars + '');
+ return repeat(chars, ceil(padLength / chars.length)).slice(0, padLength);
+ }
+
+ /**
+ * Creates a function that wraps `func` and invokes it with the optional `this`
+ * binding of `thisArg` and the `partials` prepended to those provided to
+ * the wrapper.
+ *
+ * @private
+ * @param {Function} func The function to partially apply arguments to.
+ * @param {number} bitmask The bitmask of flags. See `createWrapper` for more details.
+ * @param {*} thisArg The `this` binding of `func`.
+ * @param {Array} partials The arguments to prepend to those provided to the new function.
+ * @returns {Function} Returns the new bound function.
+ */
+ function createPartialWrapper(func, bitmask, thisArg, partials) {
+ var isBind = bitmask & BIND_FLAG,
+ Ctor = createCtorWrapper(func);
+
+ function wrapper() {
+ // Avoid `arguments` object use disqualifying optimizations by
+ // converting it to an array before providing it `func`.
+ var argsIndex = -1,
+ argsLength = arguments.length,
+ leftIndex = -1,
+ leftLength = partials.length,
+ args = Array(argsLength + leftLength);
+
+ while (++leftIndex < leftLength) {
+ args[leftIndex] = partials[leftIndex];
+ }
+ while (argsLength--) {
+ args[leftIndex++] = arguments[++argsIndex];
+ }
+ var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
+ return fn.apply(isBind ? thisArg : this, args);
+ }
+ return wrapper;
+ }
+
+ /**
+ * Creates a `_.sortedIndex` or `_.sortedLastIndex` function.
+ *
+ * @private
+ * @param {boolean} [retHighest] Specify returning the highest qualified index.
+ * @returns {Function} Returns the new index function.
+ */
+ function createSortedIndex(retHighest) {
+ return function(array, value, iteratee, thisArg) {
+ var func = getCallback(iteratee);
+ return (func === baseCallback && iteratee == null)
+ ? binaryIndex(array, value, retHighest)
+ : binaryIndexBy(array, value, func(iteratee, thisArg, 1), retHighest);
+ };
}
- return result;
- };
- // If the browser doesn't supply us with indexOf (I'm looking at you, **MSIE**),
- // we need this function. Return the position of the first occurrence of an
- // item in an array, or -1 if the item is not included in the array.
- // Delegates to **ECMAScript 5**'s native `indexOf` if available.
- // If the array is large and already in sort order, pass `true`
- // for **isSorted** to use binary search.
- _.indexOf = function(array, item, isSorted) {
- if (array == null) return -1;
- var i = 0, length = array.length;
- if (isSorted) {
- if (typeof isSorted == 'number') {
- i = (isSorted < 0 ? Math.max(0, length + isSorted) : isSorted);
+ /**
+ * Creates a function that either curries or invokes `func` with optional
+ * `this` binding and partially applied arguments.
+ *
+ * @private
+ * @param {Function|string} func The function or method name to reference.
+ * @param {number} bitmask The bitmask of flags.
+ * The bitmask may be composed of the following flags:
+ * 1 - `_.bind`
+ * 2 - `_.bindKey`
+ * 4 - `_.curry` or `_.curryRight` of a bound function
+ * 8 - `_.curry`
+ * 16 - `_.curryRight`
+ * 32 - `_.partial`
+ * 64 - `_.partialRight`
+ * 128 - `_.rearg`
+ * 256 - `_.ary`
+ * @param {*} [thisArg] The `this` binding of `func`.
+ * @param {Array} [partials] The arguments to be partially applied.
+ * @param {Array} [holders] The `partials` placeholder indexes.
+ * @param {Array} [argPos] The argument positions of the new function.
+ * @param {number} [ary] The arity cap of `func`.
+ * @param {number} [arity] The arity of `func`.
+ * @returns {Function} Returns the new wrapped function.
+ */
+ function createWrapper(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {
+ var isBindKey = bitmask & BIND_KEY_FLAG;
+ if (!isBindKey && typeof func != 'function') {
+ throw new TypeError(FUNC_ERROR_TEXT);
+ }
+ var length = partials ? partials.length : 0;
+ if (!length) {
+ bitmask &= ~(PARTIAL_FLAG | PARTIAL_RIGHT_FLAG);
+ partials = holders = null;
+ }
+ length -= (holders ? holders.length : 0);
+ if (bitmask & PARTIAL_RIGHT_FLAG) {
+ var partialsRight = partials,
+ holdersRight = holders;
+
+ partials = holders = null;
+ }
+ var data = isBindKey ? null : getData(func),
+ newData = [func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary,
arity];
+
+ if (data) {
+ mergeData(newData, data);
+ bitmask = newData[1];
+ arity = newData[9];
+ }
+ newData[9] = arity == null
+ ? (isBindKey ? 0 : func.length)
+ : (nativeMax(arity - length, 0) || 0);
+
+ if (bitmask == BIND_FLAG) {
+ var result = createBindWrapper(newData[0], newData[2]);
+ } else if ((bitmask == PARTIAL_FLAG || bitmask == (BIND_FLAG | PARTIAL_FLAG)) && !newData[4].length) {
+ result = createPartialWrapper.apply(undefined, newData);
} else {
- i = _.sortedIndex(array, item);
- return array[i] === item ? i : -1;
+ result = createHybridWrapper.apply(undefined, newData);
}
+ var setter = data ? baseSetData : setData;
+ return setter(result, newData);
}
- if (nativeIndexOf && array.indexOf === nativeIndexOf) return array.indexOf(item, isSorted);
- for (; i < length; i++) if (array[i] === item) return i;
- return -1;
- };
- // Delegates to **ECMAScript 5**'s native `lastIndexOf` if available.
- _.lastIndexOf = function(array, item, from) {
- if (array == null) return -1;
- var hasIndex = from != null;
- if (nativeLastIndexOf && array.lastIndexOf === nativeLastIndexOf) {
- return hasIndex ? array.lastIndexOf(item, from) : array.lastIndexOf(item);
+ /**
+ * A specialized version of `baseIsEqualDeep` for arrays with support for
+ * partial deep comparisons.
+ *
+ * @private
+ * @param {Array} array The array to compare.
+ * @param {Array} other The other array to compare.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Function} [customizer] The function to customize comparing arrays.
+ * @param {boolean} [isLoose] Specify performing partial comparisons.
+ * @param {Array} [stackA] Tracks traversed `value` objects.
+ * @param {Array} [stackB] Tracks traversed `other` objects.
+ * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
+ */
+ function equalArrays(array, other, equalFunc, customizer, isLoose, stackA, stackB) {
+ var index = -1,
+ arrLength = array.length,
+ othLength = other.length,
+ result = true;
+
+ if (arrLength != othLength && !(isLoose && othLength > arrLength)) {
+ return false;
+ }
+ // Deep compare the contents, ignoring non-numeric properties.
+ while (result && ++index < arrLength) {
+ var arrValue = array[index],
+ othValue = other[index];
+
+ result = undefined;
+ if (customizer) {
+ result = isLoose
+ ? customizer(othValue, arrValue, index)
+ : customizer(arrValue, othValue, index);
+ }
+ if (result === undefined) {
+ // Recursively compare arrays (susceptible to call stack limits).
+ if (isLoose) {
+ var othIndex = othLength;
+ while (othIndex--) {
+ othValue = other[othIndex];
+ result = (arrValue && arrValue === othValue) || equalFunc(arrValue, othValue, customizer,
isLoose, stackA, stackB);
+ if (result) {
+ break;
+ }
+ }
+ } else {
+ result = (arrValue && arrValue === othValue) || equalFunc(arrValue, othValue, customizer,
isLoose, stackA, stackB);
+ }
+ }
+ }
+ return !!result;
}
- var i = (hasIndex ? from : array.length);
- while (i--) if (array[i] === item) return i;
- return -1;
- };
- // Generate an integer Array containing an arithmetic progression. A port of
- // the native Python `range()` function. See
- // [the Python documentation](http://docs.python.org/library/functions.html#range).
- _.range = function(start, stop, step) {
- if (arguments.length <= 1) {
- stop = start || 0;
- start = 0;
+ /**
+ * A specialized version of `baseIsEqualDeep` for comparing objects of
+ * the same `toStringTag`.
+ *
+ * **Note:** This function only supports comparing values with tags of
+ * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
+ *
+ * @private
+ * @param {Object} value The object to compare.
+ * @param {Object} other The other object to compare.
+ * @param {string} tag The `toStringTag` of the objects to compare.
+ * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+ */
+ function equalByTag(object, other, tag) {
+ switch (tag) {
+ case boolTag:
+ case dateTag:
+ // Coerce dates and booleans to numbers, dates to milliseconds and booleans
+ // to `1` or `0` treating invalid dates coerced to `NaN` as not equal.
+ return +object == +other;
+
+ case errorTag:
+ return object.name == other.name && object.message == other.message;
+
+ case numberTag:
+ // Treat `NaN` vs. `NaN` as equal.
+ return (object != +object)
+ ? other != +other
+ // But, treat `-0` vs. `+0` as not equal.
+ : (object == 0 ? ((1 / object) == (1 / other)) : object == +other);
+
+ case regexpTag:
+ case stringTag:
+ // Coerce regexes to strings and treat strings primitives and string
+ // objects as equal. See https://es5.github.io/#x15.10.6.4 for more details.
+ return object == (other + '');
+ }
+ return false;
}
- step = arguments[2] || 1;
- var length = Math.max(Math.ceil((stop - start) / step), 0);
- var idx = 0;
- var range = new Array(length);
+ /**
+ * A specialized version of `baseIsEqualDeep` for objects with support for
+ * partial deep comparisons.
+ *
+ * @private
+ * @param {Object} object The object to compare.
+ * @param {Object} other The other object to compare.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Function} [customizer] The function to customize comparing values.
+ * @param {boolean} [isLoose] Specify performing partial comparisons.
+ * @param {Array} [stackA] Tracks traversed `value` objects.
+ * @param {Array} [stackB] Tracks traversed `other` objects.
+ * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+ */
+ function equalObjects(object, other, equalFunc, customizer, isLoose, stackA, stackB) {
+ var objProps = keys(object),
+ objLength = objProps.length,
+ othProps = keys(other),
+ othLength = othProps.length;
- while(idx < length) {
- range[idx++] = start;
- start += step;
+ if (objLength != othLength && !isLoose) {
+ return false;
+ }
+ var skipCtor = isLoose,
+ index = -1;
+
+ while (++index < objLength) {
+ var key = objProps[index],
+ result = isLoose ? key in other : hasOwnProperty.call(other, key);
+
+ if (result) {
+ var objValue = object[key],
+ othValue = other[key];
+
+ result = undefined;
+ if (customizer) {
+ result = isLoose
+ ? customizer(othValue, objValue, key)
+ : customizer(objValue, othValue, key);
+ }
+ if (result === undefined) {
+ // Recursively compare objects (susceptible to call stack limits).
+ result = (objValue && objValue === othValue) || equalFunc(objValue, othValue, customizer,
isLoose, stackA, stackB);
+ }
+ }
+ if (!result) {
+ return false;
+ }
+ skipCtor || (skipCtor = key == 'constructor');
+ }
+ if (!skipCtor) {
+ var objCtor = object.constructor,
+ othCtor = other.constructor;
+
+ // Non `Object` object instances with different constructors are not equal.
+ if (objCtor != othCtor &&
+ ('constructor' in object && 'constructor' in other) &&
+ !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
+ typeof othCtor == 'function' && othCtor instanceof othCtor)) {
+ return false;
+ }
+ }
+ return true;
}
- return range;
- };
+ /**
+ * Gets the extremum value of `collection` invoking `iteratee` for each value
+ * in `collection` to generate the criterion by which the value is ranked.
+ * The `iteratee` is invoked with three arguments: (value, index, collection).
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {boolean} [isMin] Specify returning the minimum, instead of the
+ * maximum, extremum value.
+ * @returns {*} Returns the extremum value.
+ */
+ function extremumBy(collection, iteratee, isMin) {
+ var exValue = isMin ? POSITIVE_INFINITY : NEGATIVE_INFINITY,
+ computed = exValue,
+ result = computed;
+
+ baseEach(collection, function(value, index, collection) {
+ var current = iteratee(value, index, collection);
+ if ((isMin ? (current < computed) : (current > computed)) ||
+ (current === exValue && current === result)) {
+ computed = current;
+ result = value;
+ }
+ });
+ return result;
+ }
- // Function (ahem) Functions
- // ------------------
-
- // Reusable constructor function for prototype setting.
- var ctor = function(){};
-
- // Create a function bound to a given object (assigning `this`, and arguments,
- // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if
- // available.
- _.bind = function(func, context) {
- var args, bound;
- if (nativeBind && func.bind === nativeBind) return nativeBind.apply(func, slice.call(arguments, 1));
- if (!_.isFunction(func)) throw new TypeError;
- args = slice.call(arguments, 2);
- return bound = function() {
- if (!(this instanceof bound)) return func.apply(context, args.concat(slice.call(arguments)));
- ctor.prototype = func.prototype;
- var self = new ctor;
- ctor.prototype = null;
- var result = func.apply(self, args.concat(slice.call(arguments)));
- if (Object(result) === result) return result;
- return self;
+ /**
+ * Gets the appropriate "callback" function. If the `_.callback` method is
+ * customized this function returns the custom method, otherwise it returns
+ * the `baseCallback` function. If arguments are provided the chosen function
+ * is invoked with them and its result is returned.
+ *
+ * @private
+ * @returns {Function} Returns the chosen function or its result.
+ */
+ function getCallback(func, thisArg, argCount) {
+ var result = lodash.callback || callback;
+ result = result === callback ? baseCallback : result;
+ return argCount ? result(func, thisArg, argCount) : result;
+ }
+
+ /**
+ * Gets metadata for `func`.
+ *
+ * @private
+ * @param {Function} func The function to query.
+ * @returns {*} Returns the metadata for `func`.
+ */
+ var getData = !metaMap ? noop : function(func) {
+ return metaMap.get(func);
};
- };
- // Partially apply a function by creating a version that has had some of its
- // arguments pre-filled, without changing its dynamic `this` context. _ acts
- // as a placeholder, allowing any combination of arguments to be pre-filled.
- _.partial = function(func) {
- var boundArgs = slice.call(arguments, 1);
- return function() {
- var position = 0;
- var args = boundArgs.slice();
- for (var i = 0, length = args.length; i < length; i++) {
- if (args[i] === _) args[i] = arguments[position++];
+ /**
+ * Gets the name of `func`.
+ *
+ * @private
+ * @param {Function} func The function to query.
+ * @returns {string} Returns the function name.
+ */
+ var getFuncName = (function() {
+ if (!support.funcNames) {
+ return constant('');
}
- while (position < arguments.length) args.push(arguments[position++]);
- return func.apply(this, args);
- };
- };
+ if (constant.name == 'constant') {
+ return baseProperty('name');
+ }
+ return function(func) {
+ var result = func.name,
+ array = realNames[result],
+ length = array ? array.length : 0;
- // Bind a number of an object's methods to that object. Remaining arguments
- // are the method names to be bound. Useful for ensuring that all callbacks
- // defined on an object belong to it.
- _.bindAll = function(obj) {
- var funcs = slice.call(arguments, 1);
- if (funcs.length === 0) throw new Error('bindAll must be passed function names');
- each(funcs, function(f) { obj[f] = _.bind(obj[f], obj); });
- return obj;
- };
+ while (length--) {
+ var data = array[length],
+ otherFunc = data.func;
- // Memoize an expensive function by storing its results.
- _.memoize = function(func, hasher) {
- var memo = {};
- hasher || (hasher = _.identity);
- return function() {
- var key = hasher.apply(this, arguments);
- return _.has(memo, key) ? memo[key] : (memo[key] = func.apply(this, arguments));
- };
- };
+ if (otherFunc == null || otherFunc == func) {
+ return data.name;
+ }
+ }
+ return result;
+ };
+ }());
- // Delays a function for the given number of milliseconds, and then calls
- // it with the arguments supplied.
- _.delay = function(func, wait) {
- var args = slice.call(arguments, 2);
- return setTimeout(function(){ return func.apply(null, args); }, wait);
- };
+ /**
+ * Gets the appropriate "indexOf" function. If the `_.indexOf` method is
+ * customized this function returns the custom method, otherwise it returns
+ * the `baseIndexOf` function. If arguments are provided the chosen function
+ * is invoked with them and its result is returned.
+ *
+ * @private
+ * @returns {Function|number} Returns the chosen function or its result.
+ */
+ function getIndexOf(collection, target, fromIndex) {
+ var result = lodash.indexOf || indexOf;
+ result = result === indexOf ? baseIndexOf : result;
+ return collection ? result(collection, target, fromIndex) : result;
+ }
- // Defers a function, scheduling it to run after the current call stack has
- // cleared.
- _.defer = function(func) {
- return _.delay.apply(_, [func, 1].concat(slice.call(arguments, 1)));
- };
+ /**
+ * Gets the "length" property value of `object`.
+ *
+ * **Note:** This function is used to avoid a [JIT bug](https://bugs.webkit.org/show_bug.cgi?id=142792)
+ * in Safari on iOS 8.1 ARM64.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {*} Returns the "length" value.
+ */
+ var getLength = baseProperty('length');
- // Returns a function, that, when invoked, will only be triggered at most once
- // during a given window of time. Normally, the throttled function will run
- // as much as it can, without ever going more than once per `wait` duration;
- // but if you'd like to disable the execution on the leading edge, pass
- // `{leading: false}`. To disable execution on the trailing edge, ditto.
- _.throttle = function(func, wait, options) {
- var context, args, result;
- var timeout = null;
- var previous = 0;
- options || (options = {});
- var later = function() {
- previous = options.leading === false ? 0 : _.now();
- timeout = null;
- result = func.apply(context, args);
- context = args = null;
+ /**
+ * Creates an array of the own symbols of `object`.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of symbols.
+ */
+ var getSymbols = !getOwnPropertySymbols ? constant([]) : function(object) {
+ return getOwnPropertySymbols(toObject(object));
};
- return function() {
- var now = _.now();
- if (!previous && options.leading === false) previous = now;
- var remaining = wait - (now - previous);
- context = this;
- args = arguments;
- if (remaining <= 0) {
- clearTimeout(timeout);
- timeout = null;
- previous = now;
- result = func.apply(context, args);
- context = args = null;
- } else if (!timeout && options.trailing !== false) {
- timeout = setTimeout(later, remaining);
+
+ /**
+ * Gets the view, applying any `transforms` to the `start` and `end` positions.
+ *
+ * @private
+ * @param {number} start The start of the view.
+ * @param {number} end The end of the view.
+ * @param {Array} [transforms] The transformations to apply to the view.
+ * @returns {Object} Returns an object containing the `start` and `end`
+ * positions of the view.
+ */
+ function getView(start, end, transforms) {
+ var index = -1,
+ length = transforms ? transforms.length : 0;
+
+ while (++index < length) {
+ var data = transforms[index],
+ size = data.size;
+
+ switch (data.type) {
+ case 'drop': start += size; break;
+ case 'dropRight': end -= size; break;
+ case 'take': end = nativeMin(end, start + size); break;
+ case 'takeRight': start = nativeMax(start, end - size); break;
+ }
+ }
+ return { 'start': start, 'end': end };
+ }
+
+ /**
+ * Initializes an array clone.
+ *
+ * @private
+ * @param {Array} array The array to clone.
+ * @returns {Array} Returns the initialized clone.
+ */
+ function initCloneArray(array) {
+ var length = array.length,
+ result = new array.constructor(length);
+
+ // Add array properties assigned by `RegExp#exec`.
+ if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {
+ result.index = array.index;
+ result.input = array.input;
}
return result;
- };
- };
+ }
+
+ /**
+ * Initializes an object clone.
+ *
+ * @private
+ * @param {Object} object The object to clone.
+ * @returns {Object} Returns the initialized clone.
+ */
+ function initCloneObject(object) {
+ var Ctor = object.constructor;
+ if (!(typeof Ctor == 'function' && Ctor instanceof Ctor)) {
+ Ctor = Object;
+ }
+ return new Ctor;
+ }
+
+ /**
+ * Initializes an object clone based on its `toStringTag`.
+ *
+ * **Note:** This function only supports cloning values with tags of
+ * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
+ *
+ * @private
+ * @param {Object} object The object to clone.
+ * @param {string} tag The `toStringTag` of the object to clone.
+ * @param {boolean} [isDeep] Specify a deep clone.
+ * @returns {Object} Returns the initialized clone.
+ */
+ function initCloneByTag(object, tag, isDeep) {
+ var Ctor = object.constructor;
+ switch (tag) {
+ case arrayBufferTag:
+ return bufferClone(object);
+
+ case boolTag:
+ case dateTag:
+ return new Ctor(+object);
+
+ case float32Tag: case float64Tag:
+ case int8Tag: case int16Tag: case int32Tag:
+ case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:
+ var buffer = object.buffer;
+ return new Ctor(isDeep ? bufferClone(buffer) : buffer, object.byteOffset, object.length);
+
+ case numberTag:
+ case stringTag:
+ return new Ctor(object);
+
+ case regexpTag:
+ var result = new Ctor(object.source, reFlags.exec(object));
+ result.lastIndex = object.lastIndex;
+ }
+ return result;
+ }
+
+ /**
+ * Invokes the method at `path` on `object`.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @param {Array|string} path The path of the method to invoke.
+ * @param {Array} args The arguments to invoke the method with.
+ * @returns {*} Returns the result of the invoked method.
+ */
+ function invokePath(object, path, args) {
+ if (object != null && !isKey(path, object)) {
+ path = toPath(path);
+ object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
+ path = last(path);
+ }
+ var func = object == null ? object : object[path];
+ return func == null ? undefined : func.apply(object, args);
+ }
- // Returns a function, that, as long as it continues to be invoked, will not
- // be triggered. The function will be called after it stops being called for
- // N milliseconds. If `immediate` is passed, trigger the function on the
- // leading edge, instead of the trailing.
- _.debounce = function(func, wait, immediate) {
- var timeout, args, context, timestamp, result;
-
- var later = function() {
- var last = _.now() - timestamp;
- if (last < wait) {
- timeout = setTimeout(later, wait - last);
+ /**
+ * Checks if `value` is a valid array-like index.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
+ * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
+ */
+ function isIndex(value, length) {
+ value = +value;
+ length = length == null ? MAX_SAFE_INTEGER : length;
+ return value > -1 && value % 1 == 0 && value < length;
+ }
+
+ /**
+ * Checks if the provided arguments are from an iteratee call.
+ *
+ * @private
+ * @param {*} value The potential iteratee value argument.
+ * @param {*} index The potential iteratee index or key argument.
+ * @param {*} object The potential iteratee object argument.
+ * @returns {boolean} Returns `true` if the arguments are from an iteratee call, else `false`.
+ */
+ function isIterateeCall(value, index, object) {
+ if (!isObject(object)) {
+ return false;
+ }
+ var type = typeof index;
+ if (type == 'number') {
+ var length = getLength(object),
+ prereq = isLength(length) && isIndex(index, length);
} else {
- timeout = null;
- if (!immediate) {
- result = func.apply(context, args);
- context = args = null;
+ prereq = type == 'string' && index in object;
+ }
+ if (prereq) {
+ var other = object[index];
+ return value === value ? (value === other) : (other !== other);
+ }
+ return false;
+ }
+
+ /**
+ * Checks if `value` is a property name and not a property path.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @param {Object} [object] The object to query keys on.
+ * @returns {boolean} Returns `true` if `value` is a property name, else `false`.
+ */
+ function isKey(value, object) {
+ var type = typeof value;
+ if ((type == 'string' && reIsPlainProp.test(value)) || type == 'number') {
+ return true;
+ }
+ if (isArray(value)) {
+ return false;
+ }
+ var result = !reIsDeepProp.test(value);
+ return result || (object != null && value in toObject(object));
+ }
+
+ /**
+ * Checks if `func` has a lazy counterpart.
+ *
+ * @private
+ * @param {Function} func The function to check.
+ * @returns {boolean} Returns `true` if `func` has a lazy counterpart, else `false`.
+ */
+ function isLaziable(func) {
+ var funcName = getFuncName(func);
+ return !!funcName && func === lodash[funcName] && funcName in LazyWrapper.prototype;
+ }
+
+ /**
+ * Checks if `value` is a valid array-like length.
+ *
+ * **Note:** This function is based on
[`ToLength`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength).
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.
+ */
+ function isLength(value) {
+ return typeof value == 'number' && value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
+ }
+
+ /**
+ * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` if suitable for strict
+ * equality comparisons, else `false`.
+ */
+ function isStrictComparable(value) {
+ return value === value && (value === 0 ? ((1 / value) > 0) : !isObject(value));
+ }
+
+ /**
+ * Merges the function metadata of `source` into `data`.
+ *
+ * Merging metadata reduces the number of wrappers required to invoke a function.
+ * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`
+ * may be applied regardless of execution order. Methods like `_.ary` and `_.rearg`
+ * augment function arguments, making the order in which they are executed important,
+ * preventing the merging of metadata. However, we make an exception for a safe
+ * common case where curried functions have `_.ary` and or `_.rearg` applied.
+ *
+ * @private
+ * @param {Array} data The destination metadata.
+ * @param {Array} source The source metadata.
+ * @returns {Array} Returns `data`.
+ */
+ function mergeData(data, source) {
+ var bitmask = data[1],
+ srcBitmask = source[1],
+ newBitmask = bitmask | srcBitmask,
+ isCommon = newBitmask < ARY_FLAG;
+
+ var isCombo =
+ (srcBitmask == ARY_FLAG && bitmask == CURRY_FLAG) ||
+ (srcBitmask == ARY_FLAG && bitmask == REARG_FLAG && data[7].length <= source[8]) ||
+ (srcBitmask == (ARY_FLAG | REARG_FLAG) && bitmask == CURRY_FLAG);
+
+ // Exit early if metadata can't be merged.
+ if (!(isCommon || isCombo)) {
+ return data;
+ }
+ // Use source `thisArg` if available.
+ if (srcBitmask & BIND_FLAG) {
+ data[2] = source[2];
+ // Set when currying a bound function.
+ newBitmask |= (bitmask & BIND_FLAG) ? 0 : CURRY_BOUND_FLAG;
+ }
+ // Compose partial arguments.
+ var value = source[3];
+ if (value) {
+ var partials = data[3];
+ data[3] = partials ? composeArgs(partials, value, source[4]) : arrayCopy(value);
+ data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : arrayCopy(source[4]);
+ }
+ // Compose partial right arguments.
+ value = source[5];
+ if (value) {
+ partials = data[5];
+ data[5] = partials ? composeArgsRight(partials, value, source[6]) : arrayCopy(value);
+ data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : arrayCopy(source[6]);
+ }
+ // Use source `argPos` if available.
+ value = source[7];
+ if (value) {
+ data[7] = arrayCopy(value);
+ }
+ // Use source `ary` if it's smaller.
+ if (srcBitmask & ARY_FLAG) {
+ data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);
+ }
+ // Use source `arity` if one is not provided.
+ if (data[9] == null) {
+ data[9] = source[9];
+ }
+ // Use source `func` and merge bitmasks.
+ data[0] = source[0];
+ data[1] = newBitmask;
+
+ return data;
+ }
+
+ /**
+ * A specialized version of `_.pick` that picks `object` properties specified
+ * by `props`.
+ *
+ * @private
+ * @param {Object} object The source object.
+ * @param {string[]} props The property names to pick.
+ * @returns {Object} Returns the new object.
+ */
+ function pickByArray(object, props) {
+ object = toObject(object);
+
+ var index = -1,
+ length = props.length,
+ result = {};
+
+ while (++index < length) {
+ var key = props[index];
+ if (key in object) {
+ result[key] = object[key];
}
}
- };
+ return result;
+ }
- return function() {
- context = this;
- args = arguments;
- timestamp = _.now();
- var callNow = immediate && !timeout;
- if (!timeout) {
- timeout = setTimeout(later, wait);
+ /**
+ * A specialized version of `_.pick` that picks `object` properties `predicate`
+ * returns truthy for.
+ *
+ * @private
+ * @param {Object} object The source object.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {Object} Returns the new object.
+ */
+ function pickByCallback(object, predicate) {
+ var result = {};
+ baseForIn(object, function(value, key, object) {
+ if (predicate(value, key, object)) {
+ result[key] = value;
+ }
+ });
+ return result;
+ }
+
+ /**
+ * Reorder `array` according to the specified indexes where the element at
+ * the first index is assigned as the first element, the element at
+ * the second index is assigned as the second element, and so on.
+ *
+ * @private
+ * @param {Array} array The array to reorder.
+ * @param {Array} indexes The arranged array indexes.
+ * @returns {Array} Returns `array`.
+ */
+ function reorder(array, indexes) {
+ var arrLength = array.length,
+ length = nativeMin(indexes.length, arrLength),
+ oldArray = arrayCopy(array);
+
+ while (length--) {
+ var index = indexes[length];
+ array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;
}
- if (callNow) {
- result = func.apply(context, args);
- context = args = null;
+ return array;
+ }
+
+ /**
+ * Sets metadata for `func`.
+ *
+ * **Note:** If this function becomes hot, i.e. is invoked a lot in a short
+ * period of time, it will trip its breaker and transition to an identity function
+ * to avoid garbage collection pauses in V8. See [V8 issue
2070](https://code.google.com/p/v8/issues/detail?id=2070)
+ * for more details.
+ *
+ * @private
+ * @param {Function} func The function to associate metadata with.
+ * @param {*} data The metadata.
+ * @returns {Function} Returns `func`.
+ */
+ var setData = (function() {
+ var count = 0,
+ lastCalled = 0;
+
+ return function(key, value) {
+ var stamp = now(),
+ remaining = HOT_SPAN - (stamp - lastCalled);
+
+ lastCalled = stamp;
+ if (remaining > 0) {
+ if (++count >= HOT_COUNT) {
+ return key;
+ }
+ } else {
+ count = 0;
+ }
+ return baseSetData(key, value);
+ };
+ }());
+
+ /**
+ * A fallback implementation of `_.isPlainObject` which checks if `value`
+ * is an object created by the `Object` constructor or has a `[[Prototype]]`
+ * of `null`.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.
+ */
+ function shimIsPlainObject(value) {
+ var Ctor,
+ support = lodash.support;
+
+ // Exit early for non `Object` objects.
+ if (!(isObjectLike(value) && objToString.call(value) == objectTag) ||
+ (!hasOwnProperty.call(value, 'constructor') &&
+ (Ctor = value.constructor, typeof Ctor == 'function' && !(Ctor instanceof Ctor)))) {
+ return false;
}
+ // IE < 9 iterates inherited properties before own properties. If the first
+ // iterated property is an object's own property then there are no inherited
+ // enumerable properties.
+ var result;
+ // In most environments an object's own properties are iterated before
+ // its inherited properties. If the last iterated property is an object's
+ // own property then there are no inherited enumerable properties.
+ baseForIn(value, function(subValue, key) {
+ result = key;
+ });
+ return result === undefined || hasOwnProperty.call(value, result);
+ }
+ /**
+ * A fallback implementation of `Object.keys` which creates an array of the
+ * own enumerable property names of `object`.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ */
+ function shimKeys(object) {
+ var props = keysIn(object),
+ propsLength = props.length,
+ length = propsLength && object.length,
+ support = lodash.support;
+
+ var allowIndexes = length && isLength(length) &&
+ (isArray(object) || (support.nonEnumArgs && isArguments(object)));
+
+ var index = -1,
+ result = [];
+
+ while (++index < propsLength) {
+ var key = props[index];
+ if ((allowIndexes && isIndex(key, length)) || hasOwnProperty.call(object, key)) {
+ result.push(key);
+ }
+ }
return result;
- };
- };
+ }
- // Returns a function that will be executed at most one time, no matter how
- // often you call it. Useful for lazy initialization.
- _.once = function(func) {
- var ran = false, memo;
- return function() {
- if (ran) return memo;
- ran = true;
- memo = func.apply(this, arguments);
- func = null;
- return memo;
- };
- };
+ /**
+ * Converts `value` to an array-like object if it is not one.
+ *
+ * @private
+ * @param {*} value The value to process.
+ * @returns {Array|Object} Returns the array-like object.
+ */
+ function toIterable(value) {
+ if (value == null) {
+ return [];
+ }
+ if (!isLength(getLength(value))) {
+ return values(value);
+ }
+ return isObject(value) ? value : Object(value);
+ }
- // Returns the first function passed as an argument to the second,
- // allowing you to adjust arguments, run code before and after, and
- // conditionally execute the original function.
- _.wrap = function(func, wrapper) {
- return _.partial(wrapper, func);
- };
+ /**
+ * Converts `value` to an object if it is not one.
+ *
+ * @private
+ * @param {*} value The value to process.
+ * @returns {Object} Returns the object.
+ */
+ function toObject(value) {
+ return isObject(value) ? value : Object(value);
+ }
- // Returns a function that is the composition of a list of functions, each
- // consuming the return value of the function that follows.
- _.compose = function() {
- var funcs = arguments;
- return function() {
- var args = arguments;
- for (var i = funcs.length - 1; i >= 0; i--) {
- args = [funcs[i].apply(this, args)];
+ /**
+ * Converts `value` to property path array if it is not one.
+ *
+ * @private
+ * @param {*} value The value to process.
+ * @returns {Array} Returns the property path array.
+ */
+ function toPath(value) {
+ if (isArray(value)) {
+ return value;
}
- return args[0];
- };
- };
+ var result = [];
+ baseToString(value).replace(rePropName, function(match, number, quote, string) {
+ result.push(quote ? string.replace(reEscapeChar, '$1') : (number || match));
+ });
+ return result;
+ }
- // Returns a function that will only be executed after being called N times.
- _.after = function(times, func) {
- return function() {
- if (--times < 1) {
- return func.apply(this, arguments);
+ /**
+ * Creates a clone of `wrapper`.
+ *
+ * @private
+ * @param {Object} wrapper The wrapper to clone.
+ * @returns {Object} Returns the cloned wrapper.
+ */
+ function wrapperClone(wrapper) {
+ return wrapper instanceof LazyWrapper
+ ? wrapper.clone()
+ : new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__, arrayCopy(wrapper.__actions__));
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Creates an array of elements split into groups the length of `size`.
+ * If `collection` can't be split evenly, the final chunk will be the remaining
+ * elements.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to process.
+ * @param {number} [size=1] The length of each chunk.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Array} Returns the new array containing chunks.
+ * @example
+ *
+ * _.chunk(['a', 'b', 'c', 'd'], 2);
+ * // => [['a', 'b'], ['c', 'd']]
+ *
+ * _.chunk(['a', 'b', 'c', 'd'], 3);
+ * // => [['a', 'b', 'c'], ['d']]
+ */
+ function chunk(array, size, guard) {
+ if (guard ? isIterateeCall(array, size, guard) : size == null) {
+ size = 1;
+ } else {
+ size = nativeMax(+size || 1, 1);
}
- };
- };
+ var index = 0,
+ length = array ? array.length : 0,
+ resIndex = -1,
+ result = Array(ceil(length / size));
- // Object Functions
- // ----------------
-
- // Retrieve the names of an object's properties.
- // Delegates to **ECMAScript 5**'s native `Object.keys`
- _.keys = function(obj) {
- if (!_.isObject(obj)) return [];
- if (nativeKeys) return nativeKeys(obj);
- var keys = [];
- for (var key in obj) if (_.has(obj, key)) keys.push(key);
- return keys;
- };
+ while (index < length) {
+ result[++resIndex] = baseSlice(array, index, (index += size));
+ }
+ return result;
+ }
- // Retrieve the values of an object's properties.
- _.values = function(obj) {
- var keys = _.keys(obj);
- var length = keys.length;
- var values = new Array(length);
- for (var i = 0; i < length; i++) {
- values[i] = obj[keys[i]];
+ /**
+ * Creates an array with all falsey values removed. The values `false`, `null`,
+ * `0`, `""`, `undefined`, and `NaN` are falsey.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to compact.
+ * @returns {Array} Returns the new array of filtered values.
+ * @example
+ *
+ * _.compact([0, 1, false, 2, '', 3]);
+ * // => [1, 2, 3]
+ */
+ function compact(array) {
+ var index = -1,
+ length = array ? array.length : 0,
+ resIndex = -1,
+ result = [];
+
+ while (++index < length) {
+ var value = array[index];
+ if (value) {
+ result[++resIndex] = value;
+ }
+ }
+ return result;
}
- return values;
- };
- // Convert an object into a list of `[key, value]` pairs.
- _.pairs = function(obj) {
- var keys = _.keys(obj);
- var length = keys.length;
- var pairs = new Array(length);
- for (var i = 0; i < length; i++) {
- pairs[i] = [keys[i], obj[keys[i]]];
+ /**
+ * Creates an array excluding all values of the provided arrays using
+ * `SameValueZero` for equality comparisons.
+ *
+ * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+ * comparisons are like strict equality comparisons, e.g. `===`, except that
+ * `NaN` matches `NaN`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to inspect.
+ * @param {...Array} [values] The arrays of values to exclude.
+ * @returns {Array} Returns the new array of filtered values.
+ * @example
+ *
+ * _.difference([1, 2, 3], [4, 2]);
+ * // => [1, 3]
+ */
+ var difference = restParam(function(array, values) {
+ return (isArray(array) || isArguments(array))
+ ? baseDifference(array, baseFlatten(values, false, true))
+ : [];
+ });
+
+ /**
+ * Creates a slice of `array` with `n` elements dropped from the beginning.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to query.
+ * @param {number} [n=1] The number of elements to drop.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Array} Returns the slice of `array`.
+ * @example
+ *
+ * _.drop([1, 2, 3]);
+ * // => [2, 3]
+ *
+ * _.drop([1, 2, 3], 2);
+ * // => [3]
+ *
+ * _.drop([1, 2, 3], 5);
+ * // => []
+ *
+ * _.drop([1, 2, 3], 0);
+ * // => [1, 2, 3]
+ */
+ function drop(array, n, guard) {
+ var length = array ? array.length : 0;
+ if (!length) {
+ return [];
+ }
+ if (guard ? isIterateeCall(array, n, guard) : n == null) {
+ n = 1;
+ }
+ return baseSlice(array, n < 0 ? 0 : n);
+ }
+
+ /**
+ * Creates a slice of `array` with `n` elements dropped from the end.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to query.
+ * @param {number} [n=1] The number of elements to drop.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Array} Returns the slice of `array`.
+ * @example
+ *
+ * _.dropRight([1, 2, 3]);
+ * // => [1, 2]
+ *
+ * _.dropRight([1, 2, 3], 2);
+ * // => [1]
+ *
+ * _.dropRight([1, 2, 3], 5);
+ * // => []
+ *
+ * _.dropRight([1, 2, 3], 0);
+ * // => [1, 2, 3]
+ */
+ function dropRight(array, n, guard) {
+ var length = array ? array.length : 0;
+ if (!length) {
+ return [];
+ }
+ if (guard ? isIterateeCall(array, n, guard) : n == null) {
+ n = 1;
+ }
+ n = length - (+n || 0);
+ return baseSlice(array, 0, n < 0 ? 0 : n);
}
- return pairs;
- };
- // Invert the keys and values of an object. The values must be serializable.
- _.invert = function(obj) {
- var result = {};
- var keys = _.keys(obj);
- for (var i = 0, length = keys.length; i < length; i++) {
- result[obj[keys[i]]] = keys[i];
+ /**
+ * Creates a slice of `array` excluding elements dropped from the end.
+ * Elements are dropped until `predicate` returns falsey. The predicate is
+ * bound to `thisArg` and invoked with three arguments: (value, index, array).
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that match the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to query.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {Array} Returns the slice of `array`.
+ * @example
+ *
+ * _.dropRightWhile([1, 2, 3], function(n) {
+ * return n > 1;
+ * });
+ * // => [1]
+ *
+ * var users = [
+ * { 'user': 'barney', 'active': true },
+ * { 'user': 'fred', 'active': false },
+ * { 'user': 'pebbles', 'active': false }
+ * ];
+ *
+ * // using the `_.matches` callback shorthand
+ * _.pluck(_.dropRightWhile(users, { 'user': 'pebbles', 'active': false }), 'user');
+ * // => ['barney', 'fred']
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.pluck(_.dropRightWhile(users, 'active', false), 'user');
+ * // => ['barney']
+ *
+ * // using the `_.property` callback shorthand
+ * _.pluck(_.dropRightWhile(users, 'active'), 'user');
+ * // => ['barney', 'fred', 'pebbles']
+ */
+ function dropRightWhile(array, predicate, thisArg) {
+ return (array && array.length)
+ ? baseWhile(array, getCallback(predicate, thisArg, 3), true, true)
+ : [];
}
- return result;
- };
- // Return a sorted list of the function names available on the object.
- // Aliased as `methods`
- _.functions = _.methods = function(obj) {
- var names = [];
- for (var key in obj) {
- if (_.isFunction(obj[key])) names.push(key);
+ /**
+ * Creates a slice of `array` excluding elements dropped from the beginning.
+ * Elements are dropped until `predicate` returns falsey. The predicate is
+ * bound to `thisArg` and invoked with three arguments: (value, index, array).
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to query.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {Array} Returns the slice of `array`.
+ * @example
+ *
+ * _.dropWhile([1, 2, 3], function(n) {
+ * return n < 3;
+ * });
+ * // => [3]
+ *
+ * var users = [
+ * { 'user': 'barney', 'active': false },
+ * { 'user': 'fred', 'active': false },
+ * { 'user': 'pebbles', 'active': true }
+ * ];
+ *
+ * // using the `_.matches` callback shorthand
+ * _.pluck(_.dropWhile(users, { 'user': 'barney', 'active': false }), 'user');
+ * // => ['fred', 'pebbles']
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.pluck(_.dropWhile(users, 'active', false), 'user');
+ * // => ['pebbles']
+ *
+ * // using the `_.property` callback shorthand
+ * _.pluck(_.dropWhile(users, 'active'), 'user');
+ * // => ['barney', 'fred', 'pebbles']
+ */
+ function dropWhile(array, predicate, thisArg) {
+ return (array && array.length)
+ ? baseWhile(array, getCallback(predicate, thisArg, 3), true)
+ : [];
}
- return names.sort();
- };
- // Extend a given object with all the properties in passed-in object(s).
- _.extend = function(obj) {
- each(slice.call(arguments, 1), function(source) {
- if (source) {
- for (var prop in source) {
- obj[prop] = source[prop];
+ /**
+ * Fills elements of `array` with `value` from `start` up to, but not
+ * including, `end`.
+ *
+ * **Note:** This method mutates `array`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to fill.
+ * @param {*} value The value to fill `array` with.
+ * @param {number} [start=0] The start position.
+ * @param {number} [end=array.length] The end position.
+ * @returns {Array} Returns `array`.
+ * @example
+ *
+ * var array = [1, 2, 3];
+ *
+ * _.fill(array, 'a');
+ * console.log(array);
+ * // => ['a', 'a', 'a']
+ *
+ * _.fill(Array(3), 2);
+ * // => [2, 2, 2]
+ *
+ * _.fill([4, 6, 8], '*', 1, 2);
+ * // => [4, '*', 8]
+ */
+ function fill(array, value, start, end) {
+ var length = array ? array.length : 0;
+ if (!length) {
+ return [];
+ }
+ if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {
+ start = 0;
+ end = length;
+ }
+ return baseFill(array, value, start, end);
+ }
+
+ /**
+ * This method is like `_.find` except that it returns the index of the first
+ * element `predicate` returns truthy for instead of the element itself.
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to search.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {number} Returns the index of the found element, else `-1`.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney', 'active': false },
+ * { 'user': 'fred', 'active': false },
+ * { 'user': 'pebbles', 'active': true }
+ * ];
+ *
+ * _.findIndex(users, function(chr) {
+ * return chr.user == 'barney';
+ * });
+ * // => 0
+ *
+ * // using the `_.matches` callback shorthand
+ * _.findIndex(users, { 'user': 'fred', 'active': false });
+ * // => 1
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.findIndex(users, 'active', false);
+ * // => 0
+ *
+ * // using the `_.property` callback shorthand
+ * _.findIndex(users, 'active');
+ * // => 2
+ */
+ var findIndex = createFindIndex();
+
+ /**
+ * This method is like `_.findIndex` except that it iterates over elements
+ * of `collection` from right to left.
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to search.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {number} Returns the index of the found element, else `-1`.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney', 'active': true },
+ * { 'user': 'fred', 'active': false },
+ * { 'user': 'pebbles', 'active': false }
+ * ];
+ *
+ * _.findLastIndex(users, function(chr) {
+ * return chr.user == 'pebbles';
+ * });
+ * // => 2
+ *
+ * // using the `_.matches` callback shorthand
+ * _.findLastIndex(users, { 'user': 'barney', 'active': true });
+ * // => 0
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.findLastIndex(users, 'active', false);
+ * // => 2
+ *
+ * // using the `_.property` callback shorthand
+ * _.findLastIndex(users, 'active');
+ * // => 0
+ */
+ var findLastIndex = createFindIndex(true);
+
+ /**
+ * Gets the first element of `array`.
+ *
+ * @static
+ * @memberOf _
+ * @alias head
+ * @category Array
+ * @param {Array} array The array to query.
+ * @returns {*} Returns the first element of `array`.
+ * @example
+ *
+ * _.first([1, 2, 3]);
+ * // => 1
+ *
+ * _.first([]);
+ * // => undefined
+ */
+ function first(array) {
+ return array ? array[0] : undefined;
+ }
+
+ /**
+ * Flattens a nested array. If `isDeep` is `true` the array is recursively
+ * flattened, otherwise it is only flattened a single level.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to flatten.
+ * @param {boolean} [isDeep] Specify a deep flatten.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Array} Returns the new flattened array.
+ * @example
+ *
+ * _.flatten([1, [2, 3, [4]]]);
+ * // => [1, 2, 3, [4]]
+ *
+ * // using `isDeep`
+ * _.flatten([1, [2, 3, [4]]], true);
+ * // => [1, 2, 3, 4]
+ */
+ function flatten(array, isDeep, guard) {
+ var length = array ? array.length : 0;
+ if (guard && isIterateeCall(array, isDeep, guard)) {
+ isDeep = false;
+ }
+ return length ? baseFlatten(array, isDeep) : [];
+ }
+
+ /**
+ * Recursively flattens a nested array.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to recursively flatten.
+ * @returns {Array} Returns the new flattened array.
+ * @example
+ *
+ * _.flattenDeep([1, [2, 3, [4]]]);
+ * // => [1, 2, 3, 4]
+ */
+ function flattenDeep(array) {
+ var length = array ? array.length : 0;
+ return length ? baseFlatten(array, true) : [];
+ }
+
+ /**
+ * Gets the index at which the first occurrence of `value` is found in `array`
+ * using `SameValueZero` for equality comparisons. If `fromIndex` is negative,
+ * it is used as the offset from the end of `array`. If `array` is sorted
+ * providing `true` for `fromIndex` performs a faster binary search.
+ *
+ * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+ * comparisons are like strict equality comparisons, e.g. `===`, except that
+ * `NaN` matches `NaN`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to search.
+ * @param {*} value The value to search for.
+ * @param {boolean|number} [fromIndex=0] The index to search from or `true`
+ * to perform a binary search on a sorted array.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ * @example
+ *
+ * _.indexOf([1, 2, 1, 2], 2);
+ * // => 1
+ *
+ * // using `fromIndex`
+ * _.indexOf([1, 2, 1, 2], 2, 2);
+ * // => 3
+ *
+ * // performing a binary search
+ * _.indexOf([1, 1, 2, 2], 2, true);
+ * // => 2
+ */
+ function indexOf(array, value, fromIndex) {
+ var length = array ? array.length : 0;
+ if (!length) {
+ return -1;
+ }
+ if (typeof fromIndex == 'number') {
+ fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : fromIndex;
+ } else if (fromIndex) {
+ var index = binaryIndex(array, value),
+ other = array[index];
+
+ if (value === value ? (value === other) : (other !== other)) {
+ return index;
+ }
+ return -1;
+ }
+ return baseIndexOf(array, value, fromIndex || 0);
+ }
+
+ /**
+ * Gets all but the last element of `array`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to query.
+ * @returns {Array} Returns the slice of `array`.
+ * @example
+ *
+ * _.initial([1, 2, 3]);
+ * // => [1, 2]
+ */
+ function initial(array) {
+ return dropRight(array, 1);
+ }
+
+ /**
+ * Creates an array of unique values in all provided arrays using `SameValueZero`
+ * for equality comparisons.
+ *
+ * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+ * comparisons are like strict equality comparisons, e.g. `===`, except that
+ * `NaN` matches `NaN`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {...Array} [arrays] The arrays to inspect.
+ * @returns {Array} Returns the new array of shared values.
+ * @example
+ * _.intersection([1, 2], [4, 2], [2, 1]);
+ * // => [2]
+ */
+ function intersection() {
+ var args = [],
+ argsIndex = -1,
+ argsLength = arguments.length,
+ caches = [],
+ indexOf = getIndexOf(),
+ isCommon = indexOf == baseIndexOf,
+ result = [];
+
+ while (++argsIndex < argsLength) {
+ var value = arguments[argsIndex];
+ if (isArray(value) || isArguments(value)) {
+ args.push(value);
+ caches.push((isCommon && value.length >= 120) ? createCache(argsIndex && value) : null);
}
}
+ argsLength = args.length;
+ if (argsLength < 2) {
+ return result;
+ }
+ var array = args[0],
+ index = -1,
+ length = array ? array.length : 0,
+ seen = caches[0];
+
+ outer:
+ while (++index < length) {
+ value = array[index];
+ if ((seen ? cacheIndexOf(seen, value) : indexOf(result, value, 0)) < 0) {
+ argsIndex = argsLength;
+ while (--argsIndex) {
+ var cache = caches[argsIndex];
+ if ((cache ? cacheIndexOf(cache, value) : indexOf(args[argsIndex], value, 0)) < 0) {
+ continue outer;
+ }
+ }
+ if (seen) {
+ seen.push(value);
+ }
+ result.push(value);
+ }
+ }
+ return result;
+ }
+
+ /**
+ * Gets the last element of `array`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to query.
+ * @returns {*} Returns the last element of `array`.
+ * @example
+ *
+ * _.last([1, 2, 3]);
+ * // => 3
+ */
+ function last(array) {
+ var length = array ? array.length : 0;
+ return length ? array[length - 1] : undefined;
+ }
+
+ /**
+ * This method is like `_.indexOf` except that it iterates over elements of
+ * `array` from right to left.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to search.
+ * @param {*} value The value to search for.
+ * @param {boolean|number} [fromIndex=array.length-1] The index to search from
+ * or `true` to perform a binary search on a sorted array.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ * @example
+ *
+ * _.lastIndexOf([1, 2, 1, 2], 2);
+ * // => 3
+ *
+ * // using `fromIndex`
+ * _.lastIndexOf([1, 2, 1, 2], 2, 2);
+ * // => 1
+ *
+ * // performing a binary search
+ * _.lastIndexOf([1, 1, 2, 2], 2, true);
+ * // => 3
+ */
+ function lastIndexOf(array, value, fromIndex) {
+ var length = array ? array.length : 0;
+ if (!length) {
+ return -1;
+ }
+ var index = length;
+ if (typeof fromIndex == 'number') {
+ index = (fromIndex < 0 ? nativeMax(length + fromIndex, 0) : nativeMin(fromIndex || 0, length - 1)) +
1;
+ } else if (fromIndex) {
+ index = binaryIndex(array, value, true) - 1;
+ var other = array[index];
+ if (value === value ? (value === other) : (other !== other)) {
+ return index;
+ }
+ return -1;
+ }
+ if (value !== value) {
+ return indexOfNaN(array, index, true);
+ }
+ while (index--) {
+ if (array[index] === value) {
+ return index;
+ }
+ }
+ return -1;
+ }
+
+ /**
+ * Removes all provided values from `array` using `SameValueZero` for equality
+ * comparisons.
+ *
+ * **Notes:**
+ * - Unlike `_.without`, this method mutates `array`
+ * - [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+ * comparisons are like strict equality comparisons, e.g. `===`, except
+ * that `NaN` matches `NaN`
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to modify.
+ * @param {...*} [values] The values to remove.
+ * @returns {Array} Returns `array`.
+ * @example
+ *
+ * var array = [1, 2, 3, 1, 2, 3];
+ *
+ * _.pull(array, 2, 3);
+ * console.log(array);
+ * // => [1, 1]
+ */
+ function pull() {
+ var args = arguments,
+ array = args[0];
+
+ if (!(array && array.length)) {
+ return array;
+ }
+ var index = 0,
+ indexOf = getIndexOf(),
+ length = args.length;
+
+ while (++index < length) {
+ var fromIndex = 0,
+ value = args[index];
+
+ while ((fromIndex = indexOf(array, value, fromIndex)) > -1) {
+ splice.call(array, fromIndex, 1);
+ }
+ }
+ return array;
+ }
+
+ /**
+ * Removes elements from `array` corresponding to the given indexes and returns
+ * an array of the removed elements. Indexes may be specified as an array of
+ * indexes or as individual arguments.
+ *
+ * **Note:** Unlike `_.at`, this method mutates `array`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to modify.
+ * @param {...(number|number[])} [indexes] The indexes of elements to remove,
+ * specified as individual indexes or arrays of indexes.
+ * @returns {Array} Returns the new array of removed elements.
+ * @example
+ *
+ * var array = [5, 10, 15, 20];
+ * var evens = _.pullAt(array, 1, 3);
+ *
+ * console.log(array);
+ * // => [5, 15]
+ *
+ * console.log(evens);
+ * // => [10, 20]
+ */
+ var pullAt = restParam(function(array, indexes) {
+ array || (array = []);
+ indexes = baseFlatten(indexes);
+
+ var result = baseAt(array, indexes);
+ basePullAt(array, indexes.sort(baseCompareAscending));
+ return result;
});
- return obj;
- };
- // Return a copy of the object only containing the whitelisted properties.
- _.pick = function(obj) {
- var copy = {};
- var keys = concat.apply(ArrayProto, slice.call(arguments, 1));
- each(keys, function(key) {
- if (key in obj) copy[key] = obj[key];
+ /**
+ * Removes all elements from `array` that `predicate` returns truthy for
+ * and returns an array of the removed elements. The predicate is bound to
+ * `thisArg` and invoked with three arguments: (value, index, array).
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * **Note:** Unlike `_.filter`, this method mutates `array`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to modify.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {Array} Returns the new array of removed elements.
+ * @example
+ *
+ * var array = [1, 2, 3, 4];
+ * var evens = _.remove(array, function(n) {
+ * return n % 2 == 0;
+ * });
+ *
+ * console.log(array);
+ * // => [1, 3]
+ *
+ * console.log(evens);
+ * // => [2, 4]
+ */
+ function remove(array, predicate, thisArg) {
+ var result = [];
+ if (!(array && array.length)) {
+ return result;
+ }
+ var index = -1,
+ indexes = [],
+ length = array.length;
+
+ predicate = getCallback(predicate, thisArg, 3);
+ while (++index < length) {
+ var value = array[index];
+ if (predicate(value, index, array)) {
+ result.push(value);
+ indexes.push(index);
+ }
+ }
+ basePullAt(array, indexes);
+ return result;
+ }
+
+ /**
+ * Gets all but the first element of `array`.
+ *
+ * @static
+ * @memberOf _
+ * @alias tail
+ * @category Array
+ * @param {Array} array The array to query.
+ * @returns {Array} Returns the slice of `array`.
+ * @example
+ *
+ * _.rest([1, 2, 3]);
+ * // => [2, 3]
+ */
+ function rest(array) {
+ return drop(array, 1);
+ }
+
+ /**
+ * Creates a slice of `array` from `start` up to, but not including, `end`.
+ *
+ * **Note:** This method is used instead of `Array#slice` to support node
+ * lists in IE < 9 and to ensure dense arrays are returned.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to slice.
+ * @param {number} [start=0] The start position.
+ * @param {number} [end=array.length] The end position.
+ * @returns {Array} Returns the slice of `array`.
+ */
+ function slice(array, start, end) {
+ var length = array ? array.length : 0;
+ if (!length) {
+ return [];
+ }
+ if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {
+ start = 0;
+ end = length;
+ }
+ return baseSlice(array, start, end);
+ }
+
+ /**
+ * Uses a binary search to determine the lowest index at which `value` should
+ * be inserted into `array` in order to maintain its sort order. If an iteratee
+ * function is provided it is invoked for `value` and each element of `array`
+ * to compute their sort ranking. The iteratee is bound to `thisArg` and
+ * invoked with one argument; (value).
+ *
+ * If a property name is provided for `iteratee` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `iteratee` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The sorted array to inspect.
+ * @param {*} value The value to evaluate.
+ * @param {Function|Object|string} [iteratee=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {number} Returns the index at which `value` should be inserted
+ * into `array`.
+ * @example
+ *
+ * _.sortedIndex([30, 50], 40);
+ * // => 1
+ *
+ * _.sortedIndex([4, 4, 5, 5], 5);
+ * // => 2
+ *
+ * var dict = { 'data': { 'thirty': 30, 'forty': 40, 'fifty': 50 } };
+ *
+ * // using an iteratee function
+ * _.sortedIndex(['thirty', 'fifty'], 'forty', function(word) {
+ * return this.data[word];
+ * }, dict);
+ * // => 1
+ *
+ * // using the `_.property` callback shorthand
+ * _.sortedIndex([{ 'x': 30 }, { 'x': 50 }], { 'x': 40 }, 'x');
+ * // => 1
+ */
+ var sortedIndex = createSortedIndex();
+
+ /**
+ * This method is like `_.sortedIndex` except that it returns the highest
+ * index at which `value` should be inserted into `array` in order to
+ * maintain its sort order.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The sorted array to inspect.
+ * @param {*} value The value to evaluate.
+ * @param {Function|Object|string} [iteratee=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {number} Returns the index at which `value` should be inserted
+ * into `array`.
+ * @example
+ *
+ * _.sortedLastIndex([4, 4, 5, 5], 5);
+ * // => 4
+ */
+ var sortedLastIndex = createSortedIndex(true);
+
+ /**
+ * Creates a slice of `array` with `n` elements taken from the beginning.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to query.
+ * @param {number} [n=1] The number of elements to take.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Array} Returns the slice of `array`.
+ * @example
+ *
+ * _.take([1, 2, 3]);
+ * // => [1]
+ *
+ * _.take([1, 2, 3], 2);
+ * // => [1, 2]
+ *
+ * _.take([1, 2, 3], 5);
+ * // => [1, 2, 3]
+ *
+ * _.take([1, 2, 3], 0);
+ * // => []
+ */
+ function take(array, n, guard) {
+ var length = array ? array.length : 0;
+ if (!length) {
+ return [];
+ }
+ if (guard ? isIterateeCall(array, n, guard) : n == null) {
+ n = 1;
+ }
+ return baseSlice(array, 0, n < 0 ? 0 : n);
+ }
+
+ /**
+ * Creates a slice of `array` with `n` elements taken from the end.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to query.
+ * @param {number} [n=1] The number of elements to take.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Array} Returns the slice of `array`.
+ * @example
+ *
+ * _.takeRight([1, 2, 3]);
+ * // => [3]
+ *
+ * _.takeRight([1, 2, 3], 2);
+ * // => [2, 3]
+ *
+ * _.takeRight([1, 2, 3], 5);
+ * // => [1, 2, 3]
+ *
+ * _.takeRight([1, 2, 3], 0);
+ * // => []
+ */
+ function takeRight(array, n, guard) {
+ var length = array ? array.length : 0;
+ if (!length) {
+ return [];
+ }
+ if (guard ? isIterateeCall(array, n, guard) : n == null) {
+ n = 1;
+ }
+ n = length - (+n || 0);
+ return baseSlice(array, n < 0 ? 0 : n);
+ }
+
+ /**
+ * Creates a slice of `array` with elements taken from the end. Elements are
+ * taken until `predicate` returns falsey. The predicate is bound to `thisArg`
+ * and invoked with three arguments: (value, index, array).
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to query.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {Array} Returns the slice of `array`.
+ * @example
+ *
+ * _.takeRightWhile([1, 2, 3], function(n) {
+ * return n > 1;
+ * });
+ * // => [2, 3]
+ *
+ * var users = [
+ * { 'user': 'barney', 'active': true },
+ * { 'user': 'fred', 'active': false },
+ * { 'user': 'pebbles', 'active': false }
+ * ];
+ *
+ * // using the `_.matches` callback shorthand
+ * _.pluck(_.takeRightWhile(users, { 'user': 'pebbles', 'active': false }), 'user');
+ * // => ['pebbles']
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.pluck(_.takeRightWhile(users, 'active', false), 'user');
+ * // => ['fred', 'pebbles']
+ *
+ * // using the `_.property` callback shorthand
+ * _.pluck(_.takeRightWhile(users, 'active'), 'user');
+ * // => []
+ */
+ function takeRightWhile(array, predicate, thisArg) {
+ return (array && array.length)
+ ? baseWhile(array, getCallback(predicate, thisArg, 3), false, true)
+ : [];
+ }
+
+ /**
+ * Creates a slice of `array` with elements taken from the beginning. Elements
+ * are taken until `predicate` returns falsey. The predicate is bound to
+ * `thisArg` and invoked with three arguments: (value, index, array).
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to query.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {Array} Returns the slice of `array`.
+ * @example
+ *
+ * _.takeWhile([1, 2, 3], function(n) {
+ * return n < 3;
+ * });
+ * // => [1, 2]
+ *
+ * var users = [
+ * { 'user': 'barney', 'active': false },
+ * { 'user': 'fred', 'active': false},
+ * { 'user': 'pebbles', 'active': true }
+ * ];
+ *
+ * // using the `_.matches` callback shorthand
+ * _.pluck(_.takeWhile(users, { 'user': 'barney', 'active': false }), 'user');
+ * // => ['barney']
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.pluck(_.takeWhile(users, 'active', false), 'user');
+ * // => ['barney', 'fred']
+ *
+ * // using the `_.property` callback shorthand
+ * _.pluck(_.takeWhile(users, 'active'), 'user');
+ * // => []
+ */
+ function takeWhile(array, predicate, thisArg) {
+ return (array && array.length)
+ ? baseWhile(array, getCallback(predicate, thisArg, 3))
+ : [];
+ }
+
+ /**
+ * Creates an array of unique values, in order, of the provided arrays using
+ * `SameValueZero` for equality comparisons.
+ *
+ * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+ * comparisons are like strict equality comparisons, e.g. `===`, except that
+ * `NaN` matches `NaN`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {...Array} [arrays] The arrays to inspect.
+ * @returns {Array} Returns the new array of combined values.
+ * @example
+ *
+ * _.union([1, 2], [4, 2], [2, 1]);
+ * // => [1, 2, 4]
+ */
+ var union = restParam(function(arrays) {
+ return baseUniq(baseFlatten(arrays, false, true));
});
- return copy;
- };
- // Return a copy of the object without the blacklisted properties.
- _.omit = function(obj) {
- var copy = {};
- var keys = concat.apply(ArrayProto, slice.call(arguments, 1));
- for (var key in obj) {
- if (!_.contains(keys, key)) copy[key] = obj[key];
+ /**
+ * Creates a duplicate-free version of an array, using `SameValueZero` for
+ * equality comparisons, in which only the first occurence of each element
+ * is kept. Providing `true` for `isSorted` performs a faster search algorithm
+ * for sorted arrays. If an iteratee function is provided it is invoked for
+ * each element in the array to generate the criterion by which uniqueness
+ * is computed. The `iteratee` is bound to `thisArg` and invoked with three
+ * arguments: (value, index, array).
+ *
+ * If a property name is provided for `iteratee` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `iteratee` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+ * comparisons are like strict equality comparisons, e.g. `===`, except that
+ * `NaN` matches `NaN`.
+ *
+ * @static
+ * @memberOf _
+ * @alias unique
+ * @category Array
+ * @param {Array} array The array to inspect.
+ * @param {boolean} [isSorted] Specify the array is sorted.
+ * @param {Function|Object|string} [iteratee] The function invoked per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Array} Returns the new duplicate-value-free array.
+ * @example
+ *
+ * _.uniq([2, 1, 2]);
+ * // => [2, 1]
+ *
+ * // using `isSorted`
+ * _.uniq([1, 1, 2], true);
+ * // => [1, 2]
+ *
+ * // using an iteratee function
+ * _.uniq([1, 2.5, 1.5, 2], function(n) {
+ * return this.floor(n);
+ * }, Math);
+ * // => [1, 2.5]
+ *
+ * // using the `_.property` callback shorthand
+ * _.uniq([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');
+ * // => [{ 'x': 1 }, { 'x': 2 }]
+ */
+ function uniq(array, isSorted, iteratee, thisArg) {
+ var length = array ? array.length : 0;
+ if (!length) {
+ return [];
+ }
+ if (isSorted != null && typeof isSorted != 'boolean') {
+ thisArg = iteratee;
+ iteratee = isIterateeCall(array, isSorted, thisArg) ? null : isSorted;
+ isSorted = false;
+ }
+ var func = getCallback();
+ if (!(func === baseCallback && iteratee == null)) {
+ iteratee = func(iteratee, thisArg, 3);
+ }
+ return (isSorted && getIndexOf() == baseIndexOf)
+ ? sortedUniq(array, iteratee)
+ : baseUniq(array, iteratee);
+ }
+
+ /**
+ * This method is like `_.zip` except that it accepts an array of grouped
+ * elements and creates an array regrouping the elements to their pre-`_.zip`
+ * configuration.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array of grouped elements to process.
+ * @returns {Array} Returns the new array of regrouped elements.
+ * @example
+ *
+ * var zipped = _.zip(['fred', 'barney'], [30, 40], [true, false]);
+ * // => [['fred', 30, true], ['barney', 40, false]]
+ *
+ * _.unzip(zipped);
+ * // => [['fred', 'barney'], [30, 40], [true, false]]
+ */
+ function unzip(array) {
+ var index = -1,
+ length = (array && array.length && arrayMax(arrayMap(array, getLength))) >>> 0,
+ result = Array(length);
+
+ while (++index < length) {
+ result[index] = arrayMap(array, baseProperty(index));
+ }
+ return result;
+ }
+
+ /**
+ * Creates an array excluding all provided values using `SameValueZero` for
+ * equality comparisons.
+ *
+ * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+ * comparisons are like strict equality comparisons, e.g. `===`, except that
+ * `NaN` matches `NaN`.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to filter.
+ * @param {...*} [values] The values to exclude.
+ * @returns {Array} Returns the new array of filtered values.
+ * @example
+ *
+ * _.without([1, 2, 1, 3], 1, 2);
+ * // => [3]
+ */
+ var without = restParam(function(array, values) {
+ return (isArray(array) || isArguments(array))
+ ? baseDifference(array, values)
+ : [];
+ });
+
+ /**
+ * Creates an array that is the [symmetric
difference](https://en.wikipedia.org/wiki/Symmetric_difference)
+ * of the provided arrays.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {...Array} [arrays] The arrays to inspect.
+ * @returns {Array} Returns the new array of values.
+ * @example
+ *
+ * _.xor([1, 2], [4, 2]);
+ * // => [1, 4]
+ */
+ function xor() {
+ var index = -1,
+ length = arguments.length;
+
+ while (++index < length) {
+ var array = arguments[index];
+ if (isArray(array) || isArguments(array)) {
+ var result = result
+ ? baseDifference(result, array).concat(baseDifference(array, result))
+ : array;
+ }
+ }
+ return result ? baseUniq(result) : [];
+ }
+
+ /**
+ * Creates an array of grouped elements, the first of which contains the first
+ * elements of the given arrays, the second of which contains the second elements
+ * of the given arrays, and so on.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {...Array} [arrays] The arrays to process.
+ * @returns {Array} Returns the new array of grouped elements.
+ * @example
+ *
+ * _.zip(['fred', 'barney'], [30, 40], [true, false]);
+ * // => [['fred', 30, true], ['barney', 40, false]]
+ */
+ var zip = restParam(unzip);
+
+ /**
+ * The inverse of `_.pairs`; this method returns an object composed from arrays
+ * of property names and values. Provide either a single two dimensional array,
+ * e.g. `[[key1, value1], [key2, value2]]` or two arrays, one of property names
+ * and one of corresponding values.
+ *
+ * @static
+ * @memberOf _
+ * @alias object
+ * @category Array
+ * @param {Array} props The property names.
+ * @param {Array} [values=[]] The property values.
+ * @returns {Object} Returns the new object.
+ * @example
+ *
+ * _.zipObject([['fred', 30], ['barney', 40]]);
+ * // => { 'fred': 30, 'barney': 40 }
+ *
+ * _.zipObject(['fred', 'barney'], [30, 40]);
+ * // => { 'fred': 30, 'barney': 40 }
+ */
+ function zipObject(props, values) {
+ var index = -1,
+ length = props ? props.length : 0,
+ result = {};
+
+ if (length && !values && !isArray(props[0])) {
+ values = [];
+ }
+ while (++index < length) {
+ var key = props[index];
+ if (values) {
+ result[key] = values[index];
+ } else if (key) {
+ result[key[0]] = key[1];
+ }
+ }
+ return result;
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Creates a `lodash` object that wraps `value` with explicit method
+ * chaining enabled.
+ *
+ * @static
+ * @memberOf _
+ * @category Chain
+ * @param {*} value The value to wrap.
+ * @returns {Object} Returns the new `lodash` wrapper instance.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36 },
+ * { 'user': 'fred', 'age': 40 },
+ * { 'user': 'pebbles', 'age': 1 }
+ * ];
+ *
+ * var youngest = _.chain(users)
+ * .sortBy('age')
+ * .map(function(chr) {
+ * return chr.user + ' is ' + chr.age;
+ * })
+ * .first()
+ * .value();
+ * // => 'pebbles is 1'
+ */
+ function chain(value) {
+ var result = lodash(value);
+ result.__chain__ = true;
+ return result;
+ }
+
+ /**
+ * This method invokes `interceptor` and returns `value`. The interceptor is
+ * bound to `thisArg` and invoked with one argument; (value). The purpose of
+ * this method is to "tap into" a method chain in order to perform operations
+ * on intermediate results within the chain.
+ *
+ * @static
+ * @memberOf _
+ * @category Chain
+ * @param {*} value The value to provide to `interceptor`.
+ * @param {Function} interceptor The function to invoke.
+ * @param {*} [thisArg] The `this` binding of `interceptor`.
+ * @returns {*} Returns `value`.
+ * @example
+ *
+ * _([1, 2, 3])
+ * .tap(function(array) {
+ * array.pop();
+ * })
+ * .reverse()
+ * .value();
+ * // => [2, 1]
+ */
+ function tap(value, interceptor, thisArg) {
+ interceptor.call(thisArg, value);
+ return value;
+ }
+
+ /**
+ * This method is like `_.tap` except that it returns the result of `interceptor`.
+ *
+ * @static
+ * @memberOf _
+ * @category Chain
+ * @param {*} value The value to provide to `interceptor`.
+ * @param {Function} interceptor The function to invoke.
+ * @param {*} [thisArg] The `this` binding of `interceptor`.
+ * @returns {*} Returns the result of `interceptor`.
+ * @example
+ *
+ * _(' abc ')
+ * .chain()
+ * .trim()
+ * .thru(function(value) {
+ * return [value];
+ * })
+ * .value();
+ * // => ['abc']
+ */
+ function thru(value, interceptor, thisArg) {
+ return interceptor.call(thisArg, value);
+ }
+
+ /**
+ * Enables explicit method chaining on the wrapper object.
+ *
+ * @name chain
+ * @memberOf _
+ * @category Chain
+ * @returns {Object} Returns the new `lodash` wrapper instance.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36 },
+ * { 'user': 'fred', 'age': 40 }
+ * ];
+ *
+ * // without explicit chaining
+ * _(users).first();
+ * // => { 'user': 'barney', 'age': 36 }
+ *
+ * // with explicit chaining
+ * _(users).chain()
+ * .first()
+ * .pick('user')
+ * .value();
+ * // => { 'user': 'barney' }
+ */
+ function wrapperChain() {
+ return chain(this);
+ }
+
+ /**
+ * Executes the chained sequence and returns the wrapped result.
+ *
+ * @name commit
+ * @memberOf _
+ * @category Chain
+ * @returns {Object} Returns the new `lodash` wrapper instance.
+ * @example
+ *
+ * var array = [1, 2];
+ * var wrapper = _(array).push(3);
+ *
+ * console.log(array);
+ * // => [1, 2]
+ *
+ * wrapper = wrapper.commit();
+ * console.log(array);
+ * // => [1, 2, 3]
+ *
+ * wrapper.last();
+ * // => 3
+ *
+ * console.log(array);
+ * // => [1, 2, 3]
+ */
+ function wrapperCommit() {
+ return new LodashWrapper(this.value(), this.__chain__);
+ }
+
+ /**
+ * Creates a clone of the chained sequence planting `value` as the wrapped value.
+ *
+ * @name plant
+ * @memberOf _
+ * @category Chain
+ * @returns {Object} Returns the new `lodash` wrapper instance.
+ * @example
+ *
+ * var array = [1, 2];
+ * var wrapper = _(array).map(function(value) {
+ * return Math.pow(value, 2);
+ * });
+ *
+ * var other = [3, 4];
+ * var otherWrapper = wrapper.plant(other);
+ *
+ * otherWrapper.value();
+ * // => [9, 16]
+ *
+ * wrapper.value();
+ * // => [1, 4]
+ */
+ function wrapperPlant(value) {
+ var result,
+ parent = this;
+
+ while (parent instanceof baseLodash) {
+ var clone = wrapperClone(parent);
+ if (result) {
+ previous.__wrapped__ = clone;
+ } else {
+ result = clone;
+ }
+ var previous = clone;
+ parent = parent.__wrapped__;
+ }
+ previous.__wrapped__ = value;
+ return result;
+ }
+
+ /**
+ * Reverses the wrapped array so the first element becomes the last, the
+ * second element becomes the second to last, and so on.
+ *
+ * **Note:** This method mutates the wrapped array.
+ *
+ * @name reverse
+ * @memberOf _
+ * @category Chain
+ * @returns {Object} Returns the new reversed `lodash` wrapper instance.
+ * @example
+ *
+ * var array = [1, 2, 3];
+ *
+ * _(array).reverse().value()
+ * // => [3, 2, 1]
+ *
+ * console.log(array);
+ * // => [3, 2, 1]
+ */
+ function wrapperReverse() {
+ var value = this.__wrapped__;
+ if (value instanceof LazyWrapper) {
+ if (this.__actions__.length) {
+ value = new LazyWrapper(this);
+ }
+ return new LodashWrapper(value.reverse(), this.__chain__);
+ }
+ return this.thru(function(value) {
+ return value.reverse();
+ });
+ }
+
+ /**
+ * Produces the result of coercing the unwrapped value to a string.
+ *
+ * @name toString
+ * @memberOf _
+ * @category Chain
+ * @returns {string} Returns the coerced string value.
+ * @example
+ *
+ * _([1, 2, 3]).toString();
+ * // => '1,2,3'
+ */
+ function wrapperToString() {
+ return (this.value() + '');
+ }
+
+ /**
+ * Executes the chained sequence to extract the unwrapped value.
+ *
+ * @name value
+ * @memberOf _
+ * @alias run, toJSON, valueOf
+ * @category Chain
+ * @returns {*} Returns the resolved unwrapped value.
+ * @example
+ *
+ * _([1, 2, 3]).value();
+ * // => [1, 2, 3]
+ */
+ function wrapperValue() {
+ return baseWrapperValue(this.__wrapped__, this.__actions__);
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Creates an array of elements corresponding to the given keys, or indexes,
+ * of `collection`. Keys may be specified as individual arguments or as arrays
+ * of keys.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {...(number|number[]|string|string[])} [props] The property names
+ * or indexes of elements to pick, specified individually or in arrays.
+ * @returns {Array} Returns the new array of picked elements.
+ * @example
+ *
+ * _.at(['a', 'b', 'c'], [0, 2]);
+ * // => ['a', 'c']
+ *
+ * _.at(['barney', 'fred', 'pebbles'], 0, 2);
+ * // => ['barney', 'pebbles']
+ */
+ var at = restParam(function(collection, props) {
+ var length = collection ? getLength(collection) : 0;
+ if (isLength(length)) {
+ collection = toIterable(collection);
+ }
+ return baseAt(collection, baseFlatten(props));
+ });
+
+ /**
+ * Creates an object composed of keys generated from the results of running
+ * each element of `collection` through `iteratee`. The corresponding value
+ * of each key is the number of times the key was returned by `iteratee`.
+ * The `iteratee` is bound to `thisArg` and invoked with three arguments:
+ * (value, index|key, collection).
+ *
+ * If a property name is provided for `iteratee` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `iteratee` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [iteratee=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Object} Returns the composed aggregate object.
+ * @example
+ *
+ * _.countBy([4.3, 6.1, 6.4], function(n) {
+ * return Math.floor(n);
+ * });
+ * // => { '4': 1, '6': 2 }
+ *
+ * _.countBy([4.3, 6.1, 6.4], function(n) {
+ * return this.floor(n);
+ * }, Math);
+ * // => { '4': 1, '6': 2 }
+ *
+ * _.countBy(['one', 'two', 'three'], 'length');
+ * // => { '3': 2, '5': 1 }
+ */
+ var countBy = createAggregator(function(result, value, key) {
+ hasOwnProperty.call(result, key) ? ++result[key] : (result[key] = 1);
+ });
+
+ /**
+ * Checks if `predicate` returns truthy for **all** elements of `collection`.
+ * The predicate is bound to `thisArg` and invoked with three arguments:
+ * (value, index|key, collection).
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias all
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {boolean} Returns `true` if all elements pass the predicate check,
+ * else `false`.
+ * @example
+ *
+ * _.every([true, 1, null, 'yes'], Boolean);
+ * // => false
+ *
+ * var users = [
+ * { 'user': 'barney', 'active': false },
+ * { 'user': 'fred', 'active': false }
+ * ];
+ *
+ * // using the `_.matches` callback shorthand
+ * _.every(users, { 'user': 'barney', 'active': false });
+ * // => false
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.every(users, 'active', false);
+ * // => true
+ *
+ * // using the `_.property` callback shorthand
+ * _.every(users, 'active');
+ * // => false
+ */
+ function every(collection, predicate, thisArg) {
+ var func = isArray(collection) ? arrayEvery : baseEvery;
+ if (thisArg && isIterateeCall(collection, predicate, thisArg)) {
+ predicate = null;
+ }
+ if (typeof predicate != 'function' || thisArg !== undefined) {
+ predicate = getCallback(predicate, thisArg, 3);
+ }
+ return func(collection, predicate);
+ }
+
+ /**
+ * Iterates over elements of `collection`, returning an array of all elements
+ * `predicate` returns truthy for. The predicate is bound to `thisArg` and
+ * invoked with three arguments: (value, index|key, collection).
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias select
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {Array} Returns the new filtered array.
+ * @example
+ *
+ * _.filter([4, 5, 6], function(n) {
+ * return n % 2 == 0;
+ * });
+ * // => [4, 6]
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36, 'active': true },
+ * { 'user': 'fred', 'age': 40, 'active': false }
+ * ];
+ *
+ * // using the `_.matches` callback shorthand
+ * _.pluck(_.filter(users, { 'age': 36, 'active': true }), 'user');
+ * // => ['barney']
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.pluck(_.filter(users, 'active', false), 'user');
+ * // => ['fred']
+ *
+ * // using the `_.property` callback shorthand
+ * _.pluck(_.filter(users, 'active'), 'user');
+ * // => ['barney']
+ */
+ function filter(collection, predicate, thisArg) {
+ var func = isArray(collection) ? arrayFilter : baseFilter;
+ predicate = getCallback(predicate, thisArg, 3);
+ return func(collection, predicate);
}
- return copy;
- };
- // Fill in a given object with default properties.
- _.defaults = function(obj) {
- each(slice.call(arguments, 1), function(source) {
- if (source) {
- for (var prop in source) {
- if (obj[prop] === void 0) obj[prop] = source[prop];
+ /**
+ * Iterates over elements of `collection`, returning the first element
+ * `predicate` returns truthy for. The predicate is bound to `thisArg` and
+ * invoked with three arguments: (value, index|key, collection).
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias detect
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to search.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {*} Returns the matched element, else `undefined`.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36, 'active': true },
+ * { 'user': 'fred', 'age': 40, 'active': false },
+ * { 'user': 'pebbles', 'age': 1, 'active': true }
+ * ];
+ *
+ * _.result(_.find(users, function(chr) {
+ * return chr.age < 40;
+ * }), 'user');
+ * // => 'barney'
+ *
+ * // using the `_.matches` callback shorthand
+ * _.result(_.find(users, { 'age': 1, 'active': true }), 'user');
+ * // => 'pebbles'
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.result(_.find(users, 'active', false), 'user');
+ * // => 'fred'
+ *
+ * // using the `_.property` callback shorthand
+ * _.result(_.find(users, 'active'), 'user');
+ * // => 'barney'
+ */
+ var find = createFind(baseEach);
+
+ /**
+ * This method is like `_.find` except that it iterates over elements of
+ * `collection` from right to left.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to search.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {*} Returns the matched element, else `undefined`.
+ * @example
+ *
+ * _.findLast([1, 2, 3, 4], function(n) {
+ * return n % 2 == 1;
+ * });
+ * // => 3
+ */
+ var findLast = createFind(baseEachRight, true);
+
+ /**
+ * Performs a deep comparison between each element in `collection` and the
+ * source object, returning the first element that has equivalent property
+ * values.
+ *
+ * **Note:** This method supports comparing arrays, booleans, `Date` objects,
+ * numbers, `Object` objects, regexes, and strings. Objects are compared by
+ * their own, not inherited, enumerable properties. For comparing a single
+ * own or inherited property value see `_.matchesProperty`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to search.
+ * @param {Object} source The object of property values to match.
+ * @returns {*} Returns the matched element, else `undefined`.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36, 'active': true },
+ * { 'user': 'fred', 'age': 40, 'active': false }
+ * ];
+ *
+ * _.result(_.findWhere(users, { 'age': 36, 'active': true }), 'user');
+ * // => 'barney'
+ *
+ * _.result(_.findWhere(users, { 'age': 40, 'active': false }), 'user');
+ * // => 'fred'
+ */
+ function findWhere(collection, source) {
+ return find(collection, baseMatches(source));
+ }
+
+ /**
+ * Iterates over elements of `collection` invoking `iteratee` for each element.
+ * The `iteratee` is bound to `thisArg` and invoked with three arguments:
+ * (value, index|key, collection). Iteratee functions may exit iteration early
+ * by explicitly returning `false`.
+ *
+ * **Note:** As with other "Collections" methods, objects with a "length" property
+ * are iterated like arrays. To avoid this behavior `_.forIn` or `_.forOwn`
+ * may be used for object iteration.
+ *
+ * @static
+ * @memberOf _
+ * @alias each
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Array|Object|string} Returns `collection`.
+ * @example
+ *
+ * _([1, 2]).forEach(function(n) {
+ * console.log(n);
+ * }).value();
+ * // => logs each value from left to right and returns the array
+ *
+ * _.forEach({ 'a': 1, 'b': 2 }, function(n, key) {
+ * console.log(n, key);
+ * });
+ * // => logs each value-key pair and returns the object (iteration order is not guaranteed)
+ */
+ var forEach = createForEach(arrayEach, baseEach);
+
+ /**
+ * This method is like `_.forEach` except that it iterates over elements of
+ * `collection` from right to left.
+ *
+ * @static
+ * @memberOf _
+ * @alias eachRight
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Array|Object|string} Returns `collection`.
+ * @example
+ *
+ * _([1, 2]).forEachRight(function(n) {
+ * console.log(n);
+ * }).value();
+ * // => logs each value from right to left and returns the array
+ */
+ var forEachRight = createForEach(arrayEachRight, baseEachRight);
+
+ /**
+ * Creates an object composed of keys generated from the results of running
+ * each element of `collection` through `iteratee`. The corresponding value
+ * of each key is an array of the elements responsible for generating the key.
+ * The `iteratee` is bound to `thisArg` and invoked with three arguments:
+ * (value, index|key, collection).
+ *
+ * If a property name is provided for `iteratee` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `iteratee` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [iteratee=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Object} Returns the composed aggregate object.
+ * @example
+ *
+ * _.groupBy([4.2, 6.1, 6.4], function(n) {
+ * return Math.floor(n);
+ * });
+ * // => { '4': [4.2], '6': [6.1, 6.4] }
+ *
+ * _.groupBy([4.2, 6.1, 6.4], function(n) {
+ * return this.floor(n);
+ * }, Math);
+ * // => { '4': [4.2], '6': [6.1, 6.4] }
+ *
+ * // using the `_.property` callback shorthand
+ * _.groupBy(['one', 'two', 'three'], 'length');
+ * // => { '3': ['one', 'two'], '5': ['three'] }
+ */
+ var groupBy = createAggregator(function(result, value, key) {
+ if (hasOwnProperty.call(result, key)) {
+ result[key].push(value);
+ } else {
+ result[key] = [value];
+ }
+ });
+
+ /**
+ * Checks if `value` is in `collection` using `SameValueZero` for equality
+ * comparisons. If `fromIndex` is negative, it is used as the offset from
+ * the end of `collection`.
+ *
+ * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+ * comparisons are like strict equality comparisons, e.g. `===`, except that
+ * `NaN` matches `NaN`.
+ *
+ * @static
+ * @memberOf _
+ * @alias contains, include
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to search.
+ * @param {*} target The value to search for.
+ * @param {number} [fromIndex=0] The index to search from.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.reduce`.
+ * @returns {boolean} Returns `true` if a matching element is found, else `false`.
+ * @example
+ *
+ * _.includes([1, 2, 3], 1);
+ * // => true
+ *
+ * _.includes([1, 2, 3], 1, 2);
+ * // => false
+ *
+ * _.includes({ 'user': 'fred', 'age': 40 }, 'fred');
+ * // => true
+ *
+ * _.includes('pebbles', 'eb');
+ * // => true
+ */
+ function includes(collection, target, fromIndex, guard) {
+ var length = collection ? getLength(collection) : 0;
+ if (!isLength(length)) {
+ collection = values(collection);
+ length = collection.length;
+ }
+ if (!length) {
+ return false;
+ }
+ if (typeof fromIndex != 'number' || (guard && isIterateeCall(target, fromIndex, guard))) {
+ fromIndex = 0;
+ } else {
+ fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : (fromIndex || 0);
+ }
+ return (typeof collection == 'string' || !isArray(collection) && isString(collection))
+ ? (fromIndex < length && collection.indexOf(target, fromIndex) > -1)
+ : (getIndexOf(collection, target, fromIndex) > -1);
+ }
+
+ /**
+ * Creates an object composed of keys generated from the results of running
+ * each element of `collection` through `iteratee`. The corresponding value
+ * of each key is the last element responsible for generating the key. The
+ * iteratee function is bound to `thisArg` and invoked with three arguments:
+ * (value, index|key, collection).
+ *
+ * If a property name is provided for `iteratee` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `iteratee` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [iteratee=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Object} Returns the composed aggregate object.
+ * @example
+ *
+ * var keyData = [
+ * { 'dir': 'left', 'code': 97 },
+ * { 'dir': 'right', 'code': 100 }
+ * ];
+ *
+ * _.indexBy(keyData, 'dir');
+ * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }
+ *
+ * _.indexBy(keyData, function(object) {
+ * return String.fromCharCode(object.code);
+ * });
+ * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
+ *
+ * _.indexBy(keyData, function(object) {
+ * return this.fromCharCode(object.code);
+ * }, String);
+ * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
+ */
+ var indexBy = createAggregator(function(result, value, key) {
+ result[key] = value;
+ });
+
+ /**
+ * Invokes the method at `path` on each element in `collection`, returning
+ * an array of the results of each invoked method. Any additional arguments
+ * are provided to each invoked method. If `methodName` is a function it is
+ * invoked for, and `this` bound to, each element in `collection`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Array|Function|string} path The path of the method to invoke or
+ * the function invoked per iteration.
+ * @param {...*} [args] The arguments to invoke the method with.
+ * @returns {Array} Returns the array of results.
+ * @example
+ *
+ * _.invoke([[5, 1, 7], [3, 2, 1]], 'sort');
+ * // => [[1, 5, 7], [1, 2, 3]]
+ *
+ * _.invoke([123, 456], String.prototype.split, '');
+ * // => [['1', '2', '3'], ['4', '5', '6']]
+ */
+ var invoke = restParam(function(collection, path, args) {
+ var index = -1,
+ isFunc = typeof path == 'function',
+ isProp = isKey(path),
+ length = getLength(collection),
+ result = isLength(length) ? Array(length) : [];
+
+ baseEach(collection, function(value) {
+ var func = isFunc ? path : (isProp && value != null && value[path]);
+ result[++index] = func ? func.apply(value, args) : invokePath(value, path, args);
+ });
+ return result;
+ });
+
+ /**
+ * Creates an array of values by running each element in `collection` through
+ * `iteratee`. The `iteratee` is bound to `thisArg` and invoked with three
+ * arguments: (value, index|key, collection).
+ *
+ * If a property name is provided for `iteratee` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `iteratee` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * Many lodash methods are guarded to work as interatees for methods like
+ * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.
+ *
+ * The guarded methods are:
+ * `ary`, `callback`, `chunk`, `clone`, `create`, `curry`, `curryRight`, `drop`,
+ * `dropRight`, `every`, `fill`, `flatten`, `invert`, `max`, `min`, `parseInt`,
+ * `slice`, `sortBy`, `take`, `takeRight`, `template`, `trim`, `trimLeft`,
+ * `trimRight`, `trunc`, `random`, `range`, `sample`, `some`, `uniq`, and `words`
+ *
+ * @static
+ * @memberOf _
+ * @alias collect
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [iteratee=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Array} Returns the new mapped array.
+ * @example
+ *
+ * function timesThree(n) {
+ * return n * 3;
+ * }
+ *
+ * _.map([1, 2], timesThree);
+ * // => [3, 6]
+ *
+ * _.map({ 'a': 1, 'b': 2 }, timesThree);
+ * // => [3, 6] (iteration order is not guaranteed)
+ *
+ * var users = [
+ * { 'user': 'barney' },
+ * { 'user': 'fred' }
+ * ];
+ *
+ * // using the `_.property` callback shorthand
+ * _.map(users, 'user');
+ * // => ['barney', 'fred']
+ */
+ function map(collection, iteratee, thisArg) {
+ var func = isArray(collection) ? arrayMap : baseMap;
+ iteratee = getCallback(iteratee, thisArg, 3);
+ return func(collection, iteratee);
+ }
+
+ /**
+ * Creates an array of elements split into two groups, the first of which
+ * contains elements `predicate` returns truthy for, while the second of which
+ * contains elements `predicate` returns falsey for. The predicate is bound
+ * to `thisArg` and invoked with three arguments: (value, index|key, collection).
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {Array} Returns the array of grouped elements.
+ * @example
+ *
+ * _.partition([1, 2, 3], function(n) {
+ * return n % 2;
+ * });
+ * // => [[1, 3], [2]]
+ *
+ * _.partition([1.2, 2.3, 3.4], function(n) {
+ * return this.floor(n) % 2;
+ * }, Math);
+ * // => [[1.2, 3.4], [2.3]]
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36, 'active': false },
+ * { 'user': 'fred', 'age': 40, 'active': true },
+ * { 'user': 'pebbles', 'age': 1, 'active': false }
+ * ];
+ *
+ * var mapper = function(array) {
+ * return _.pluck(array, 'user');
+ * };
+ *
+ * // using the `_.matches` callback shorthand
+ * _.map(_.partition(users, { 'age': 1, 'active': false }), mapper);
+ * // => [['pebbles'], ['barney', 'fred']]
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.map(_.partition(users, 'active', false), mapper);
+ * // => [['barney', 'pebbles'], ['fred']]
+ *
+ * // using the `_.property` callback shorthand
+ * _.map(_.partition(users, 'active'), mapper);
+ * // => [['fred'], ['barney', 'pebbles']]
+ */
+ var partition = createAggregator(function(result, value, key) {
+ result[key ? 0 : 1].push(value);
+ }, function() { return [[], []]; });
+
+ /**
+ * Gets the property value of `path` from all elements in `collection`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Array|string} path The path of the property to pluck.
+ * @returns {Array} Returns the property values.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36 },
+ * { 'user': 'fred', 'age': 40 }
+ * ];
+ *
+ * _.pluck(users, 'user');
+ * // => ['barney', 'fred']
+ *
+ * var userIndex = _.indexBy(users, 'user');
+ * _.pluck(userIndex, 'age');
+ * // => [36, 40] (iteration order is not guaranteed)
+ */
+ function pluck(collection, path) {
+ return map(collection, property(path));
+ }
+
+ /**
+ * Reduces `collection` to a value which is the accumulated result of running
+ * each element in `collection` through `iteratee`, where each successive
+ * invocation is supplied the return value of the previous. If `accumulator`
+ * is not provided the first element of `collection` is used as the initial
+ * value. The `iteratee` is bound to `thisArg` and invoked with four arguments:
+ * (accumulator, value, index|key, collection).
+ *
+ * Many lodash methods are guarded to work as interatees for methods like
+ * `_.reduce`, `_.reduceRight`, and `_.transform`.
+ *
+ * The guarded methods are:
+ * `assign`, `defaults`, `includes`, `merge`, `sortByAll`, and `sortByOrder`
+ *
+ * @static
+ * @memberOf _
+ * @alias foldl, inject
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+ * @param {*} [accumulator] The initial value.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {*} Returns the accumulated value.
+ * @example
+ *
+ * _.reduce([1, 2], function(total, n) {
+ * return total + n;
+ * });
+ * // => 3
+ *
+ * _.reduce({ 'a': 1, 'b': 2 }, function(result, n, key) {
+ * result[key] = n * 3;
+ * return result;
+ * }, {});
+ * // => { 'a': 3, 'b': 6 } (iteration order is not guaranteed)
+ */
+ var reduce = createReduce(arrayReduce, baseEach);
+
+ /**
+ * This method is like `_.reduce` except that it iterates over elements of
+ * `collection` from right to left.
+ *
+ * @static
+ * @memberOf _
+ * @alias foldr
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+ * @param {*} [accumulator] The initial value.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {*} Returns the accumulated value.
+ * @example
+ *
+ * var array = [[0, 1], [2, 3], [4, 5]];
+ *
+ * _.reduceRight(array, function(flattened, other) {
+ * return flattened.concat(other);
+ * }, []);
+ * // => [4, 5, 2, 3, 0, 1]
+ */
+ var reduceRight = createReduce(arrayReduceRight, baseEachRight);
+
+ /**
+ * The opposite of `_.filter`; this method returns the elements of `collection`
+ * that `predicate` does **not** return truthy for.
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {Array} Returns the new filtered array.
+ * @example
+ *
+ * _.reject([1, 2, 3, 4], function(n) {
+ * return n % 2 == 0;
+ * });
+ * // => [1, 3]
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36, 'active': false },
+ * { 'user': 'fred', 'age': 40, 'active': true }
+ * ];
+ *
+ * // using the `_.matches` callback shorthand
+ * _.pluck(_.reject(users, { 'age': 40, 'active': true }), 'user');
+ * // => ['barney']
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.pluck(_.reject(users, 'active', false), 'user');
+ * // => ['fred']
+ *
+ * // using the `_.property` callback shorthand
+ * _.pluck(_.reject(users, 'active'), 'user');
+ * // => ['barney']
+ */
+ function reject(collection, predicate, thisArg) {
+ var func = isArray(collection) ? arrayFilter : baseFilter;
+ predicate = getCallback(predicate, thisArg, 3);
+ return func(collection, function(value, index, collection) {
+ return !predicate(value, index, collection);
+ });
+ }
+
+ /**
+ * Gets a random element or `n` random elements from a collection.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to sample.
+ * @param {number} [n] The number of elements to sample.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {*} Returns the random sample(s).
+ * @example
+ *
+ * _.sample([1, 2, 3, 4]);
+ * // => 2
+ *
+ * _.sample([1, 2, 3, 4], 2);
+ * // => [3, 1]
+ */
+ function sample(collection, n, guard) {
+ if (guard ? isIterateeCall(collection, n, guard) : n == null) {
+ collection = toIterable(collection);
+ var length = collection.length;
+ return length > 0 ? collection[baseRandom(0, length - 1)] : undefined;
+ }
+ var result = shuffle(collection);
+ result.length = nativeMin(n < 0 ? 0 : (+n || 0), result.length);
+ return result;
+ }
+
+ /**
+ * Creates an array of shuffled values, using a version of the
+ * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to shuffle.
+ * @returns {Array} Returns the new shuffled array.
+ * @example
+ *
+ * _.shuffle([1, 2, 3, 4]);
+ * // => [4, 1, 3, 2]
+ */
+ function shuffle(collection) {
+ collection = toIterable(collection);
+
+ var index = -1,
+ length = collection.length,
+ result = Array(length);
+
+ while (++index < length) {
+ var rand = baseRandom(0, index);
+ if (index != rand) {
+ result[index] = result[rand];
}
+ result[rand] = collection[index];
+ }
+ return result;
+ }
+
+ /**
+ * Gets the size of `collection` by returning its length for array-like
+ * values or the number of own enumerable properties for objects.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to inspect.
+ * @returns {number} Returns the size of `collection`.
+ * @example
+ *
+ * _.size([1, 2, 3]);
+ * // => 3
+ *
+ * _.size({ 'a': 1, 'b': 2 });
+ * // => 2
+ *
+ * _.size('pebbles');
+ * // => 7
+ */
+ function size(collection) {
+ var length = collection ? getLength(collection) : 0;
+ return isLength(length) ? length : keys(collection).length;
+ }
+
+ /**
+ * Checks if `predicate` returns truthy for **any** element of `collection`.
+ * The function returns as soon as it finds a passing value and does not iterate
+ * over the entire collection. The predicate is bound to `thisArg` and invoked
+ * with three arguments: (value, index|key, collection).
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias any
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {boolean} Returns `true` if any element passes the predicate check,
+ * else `false`.
+ * @example
+ *
+ * _.some([null, 0, 'yes', false], Boolean);
+ * // => true
+ *
+ * var users = [
+ * { 'user': 'barney', 'active': true },
+ * { 'user': 'fred', 'active': false }
+ * ];
+ *
+ * // using the `_.matches` callback shorthand
+ * _.some(users, { 'user': 'barney', 'active': false });
+ * // => false
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.some(users, 'active', false);
+ * // => true
+ *
+ * // using the `_.property` callback shorthand
+ * _.some(users, 'active');
+ * // => true
+ */
+ function some(collection, predicate, thisArg) {
+ var func = isArray(collection) ? arraySome : baseSome;
+ if (thisArg && isIterateeCall(collection, predicate, thisArg)) {
+ predicate = null;
+ }
+ if (typeof predicate != 'function' || thisArg !== undefined) {
+ predicate = getCallback(predicate, thisArg, 3);
}
+ return func(collection, predicate);
+ }
+
+ /**
+ * Creates an array of elements, sorted in ascending order by the results of
+ * running each element in a collection through `iteratee`. This method performs
+ * a stable sort, that is, it preserves the original sort order of equal elements.
+ * The `iteratee` is bound to `thisArg` and invoked with three arguments:
+ * (value, index|key, collection).
+ *
+ * If a property name is provided for `iteratee` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `iteratee` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [iteratee=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Array} Returns the new sorted array.
+ * @example
+ *
+ * _.sortBy([1, 2, 3], function(n) {
+ * return Math.sin(n);
+ * });
+ * // => [3, 1, 2]
+ *
+ * _.sortBy([1, 2, 3], function(n) {
+ * return this.sin(n);
+ * }, Math);
+ * // => [3, 1, 2]
+ *
+ * var users = [
+ * { 'user': 'fred' },
+ * { 'user': 'pebbles' },
+ * { 'user': 'barney' }
+ * ];
+ *
+ * // using the `_.property` callback shorthand
+ * _.pluck(_.sortBy(users, 'user'), 'user');
+ * // => ['barney', 'fred', 'pebbles']
+ */
+ function sortBy(collection, iteratee, thisArg) {
+ if (collection == null) {
+ return [];
+ }
+ if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {
+ iteratee = null;
+ }
+ var index = -1;
+ iteratee = getCallback(iteratee, thisArg, 3);
+
+ var result = baseMap(collection, function(value, key, collection) {
+ return { 'criteria': iteratee(value, key, collection), 'index': ++index, 'value': value };
+ });
+ return baseSortBy(result, compareAscending);
+ }
+
+ /**
+ * This method is like `_.sortBy` except that it can sort by multiple iteratees
+ * or property names.
+ *
+ * If a property name is provided for an iteratee the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If an object is provided for an iteratee the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {...(Function|Function[]|Object|Object[]|string|string[])} iteratees
+ * The iteratees to sort by, specified as individual values or arrays of values.
+ * @returns {Array} Returns the new sorted array.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'fred', 'age': 48 },
+ * { 'user': 'barney', 'age': 36 },
+ * { 'user': 'fred', 'age': 42 },
+ * { 'user': 'barney', 'age': 34 }
+ * ];
+ *
+ * _.map(_.sortByAll(users, ['user', 'age']), _.values);
+ * // => [['barney', 34], ['barney', 36], ['fred', 42], ['fred', 48]]
+ *
+ * _.map(_.sortByAll(users, 'user', function(chr) {
+ * return Math.floor(chr.age / 10);
+ * }), _.values);
+ * // => [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 42]]
+ */
+ var sortByAll = restParam(function(collection, iteratees) {
+ if (collection == null) {
+ return [];
+ }
+ var guard = iteratees[2];
+ if (guard && isIterateeCall(iteratees[0], iteratees[1], guard)) {
+ iteratees.length = 1;
+ }
+ return baseSortByOrder(collection, baseFlatten(iteratees), []);
});
- return obj;
- };
- // Create a (shallow-cloned) duplicate of an object.
- _.clone = function(obj) {
- if (!_.isObject(obj)) return obj;
- return _.isArray(obj) ? obj.slice() : _.extend({}, obj);
- };
+ /**
+ * This method is like `_.sortByAll` except that it allows specifying the
+ * sort orders of the iteratees to sort by. A truthy value in `orders` will
+ * sort the corresponding property name in ascending order while a falsey
+ * value will sort it in descending order.
+ *
+ * If a property name is provided for an iteratee the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If an object is provided for an iteratee the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
+ * @param {boolean[]} orders The sort orders of `iteratees`.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.reduce`.
+ * @returns {Array} Returns the new sorted array.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'fred', 'age': 48 },
+ * { 'user': 'barney', 'age': 34 },
+ * { 'user': 'fred', 'age': 42 },
+ * { 'user': 'barney', 'age': 36 }
+ * ];
+ *
+ * // sort by `user` in ascending order and by `age` in descending order
+ * _.map(_.sortByOrder(users, ['user', 'age'], [true, false]), _.values);
+ * // => [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 42]]
+ */
+ function sortByOrder(collection, iteratees, orders, guard) {
+ if (collection == null) {
+ return [];
+ }
+ if (guard && isIterateeCall(iteratees, orders, guard)) {
+ orders = null;
+ }
+ if (!isArray(iteratees)) {
+ iteratees = iteratees == null ? [] : [iteratees];
+ }
+ if (!isArray(orders)) {
+ orders = orders == null ? [] : [orders];
+ }
+ return baseSortByOrder(collection, iteratees, orders);
+ }
- // Invokes interceptor with the obj, and then returns obj.
- // The primary purpose of this method is to "tap into" a method chain, in
- // order to perform operations on intermediate results within the chain.
- _.tap = function(obj, interceptor) {
- interceptor(obj);
- return obj;
- };
+ /**
+ * Performs a deep comparison between each element in `collection` and the
+ * source object, returning an array of all elements that have equivalent
+ * property values.
+ *
+ * **Note:** This method supports comparing arrays, booleans, `Date` objects,
+ * numbers, `Object` objects, regexes, and strings. Objects are compared by
+ * their own, not inherited, enumerable properties. For comparing a single
+ * own or inherited property value see `_.matchesProperty`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collection
+ * @param {Array|Object|string} collection The collection to search.
+ * @param {Object} source The object of property values to match.
+ * @returns {Array} Returns the new filtered array.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36, 'active': false, 'pets': ['hoppy'] },
+ * { 'user': 'fred', 'age': 40, 'active': true, 'pets': ['baby puss', 'dino'] }
+ * ];
+ *
+ * _.pluck(_.where(users, { 'age': 36, 'active': false }), 'user');
+ * // => ['barney']
+ *
+ * _.pluck(_.where(users, { 'pets': ['dino'] }), 'user');
+ * // => ['fred']
+ */
+ function where(collection, source) {
+ return filter(collection, baseMatches(source));
+ }
- // Internal recursive comparison function for `isEqual`.
- var eq = function(a, b, aStack, bStack) {
- // Identical objects are equal. `0 === -0`, but they aren't identical.
- // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal).
- if (a === b) return a !== 0 || 1 / a == 1 / b;
- // A strict comparison is necessary because `null == undefined`.
- if (a == null || b == null) return a === b;
- // Unwrap any wrapped objects.
- if (a instanceof _) a = a._wrapped;
- if (b instanceof _) b = b._wrapped;
- // Compare `[[Class]]` names.
- var className = toString.call(a);
- if (className != toString.call(b)) return false;
- switch (className) {
- // Strings, numbers, dates, and booleans are compared by value.
- case '[object String]':
- // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is
- // equivalent to `new String("5")`.
- return a == String(b);
- case '[object Number]':
- // `NaN`s are equivalent, but non-reflexive. An `egal` comparison is performed for
- // other numeric values.
- return a != +a ? b != +b : (a == 0 ? 1 / a == 1 / b : a == +b);
- case '[object Date]':
- case '[object Boolean]':
- // Coerce dates and booleans to numeric primitive values. Dates are compared by their
- // millisecond representations. Note that invalid dates with millisecond representations
- // of `NaN` are not equivalent.
- return +a == +b;
- // RegExps are compared by their source patterns and flags.
- case '[object RegExp]':
- return a.source == b.source &&
- a.global == b.global &&
- a.multiline == b.multiline &&
- a.ignoreCase == b.ignoreCase;
- }
- if (typeof a != 'object' || typeof b != 'object') return false;
- // Assume equality for cyclic structures. The algorithm for detecting cyclic
- // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.
- var length = aStack.length;
- while (length--) {
- // Linear search. Performance is inversely proportional to the number of
- // unique nested structures.
- if (aStack[length] == a) return bStack[length] == b;
- }
- // Objects with different constructors are not equivalent, but `Object`s
- // from different frames are.
- var aCtor = a.constructor, bCtor = b.constructor;
- if (aCtor !== bCtor && !(_.isFunction(aCtor) && (aCtor instanceof aCtor) &&
- _.isFunction(bCtor) && (bCtor instanceof bCtor))
- && ('constructor' in a && 'constructor' in b)) {
- return false;
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Gets the number of milliseconds that have elapsed since the Unix epoch
+ * (1 January 1970 00:00:00 UTC).
+ *
+ * @static
+ * @memberOf _
+ * @category Date
+ * @example
+ *
+ * _.defer(function(stamp) {
+ * console.log(_.now() - stamp);
+ * }, _.now());
+ * // => logs the number of milliseconds it took for the deferred function to be invoked
+ */
+ var now = nativeNow || function() {
+ return new Date().getTime();
+ };
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * The opposite of `_.before`; this method creates a function that invokes
+ * `func` once it is called `n` or more times.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {number} n The number of calls before `func` is invoked.
+ * @param {Function} func The function to restrict.
+ * @returns {Function} Returns the new restricted function.
+ * @example
+ *
+ * var saves = ['profile', 'settings'];
+ *
+ * var done = _.after(saves.length, function() {
+ * console.log('done saving!');
+ * });
+ *
+ * _.forEach(saves, function(type) {
+ * asyncSave({ 'type': type, 'complete': done });
+ * });
+ * // => logs 'done saving!' after the two async saves have completed
+ */
+ function after(n, func) {
+ if (typeof func != 'function') {
+ if (typeof n == 'function') {
+ var temp = n;
+ n = func;
+ func = temp;
+ } else {
+ throw new TypeError(FUNC_ERROR_TEXT);
+ }
+ }
+ n = nativeIsFinite(n = +n) ? n : 0;
+ return function() {
+ if (--n < 1) {
+ return func.apply(this, arguments);
+ }
+ };
}
- // Add the first object to the stack of traversed objects.
- aStack.push(a);
- bStack.push(b);
- var size = 0, result = true;
- // Recursively compare objects and arrays.
- if (className == '[object Array]') {
- // Compare array lengths to determine if a deep comparison is necessary.
- size = a.length;
- result = size == b.length;
- if (result) {
- // Deep compare the contents, ignoring non-numeric properties.
- while (size--) {
- if (!(result = eq(a[size], b[size], aStack, bStack))) break;
+
+ /**
+ * Creates a function that accepts up to `n` arguments ignoring any
+ * additional arguments.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to cap arguments for.
+ * @param {number} [n=func.length] The arity cap.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * _.map(['6', '8', '10'], _.ary(parseInt, 1));
+ * // => [6, 8, 10]
+ */
+ function ary(func, n, guard) {
+ if (guard && isIterateeCall(func, n, guard)) {
+ n = null;
+ }
+ n = (func && n == null) ? func.length : nativeMax(+n || 0, 0);
+ return createWrapper(func, ARY_FLAG, null, null, null, null, n);
+ }
+
+ /**
+ * Creates a function that invokes `func`, with the `this` binding and arguments
+ * of the created function, while it is called less than `n` times. Subsequent
+ * calls to the created function return the result of the last `func` invocation.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {number} n The number of calls at which `func` is no longer invoked.
+ * @param {Function} func The function to restrict.
+ * @returns {Function} Returns the new restricted function.
+ * @example
+ *
+ * jQuery('#add').on('click', _.before(5, addContactToList));
+ * // => allows adding up to 4 contacts to the list
+ */
+ function before(n, func) {
+ var result;
+ if (typeof func != 'function') {
+ if (typeof n == 'function') {
+ var temp = n;
+ n = func;
+ func = temp;
+ } else {
+ throw new TypeError(FUNC_ERROR_TEXT);
}
}
- } else {
- // Deep compare objects.
- for (var key in a) {
- if (_.has(a, key)) {
- // Count the expected number of properties.
- size++;
- // Deep compare each member.
- if (!(result = _.has(b, key) && eq(a[key], b[key], aStack, bStack))) break;
+ return function() {
+ if (--n > 0) {
+ result = func.apply(this, arguments);
+ }
+ if (n <= 1) {
+ func = null;
}
+ return result;
+ };
+ }
+
+ /**
+ * Creates a function that invokes `func` with the `this` binding of `thisArg`
+ * and prepends any additional `_.bind` arguments to those provided to the
+ * bound function.
+ *
+ * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,
+ * may be used as a placeholder for partially applied arguments.
+ *
+ * **Note:** Unlike native `Function#bind` this method does not set the "length"
+ * property of bound functions.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to bind.
+ * @param {*} thisArg The `this` binding of `func`.
+ * @param {...*} [partials] The arguments to be partially applied.
+ * @returns {Function} Returns the new bound function.
+ * @example
+ *
+ * var greet = function(greeting, punctuation) {
+ * return greeting + ' ' + this.user + punctuation;
+ * };
+ *
+ * var object = { 'user': 'fred' };
+ *
+ * var bound = _.bind(greet, object, 'hi');
+ * bound('!');
+ * // => 'hi fred!'
+ *
+ * // using placeholders
+ * var bound = _.bind(greet, object, _, '!');
+ * bound('hi');
+ * // => 'hi fred!'
+ */
+ var bind = restParam(function(func, thisArg, partials) {
+ var bitmask = BIND_FLAG;
+ if (partials.length) {
+ var holders = replaceHolders(partials, bind.placeholder);
+ bitmask |= PARTIAL_FLAG;
}
- // Ensure that both objects contain the same number of properties.
- if (result) {
- for (key in b) {
- if (_.has(b, key) && !(size--)) break;
+ return createWrapper(func, bitmask, thisArg, partials, holders);
+ });
+
+ /**
+ * Binds methods of an object to the object itself, overwriting the existing
+ * method. Method names may be specified as individual arguments or as arrays
+ * of method names. If no method names are provided all enumerable function
+ * properties, own and inherited, of `object` are bound.
+ *
+ * **Note:** This method does not set the "length" property of bound functions.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Object} object The object to bind and assign the bound methods to.
+ * @param {...(string|string[])} [methodNames] The object method names to bind,
+ * specified as individual method names or arrays of method names.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * var view = {
+ * 'label': 'docs',
+ * 'onClick': function() {
+ * console.log('clicked ' + this.label);
+ * }
+ * };
+ *
+ * _.bindAll(view);
+ * jQuery('#docs').on('click', view.onClick);
+ * // => logs 'clicked docs' when the element is clicked
+ */
+ var bindAll = restParam(function(object, methodNames) {
+ methodNames = methodNames.length ? baseFlatten(methodNames) : functions(object);
+
+ var index = -1,
+ length = methodNames.length;
+
+ while (++index < length) {
+ var key = methodNames[index];
+ object[key] = createWrapper(object[key], BIND_FLAG, object);
+ }
+ return object;
+ });
+
+ /**
+ * Creates a function that invokes the method at `object[key]` and prepends
+ * any additional `_.bindKey` arguments to those provided to the bound function.
+ *
+ * This method differs from `_.bind` by allowing bound functions to reference
+ * methods that may be redefined or don't yet exist.
+ * See [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)
+ * for more details.
+ *
+ * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic
+ * builds, may be used as a placeholder for partially applied arguments.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Object} object The object the method belongs to.
+ * @param {string} key The key of the method.
+ * @param {...*} [partials] The arguments to be partially applied.
+ * @returns {Function} Returns the new bound function.
+ * @example
+ *
+ * var object = {
+ * 'user': 'fred',
+ * 'greet': function(greeting, punctuation) {
+ * return greeting + ' ' + this.user + punctuation;
+ * }
+ * };
+ *
+ * var bound = _.bindKey(object, 'greet', 'hi');
+ * bound('!');
+ * // => 'hi fred!'
+ *
+ * object.greet = function(greeting, punctuation) {
+ * return greeting + 'ya ' + this.user + punctuation;
+ * };
+ *
+ * bound('!');
+ * // => 'hiya fred!'
+ *
+ * // using placeholders
+ * var bound = _.bindKey(object, 'greet', _, '!');
+ * bound('hi');
+ * // => 'hiya fred!'
+ */
+ var bindKey = restParam(function(object, key, partials) {
+ var bitmask = BIND_FLAG | BIND_KEY_FLAG;
+ if (partials.length) {
+ var holders = replaceHolders(partials, bindKey.placeholder);
+ bitmask |= PARTIAL_FLAG;
+ }
+ return createWrapper(key, bitmask, object, partials, holders);
+ });
+
+ /**
+ * Creates a function that accepts one or more arguments of `func` that when
+ * called either invokes `func` returning its result, if all `func` arguments
+ * have been provided, or returns a function that accepts one or more of the
+ * remaining `func` arguments, and so on. The arity of `func` may be specified
+ * if `func.length` is not sufficient.
+ *
+ * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,
+ * may be used as a placeholder for provided arguments.
+ *
+ * **Note:** This method does not set the "length" property of curried functions.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to curry.
+ * @param {number} [arity=func.length] The arity of `func`.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Function} Returns the new curried function.
+ * @example
+ *
+ * var abc = function(a, b, c) {
+ * return [a, b, c];
+ * };
+ *
+ * var curried = _.curry(abc);
+ *
+ * curried(1)(2)(3);
+ * // => [1, 2, 3]
+ *
+ * curried(1, 2)(3);
+ * // => [1, 2, 3]
+ *
+ * curried(1, 2, 3);
+ * // => [1, 2, 3]
+ *
+ * // using placeholders
+ * curried(1)(_, 3)(2);
+ * // => [1, 2, 3]
+ */
+ var curry = createCurry(CURRY_FLAG);
+
+ /**
+ * This method is like `_.curry` except that arguments are applied to `func`
+ * in the manner of `_.partialRight` instead of `_.partial`.
+ *
+ * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic
+ * builds, may be used as a placeholder for provided arguments.
+ *
+ * **Note:** This method does not set the "length" property of curried functions.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to curry.
+ * @param {number} [arity=func.length] The arity of `func`.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Function} Returns the new curried function.
+ * @example
+ *
+ * var abc = function(a, b, c) {
+ * return [a, b, c];
+ * };
+ *
+ * var curried = _.curryRight(abc);
+ *
+ * curried(3)(2)(1);
+ * // => [1, 2, 3]
+ *
+ * curried(2, 3)(1);
+ * // => [1, 2, 3]
+ *
+ * curried(1, 2, 3);
+ * // => [1, 2, 3]
+ *
+ * // using placeholders
+ * curried(3)(1, _)(2);
+ * // => [1, 2, 3]
+ */
+ var curryRight = createCurry(CURRY_RIGHT_FLAG);
+
+ /**
+ * Creates a function that delays invoking `func` until after `wait` milliseconds
+ * have elapsed since the last time it was invoked. The created function comes
+ * with a `cancel` method to cancel delayed invocations. Provide an options
+ * object to indicate that `func` should be invoked on the leading and/or
+ * trailing edge of the `wait` timeout. Subsequent calls to the debounced
+ * function return the result of the last `func` invocation.
+ *
+ * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked
+ * on the trailing edge of the timeout only if the the debounced function is
+ * invoked more than once during the `wait` timeout.
+ *
+ * See [David Corbacho's
article](http://drupalmotion.com/article/debounce-and-throttle-visual-explanation)
+ * for details over the differences between `_.debounce` and `_.throttle`.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to debounce.
+ * @param {number} [wait=0] The number of milliseconds to delay.
+ * @param {Object} [options] The options object.
+ * @param {boolean} [options.leading=false] Specify invoking on the leading
+ * edge of the timeout.
+ * @param {number} [options.maxWait] The maximum time `func` is allowed to be
+ * delayed before it is invoked.
+ * @param {boolean} [options.trailing=true] Specify invoking on the trailing
+ * edge of the timeout.
+ * @returns {Function} Returns the new debounced function.
+ * @example
+ *
+ * // avoid costly calculations while the window size is in flux
+ * jQuery(window).on('resize', _.debounce(calculateLayout, 150));
+ *
+ * // invoke `sendMail` when the click event is fired, debouncing subsequent calls
+ * jQuery('#postbox').on('click', _.debounce(sendMail, 300, {
+ * 'leading': true,
+ * 'trailing': false
+ * }));
+ *
+ * // ensure `batchLog` is invoked once after 1 second of debounced calls
+ * var source = new EventSource('/stream');
+ * jQuery(source).on('message', _.debounce(batchLog, 250, {
+ * 'maxWait': 1000
+ * }));
+ *
+ * // cancel a debounced call
+ * var todoChanges = _.debounce(batchLog, 1000);
+ * Object.observe(models.todo, todoChanges);
+ *
+ * Object.observe(models, function(changes) {
+ * if (_.find(changes, { 'user': 'todo', 'type': 'delete'})) {
+ * todoChanges.cancel();
+ * }
+ * }, ['delete']);
+ *
+ * // ...at some point `models.todo` is changed
+ * models.todo.completed = true;
+ *
+ * // ...before 1 second has passed `models.todo` is deleted
+ * // which cancels the debounced `todoChanges` call
+ * delete models.todo;
+ */
+ function debounce(func, wait, options) {
+ var args,
+ maxTimeoutId,
+ result,
+ stamp,
+ thisArg,
+ timeoutId,
+ trailingCall,
+ lastCalled = 0,
+ maxWait = false,
+ trailing = true;
+
+ if (typeof func != 'function') {
+ throw new TypeError(FUNC_ERROR_TEXT);
+ }
+ wait = wait < 0 ? 0 : (+wait || 0);
+ if (options === true) {
+ var leading = true;
+ trailing = false;
+ } else if (isObject(options)) {
+ leading = options.leading;
+ maxWait = 'maxWait' in options && nativeMax(+options.maxWait || 0, wait);
+ trailing = 'trailing' in options ? options.trailing : trailing;
+ }
+
+ function cancel() {
+ if (timeoutId) {
+ clearTimeout(timeoutId);
+ }
+ if (maxTimeoutId) {
+ clearTimeout(maxTimeoutId);
+ }
+ maxTimeoutId = timeoutId = trailingCall = undefined;
+ }
+
+ function delayed() {
+ var remaining = wait - (now() - stamp);
+ if (remaining <= 0 || remaining > wait) {
+ if (maxTimeoutId) {
+ clearTimeout(maxTimeoutId);
+ }
+ var isCalled = trailingCall;
+ maxTimeoutId = timeoutId = trailingCall = undefined;
+ if (isCalled) {
+ lastCalled = now();
+ result = func.apply(thisArg, args);
+ if (!timeoutId && !maxTimeoutId) {
+ args = thisArg = null;
+ }
+ }
+ } else {
+ timeoutId = setTimeout(delayed, remaining);
}
- result = !size;
}
+
+ function maxDelayed() {
+ if (timeoutId) {
+ clearTimeout(timeoutId);
+ }
+ maxTimeoutId = timeoutId = trailingCall = undefined;
+ if (trailing || (maxWait !== wait)) {
+ lastCalled = now();
+ result = func.apply(thisArg, args);
+ if (!timeoutId && !maxTimeoutId) {
+ args = thisArg = null;
+ }
+ }
+ }
+
+ function debounced() {
+ args = arguments;
+ stamp = now();
+ thisArg = this;
+ trailingCall = trailing && (timeoutId || !leading);
+
+ if (maxWait === false) {
+ var leadingCall = leading && !timeoutId;
+ } else {
+ if (!maxTimeoutId && !leading) {
+ lastCalled = stamp;
+ }
+ var remaining = maxWait - (stamp - lastCalled),
+ isCalled = remaining <= 0 || remaining > maxWait;
+
+ if (isCalled) {
+ if (maxTimeoutId) {
+ maxTimeoutId = clearTimeout(maxTimeoutId);
+ }
+ lastCalled = stamp;
+ result = func.apply(thisArg, args);
+ }
+ else if (!maxTimeoutId) {
+ maxTimeoutId = setTimeout(maxDelayed, remaining);
+ }
+ }
+ if (isCalled && timeoutId) {
+ timeoutId = clearTimeout(timeoutId);
+ }
+ else if (!timeoutId && wait !== maxWait) {
+ timeoutId = setTimeout(delayed, wait);
+ }
+ if (leadingCall) {
+ isCalled = true;
+ result = func.apply(thisArg, args);
+ }
+ if (isCalled && !timeoutId && !maxTimeoutId) {
+ args = thisArg = null;
+ }
+ return result;
+ }
+ debounced.cancel = cancel;
+ return debounced;
}
- // Remove the first object from the stack of traversed objects.
- aStack.pop();
- bStack.pop();
- return result;
- };
- // Perform a deep comparison to check if two objects are equal.
- _.isEqual = function(a, b) {
- return eq(a, b, [], []);
- };
+ /**
+ * Defers invoking the `func` until the current call stack has cleared. Any
+ * additional arguments are provided to `func` when it is invoked.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to defer.
+ * @param {...*} [args] The arguments to invoke the function with.
+ * @returns {number} Returns the timer id.
+ * @example
+ *
+ * _.defer(function(text) {
+ * console.log(text);
+ * }, 'deferred');
+ * // logs 'deferred' after one or more milliseconds
+ */
+ var defer = restParam(function(func, args) {
+ return baseDelay(func, 1, args);
+ });
- // Is a given array, string, or object empty?
- // An "empty" object has no enumerable own-properties.
- _.isEmpty = function(obj) {
- if (obj == null) return true;
- if (_.isArray(obj) || _.isString(obj)) return obj.length === 0;
- for (var key in obj) if (_.has(obj, key)) return false;
- return true;
- };
+ /**
+ * Invokes `func` after `wait` milliseconds. Any additional arguments are
+ * provided to `func` when it is invoked.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to delay.
+ * @param {number} wait The number of milliseconds to delay invocation.
+ * @param {...*} [args] The arguments to invoke the function with.
+ * @returns {number} Returns the timer id.
+ * @example
+ *
+ * _.delay(function(text) {
+ * console.log(text);
+ * }, 1000, 'later');
+ * // => logs 'later' after one second
+ */
+ var delay = restParam(function(func, wait, args) {
+ return baseDelay(func, wait, args);
+ });
- // Is a given value a DOM element?
- _.isElement = function(obj) {
- return !!(obj && obj.nodeType === 1);
- };
+ /**
+ * Creates a function that returns the result of invoking the provided
+ * functions with the `this` binding of the created function, where each
+ * successive invocation is supplied the return value of the previous.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {...Function} [funcs] Functions to invoke.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * function square(n) {
+ * return n * n;
+ * }
+ *
+ * var addSquare = _.flow(_.add, square);
+ * addSquare(1, 2);
+ * // => 9
+ */
+ var flow = createFlow();
- // Is a given value an array?
- // Delegates to ECMA5's native Array.isArray
- _.isArray = nativeIsArray || function(obj) {
- return toString.call(obj) == '[object Array]';
- };
+ /**
+ * This method is like `_.flow` except that it creates a function that
+ * invokes the provided functions from right to left.
+ *
+ * @static
+ * @memberOf _
+ * @alias backflow, compose
+ * @category Function
+ * @param {...Function} [funcs] Functions to invoke.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * function square(n) {
+ * return n * n;
+ * }
+ *
+ * var addSquare = _.flowRight(square, _.add);
+ * addSquare(1, 2);
+ * // => 9
+ */
+ var flowRight = createFlow(true);
- // Is a given variable an object?
- _.isObject = function(obj) {
- return obj === Object(obj);
- };
+ /**
+ * Creates a function that memoizes the result of `func`. If `resolver` is
+ * provided it determines the cache key for storing the result based on the
+ * arguments provided to the memoized function. By default, the first argument
+ * provided to the memoized function is coerced to a string and used as the
+ * cache key. The `func` is invoked with the `this` binding of the memoized
+ * function.
+ *
+ * **Note:** The cache is exposed as the `cache` property on the memoized
+ * function. Its creation may be customized by replacing the `_.memoize.Cache`
+ * constructor with one whose instances implement the
[`Map`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-properties-of-the-map-prototype-object)
+ * method interface of `get`, `has`, and `set`.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to have its output memoized.
+ * @param {Function} [resolver] The function to resolve the cache key.
+ * @returns {Function} Returns the new memoizing function.
+ * @example
+ *
+ * var upperCase = _.memoize(function(string) {
+ * return string.toUpperCase();
+ * });
+ *
+ * upperCase('fred');
+ * // => 'FRED'
+ *
+ * // modifying the result cache
+ * upperCase.cache.set('fred', 'BARNEY');
+ * upperCase('fred');
+ * // => 'BARNEY'
+ *
+ * // replacing `_.memoize.Cache`
+ * var object = { 'user': 'fred' };
+ * var other = { 'user': 'barney' };
+ * var identity = _.memoize(_.identity);
+ *
+ * identity(object);
+ * // => { 'user': 'fred' }
+ * identity(other);
+ * // => { 'user': 'fred' }
+ *
+ * _.memoize.Cache = WeakMap;
+ * var identity = _.memoize(_.identity);
+ *
+ * identity(object);
+ * // => { 'user': 'fred' }
+ * identity(other);
+ * // => { 'user': 'barney' }
+ */
+ function memoize(func, resolver) {
+ if (typeof func != 'function' || (resolver && typeof resolver != 'function')) {
+ throw new TypeError(FUNC_ERROR_TEXT);
+ }
+ var memoized = function() {
+ var args = arguments,
+ cache = memoized.cache,
+ key = resolver ? resolver.apply(this, args) : args[0];
+
+ if (cache.has(key)) {
+ return cache.get(key);
+ }
+ var result = func.apply(this, args);
+ cache.set(key, result);
+ return result;
+ };
+ memoized.cache = new memoize.Cache;
+ return memoized;
+ }
+
+ /**
+ * Creates a function that negates the result of the predicate `func`. The
+ * `func` predicate is invoked with the `this` binding and arguments of the
+ * created function.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} predicate The predicate to negate.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * function isEven(n) {
+ * return n % 2 == 0;
+ * }
+ *
+ * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));
+ * // => [1, 3, 5]
+ */
+ function negate(predicate) {
+ if (typeof predicate != 'function') {
+ throw new TypeError(FUNC_ERROR_TEXT);
+ }
+ return function() {
+ return !predicate.apply(this, arguments);
+ };
+ }
+
+ /**
+ * Creates a function that is restricted to invoking `func` once. Repeat calls
+ * to the function return the value of the first call. The `func` is invoked
+ * with the `this` binding and arguments of the created function.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to restrict.
+ * @returns {Function} Returns the new restricted function.
+ * @example
+ *
+ * var initialize = _.once(createApplication);
+ * initialize();
+ * initialize();
+ * // `initialize` invokes `createApplication` once
+ */
+ function once(func) {
+ return before(2, func);
+ }
+
+ /**
+ * Creates a function that invokes `func` with `partial` arguments prepended
+ * to those provided to the new function. This method is like `_.bind` except
+ * it does **not** alter the `this` binding.
+ *
+ * The `_.partial.placeholder` value, which defaults to `_` in monolithic
+ * builds, may be used as a placeholder for partially applied arguments.
+ *
+ * **Note:** This method does not set the "length" property of partially
+ * applied functions.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to partially apply arguments to.
+ * @param {...*} [partials] The arguments to be partially applied.
+ * @returns {Function} Returns the new partially applied function.
+ * @example
+ *
+ * var greet = function(greeting, name) {
+ * return greeting + ' ' + name;
+ * };
+ *
+ * var sayHelloTo = _.partial(greet, 'hello');
+ * sayHelloTo('fred');
+ * // => 'hello fred'
+ *
+ * // using placeholders
+ * var greetFred = _.partial(greet, _, 'fred');
+ * greetFred('hi');
+ * // => 'hi fred'
+ */
+ var partial = createPartial(PARTIAL_FLAG);
+
+ /**
+ * This method is like `_.partial` except that partially applied arguments
+ * are appended to those provided to the new function.
+ *
+ * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic
+ * builds, may be used as a placeholder for partially applied arguments.
+ *
+ * **Note:** This method does not set the "length" property of partially
+ * applied functions.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to partially apply arguments to.
+ * @param {...*} [partials] The arguments to be partially applied.
+ * @returns {Function} Returns the new partially applied function.
+ * @example
+ *
+ * var greet = function(greeting, name) {
+ * return greeting + ' ' + name;
+ * };
+ *
+ * var greetFred = _.partialRight(greet, 'fred');
+ * greetFred('hi');
+ * // => 'hi fred'
+ *
+ * // using placeholders
+ * var sayHelloTo = _.partialRight(greet, 'hello', _);
+ * sayHelloTo('fred');
+ * // => 'hello fred'
+ */
+ var partialRight = createPartial(PARTIAL_RIGHT_FLAG);
+
+ /**
+ * Creates a function that invokes `func` with arguments arranged according
+ * to the specified indexes where the argument value at the first index is
+ * provided as the first argument, the argument value at the second index is
+ * provided as the second argument, and so on.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to rearrange arguments for.
+ * @param {...(number|number[])} indexes The arranged argument indexes,
+ * specified as individual indexes or arrays of indexes.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var rearged = _.rearg(function(a, b, c) {
+ * return [a, b, c];
+ * }, 2, 0, 1);
+ *
+ * rearged('b', 'c', 'a')
+ * // => ['a', 'b', 'c']
+ *
+ * var map = _.rearg(_.map, [1, 0]);
+ * map(function(n) {
+ * return n * 3;
+ * }, [1, 2, 3]);
+ * // => [3, 6, 9]
+ */
+ var rearg = restParam(function(func, indexes) {
+ return createWrapper(func, REARG_FLAG, null, null, null, baseFlatten(indexes));
+ });
+
+ /**
+ * Creates a function that invokes `func` with the `this` binding of the
+ * created function and arguments from `start` and beyond provided as an array.
+ *
+ * **Note:** This method is based on the [rest
parameter](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions/rest_parameters).
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to apply a rest parameter to.
+ * @param {number} [start=func.length-1] The start position of the rest parameter.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var say = _.restParam(function(what, names) {
+ * return what + ' ' + _.initial(names).join(', ') +
+ * (_.size(names) > 1 ? ', & ' : '') + _.last(names);
+ * });
+ *
+ * say('hello', 'fred', 'barney', 'pebbles');
+ * // => 'hello fred, barney, & pebbles'
+ */
+ function restParam(func, start) {
+ if (typeof func != 'function') {
+ throw new TypeError(FUNC_ERROR_TEXT);
+ }
+ start = nativeMax(start === undefined ? (func.length - 1) : (+start || 0), 0);
+ return function() {
+ var args = arguments,
+ index = -1,
+ length = nativeMax(args.length - start, 0),
+ rest = Array(length);
+
+ while (++index < length) {
+ rest[index] = args[start + index];
+ }
+ switch (start) {
+ case 0: return func.call(this, rest);
+ case 1: return func.call(this, args[0], rest);
+ case 2: return func.call(this, args[0], args[1], rest);
+ }
+ var otherArgs = Array(start + 1);
+ index = -1;
+ while (++index < start) {
+ otherArgs[index] = args[index];
+ }
+ otherArgs[start] = rest;
+ return func.apply(this, otherArgs);
+ };
+ }
+
+ /**
+ * Creates a function that invokes `func` with the `this` binding of the created
+ * function and an array of arguments much like [`Function#apply`](https://es5.github.io/#x15.3.4.3).
+ *
+ * **Note:** This method is based on the [spread
operator](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Spread_operator).
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to spread arguments over.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var say = _.spread(function(who, what) {
+ * return who + ' says ' + what;
+ * });
+ *
+ * say(['fred', 'hello']);
+ * // => 'fred says hello'
+ *
+ * // with a Promise
+ * var numbers = Promise.all([
+ * Promise.resolve(40),
+ * Promise.resolve(36)
+ * ]);
+ *
+ * numbers.then(_.spread(function(x, y) {
+ * return x + y;
+ * }));
+ * // => a Promise of 76
+ */
+ function spread(func) {
+ if (typeof func != 'function') {
+ throw new TypeError(FUNC_ERROR_TEXT);
+ }
+ return function(array) {
+ return func.apply(this, array);
+ };
+ }
+
+ /**
+ * Creates a function that only invokes `func` at most once per every `wait`
+ * milliseconds. The created function comes with a `cancel` method to cancel
+ * delayed invocations. Provide an options object to indicate that `func`
+ * should be invoked on the leading and/or trailing edge of the `wait` timeout.
+ * Subsequent calls to the throttled function return the result of the last
+ * `func` call.
+ *
+ * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked
+ * on the trailing edge of the timeout only if the the throttled function is
+ * invoked more than once during the `wait` timeout.
+ *
+ * See [David Corbacho's
article](http://drupalmotion.com/article/debounce-and-throttle-visual-explanation)
+ * for details over the differences between `_.throttle` and `_.debounce`.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {Function} func The function to throttle.
+ * @param {number} [wait=0] The number of milliseconds to throttle invocations to.
+ * @param {Object} [options] The options object.
+ * @param {boolean} [options.leading=true] Specify invoking on the leading
+ * edge of the timeout.
+ * @param {boolean} [options.trailing=true] Specify invoking on the trailing
+ * edge of the timeout.
+ * @returns {Function} Returns the new throttled function.
+ * @example
+ *
+ * // avoid excessively updating the position while scrolling
+ * jQuery(window).on('scroll', _.throttle(updatePosition, 100));
+ *
+ * // invoke `renewToken` when the click event is fired, but not more than once every 5 minutes
+ * jQuery('.interactive').on('click', _.throttle(renewToken, 300000, {
+ * 'trailing': false
+ * }));
+ *
+ * // cancel a trailing throttled call
+ * jQuery(window).on('popstate', throttled.cancel);
+ */
+ function throttle(func, wait, options) {
+ var leading = true,
+ trailing = true;
+
+ if (typeof func != 'function') {
+ throw new TypeError(FUNC_ERROR_TEXT);
+ }
+ if (options === false) {
+ leading = false;
+ } else if (isObject(options)) {
+ leading = 'leading' in options ? !!options.leading : leading;
+ trailing = 'trailing' in options ? !!options.trailing : trailing;
+ }
+ debounceOptions.leading = leading;
+ debounceOptions.maxWait = +wait;
+ debounceOptions.trailing = trailing;
+ return debounce(func, wait, debounceOptions);
+ }
+
+ /**
+ * Creates a function that provides `value` to the wrapper function as its
+ * first argument. Any additional arguments provided to the function are
+ * appended to those provided to the wrapper function. The wrapper is invoked
+ * with the `this` binding of the created function.
+ *
+ * @static
+ * @memberOf _
+ * @category Function
+ * @param {*} value The value to wrap.
+ * @param {Function} wrapper The wrapper function.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var p = _.wrap(_.escape, function(func, text) {
+ * return '<p>' + func(text) + '</p>';
+ * });
+ *
+ * p('fred, barney, & pebbles');
+ * // => '<p>fred, barney, & pebbles</p>'
+ */
+ function wrap(value, wrapper) {
+ wrapper = wrapper == null ? identity : wrapper;
+ return createWrapper(wrapper, PARTIAL_FLAG, null, [value], []);
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Creates a clone of `value`. If `isDeep` is `true` nested objects are cloned,
+ * otherwise they are assigned by reference. If `customizer` is provided it is
+ * invoked to produce the cloned values. If `customizer` returns `undefined`
+ * cloning is handled by the method instead. The `customizer` is bound to
+ * `thisArg` and invoked with two argument; (value [, index|key, object]).
+ *
+ * **Note:** This method is loosely based on the
+ * [structured clone
algorithm](http://www.w3.org/TR/html5/infrastructure.html#internal-structured-cloning-algorithm).
+ * The enumerable properties of `arguments` objects and objects created by
+ * constructors other than `Object` are cloned to plain `Object` objects. An
+ * empty object is returned for uncloneable values such as functions, DOM nodes,
+ * Maps, Sets, and WeakMaps.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to clone.
+ * @param {boolean} [isDeep] Specify a deep clone.
+ * @param {Function} [customizer] The function to customize cloning values.
+ * @param {*} [thisArg] The `this` binding of `customizer`.
+ * @returns {*} Returns the cloned value.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney' },
+ * { 'user': 'fred' }
+ * ];
+ *
+ * var shallow = _.clone(users);
+ * shallow[0] === users[0];
+ * // => true
+ *
+ * var deep = _.clone(users, true);
+ * deep[0] === users[0];
+ * // => false
+ *
+ * // using a customizer callback
+ * var el = _.clone(document.body, function(value) {
+ * if (_.isElement(value)) {
+ * return value.cloneNode(false);
+ * }
+ * });
+ *
+ * el === document.body
+ * // => false
+ * el.nodeName
+ * // => BODY
+ * el.childNodes.length;
+ * // => 0
+ */
+ function clone(value, isDeep, customizer, thisArg) {
+ if (isDeep && typeof isDeep != 'boolean' && isIterateeCall(value, isDeep, customizer)) {
+ isDeep = false;
+ }
+ else if (typeof isDeep == 'function') {
+ thisArg = customizer;
+ customizer = isDeep;
+ isDeep = false;
+ }
+ customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 1);
+ return baseClone(value, isDeep, customizer);
+ }
+
+ /**
+ * Creates a deep clone of `value`. If `customizer` is provided it is invoked
+ * to produce the cloned values. If `customizer` returns `undefined` cloning
+ * is handled by the method instead. The `customizer` is bound to `thisArg`
+ * and invoked with two argument; (value [, index|key, object]).
+ *
+ * **Note:** This method is loosely based on the
+ * [structured clone
algorithm](http://www.w3.org/TR/html5/infrastructure.html#internal-structured-cloning-algorithm).
+ * The enumerable properties of `arguments` objects and objects created by
+ * constructors other than `Object` are cloned to plain `Object` objects. An
+ * empty object is returned for uncloneable values such as functions, DOM nodes,
+ * Maps, Sets, and WeakMaps.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to deep clone.
+ * @param {Function} [customizer] The function to customize cloning values.
+ * @param {*} [thisArg] The `this` binding of `customizer`.
+ * @returns {*} Returns the deep cloned value.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney' },
+ * { 'user': 'fred' }
+ * ];
+ *
+ * var deep = _.cloneDeep(users);
+ * deep[0] === users[0];
+ * // => false
+ *
+ * // using a customizer callback
+ * var el = _.cloneDeep(document.body, function(value) {
+ * if (_.isElement(value)) {
+ * return value.cloneNode(true);
+ * }
+ * });
+ *
+ * el === document.body
+ * // => false
+ * el.nodeName
+ * // => BODY
+ * el.childNodes.length;
+ * // => 20
+ */
+ function cloneDeep(value, customizer, thisArg) {
+ customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 1);
+ return baseClone(value, true, customizer);
+ }
+
+ /**
+ * Checks if `value` is classified as an `arguments` object.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ * @example
+ *
+ * _.isArguments(function() { return arguments; }());
+ * // => true
+ *
+ * _.isArguments([1, 2, 3]);
+ * // => false
+ */
+ function isArguments(value) {
+ var length = isObjectLike(value) ? value.length : undefined;
+ return isLength(length) && objToString.call(value) == argsTag;
+ }
- // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp.
- each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp'], function(name) {
- _['is' + name] = function(obj) {
- return toString.call(obj) == '[object ' + name + ']';
+ /**
+ * Checks if `value` is classified as an `Array` object.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ * @example
+ *
+ * _.isArray([1, 2, 3]);
+ * // => true
+ *
+ * _.isArray(function() { return arguments; }());
+ * // => false
+ */
+ var isArray = nativeIsArray || function(value) {
+ return isObjectLike(value) && isLength(value.length) && objToString.call(value) == arrayTag;
};
- });
- // Define a fallback version of the method in browsers (ahem, IE), where
- // there isn't any inspectable "Arguments" type.
- if (!_.isArguments(arguments)) {
- _.isArguments = function(obj) {
- return !!(obj && _.has(obj, 'callee'));
+ /**
+ * Checks if `value` is classified as a boolean primitive or object.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ * @example
+ *
+ * _.isBoolean(false);
+ * // => true
+ *
+ * _.isBoolean(null);
+ * // => false
+ */
+ function isBoolean(value) {
+ return value === true || value === false || (isObjectLike(value) && objToString.call(value) ==
boolTag);
+ }
+
+ /**
+ * Checks if `value` is classified as a `Date` object.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ * @example
+ *
+ * _.isDate(new Date);
+ * // => true
+ *
+ * _.isDate('Mon April 23 2012');
+ * // => false
+ */
+ function isDate(value) {
+ return isObjectLike(value) && objToString.call(value) == dateTag;
+ }
+
+ /**
+ * Checks if `value` is a DOM element.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.
+ * @example
+ *
+ * _.isElement(document.body);
+ * // => true
+ *
+ * _.isElement('<body>');
+ * // => false
+ */
+ function isElement(value) {
+ return !!value && value.nodeType === 1 && isObjectLike(value) &&
+ (objToString.call(value).indexOf('Element') > -1);
+ }
+ // Fallback for environments without DOM support.
+ if (!support.dom) {
+ isElement = function(value) {
+ return !!value && value.nodeType === 1 && isObjectLike(value) && !isPlainObject(value);
+ };
+ }
+
+ /**
+ * Checks if `value` is empty. A value is considered empty unless it is an
+ * `arguments` object, array, string, or jQuery-like collection with a length
+ * greater than `0` or an object with own enumerable properties.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {Array|Object|string} value The value to inspect.
+ * @returns {boolean} Returns `true` if `value` is empty, else `false`.
+ * @example
+ *
+ * _.isEmpty(null);
+ * // => true
+ *
+ * _.isEmpty(true);
+ * // => true
+ *
+ * _.isEmpty(1);
+ * // => true
+ *
+ * _.isEmpty([1, 2, 3]);
+ * // => false
+ *
+ * _.isEmpty({ 'a': 1 });
+ * // => false
+ */
+ function isEmpty(value) {
+ if (value == null) {
+ return true;
+ }
+ var length = getLength(value);
+ if (isLength(length) && (isArray(value) || isString(value) || isArguments(value) ||
+ (isObjectLike(value) && isFunction(value.splice)))) {
+ return !length;
+ }
+ return !keys(value).length;
+ }
+
+ /**
+ * Performs a deep comparison between two values to determine if they are
+ * equivalent. If `customizer` is provided it is invoked to compare values.
+ * If `customizer` returns `undefined` comparisons are handled by the method
+ * instead. The `customizer` is bound to `thisArg` and invoked with three
+ * arguments: (value, other [, index|key]).
+ *
+ * **Note:** This method supports comparing arrays, booleans, `Date` objects,
+ * numbers, `Object` objects, regexes, and strings. Objects are compared by
+ * their own, not inherited, enumerable properties. Functions and DOM nodes
+ * are **not** supported. Provide a customizer function to extend support
+ * for comparing other values.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to compare.
+ * @param {*} other The other value to compare.
+ * @param {Function} [customizer] The function to customize value comparisons.
+ * @param {*} [thisArg] The `this` binding of `customizer`.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ * @example
+ *
+ * var object = { 'user': 'fred' };
+ * var other = { 'user': 'fred' };
+ *
+ * object == other;
+ * // => false
+ *
+ * _.isEqual(object, other);
+ * // => true
+ *
+ * // using a customizer callback
+ * var array = ['hello', 'goodbye'];
+ * var other = ['hi', 'goodbye'];
+ *
+ * _.isEqual(array, other, function(value, other) {
+ * if (_.every([value, other], RegExp.prototype.test, /^h(?:i|ello)$/)) {
+ * return true;
+ * }
+ * });
+ * // => true
+ */
+ function isEqual(value, other, customizer, thisArg) {
+ customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 3);
+ if (!customizer && isStrictComparable(value) && isStrictComparable(other)) {
+ return value === other;
+ }
+ var result = customizer ? customizer(value, other) : undefined;
+ return result === undefined ? baseIsEqual(value, other, customizer) : !!result;
+ }
+
+ /**
+ * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,
+ * `SyntaxError`, `TypeError`, or `URIError` object.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an error object, else `false`.
+ * @example
+ *
+ * _.isError(new Error);
+ * // => true
+ *
+ * _.isError(Error);
+ * // => false
+ */
+ function isError(value) {
+ return isObjectLike(value) && typeof value.message == 'string' && objToString.call(value) == errorTag;
+ }
+
+ /**
+ * Checks if `value` is a finite primitive number.
+ *
+ * **Note:** This method is based on
[`Number.isFinite`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-number.isfinite).
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.
+ * @example
+ *
+ * _.isFinite(10);
+ * // => true
+ *
+ * _.isFinite('10');
+ * // => false
+ *
+ * _.isFinite(true);
+ * // => false
+ *
+ * _.isFinite(Object(10));
+ * // => false
+ *
+ * _.isFinite(Infinity);
+ * // => false
+ */
+ var isFinite = nativeNumIsFinite || function(value) {
+ return typeof value == 'number' && nativeIsFinite(value);
};
- }
- // Optimize `isFunction` if appropriate.
- if (typeof (/./) !== 'function') {
- _.isFunction = function(obj) {
- return typeof obj === 'function';
+ /**
+ * Checks if `value` is classified as a `Function` object.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ * @example
+ *
+ * _.isFunction(_);
+ * // => true
+ *
+ * _.isFunction(/abc/);
+ * // => false
+ */
+ var isFunction = !(baseIsFunction(/x/) || (Uint8Array && !baseIsFunction(Uint8Array))) ? baseIsFunction
: function(value) {
+ // The use of `Object#toString` avoids issues with the `typeof` operator
+ // in older versions of Chrome and Safari which return 'function' for regexes
+ // and Safari 8 equivalents which return 'object' for typed array constructors.
+ return objToString.call(value) == funcTag;
};
- }
- // Is a given object a finite number?
- _.isFinite = function(obj) {
- return isFinite(obj) && !isNaN(parseFloat(obj));
- };
+ /**
+ * Checks if `value` is the [language type](https://es5.github.io/#x8) of `Object`.
+ * (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an object, else `false`.
+ * @example
+ *
+ * _.isObject({});
+ * // => true
+ *
+ * _.isObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isObject(1);
+ * // => false
+ */
+ function isObject(value) {
+ // Avoid a V8 JIT bug in Chrome 19-20.
+ // See https://code.google.com/p/v8/issues/detail?id=2291 for more details.
+ var type = typeof value;
+ return type == 'function' || (!!value && type == 'object');
+ }
- // Is the given value `NaN`? (NaN is the only number which does not equal itself).
- _.isNaN = function(obj) {
- return _.isNumber(obj) && obj != +obj;
- };
+ /**
+ * Performs a deep comparison between `object` and `source` to determine if
+ * `object` contains equivalent property values. If `customizer` is provided
+ * it is invoked to compare values. If `customizer` returns `undefined`
+ * comparisons are handled by the method instead. The `customizer` is bound
+ * to `thisArg` and invoked with three arguments: (value, other, index|key).
+ *
+ * **Note:** This method supports comparing properties of arrays, booleans,
+ * `Date` objects, numbers, `Object` objects, regexes, and strings. Functions
+ * and DOM nodes are **not** supported. Provide a customizer function to extend
+ * support for comparing other values.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {Object} object The object to inspect.
+ * @param {Object} source The object of property values to match.
+ * @param {Function} [customizer] The function to customize value comparisons.
+ * @param {*} [thisArg] The `this` binding of `customizer`.
+ * @returns {boolean} Returns `true` if `object` is a match, else `false`.
+ * @example
+ *
+ * var object = { 'user': 'fred', 'age': 40 };
+ *
+ * _.isMatch(object, { 'age': 40 });
+ * // => true
+ *
+ * _.isMatch(object, { 'age': 36 });
+ * // => false
+ *
+ * // using a customizer callback
+ * var object = { 'greeting': 'hello' };
+ * var source = { 'greeting': 'hi' };
+ *
+ * _.isMatch(object, source, function(value, other) {
+ * return _.every([value, other], RegExp.prototype.test, /^h(?:i|ello)$/) || undefined;
+ * });
+ * // => true
+ */
+ function isMatch(object, source, customizer, thisArg) {
+ var props = keys(source),
+ length = props.length;
- // Is a given value a boolean?
- _.isBoolean = function(obj) {
- return obj === true || obj === false || toString.call(obj) == '[object Boolean]';
- };
+ if (!length) {
+ return true;
+ }
+ if (object == null) {
+ return false;
+ }
+ customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 3);
+ object = toObject(object);
+ if (!customizer && length == 1) {
+ var key = props[0],
+ value = source[key];
- // Is a given value equal to null?
- _.isNull = function(obj) {
- return obj === null;
- };
+ if (isStrictComparable(value)) {
+ return value === object[key] && (value !== undefined || (key in object));
+ }
+ }
+ var values = Array(length),
+ strictCompareFlags = Array(length);
- // Is a given variable undefined?
- _.isUndefined = function(obj) {
- return obj === void 0;
- };
+ while (length--) {
+ value = values[length] = source[props[length]];
+ strictCompareFlags[length] = isStrictComparable(value);
+ }
+ return baseIsMatch(object, props, values, strictCompareFlags, customizer);
+ }
- // Shortcut function for checking if an object has a given property directly
- // on itself (in other words, not on a prototype).
- _.has = function(obj, key) {
- return hasOwnProperty.call(obj, key);
- };
+ /**
+ * Checks if `value` is `NaN`.
+ *
+ * **Note:** This method is not the same as [`isNaN`](https://es5.github.io/#x15.1.2.4)
+ * which returns `true` for `undefined` and other non-numeric values.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
+ * @example
+ *
+ * _.isNaN(NaN);
+ * // => true
+ *
+ * _.isNaN(new Number(NaN));
+ * // => true
+ *
+ * isNaN(undefined);
+ * // => true
+ *
+ * _.isNaN(undefined);
+ * // => false
+ */
+ function isNaN(value) {
+ // An `NaN` primitive is the only value that is not equal to itself.
+ // Perform the `toStringTag` check first to avoid errors with some host objects in IE.
+ return isNumber(value) && value != +value;
+ }
- // Utility Functions
- // -----------------
+ /**
+ * Checks if `value` is a native function.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a native function, else `false`.
+ * @example
+ *
+ * _.isNative(Array.prototype.push);
+ * // => true
+ *
+ * _.isNative(_);
+ * // => false
+ */
+ function isNative(value) {
+ if (value == null) {
+ return false;
+ }
+ if (objToString.call(value) == funcTag) {
+ return reIsNative.test(fnToString.call(value));
+ }
+ return isObjectLike(value) && reIsHostCtor.test(value);
+ }
- // Run Underscore.js in *noConflict* mode, returning the `_` variable to its
- // previous owner. Returns a reference to the Underscore object.
- _.noConflict = function() {
- root._ = previousUnderscore;
- return this;
- };
+ /**
+ * Checks if `value` is `null`.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is `null`, else `false`.
+ * @example
+ *
+ * _.isNull(null);
+ * // => true
+ *
+ * _.isNull(void 0);
+ * // => false
+ */
+ function isNull(value) {
+ return value === null;
+ }
- // Keep the identity function around for default iterators.
- _.identity = function(value) {
- return value;
- };
+ /**
+ * Checks if `value` is classified as a `Number` primitive or object.
+ *
+ * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are classified
+ * as numbers, use the `_.isFinite` method.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ * @example
+ *
+ * _.isNumber(8.4);
+ * // => true
+ *
+ * _.isNumber(NaN);
+ * // => true
+ *
+ * _.isNumber('8.4');
+ * // => false
+ */
+ function isNumber(value) {
+ return typeof value == 'number' || (isObjectLike(value) && objToString.call(value) == numberTag);
+ }
- _.constant = function(value) {
- return function () {
- return value;
+ /**
+ * Checks if `value` is a plain object, that is, an object created by the
+ * `Object` constructor or one with a `[[Prototype]]` of `null`.
+ *
+ * **Note:** This method assumes objects created by the `Object` constructor
+ * have no inherited enumerable properties.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.
+ * @example
+ *
+ * function Foo() {
+ * this.a = 1;
+ * }
+ *
+ * _.isPlainObject(new Foo);
+ * // => false
+ *
+ * _.isPlainObject([1, 2, 3]);
+ * // => false
+ *
+ * _.isPlainObject({ 'x': 0, 'y': 0 });
+ * // => true
+ *
+ * _.isPlainObject(Object.create(null));
+ * // => true
+ */
+ var isPlainObject = !getPrototypeOf ? shimIsPlainObject : function(value) {
+ if (!(value && objToString.call(value) == objectTag)) {
+ return false;
+ }
+ var valueOf = value.valueOf,
+ objProto = isNative(valueOf) && (objProto = getPrototypeOf(valueOf)) && getPrototypeOf(objProto);
+
+ return objProto
+ ? (value == objProto || getPrototypeOf(value) == objProto)
+ : shimIsPlainObject(value);
};
- };
- _.property = function(key) {
- return function(obj) {
- return obj[key];
+ /**
+ * Checks if `value` is classified as a `RegExp` object.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ * @example
+ *
+ * _.isRegExp(/abc/);
+ * // => true
+ *
+ * _.isRegExp('/abc/');
+ * // => false
+ */
+ function isRegExp(value) {
+ return (isObjectLike(value) && objToString.call(value) == regexpTag) || false;
+ }
+
+ /**
+ * Checks if `value` is classified as a `String` primitive or object.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ * @example
+ *
+ * _.isString('abc');
+ * // => true
+ *
+ * _.isString(1);
+ * // => false
+ */
+ function isString(value) {
+ return typeof value == 'string' || (isObjectLike(value) && objToString.call(value) == stringTag);
+ }
+
+ /**
+ * Checks if `value` is classified as a typed array.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ * @example
+ *
+ * _.isTypedArray(new Uint8Array);
+ * // => true
+ *
+ * _.isTypedArray([]);
+ * // => false
+ */
+ function isTypedArray(value) {
+ return isObjectLike(value) && isLength(value.length) && !!typedArrayTags[objToString.call(value)];
+ }
+
+ /**
+ * Checks if `value` is `undefined`.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.
+ * @example
+ *
+ * _.isUndefined(void 0);
+ * // => true
+ *
+ * _.isUndefined(null);
+ * // => false
+ */
+ function isUndefined(value) {
+ return value === undefined;
+ }
+
+ /**
+ * Converts `value` to an array.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to convert.
+ * @returns {Array} Returns the converted array.
+ * @example
+ *
+ * (function() {
+ * return _.toArray(arguments).slice(1);
+ * }(1, 2, 3));
+ * // => [2, 3]
+ */
+ function toArray(value) {
+ var length = value ? getLength(value) : 0;
+ if (!isLength(length)) {
+ return values(value);
+ }
+ if (!length) {
+ return [];
+ }
+ return arrayCopy(value);
+ }
+
+ /**
+ * Converts `value` to a plain object flattening inherited enumerable
+ * properties of `value` to own properties of the plain object.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to convert.
+ * @returns {Object} Returns the converted plain object.
+ * @example
+ *
+ * function Foo() {
+ * this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.assign({ 'a': 1 }, new Foo);
+ * // => { 'a': 1, 'b': 2 }
+ *
+ * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));
+ * // => { 'a': 1, 'b': 2, 'c': 3 }
+ */
+ function toPlainObject(value) {
+ return baseCopy(value, keysIn(value));
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Assigns own enumerable properties of source object(s) to the destination
+ * object. Subsequent sources overwrite property assignments of previous sources.
+ * If `customizer` is provided it is invoked to produce the assigned values.
+ * The `customizer` is bound to `thisArg` and invoked with five arguments:
+ * (objectValue, sourceValue, key, object, source).
+ *
+ * **Note:** This method mutates `object` and is based on
+ * [`Object.assign`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-object.assign).
+ *
+ *
+ * @static
+ * @memberOf _
+ * @alias extend
+ * @category Object
+ * @param {Object} object The destination object.
+ * @param {...Object} [sources] The source objects.
+ * @param {Function} [customizer] The function to customize assigned values.
+ * @param {*} [thisArg] The `this` binding of `customizer`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * _.assign({ 'user': 'barney' }, { 'age': 40 }, { 'user': 'fred' });
+ * // => { 'user': 'fred', 'age': 40 }
+ *
+ * // using a customizer callback
+ * var defaults = _.partialRight(_.assign, function(value, other) {
+ * return _.isUndefined(value) ? other : value;
+ * });
+ *
+ * defaults({ 'user': 'barney' }, { 'age': 36 }, { 'user': 'fred' });
+ * // => { 'user': 'barney', 'age': 36 }
+ */
+ var assign = createAssigner(function(object, source, customizer) {
+ return customizer
+ ? assignWith(object, source, customizer)
+ : baseAssign(object, source);
+ });
+
+ /**
+ * Creates an object that inherits from the given `prototype` object. If a
+ * `properties` object is provided its own enumerable properties are assigned
+ * to the created object.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} prototype The object to inherit from.
+ * @param {Object} [properties] The properties to assign to the object.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Object} Returns the new object.
+ * @example
+ *
+ * function Shape() {
+ * this.x = 0;
+ * this.y = 0;
+ * }
+ *
+ * function Circle() {
+ * Shape.call(this);
+ * }
+ *
+ * Circle.prototype = _.create(Shape.prototype, {
+ * 'constructor': Circle
+ * });
+ *
+ * var circle = new Circle;
+ * circle instanceof Circle;
+ * // => true
+ *
+ * circle instanceof Shape;
+ * // => true
+ */
+ function create(prototype, properties, guard) {
+ var result = baseCreate(prototype);
+ if (guard && isIterateeCall(prototype, properties, guard)) {
+ properties = null;
+ }
+ return properties ? baseAssign(result, properties) : result;
+ }
+
+ /**
+ * Assigns own enumerable properties of source object(s) to the destination
+ * object for all destination properties that resolve to `undefined`. Once a
+ * property is set, additional values of the same property are ignored.
+ *
+ * **Note:** This method mutates `object`.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The destination object.
+ * @param {...Object} [sources] The source objects.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * _.defaults({ 'user': 'barney' }, { 'age': 36 }, { 'user': 'fred' });
+ * // => { 'user': 'barney', 'age': 36 }
+ */
+ var defaults = restParam(function(args) {
+ var object = args[0];
+ if (object == null) {
+ return object;
+ }
+ args.push(assignDefaults);
+ return assign.apply(undefined, args);
+ });
+
+ /**
+ * This method is like `_.find` except that it returns the key of the first
+ * element `predicate` returns truthy for instead of the element itself.
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to search.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {string|undefined} Returns the key of the matched element, else `undefined`.
+ * @example
+ *
+ * var users = {
+ * 'barney': { 'age': 36, 'active': true },
+ * 'fred': { 'age': 40, 'active': false },
+ * 'pebbles': { 'age': 1, 'active': true }
+ * };
+ *
+ * _.findKey(users, function(chr) {
+ * return chr.age < 40;
+ * });
+ * // => 'barney' (iteration order is not guaranteed)
+ *
+ * // using the `_.matches` callback shorthand
+ * _.findKey(users, { 'age': 1, 'active': true });
+ * // => 'pebbles'
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.findKey(users, 'active', false);
+ * // => 'fred'
+ *
+ * // using the `_.property` callback shorthand
+ * _.findKey(users, 'active');
+ * // => 'barney'
+ */
+ var findKey = createFindKey(baseForOwn);
+
+ /**
+ * This method is like `_.findKey` except that it iterates over elements of
+ * a collection in the opposite order.
+ *
+ * If a property name is provided for `predicate` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `predicate` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to search.
+ * @param {Function|Object|string} [predicate=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {string|undefined} Returns the key of the matched element, else `undefined`.
+ * @example
+ *
+ * var users = {
+ * 'barney': { 'age': 36, 'active': true },
+ * 'fred': { 'age': 40, 'active': false },
+ * 'pebbles': { 'age': 1, 'active': true }
+ * };
+ *
+ * _.findLastKey(users, function(chr) {
+ * return chr.age < 40;
+ * });
+ * // => returns `pebbles` assuming `_.findKey` returns `barney`
+ *
+ * // using the `_.matches` callback shorthand
+ * _.findLastKey(users, { 'age': 36, 'active': true });
+ * // => 'barney'
+ *
+ * // using the `_.matchesProperty` callback shorthand
+ * _.findLastKey(users, 'active', false);
+ * // => 'fred'
+ *
+ * // using the `_.property` callback shorthand
+ * _.findLastKey(users, 'active');
+ * // => 'pebbles'
+ */
+ var findLastKey = createFindKey(baseForOwnRight);
+
+ /**
+ * Iterates over own and inherited enumerable properties of an object invoking
+ * `iteratee` for each property. The `iteratee` is bound to `thisArg` and invoked
+ * with three arguments: (value, key, object). Iteratee functions may exit
+ * iteration early by explicitly returning `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * function Foo() {
+ * this.a = 1;
+ * this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.forIn(new Foo, function(value, key) {
+ * console.log(key);
+ * });
+ * // => logs 'a', 'b', and 'c' (iteration order is not guaranteed)
+ */
+ var forIn = createForIn(baseFor);
+
+ /**
+ * This method is like `_.forIn` except that it iterates over properties of
+ * `object` in the opposite order.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * function Foo() {
+ * this.a = 1;
+ * this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.forInRight(new Foo, function(value, key) {
+ * console.log(key);
+ * });
+ * // => logs 'c', 'b', and 'a' assuming `_.forIn ` logs 'a', 'b', and 'c'
+ */
+ var forInRight = createForIn(baseForRight);
+
+ /**
+ * Iterates over own enumerable properties of an object invoking `iteratee`
+ * for each property. The `iteratee` is bound to `thisArg` and invoked with
+ * three arguments: (value, key, object). Iteratee functions may exit iteration
+ * early by explicitly returning `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * function Foo() {
+ * this.a = 1;
+ * this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.forOwn(new Foo, function(value, key) {
+ * console.log(key);
+ * });
+ * // => logs 'a' and 'b' (iteration order is not guaranteed)
+ */
+ var forOwn = createForOwn(baseForOwn);
+
+ /**
+ * This method is like `_.forOwn` except that it iterates over properties of
+ * `object` in the opposite order.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * function Foo() {
+ * this.a = 1;
+ * this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.forOwnRight(new Foo, function(value, key) {
+ * console.log(key);
+ * });
+ * // => logs 'b' and 'a' assuming `_.forOwn` logs 'a' and 'b'
+ */
+ var forOwnRight = createForOwn(baseForOwnRight);
+
+ /**
+ * Creates an array of function property names from all enumerable properties,
+ * own and inherited, of `object`.
+ *
+ * @static
+ * @memberOf _
+ * @alias methods
+ * @category Object
+ * @param {Object} object The object to inspect.
+ * @returns {Array} Returns the new array of property names.
+ * @example
+ *
+ * _.functions(_);
+ * // => ['after', 'ary', 'assign', ...]
+ */
+ function functions(object) {
+ return baseFunctions(object, keysIn(object));
+ }
+
+ /**
+ * Gets the property value of `path` on `object`. If the resolved value is
+ * `undefined` the `defaultValue` is used in its place.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to query.
+ * @param {Array|string} path The path of the property to get.
+ * @param {*} [defaultValue] The value returned if the resolved value is `undefined`.
+ * @returns {*} Returns the resolved value.
+ * @example
+ *
+ * var object = { 'a': [{ 'b': { 'c': 3 } }] };
+ *
+ * _.get(object, 'a[0].b.c');
+ * // => 3
+ *
+ * _.get(object, ['a', '0', 'b', 'c']);
+ * // => 3
+ *
+ * _.get(object, 'a.b.c', 'default');
+ * // => 'default'
+ */
+ function get(object, path, defaultValue) {
+ var result = object == null ? undefined : baseGet(object, toPath(path), path + '');
+ return result === undefined ? defaultValue : result;
+ }
+
+ /**
+ * Checks if `path` is a direct property.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to query.
+ * @param {Array|string} path The path to check.
+ * @returns {boolean} Returns `true` if `path` is a direct property, else `false`.
+ * @example
+ *
+ * var object = { 'a': { 'b': { 'c': 3 } } };
+ *
+ * _.has(object, 'a');
+ * // => true
+ *
+ * _.has(object, 'a.b.c');
+ * // => true
+ *
+ * _.has(object, ['a', 'b', 'c']);
+ * // => true
+ */
+ function has(object, path) {
+ if (object == null) {
+ return false;
+ }
+ var result = hasOwnProperty.call(object, path);
+ if (!result && !isKey(path)) {
+ path = toPath(path);
+ object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
+ path = last(path);
+ result = object != null && hasOwnProperty.call(object, path);
+ }
+ return result;
+ }
+
+ /**
+ * Creates an object composed of the inverted keys and values of `object`.
+ * If `object` contains duplicate values, subsequent values overwrite property
+ * assignments of previous values unless `multiValue` is `true`.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to invert.
+ * @param {boolean} [multiValue] Allow multiple values per key.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Object} Returns the new inverted object.
+ * @example
+ *
+ * var object = { 'a': 1, 'b': 2, 'c': 1 };
+ *
+ * _.invert(object);
+ * // => { '1': 'c', '2': 'b' }
+ *
+ * // with `multiValue`
+ * _.invert(object, true);
+ * // => { '1': ['a', 'c'], '2': ['b'] }
+ */
+ function invert(object, multiValue, guard) {
+ if (guard && isIterateeCall(object, multiValue, guard)) {
+ multiValue = null;
+ }
+ var index = -1,
+ props = keys(object),
+ length = props.length,
+ result = {};
+
+ while (++index < length) {
+ var key = props[index],
+ value = object[key];
+
+ if (multiValue) {
+ if (hasOwnProperty.call(result, value)) {
+ result[value].push(key);
+ } else {
+ result[value] = [key];
+ }
+ }
+ else {
+ result[value] = key;
+ }
+ }
+ return result;
+ }
+
+ /**
+ * Creates an array of the own enumerable property names of `object`.
+ *
+ * **Note:** Non-object values are coerced to objects. See the
+ * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-object.keys)
+ * for more details.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ * @example
+ *
+ * function Foo() {
+ * this.a = 1;
+ * this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.keys(new Foo);
+ * // => ['a', 'b'] (iteration order is not guaranteed)
+ *
+ * _.keys('hi');
+ * // => ['0', '1']
+ */
+ var keys = !nativeKeys ? shimKeys : function(object) {
+ if (object) {
+ var Ctor = object.constructor,
+ length = object.length;
+ }
+ if ((typeof Ctor == 'function' && Ctor.prototype === object) ||
+ (typeof object != 'function' && isLength(length))) {
+ return shimKeys(object);
+ }
+ return isObject(object) ? nativeKeys(object) : [];
};
- };
- // Returns a predicate for checking whether an object has a given set of `key:value` pairs.
- _.matches = function(attrs) {
- return function(obj) {
- if (obj === attrs) return true; //avoid comparing an object to itself.
- for (var key in attrs) {
- if (attrs[key] !== obj[key])
- return false;
+ /**
+ * Creates an array of the own and inherited enumerable property names of `object`.
+ *
+ * **Note:** Non-object values are coerced to objects.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ * @example
+ *
+ * function Foo() {
+ * this.a = 1;
+ * this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.keysIn(new Foo);
+ * // => ['a', 'b', 'c'] (iteration order is not guaranteed)
+ */
+ function keysIn(object) {
+ if (object == null) {
+ return [];
+ }
+ if (!isObject(object)) {
+ object = Object(object);
+ }
+ var length = object.length;
+ length = (length && isLength(length) &&
+ (isArray(object) || (support.nonEnumArgs && isArguments(object))) && length) || 0;
+
+ var Ctor = object.constructor,
+ index = -1,
+ isProto = typeof Ctor == 'function' && Ctor.prototype === object,
+ result = Array(length),
+ skipIndexes = length > 0;
+
+ while (++index < length) {
+ result[index] = (index + '');
+ }
+ for (var key in object) {
+ if (!(skipIndexes && isIndex(key, length)) &&
+ !(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {
+ result.push(key);
+ }
}
- return true;
+ return result;
}
- };
- // Run a function **n** times.
- _.times = function(n, iterator, context) {
- var accum = Array(Math.max(0, n));
- for (var i = 0; i < n; i++) accum[i] = iterator.call(context, i);
- return accum;
- };
+ /**
+ * Creates an object with the same keys as `object` and values generated by
+ * running each own enumerable property of `object` through `iteratee`. The
+ * iteratee function is bound to `thisArg` and invoked with three arguments:
+ * (value, key, object).
+ *
+ * If a property name is provided for `iteratee` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `iteratee` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to iterate over.
+ * @param {Function|Object|string} [iteratee=_.identity] The function invoked
+ * per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Object} Returns the new mapped object.
+ * @example
+ *
+ * _.mapValues({ 'a': 1, 'b': 2 }, function(n) {
+ * return n * 3;
+ * });
+ * // => { 'a': 3, 'b': 6 }
+ *
+ * var users = {
+ * 'fred': { 'user': 'fred', 'age': 40 },
+ * 'pebbles': { 'user': 'pebbles', 'age': 1 }
+ * };
+ *
+ * // using the `_.property` callback shorthand
+ * _.mapValues(users, 'age');
+ * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
+ */
+ function mapValues(object, iteratee, thisArg) {
+ var result = {};
+ iteratee = getCallback(iteratee, thisArg, 3);
- // Return a random integer between min and max (inclusive).
- _.random = function(min, max) {
- if (max == null) {
- max = min;
- min = 0;
+ baseForOwn(object, function(value, key, object) {
+ result[key] = iteratee(value, key, object);
+ });
+ return result;
}
- return min + Math.floor(Math.random() * (max - min + 1));
- };
- // A (possibly faster) way to get the current timestamp as an integer.
- _.now = Date.now || function() { return new Date().getTime(); };
+ /**
+ * Recursively merges own enumerable properties of the source object(s), that
+ * don't resolve to `undefined` into the destination object. Subsequent sources
+ * overwrite property assignments of previous sources. If `customizer` is
+ * provided it is invoked to produce the merged values of the destination and
+ * source properties. If `customizer` returns `undefined` merging is handled
+ * by the method instead. The `customizer` is bound to `thisArg` and invoked
+ * with five arguments: (objectValue, sourceValue, key, object, source).
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The destination object.
+ * @param {...Object} [sources] The source objects.
+ * @param {Function} [customizer] The function to customize assigned values.
+ * @param {*} [thisArg] The `this` binding of `customizer`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * var users = {
+ * 'data': [{ 'user': 'barney' }, { 'user': 'fred' }]
+ * };
+ *
+ * var ages = {
+ * 'data': [{ 'age': 36 }, { 'age': 40 }]
+ * };
+ *
+ * _.merge(users, ages);
+ * // => { 'data': [{ 'user': 'barney', 'age': 36 }, { 'user': 'fred', 'age': 40 }] }
+ *
+ * // using a customizer callback
+ * var object = {
+ * 'fruits': ['apple'],
+ * 'vegetables': ['beet']
+ * };
+ *
+ * var other = {
+ * 'fruits': ['banana'],
+ * 'vegetables': ['carrot']
+ * };
+ *
+ * _.merge(object, other, function(a, b) {
+ * if (_.isArray(a)) {
+ * return a.concat(b);
+ * }
+ * });
+ * // => { 'fruits': ['apple', 'banana'], 'vegetables': ['beet', 'carrot'] }
+ */
+ var merge = createAssigner(baseMerge);
- // List of HTML entities for escaping.
- var entityMap = {
- escape: {
- '&': '&',
- '<': '<',
- '>': '>',
- '"': '"',
- "'": '''
+ /**
+ * The opposite of `_.pick`; this method creates an object composed of the
+ * own and inherited enumerable properties of `object` that are not omitted.
+ * Property names may be specified as individual arguments or as arrays of
+ * property names. If `predicate` is provided it is invoked for each property
+ * of `object` omitting the properties `predicate` returns truthy for. The
+ * predicate is bound to `thisArg` and invoked with three arguments:
+ * (value, key, object).
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The source object.
+ * @param {Function|...(string|string[])} [predicate] The function invoked per
+ * iteration or property names to omit, specified as individual property
+ * names or arrays of property names.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {Object} Returns the new object.
+ * @example
+ *
+ * var object = { 'user': 'fred', 'age': 40 };
+ *
+ * _.omit(object, 'age');
+ * // => { 'user': 'fred' }
+ *
+ * _.omit(object, _.isNumber);
+ * // => { 'user': 'fred' }
+ */
+ var omit = restParam(function(object, props) {
+ if (object == null) {
+ return {};
+ }
+ if (typeof props[0] != 'function') {
+ var props = arrayMap(baseFlatten(props), String);
+ return pickByArray(object, baseDifference(keysIn(object), props));
+ }
+ var predicate = bindCallback(props[0], props[1], 3);
+ return pickByCallback(object, function(value, key, object) {
+ return !predicate(value, key, object);
+ });
+ });
+
+ /**
+ * Creates a two dimensional array of the key-value pairs for `object`,
+ * e.g. `[[key1, value1], [key2, value2]]`.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the new array of key-value pairs.
+ * @example
+ *
+ * _.pairs({ 'barney': 36, 'fred': 40 });
+ * // => [['barney', 36], ['fred', 40]] (iteration order is not guaranteed)
+ */
+ function pairs(object) {
+ var index = -1,
+ props = keys(object),
+ length = props.length,
+ result = Array(length);
+
+ while (++index < length) {
+ var key = props[index];
+ result[index] = [key, object[key]];
+ }
+ return result;
}
- };
- entityMap.unescape = _.invert(entityMap.escape);
- // Regexes containing the keys and values listed immediately above.
- var entityRegexes = {
- escape: new RegExp('[' + _.keys(entityMap.escape).join('') + ']', 'g'),
- unescape: new RegExp('(' + _.keys(entityMap.unescape).join('|') + ')', 'g')
- };
+ /**
+ * Creates an object composed of the picked `object` properties. Property
+ * names may be specified as individual arguments or as arrays of property
+ * names. If `predicate` is provided it is invoked for each property of `object`
+ * picking the properties `predicate` returns truthy for. The predicate is
+ * bound to `thisArg` and invoked with three arguments: (value, key, object).
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The source object.
+ * @param {Function|...(string|string[])} [predicate] The function invoked per
+ * iteration or property names to pick, specified as individual property
+ * names or arrays of property names.
+ * @param {*} [thisArg] The `this` binding of `predicate`.
+ * @returns {Object} Returns the new object.
+ * @example
+ *
+ * var object = { 'user': 'fred', 'age': 40 };
+ *
+ * _.pick(object, 'user');
+ * // => { 'user': 'fred' }
+ *
+ * _.pick(object, _.isString);
+ * // => { 'user': 'fred' }
+ */
+ var pick = restParam(function(object, props) {
+ if (object == null) {
+ return {};
+ }
+ return typeof props[0] == 'function'
+ ? pickByCallback(object, bindCallback(props[0], props[1], 3))
+ : pickByArray(object, baseFlatten(props));
+ });
- // Functions for escaping and unescaping strings to/from HTML interpolation.
- _.each(['escape', 'unescape'], function(method) {
- _[method] = function(string) {
- if (string == null) return '';
- return ('' + string).replace(entityRegexes[method], function(match) {
- return entityMap[method][match];
+ /**
+ * This method is like `_.get` except that if the resolved value is a function
+ * it is invoked with the `this` binding of its parent object and its result
+ * is returned.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to query.
+ * @param {Array|string} path The path of the property to resolve.
+ * @param {*} [defaultValue] The value returned if the resolved value is `undefined`.
+ * @returns {*} Returns the resolved value.
+ * @example
+ *
+ * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };
+ *
+ * _.result(object, 'a[0].b.c1');
+ * // => 3
+ *
+ * _.result(object, 'a[0].b.c2');
+ * // => 4
+ *
+ * _.result(object, 'a.b.c', 'default');
+ * // => 'default'
+ *
+ * _.result(object, 'a.b.c', _.constant('default'));
+ * // => 'default'
+ */
+ function result(object, path, defaultValue) {
+ var result = object == null ? undefined : object[path];
+ if (result === undefined) {
+ if (object != null && !isKey(path, object)) {
+ path = toPath(path);
+ object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
+ result = object == null ? undefined : object[last(path)];
+ }
+ result = result === undefined ? defaultValue : result;
+ }
+ return isFunction(result) ? result.call(object) : result;
+ }
+
+ /**
+ * Sets the property value of `path` on `object`. If a portion of `path`
+ * does not exist it is created.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to augment.
+ * @param {Array|string} path The path of the property to set.
+ * @param {*} value The value to set.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * var object = { 'a': [{ 'b': { 'c': 3 } }] };
+ *
+ * _.set(object, 'a[0].b.c', 4);
+ * console.log(object.a[0].b.c);
+ * // => 4
+ *
+ * _.set(object, 'x[0].y.z', 5);
+ * console.log(object.x[0].y.z);
+ * // => 5
+ */
+ function set(object, path, value) {
+ if (object == null) {
+ return object;
+ }
+ var pathKey = (path + '');
+ path = (object[pathKey] != null || isKey(path, object)) ? [pathKey] : toPath(path);
+
+ var index = -1,
+ length = path.length,
+ endIndex = length - 1,
+ nested = object;
+
+ while (nested != null && ++index < length) {
+ var key = path[index];
+ if (isObject(nested)) {
+ if (index == endIndex) {
+ nested[key] = value;
+ } else if (nested[key] == null) {
+ nested[key] = isIndex(path[index + 1]) ? [] : {};
+ }
+ }
+ nested = nested[key];
+ }
+ return object;
+ }
+
+ /**
+ * An alternative to `_.reduce`; this method transforms `object` to a new
+ * `accumulator` object which is the result of running each of its own enumerable
+ * properties through `iteratee`, with each invocation potentially mutating
+ * the `accumulator` object. The `iteratee` is bound to `thisArg` and invoked
+ * with four arguments: (accumulator, value, key, object). Iteratee functions
+ * may exit iteration early by explicitly returning `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Array|Object} object The object to iterate over.
+ * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+ * @param {*} [accumulator] The custom accumulator value.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {*} Returns the accumulated value.
+ * @example
+ *
+ * _.transform([2, 3, 4], function(result, n) {
+ * result.push(n *= n);
+ * return n % 2 == 0;
+ * });
+ * // => [4, 9]
+ *
+ * _.transform({ 'a': 1, 'b': 2 }, function(result, n, key) {
+ * result[key] = n * 3;
+ * });
+ * // => { 'a': 3, 'b': 6 }
+ */
+ function transform(object, iteratee, accumulator, thisArg) {
+ var isArr = isArray(object) || isTypedArray(object);
+ iteratee = getCallback(iteratee, thisArg, 4);
+
+ if (accumulator == null) {
+ if (isArr || isObject(object)) {
+ var Ctor = object.constructor;
+ if (isArr) {
+ accumulator = isArray(object) ? new Ctor : [];
+ } else {
+ accumulator = baseCreate(isFunction(Ctor) && Ctor.prototype);
+ }
+ } else {
+ accumulator = {};
+ }
+ }
+ (isArr ? arrayEach : baseForOwn)(object, function(value, index, object) {
+ return iteratee(accumulator, value, index, object);
});
- };
- });
+ return accumulator;
+ }
- // If the value of the named `property` is a function then invoke it with the
- // `object` as context; otherwise, return it.
- _.result = function(object, property) {
- if (object == null) return void 0;
- var value = object[property];
- return _.isFunction(value) ? value.call(object) : value;
- };
+ /**
+ * Creates an array of the own enumerable property values of `object`.
+ *
+ * **Note:** Non-object values are coerced to objects.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property values.
+ * @example
+ *
+ * function Foo() {
+ * this.a = 1;
+ * this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.values(new Foo);
+ * // => [1, 2] (iteration order is not guaranteed)
+ *
+ * _.values('hi');
+ * // => ['h', 'i']
+ */
+ function values(object) {
+ return baseValues(object, keys(object));
+ }
- // Add your own custom functions to the Underscore object.
- _.mixin = function(obj) {
- each(_.functions(obj), function(name) {
- var func = _[name] = obj[name];
- _.prototype[name] = function() {
- var args = [this._wrapped];
- push.apply(args, arguments);
- return result.call(this, func.apply(_, args));
+ /**
+ * Creates an array of the own and inherited enumerable property values
+ * of `object`.
+ *
+ * **Note:** Non-object values are coerced to objects.
+ *
+ * @static
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property values.
+ * @example
+ *
+ * function Foo() {
+ * this.a = 1;
+ * this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.valuesIn(new Foo);
+ * // => [1, 2, 3] (iteration order is not guaranteed)
+ */
+ function valuesIn(object) {
+ return baseValues(object, keysIn(object));
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Checks if `n` is between `start` and up to but not including, `end`. If
+ * `end` is not specified it is set to `start` with `start` then set to `0`.
+ *
+ * @static
+ * @memberOf _
+ * @category Number
+ * @param {number} n The number to check.
+ * @param {number} [start=0] The start of the range.
+ * @param {number} end The end of the range.
+ * @returns {boolean} Returns `true` if `n` is in the range, else `false`.
+ * @example
+ *
+ * _.inRange(3, 2, 4);
+ * // => true
+ *
+ * _.inRange(4, 8);
+ * // => true
+ *
+ * _.inRange(4, 2);
+ * // => false
+ *
+ * _.inRange(2, 2);
+ * // => false
+ *
+ * _.inRange(1.2, 2);
+ * // => true
+ *
+ * _.inRange(5.2, 4);
+ * // => false
+ */
+ function inRange(value, start, end) {
+ start = +start || 0;
+ if (typeof end === 'undefined') {
+ end = start;
+ start = 0;
+ } else {
+ end = +end || 0;
+ }
+ return value >= nativeMin(start, end) && value < nativeMax(start, end);
+ }
+
+ /**
+ * Produces a random number between `min` and `max` (inclusive). If only one
+ * argument is provided a number between `0` and the given number is returned.
+ * If `floating` is `true`, or either `min` or `max` are floats, a floating-point
+ * number is returned instead of an integer.
+ *
+ * @static
+ * @memberOf _
+ * @category Number
+ * @param {number} [min=0] The minimum possible value.
+ * @param {number} [max=1] The maximum possible value.
+ * @param {boolean} [floating] Specify returning a floating-point number.
+ * @returns {number} Returns the random number.
+ * @example
+ *
+ * _.random(0, 5);
+ * // => an integer between 0 and 5
+ *
+ * _.random(5);
+ * // => also an integer between 0 and 5
+ *
+ * _.random(5, true);
+ * // => a floating-point number between 0 and 5
+ *
+ * _.random(1.2, 5.2);
+ * // => a floating-point number between 1.2 and 5.2
+ */
+ function random(min, max, floating) {
+ if (floating && isIterateeCall(min, max, floating)) {
+ max = floating = null;
+ }
+ var noMin = min == null,
+ noMax = max == null;
+
+ if (floating == null) {
+ if (noMax && typeof min == 'boolean') {
+ floating = min;
+ min = 1;
+ }
+ else if (typeof max == 'boolean') {
+ floating = max;
+ noMax = true;
+ }
+ }
+ if (noMin && noMax) {
+ max = 1;
+ noMax = false;
+ }
+ min = +min || 0;
+ if (noMax) {
+ max = min;
+ min = 0;
+ } else {
+ max = +max || 0;
+ }
+ if (floating || min % 1 || max % 1) {
+ var rand = nativeRandom();
+ return nativeMin(min + (rand * (max - min + parseFloat('1e-' + ((rand + '').length - 1)))), max);
+ }
+ return baseRandom(min, max);
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to convert.
+ * @returns {string} Returns the camel cased string.
+ * @example
+ *
+ * _.camelCase('Foo Bar');
+ * // => 'fooBar'
+ *
+ * _.camelCase('--foo-bar');
+ * // => 'fooBar'
+ *
+ * _.camelCase('__foo_bar__');
+ * // => 'fooBar'
+ */
+ var camelCase = createCompounder(function(result, word, index) {
+ word = word.toLowerCase();
+ return result + (index ? (word.charAt(0).toUpperCase() + word.slice(1)) : word);
+ });
+
+ /**
+ * Capitalizes the first character of `string`.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to capitalize.
+ * @returns {string} Returns the capitalized string.
+ * @example
+ *
+ * _.capitalize('fred');
+ * // => 'Fred'
+ */
+ function capitalize(string) {
+ string = baseToString(string);
+ return string && (string.charAt(0).toUpperCase() + string.slice(1));
+ }
+
+ /**
+ * Deburrs `string` by converting [latin-1 supplementary
letters](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)
+ * to basic latin letters and removing [combining diacritical
marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to deburr.
+ * @returns {string} Returns the deburred string.
+ * @example
+ *
+ * _.deburr('déjà vu');
+ * // => 'deja vu'
+ */
+ function deburr(string) {
+ string = baseToString(string);
+ return string && string.replace(reLatin1, deburrLetter).replace(reComboMark, '');
+ }
+
+ /**
+ * Checks if `string` ends with the given target string.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to search.
+ * @param {string} [target] The string to search for.
+ * @param {number} [position=string.length] The position to search from.
+ * @returns {boolean} Returns `true` if `string` ends with `target`, else `false`.
+ * @example
+ *
+ * _.endsWith('abc', 'c');
+ * // => true
+ *
+ * _.endsWith('abc', 'b');
+ * // => false
+ *
+ * _.endsWith('abc', 'b', 2);
+ * // => true
+ */
+ function endsWith(string, target, position) {
+ string = baseToString(string);
+ target = (target + '');
+
+ var length = string.length;
+ position = position === undefined
+ ? length
+ : nativeMin(position < 0 ? 0 : (+position || 0), length);
+
+ position -= target.length;
+ return position >= 0 && string.indexOf(target, position) == position;
+ }
+
+ /**
+ * Converts the characters "&", "<", ">", '"', "'", and "\`", in `string` to
+ * their corresponding HTML entities.
+ *
+ * **Note:** No other characters are escaped. To escape additional characters
+ * use a third-party library like [_he_](https://mths.be/he).
+ *
+ * Though the ">" character is escaped for symmetry, characters like
+ * ">" and "/" don't require escaping in HTML and have no special meaning
+ * unless they're part of a tag or unquoted attribute value.
+ * See [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)
+ * (under "semi-related fun fact") for more details.
+ *
+ * Backticks are escaped because in Internet Explorer < 9, they can break out
+ * of attribute values or HTML comments. See [#59](https://html5sec.org/#59),
+ * [#102](https://html5sec.org/#102), [#108](https://html5sec.org/#108), and
+ * [#133](https://html5sec.org/#133) of the [HTML5 Security Cheatsheet](https://html5sec.org/)
+ * for more details.
+ *
+ * When working with HTML you should always [quote attribute values](http://wonko.com/post/html-escaping)
+ * to reduce XSS vectors.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to escape.
+ * @returns {string} Returns the escaped string.
+ * @example
+ *
+ * _.escape('fred, barney, & pebbles');
+ * // => 'fred, barney, & pebbles'
+ */
+ function escape(string) {
+ // Reset `lastIndex` because in IE < 9 `String#replace` does not.
+ string = baseToString(string);
+ return (string && reHasUnescapedHtml.test(string))
+ ? string.replace(reUnescapedHtml, escapeHtmlChar)
+ : string;
+ }
+
+ /**
+ * Escapes the `RegExp` special characters "\", "/", "^", "$", ".", "|", "?",
+ * "*", "+", "(", ")", "[", "]", "{" and "}" in `string`.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to escape.
+ * @returns {string} Returns the escaped string.
+ * @example
+ *
+ * _.escapeRegExp('[lodash](https://lodash.com/)');
+ * // => '\[lodash\]\(https:\/\/lodash\.com\/\)'
+ */
+ function escapeRegExp(string) {
+ string = baseToString(string);
+ return (string && reHasRegExpChars.test(string))
+ ? string.replace(reRegExpChars, '\\$&')
+ : string;
+ }
+
+ /**
+ * Converts `string` to [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to convert.
+ * @returns {string} Returns the kebab cased string.
+ * @example
+ *
+ * _.kebabCase('Foo Bar');
+ * // => 'foo-bar'
+ *
+ * _.kebabCase('fooBar');
+ * // => 'foo-bar'
+ *
+ * _.kebabCase('__foo_bar__');
+ * // => 'foo-bar'
+ */
+ var kebabCase = createCompounder(function(result, word, index) {
+ return result + (index ? '-' : '') + word.toLowerCase();
+ });
+
+ /**
+ * Pads `string` on the left and right sides if it is shorter than `length`.
+ * Padding characters are truncated if they can't be evenly divided by `length`.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to pad.
+ * @param {number} [length=0] The padding length.
+ * @param {string} [chars=' '] The string used as padding.
+ * @returns {string} Returns the padded string.
+ * @example
+ *
+ * _.pad('abc', 8);
+ * // => ' abc '
+ *
+ * _.pad('abc', 8, '_-');
+ * // => '_-abc_-_'
+ *
+ * _.pad('abc', 3);
+ * // => 'abc'
+ */
+ function pad(string, length, chars) {
+ string = baseToString(string);
+ length = +length;
+
+ var strLength = string.length;
+ if (strLength >= length || !nativeIsFinite(length)) {
+ return string;
+ }
+ var mid = (length - strLength) / 2,
+ leftLength = floor(mid),
+ rightLength = ceil(mid);
+
+ chars = createPadding('', rightLength, chars);
+ return chars.slice(0, leftLength) + string + chars;
+ }
+
+ /**
+ * Pads `string` on the left side if it is shorter than `length`. Padding
+ * characters are truncated if they exceed `length`.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to pad.
+ * @param {number} [length=0] The padding length.
+ * @param {string} [chars=' '] The string used as padding.
+ * @returns {string} Returns the padded string.
+ * @example
+ *
+ * _.padLeft('abc', 6);
+ * // => ' abc'
+ *
+ * _.padLeft('abc', 6, '_-');
+ * // => '_-_abc'
+ *
+ * _.padLeft('abc', 3);
+ * // => 'abc'
+ */
+ var padLeft = createPadDir();
+
+ /**
+ * Pads `string` on the right side if it is shorter than `length`. Padding
+ * characters are truncated if they exceed `length`.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to pad.
+ * @param {number} [length=0] The padding length.
+ * @param {string} [chars=' '] The string used as padding.
+ * @returns {string} Returns the padded string.
+ * @example
+ *
+ * _.padRight('abc', 6);
+ * // => 'abc '
+ *
+ * _.padRight('abc', 6, '_-');
+ * // => 'abc_-_'
+ *
+ * _.padRight('abc', 3);
+ * // => 'abc'
+ */
+ var padRight = createPadDir(true);
+
+ /**
+ * Converts `string` to an integer of the specified radix. If `radix` is
+ * `undefined` or `0`, a `radix` of `10` is used unless `value` is a hexadecimal,
+ * in which case a `radix` of `16` is used.
+ *
+ * **Note:** This method aligns with the [ES5 implementation](https://es5.github.io/#E)
+ * of `parseInt`.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} string The string to convert.
+ * @param {number} [radix] The radix to interpret `value` by.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {number} Returns the converted integer.
+ * @example
+ *
+ * _.parseInt('08');
+ * // => 8
+ *
+ * _.map(['6', '08', '10'], _.parseInt);
+ * // => [6, 8, 10]
+ */
+ function parseInt(string, radix, guard) {
+ if (guard && isIterateeCall(string, radix, guard)) {
+ radix = 0;
+ }
+ return nativeParseInt(string, radix);
+ }
+ // Fallback for environments with pre-ES5 implementations.
+ if (nativeParseInt(whitespace + '08') != 8) {
+ parseInt = function(string, radix, guard) {
+ // Firefox < 21 and Opera < 15 follow ES3 for `parseInt`.
+ // Chrome fails to trim leading <BOM> whitespace characters.
+ // See https://code.google.com/p/v8/issues/detail?id=3109 for more details.
+ if (guard ? isIterateeCall(string, radix, guard) : radix == null) {
+ radix = 0;
+ } else if (radix) {
+ radix = +radix;
+ }
+ string = trim(string);
+ return nativeParseInt(string, radix || (reHasHexPrefix.test(string) ? 16 : 10));
};
+ }
+
+ /**
+ * Repeats the given string `n` times.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to repeat.
+ * @param {number} [n=0] The number of times to repeat the string.
+ * @returns {string} Returns the repeated string.
+ * @example
+ *
+ * _.repeat('*', 3);
+ * // => '***'
+ *
+ * _.repeat('abc', 2);
+ * // => 'abcabc'
+ *
+ * _.repeat('abc', 0);
+ * // => ''
+ */
+ function repeat(string, n) {
+ var result = '';
+ string = baseToString(string);
+ n = +n;
+ if (n < 1 || !string || !nativeIsFinite(n)) {
+ return result;
+ }
+ // Leverage the exponentiation by squaring algorithm for a faster repeat.
+ // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.
+ do {
+ if (n % 2) {
+ result += string;
+ }
+ n = floor(n / 2);
+ string += string;
+ } while (n);
+
+ return result;
+ }
+
+ /**
+ * Converts `string` to [snake case](https://en.wikipedia.org/wiki/Snake_case).
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to convert.
+ * @returns {string} Returns the snake cased string.
+ * @example
+ *
+ * _.snakeCase('Foo Bar');
+ * // => 'foo_bar'
+ *
+ * _.snakeCase('fooBar');
+ * // => 'foo_bar'
+ *
+ * _.snakeCase('--foo-bar');
+ * // => 'foo_bar'
+ */
+ var snakeCase = createCompounder(function(result, word, index) {
+ return result + (index ? '_' : '') + word.toLowerCase();
});
- };
- // Generate a unique integer id (unique within the entire client session).
- // Useful for temporary DOM ids.
- var idCounter = 0;
- _.uniqueId = function(prefix) {
- var id = ++idCounter + '';
- return prefix ? prefix + id : id;
- };
+ /**
+ * Converts `string` to [start
case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to convert.
+ * @returns {string} Returns the start cased string.
+ * @example
+ *
+ * _.startCase('--foo-bar');
+ * // => 'Foo Bar'
+ *
+ * _.startCase('fooBar');
+ * // => 'Foo Bar'
+ *
+ * _.startCase('__foo_bar__');
+ * // => 'Foo Bar'
+ */
+ var startCase = createCompounder(function(result, word, index) {
+ return result + (index ? ' ' : '') + (word.charAt(0).toUpperCase() + word.slice(1));
+ });
- // By default, Underscore uses ERB-style template delimiters, change the
- // following template settings to use alternative delimiters.
- _.templateSettings = {
- evaluate : /<%([\s\S]+?)%>/g,
- interpolate : /<%=([\s\S]+?)%>/g,
- escape : /<%-([\s\S]+?)%>/g
- };
+ /**
+ * Checks if `string` starts with the given target string.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to search.
+ * @param {string} [target] The string to search for.
+ * @param {number} [position=0] The position to search from.
+ * @returns {boolean} Returns `true` if `string` starts with `target`, else `false`.
+ * @example
+ *
+ * _.startsWith('abc', 'a');
+ * // => true
+ *
+ * _.startsWith('abc', 'b');
+ * // => false
+ *
+ * _.startsWith('abc', 'b', 1);
+ * // => true
+ */
+ function startsWith(string, target, position) {
+ string = baseToString(string);
+ position = position == null
+ ? 0
+ : nativeMin(position < 0 ? 0 : (+position || 0), string.length);
- // When customizing `templateSettings`, if you don't want to define an
- // interpolation, evaluation or escaping regex, we need one that is
- // guaranteed not to match.
- var noMatch = /(.)^/;
-
- // Certain characters need to be escaped so that they can be put into a
- // string literal.
- var escapes = {
- "'": "'",
- '\\': '\\',
- '\r': 'r',
- '\n': 'n',
- '\t': 't',
- '\u2028': 'u2028',
- '\u2029': 'u2029'
- };
+ return string.lastIndexOf(target, position) == position;
+ }
+
+ /**
+ * Creates a compiled template function that can interpolate data properties
+ * in "interpolate" delimiters, HTML-escape interpolated data properties in
+ * "escape" delimiters, and execute JavaScript in "evaluate" delimiters. Data
+ * properties may be accessed as free variables in the template. If a setting
+ * object is provided it takes precedence over `_.templateSettings` values.
+ *
+ * **Note:** In the development build `_.template` utilizes
+ * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)
+ * for easier debugging.
+ *
+ * For more information on precompiling templates see
+ * [lodash's custom builds documentation](https://lodash.com/custom-builds).
+ *
+ * For more information on Chrome extension sandboxes see
+ * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The template string.
+ * @param {Object} [options] The options object.
+ * @param {RegExp} [options.escape] The HTML "escape" delimiter.
+ * @param {RegExp} [options.evaluate] The "evaluate" delimiter.
+ * @param {Object} [options.imports] An object to import into the template as free variables.
+ * @param {RegExp} [options.interpolate] The "interpolate" delimiter.
+ * @param {string} [options.sourceURL] The sourceURL of the template's compiled source.
+ * @param {string} [options.variable] The data object variable name.
+ * @param- {Object} [otherOptions] Enables the legacy `options` param signature.
+ * @returns {Function} Returns the compiled template function.
+ * @example
+ *
+ * // using the "interpolate" delimiter to create a compiled template
+ * var compiled = _.template('hello <%= user %>!');
+ * compiled({ 'user': 'fred' });
+ * // => 'hello fred!'
+ *
+ * // using the HTML "escape" delimiter to escape data property values
+ * var compiled = _.template('<b><%- value %></b>');
+ * compiled({ 'value': '<script>' });
+ * // => '<b><script></b>'
+ *
+ * // using the "evaluate" delimiter to execute JavaScript and generate HTML
+ * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');
+ * compiled({ 'users': ['fred', 'barney'] });
+ * // => '<li>fred</li><li>barney</li>'
+ *
+ * // using the internal `print` function in "evaluate" delimiters
+ * var compiled = _.template('<% print("hello " + user); %>!');
+ * compiled({ 'user': 'barney' });
+ * // => 'hello barney!'
+ *
+ * // using the ES delimiter as an alternative to the default "interpolate" delimiter
+ * var compiled = _.template('hello ${ user }!');
+ * compiled({ 'user': 'pebbles' });
+ * // => 'hello pebbles!'
+ *
+ * // using custom template delimiters
+ * _.templateSettings.interpolate = /{{([\s\S]+?)}}/g;
+ * var compiled = _.template('hello {{ user }}!');
+ * compiled({ 'user': 'mustache' });
+ * // => 'hello mustache!'
+ *
+ * // using backslashes to treat delimiters as plain text
+ * var compiled = _.template('<%= "\\<%- value %\\>" %>');
+ * compiled({ 'value': 'ignored' });
+ * // => '<%- value %>'
+ *
+ * // using the `imports` option to import `jQuery` as `jq`
+ * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';
+ * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });
+ * compiled({ 'users': ['fred', 'barney'] });
+ * // => '<li>fred</li><li>barney</li>'
+ *
+ * // using the `sourceURL` option to specify a custom sourceURL for the template
+ * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });
+ * compiled(data);
+ * // => find the source of "greeting.jst" under the Sources tab or Resources panel of the web inspector
+ *
+ * // using the `variable` option to ensure a with-statement isn't used in the compiled template
+ * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });
+ * compiled.source;
+ * // => function(data) {
+ * // var __t, __p = '';
+ * // __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';
+ * // return __p;
+ * // }
+ *
+ * // using the `source` property to inline compiled templates for meaningful
+ * // line numbers in error messages and a stack trace
+ * fs.writeFileSync(path.join(cwd, 'jst.js'), '\
+ * var JST = {\
+ * "main": ' + _.template(mainText).source + '\
+ * };\
+ * ');
+ */
+ function template(string, options, otherOptions) {
+ // Based on John Resig's `tmpl` implementation (http://ejohn.org/blog/javascript-micro-templating/)
+ // and Laura Doktorova's doT.js (https://github.com/olado/doT).
+ var settings = lodash.templateSettings;
+
+ if (otherOptions && isIterateeCall(string, options, otherOptions)) {
+ options = otherOptions = null;
+ }
+ string = baseToString(string);
+ options = assignWith(baseAssign({}, otherOptions || options), settings, assignOwnDefaults);
+
+ var imports = assignWith(baseAssign({}, options.imports), settings.imports, assignOwnDefaults),
+ importsKeys = keys(imports),
+ importsValues = baseValues(imports, importsKeys);
+
+ var isEscaping,
+ isEvaluating,
+ index = 0,
+ interpolate = options.interpolate || reNoMatch,
+ source = "__p += '";
+
+ // Compile the regexp to match each delimiter.
+ var reDelimiters = RegExp(
+ (options.escape || reNoMatch).source + '|' +
+ interpolate.source + '|' +
+ (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +
+ (options.evaluate || reNoMatch).source + '|$'
+ , 'g');
+
+ // Use a sourceURL for easier debugging.
+ var sourceURL = '//# sourceURL=' +
+ ('sourceURL' in options
+ ? options.sourceURL
+ : ('lodash.templateSources[' + (++templateCounter) + ']')
+ ) + '\n';
+
+ string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue,
evaluateValue, offset) {
+ interpolateValue || (interpolateValue = esTemplateValue);
+
+ // Escape characters that can't be included in string literals.
+ source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);
+
+ // Replace delimiters with snippets.
+ if (escapeValue) {
+ isEscaping = true;
+ source += "' +\n__e(" + escapeValue + ") +\n'";
+ }
+ if (evaluateValue) {
+ isEvaluating = true;
+ source += "';\n" + evaluateValue + ";\n__p += '";
+ }
+ if (interpolateValue) {
+ source += "' +\n((__t = (" + interpolateValue + ")) == null ? '' : __t) +\n'";
+ }
+ index = offset + match.length;
- var escaper = /\\|'|\r|\n|\t|\u2028|\u2029/g;
+ // The JS engine embedded in Adobe products requires returning the `match`
+ // string in order to produce the correct `offset` value.
+ return match;
+ });
- // JavaScript micro-templating, similar to John Resig's implementation.
- // Underscore templating handles arbitrary delimiters, preserves whitespace,
- // and correctly escapes quotes within interpolated code.
- _.template = function(text, data, settings) {
- var render;
- settings = _.defaults({}, settings, _.templateSettings);
+ source += "';\n";
+
+ // If `variable` is not specified wrap a with-statement around the generated
+ // code to add the data object to the top of the scope chain.
+ var variable = options.variable;
+ if (!variable) {
+ source = 'with (obj) {\n' + source + '\n}\n';
+ }
+ // Cleanup code by stripping empty strings.
+ source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)
+ .replace(reEmptyStringMiddle, '$1')
+ .replace(reEmptyStringTrailing, '$1;');
+
+ // Frame code as the function body.
+ source = 'function(' + (variable || 'obj') + ') {\n' +
+ (variable
+ ? ''
+ : 'obj || (obj = {});\n'
+ ) +
+ "var __t, __p = ''" +
+ (isEscaping
+ ? ', __e = _.escape'
+ : ''
+ ) +
+ (isEvaluating
+ ? ', __j = Array.prototype.join;\n' +
+ "function print() { __p += __j.call(arguments, '') }\n"
+ : ';\n'
+ ) +
+ source +
+ 'return __p\n}';
+
+ var result = attempt(function() {
+ return Function(importsKeys, sourceURL + 'return ' + source).apply(undefined, importsValues);
+ });
- // Combine delimiters into one regular expression via alternation.
- var matcher = new RegExp([
- (settings.escape || noMatch).source,
- (settings.interpolate || noMatch).source,
- (settings.evaluate || noMatch).source
- ].join('|') + '|$', 'g');
+ // Provide the compiled function's source by its `toString` method or
+ // the `source` property as a convenience for inlining compiled templates.
+ result.source = source;
+ if (isError(result)) {
+ throw result;
+ }
+ return result;
+ }
- // Compile the template source, escaping string literals appropriately.
- var index = 0;
- var source = "__p+='";
- text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
- source += text.slice(index, offset)
- .replace(escaper, function(match) { return '\\' + escapes[match]; });
+ /**
+ * Removes leading and trailing whitespace or specified characters from `string`.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to trim.
+ * @param {string} [chars=whitespace] The characters to trim.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {string} Returns the trimmed string.
+ * @example
+ *
+ * _.trim(' abc ');
+ * // => 'abc'
+ *
+ * _.trim('-_-abc-_-', '_-');
+ * // => 'abc'
+ *
+ * _.map([' foo ', ' bar '], _.trim);
+ * // => ['foo', 'bar']
+ */
+ function trim(string, chars, guard) {
+ var value = string;
+ string = baseToString(string);
+ if (!string) {
+ return string;
+ }
+ if (guard ? isIterateeCall(value, chars, guard) : chars == null) {
+ return string.slice(trimmedLeftIndex(string), trimmedRightIndex(string) + 1);
+ }
+ chars = (chars + '');
+ return string.slice(charsLeftIndex(string, chars), charsRightIndex(string, chars) + 1);
+ }
+
+ /**
+ * Removes leading whitespace or specified characters from `string`.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to trim.
+ * @param {string} [chars=whitespace] The characters to trim.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {string} Returns the trimmed string.
+ * @example
+ *
+ * _.trimLeft(' abc ');
+ * // => 'abc '
+ *
+ * _.trimLeft('-_-abc-_-', '_-');
+ * // => 'abc-_-'
+ */
+ function trimLeft(string, chars, guard) {
+ var value = string;
+ string = baseToString(string);
+ if (!string) {
+ return string;
+ }
+ if (guard ? isIterateeCall(value, chars, guard) : chars == null) {
+ return string.slice(trimmedLeftIndex(string));
+ }
+ return string.slice(charsLeftIndex(string, (chars + '')));
+ }
+
+ /**
+ * Removes trailing whitespace or specified characters from `string`.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to trim.
+ * @param {string} [chars=whitespace] The characters to trim.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {string} Returns the trimmed string.
+ * @example
+ *
+ * _.trimRight(' abc ');
+ * // => ' abc'
+ *
+ * _.trimRight('-_-abc-_-', '_-');
+ * // => '-_-abc'
+ */
+ function trimRight(string, chars, guard) {
+ var value = string;
+ string = baseToString(string);
+ if (!string) {
+ return string;
+ }
+ if (guard ? isIterateeCall(value, chars, guard) : chars == null) {
+ return string.slice(0, trimmedRightIndex(string) + 1);
+ }
+ return string.slice(0, charsRightIndex(string, (chars + '')) + 1);
+ }
- if (escape) {
- source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
+ /**
+ * Truncates `string` if it is longer than the given maximum string length.
+ * The last characters of the truncated string are replaced with the omission
+ * string which defaults to "...".
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to truncate.
+ * @param {Object|number} [options] The options object or maximum string length.
+ * @param {number} [options.length=30] The maximum string length.
+ * @param {string} [options.omission='...'] The string to indicate text is omitted.
+ * @param {RegExp|string} [options.separator] The separator pattern to truncate to.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {string} Returns the truncated string.
+ * @example
+ *
+ * _.trunc('hi-diddly-ho there, neighborino');
+ * // => 'hi-diddly-ho there, neighbo...'
+ *
+ * _.trunc('hi-diddly-ho there, neighborino', 24);
+ * // => 'hi-diddly-ho there, n...'
+ *
+ * _.trunc('hi-diddly-ho there, neighborino', {
+ * 'length': 24,
+ * 'separator': ' '
+ * });
+ * // => 'hi-diddly-ho there,...'
+ *
+ * _.trunc('hi-diddly-ho there, neighborino', {
+ * 'length': 24,
+ * 'separator': /,? +/
+ * });
+ * // => 'hi-diddly-ho there...'
+ *
+ * _.trunc('hi-diddly-ho there, neighborino', {
+ * 'omission': ' [...]'
+ * });
+ * // => 'hi-diddly-ho there, neig [...]'
+ */
+ function trunc(string, options, guard) {
+ if (guard && isIterateeCall(string, options, guard)) {
+ options = null;
+ }
+ var length = DEFAULT_TRUNC_LENGTH,
+ omission = DEFAULT_TRUNC_OMISSION;
+
+ if (options != null) {
+ if (isObject(options)) {
+ var separator = 'separator' in options ? options.separator : separator;
+ length = 'length' in options ? (+options.length || 0) : length;
+ omission = 'omission' in options ? baseToString(options.omission) : omission;
+ } else {
+ length = +options || 0;
+ }
}
- if (interpolate) {
- source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
+ string = baseToString(string);
+ if (length >= string.length) {
+ return string;
}
- if (evaluate) {
- source += "';\n" + evaluate + "\n__p+='";
+ var end = length - omission.length;
+ if (end < 1) {
+ return omission;
+ }
+ var result = string.slice(0, end);
+ if (separator == null) {
+ return result + omission;
+ }
+ if (isRegExp(separator)) {
+ if (string.slice(end).search(separator)) {
+ var match,
+ newEnd,
+ substring = string.slice(0, end);
+
+ if (!separator.global) {
+ separator = RegExp(separator.source, (reFlags.exec(separator) || '') + 'g');
+ }
+ separator.lastIndex = 0;
+ while ((match = separator.exec(substring))) {
+ newEnd = match.index;
+ }
+ result = result.slice(0, newEnd == null ? end : newEnd);
+ }
+ } else if (string.indexOf(separator, end) != end) {
+ var index = result.lastIndexOf(separator);
+ if (index > -1) {
+ result = result.slice(0, index);
+ }
+ }
+ return result + omission;
+ }
+
+ /**
+ * The inverse of `_.escape`; this method converts the HTML entities
+ * `&`, `<`, `>`, `"`, `'`, and ``` in `string` to their
+ * corresponding characters.
+ *
+ * **Note:** No other HTML entities are unescaped. To unescape additional HTML
+ * entities use a third-party library like [_he_](https://mths.be/he).
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to unescape.
+ * @returns {string} Returns the unescaped string.
+ * @example
+ *
+ * _.unescape('fred, barney, & pebbles');
+ * // => 'fred, barney, & pebbles'
+ */
+ function unescape(string) {
+ string = baseToString(string);
+ return (string && reHasEscapedHtml.test(string))
+ ? string.replace(reEscapedHtml, unescapeHtmlChar)
+ : string;
+ }
+
+ /**
+ * Splits `string` into an array of its words.
+ *
+ * @static
+ * @memberOf _
+ * @category String
+ * @param {string} [string=''] The string to inspect.
+ * @param {RegExp|string} [pattern] The pattern to match words.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Array} Returns the words of `string`.
+ * @example
+ *
+ * _.words('fred, barney, & pebbles');
+ * // => ['fred', 'barney', 'pebbles']
+ *
+ * _.words('fred, barney, & pebbles', /[^, ]+/g);
+ * // => ['fred', 'barney', '&', 'pebbles']
+ */
+ function words(string, pattern, guard) {
+ if (guard && isIterateeCall(string, pattern, guard)) {
+ pattern = null;
+ }
+ string = baseToString(string);
+ return string.match(pattern || reWords) || [];
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Attempts to invoke `func`, returning either the result or the caught error
+ * object. Any additional arguments are provided to `func` when it is invoked.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {Function} func The function to attempt.
+ * @returns {*} Returns the `func` result or error object.
+ * @example
+ *
+ * // avoid throwing errors for invalid selectors
+ * var elements = _.attempt(function(selector) {
+ * return document.querySelectorAll(selector);
+ * }, '>_>');
+ *
+ * if (_.isError(elements)) {
+ * elements = [];
+ * }
+ */
+ var attempt = restParam(function(func, args) {
+ try {
+ return func.apply(undefined, args);
+ } catch(e) {
+ return isError(e) ? e : new Error(e);
}
- index = offset + match.length;
- return match;
});
- source += "';\n";
- // If a variable is not specified, place data values in local scope.
- if (!settings.variable) source = 'with(obj||{}){\n' + source + '}\n';
+ /**
+ * Creates a function that invokes `func` with the `this` binding of `thisArg`
+ * and arguments of the created function. If `func` is a property name the
+ * created callback returns the property value for a given element. If `func`
+ * is an object the created callback returns `true` for elements that contain
+ * the equivalent object properties, otherwise it returns `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias iteratee
+ * @category Utility
+ * @param {*} [func=_.identity] The value to convert to a callback.
+ * @param {*} [thisArg] The `this` binding of `func`.
+ * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+ * @returns {Function} Returns the callback.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36 },
+ * { 'user': 'fred', 'age': 40 }
+ * ];
+ *
+ * // wrap to create custom callback shorthands
+ * _.callback = _.wrap(_.callback, function(callback, func, thisArg) {
+ * var match = /^(.+?)__([gl]t)(.+)$/.exec(func);
+ * if (!match) {
+ * return callback(func, thisArg);
+ * }
+ * return function(object) {
+ * return match[2] == 'gt'
+ * ? object[match[1]] > match[3]
+ * : object[match[1]] < match[3];
+ * };
+ * });
+ *
+ * _.filter(users, 'age__gt36');
+ * // => [{ 'user': 'fred', 'age': 40 }]
+ */
+ function callback(func, thisArg, guard) {
+ if (guard && isIterateeCall(func, thisArg, guard)) {
+ thisArg = null;
+ }
+ return baseCallback(func, thisArg);
+ }
- source = "var __t,__p='',__j=Array.prototype.join," +
- "print=function(){__p+=__j.call(arguments,'');};\n" +
- source + "return __p;\n";
+ /**
+ * Creates a function that returns `value`.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {*} value The value to return from the new function.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var object = { 'user': 'fred' };
+ * var getter = _.constant(object);
+ *
+ * getter() === object;
+ * // => true
+ */
+ function constant(value) {
+ return function() {
+ return value;
+ };
+ }
- try {
- render = new Function(settings.variable || 'obj', '_', source);
- } catch (e) {
- e.source = source;
- throw e;
+ /**
+ * This method returns the first argument provided to it.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {*} value Any value.
+ * @returns {*} Returns `value`.
+ * @example
+ *
+ * var object = { 'user': 'fred' };
+ *
+ * _.identity(object) === object;
+ * // => true
+ */
+ function identity(value) {
+ return value;
}
- if (data) return render(data, _);
- var template = function(data) {
- return render.call(this, data, _);
+ /**
+ * Creates a function which performs a deep comparison between a given object
+ * and `source`, returning `true` if the given object has equivalent property
+ * values, else `false`.
+ *
+ * **Note:** This method supports comparing arrays, booleans, `Date` objects,
+ * numbers, `Object` objects, regexes, and strings. Objects are compared by
+ * their own, not inherited, enumerable properties. For comparing a single
+ * own or inherited property value see `_.matchesProperty`.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {Object} source The object of property values to match.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36, 'active': true },
+ * { 'user': 'fred', 'age': 40, 'active': false }
+ * ];
+ *
+ * _.filter(users, _.matches({ 'age': 40, 'active': false }));
+ * // => [{ 'user': 'fred', 'age': 40, 'active': false }]
+ */
+ function matches(source) {
+ return baseMatches(baseClone(source, true));
+ }
+
+ /**
+ * Creates a function which compares the property value of `path` on a given
+ * object to `value`.
+ *
+ * **Note:** This method supports comparing arrays, booleans, `Date` objects,
+ * numbers, `Object` objects, regexes, and strings. Objects are compared by
+ * their own, not inherited, enumerable properties.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {Array|string} path The path of the property to get.
+ * @param {*} value The value to compare.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var users = [
+ * { 'user': 'barney' },
+ * { 'user': 'fred' }
+ * ];
+ *
+ * _.find(users, _.matchesProperty('user', 'fred'));
+ * // => { 'user': 'fred' }
+ */
+ function matchesProperty(path, value) {
+ return baseMatchesProperty(path, baseClone(value, true));
+ }
+
+ /**
+ * Creates a function which invokes the method at `path` on a given object.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {Array|string} path The path of the method to invoke.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var objects = [
+ * { 'a': { 'b': { 'c': _.constant(2) } } },
+ * { 'a': { 'b': { 'c': _.constant(1) } } }
+ * ];
+ *
+ * _.map(objects, _.method('a.b.c'));
+ * // => [2, 1]
+ *
+ * _.invoke(_.sortBy(objects, _.method(['a', 'b', 'c'])), 'a.b.c');
+ * // => [1, 2]
+ */
+ var method = restParam(function(path, args) {
+ return function(object) {
+ return invokePath(object, path, args);
+ }
+ });
+
+ /**
+ * The opposite of `_.method`; this method creates a function which invokes
+ * the method at a given path on `object`.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {Object} object The object to query.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var array = _.times(3, _.constant),
+ * object = { 'a': array, 'b': array, 'c': array };
+ *
+ * _.map(['a[2]', 'c[0]'], _.methodOf(object));
+ * // => [2, 0]
+ *
+ * _.map([['a', '2'], ['c', '0']], _.methodOf(object));
+ * // => [2, 0]
+ */
+ var methodOf = restParam(function(object, args) {
+ return function(path) {
+ return invokePath(object, path, args);
+ };
+ });
+
+ /**
+ * Adds all own enumerable function properties of a source object to the
+ * destination object. If `object` is a function then methods are added to
+ * its prototype as well.
+ *
+ * **Note:** Use `_.runInContext` to create a pristine `lodash` function to
+ * avoid conflicts caused by modifying the original.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {Function|Object} [object=lodash] The destination object.
+ * @param {Object} source The object of functions to add.
+ * @param {Object} [options] The options object.
+ * @param {boolean} [options.chain=true] Specify whether the functions added
+ * are chainable.
+ * @returns {Function|Object} Returns `object`.
+ * @example
+ *
+ * function vowels(string) {
+ * return _.filter(string, function(v) {
+ * return /[aeiou]/i.test(v);
+ * });
+ * }
+ *
+ * // use `_.runInContext` to avoid conflicts (esp. in Node.js)
+ * var _ = require('lodash').runInContext();
+ *
+ * _.mixin({ 'vowels': vowels });
+ * _.vowels('fred');
+ * // => ['e']
+ *
+ * _('fred').vowels().value();
+ * // => ['e']
+ *
+ * _.mixin({ 'vowels': vowels }, { 'chain': false });
+ * _('fred').vowels();
+ * // => ['e']
+ */
+ function mixin(object, source, options) {
+ if (options == null) {
+ var isObj = isObject(source),
+ props = isObj && keys(source),
+ methodNames = props && props.length && baseFunctions(source, props);
+
+ if (!(methodNames ? methodNames.length : isObj)) {
+ methodNames = false;
+ options = source;
+ source = object;
+ object = this;
+ }
+ }
+ if (!methodNames) {
+ methodNames = baseFunctions(source, keys(source));
+ }
+ var chain = true,
+ index = -1,
+ isFunc = isFunction(object),
+ length = methodNames.length;
+
+ if (options === false) {
+ chain = false;
+ } else if (isObject(options) && 'chain' in options) {
+ chain = options.chain;
+ }
+ while (++index < length) {
+ var methodName = methodNames[index],
+ func = source[methodName];
+
+ object[methodName] = func;
+ if (isFunc) {
+ object.prototype[methodName] = (function(func) {
+ return function() {
+ var chainAll = this.__chain__;
+ if (chain || chainAll) {
+ var result = object(this.__wrapped__),
+ actions = result.__actions__ = arrayCopy(this.__actions__);
+
+ actions.push({ 'func': func, 'args': arguments, 'thisArg': object });
+ result.__chain__ = chainAll;
+ return result;
+ }
+ var args = [this.value()];
+ push.apply(args, arguments);
+ return func.apply(object, args);
+ };
+ }(func));
+ }
+ }
+ return object;
+ }
+
+ /**
+ * Reverts the `_` variable to its previous value and returns a reference to
+ * the `lodash` function.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @returns {Function} Returns the `lodash` function.
+ * @example
+ *
+ * var lodash = _.noConflict();
+ */
+ function noConflict() {
+ context._ = oldDash;
+ return this;
+ }
+
+ /**
+ * A no-operation function which returns `undefined` regardless of the
+ * arguments it receives.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @example
+ *
+ * var object = { 'user': 'fred' };
+ *
+ * _.noop(object) === undefined;
+ * // => true
+ */
+ function noop() {
+ // No operation performed.
+ }
+
+ /**
+ * Creates a function which returns the property value at `path` on a
+ * given object.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {Array|string} path The path of the property to get.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var objects = [
+ * { 'a': { 'b': { 'c': 2 } } },
+ * { 'a': { 'b': { 'c': 1 } } }
+ * ];
+ *
+ * _.map(objects, _.property('a.b.c'));
+ * // => [2, 1]
+ *
+ * _.pluck(_.sortBy(objects, _.property(['a', 'b', 'c'])), 'a.b.c');
+ * // => [1, 2]
+ */
+ function property(path) {
+ return isKey(path) ? baseProperty(path) : basePropertyDeep(path);
+ }
+
+ /**
+ * The opposite of `_.property`; this method creates a function which returns
+ * the property value at a given path on `object`.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {Object} object The object to query.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var array = [0, 1, 2],
+ * object = { 'a': array, 'b': array, 'c': array };
+ *
+ * _.map(['a[2]', 'c[0]'], _.propertyOf(object));
+ * // => [2, 0]
+ *
+ * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));
+ * // => [2, 0]
+ */
+ function propertyOf(object) {
+ return function(path) {
+ return baseGet(object, toPath(path), path + '');
+ };
+ }
+
+ /**
+ * Creates an array of numbers (positive and/or negative) progressing from
+ * `start` up to, but not including, `end`. If `end` is not specified it is
+ * set to `start` with `start` then set to `0`. If `end` is less than `start`
+ * a zero-length range is created unless a negative `step` is specified.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {number} [start=0] The start of the range.
+ * @param {number} end The end of the range.
+ * @param {number} [step=1] The value to increment or decrement by.
+ * @returns {Array} Returns the new array of numbers.
+ * @example
+ *
+ * _.range(4);
+ * // => [0, 1, 2, 3]
+ *
+ * _.range(1, 5);
+ * // => [1, 2, 3, 4]
+ *
+ * _.range(0, 20, 5);
+ * // => [0, 5, 10, 15]
+ *
+ * _.range(0, -4, -1);
+ * // => [0, -1, -2, -3]
+ *
+ * _.range(1, 4, 0);
+ * // => [1, 1, 1]
+ *
+ * _.range(0);
+ * // => []
+ */
+ function range(start, end, step) {
+ if (step && isIterateeCall(start, end, step)) {
+ end = step = null;
+ }
+ start = +start || 0;
+ step = step == null ? 1 : (+step || 0);
+
+ if (end == null) {
+ end = start;
+ start = 0;
+ } else {
+ end = +end || 0;
+ }
+ // Use `Array(length)` so engines like Chakra and V8 avoid slower modes.
+ // See https://youtu.be/XAqIpGU8ZZk#t=17m25s for more details.
+ var index = -1,
+ length = nativeMax(ceil((end - start) / (step || 1)), 0),
+ result = Array(length);
+
+ while (++index < length) {
+ result[index] = start;
+ start += step;
+ }
+ return result;
+ }
+
+ /**
+ * Invokes the iteratee function `n` times, returning an array of the results
+ * of each invocation. The `iteratee` is bound to `thisArg` and invoked with
+ * one argument; (index).
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {number} n The number of times to invoke `iteratee`.
+ * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {Array} Returns the array of results.
+ * @example
+ *
+ * var diceRolls = _.times(3, _.partial(_.random, 1, 6, false));
+ * // => [3, 6, 4]
+ *
+ * _.times(3, function(n) {
+ * mage.castSpell(n);
+ * });
+ * // => invokes `mage.castSpell(n)` three times with `n` of `0`, `1`, and `2`
+ *
+ * _.times(3, function(n) {
+ * this.cast(n);
+ * }, mage);
+ * // => also invokes `mage.castSpell(n)` three times
+ */
+ function times(n, iteratee, thisArg) {
+ n = floor(n);
+
+ // Exit early to avoid a JSC JIT bug in Safari 8
+ // where `Array(0)` is treated as `Array(1)`.
+ if (n < 1 || !nativeIsFinite(n)) {
+ return [];
+ }
+ var index = -1,
+ result = Array(nativeMin(n, MAX_ARRAY_LENGTH));
+
+ iteratee = bindCallback(iteratee, thisArg, 1);
+ while (++index < n) {
+ if (index < MAX_ARRAY_LENGTH) {
+ result[index] = iteratee(index);
+ } else {
+ iteratee(index);
+ }
+ }
+ return result;
+ }
+
+ /**
+ * Generates a unique ID. If `prefix` is provided the ID is appended to it.
+ *
+ * @static
+ * @memberOf _
+ * @category Utility
+ * @param {string} [prefix] The value to prefix the ID with.
+ * @returns {string} Returns the unique ID.
+ * @example
+ *
+ * _.uniqueId('contact_');
+ * // => 'contact_104'
+ *
+ * _.uniqueId();
+ * // => '105'
+ */
+ function uniqueId(prefix) {
+ var id = ++idCounter;
+ return baseToString(prefix) + id;
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ /**
+ * Adds two numbers.
+ *
+ * @static
+ * @memberOf _
+ * @category Math
+ * @param {number} augend The first number to add.
+ * @param {number} addend The second number to add.
+ * @returns {number} Returns the sum.
+ * @example
+ *
+ * _.add(6, 4);
+ * // => 10
+ */
+ function add(augend, addend) {
+ return (+augend || 0) + (+addend || 0);
+ }
+
+ /**
+ * Gets the maximum value of `collection`. If `collection` is empty or falsey
+ * `-Infinity` is returned. If an iteratee function is provided it is invoked
+ * for each value in `collection` to generate the criterion by which the value
+ * is ranked. The `iteratee` is bound to `thisArg` and invoked with three
+ * arguments: (value, index, collection).
+ *
+ * If a property name is provided for `iteratee` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `iteratee` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Math
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [iteratee] The function invoked per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {*} Returns the maximum value.
+ * @example
+ *
+ * _.max([4, 2, 8, 6]);
+ * // => 8
+ *
+ * _.max([]);
+ * // => -Infinity
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36 },
+ * { 'user': 'fred', 'age': 40 }
+ * ];
+ *
+ * _.max(users, function(chr) {
+ * return chr.age;
+ * });
+ * // => { 'user': 'fred', 'age': 40 }
+ *
+ * // using the `_.property` callback shorthand
+ * _.max(users, 'age');
+ * // => { 'user': 'fred', 'age': 40 }
+ */
+ var max = createExtremum(arrayMax);
+
+ /**
+ * Gets the minimum value of `collection`. If `collection` is empty or falsey
+ * `Infinity` is returned. If an iteratee function is provided it is invoked
+ * for each value in `collection` to generate the criterion by which the value
+ * is ranked. The `iteratee` is bound to `thisArg` and invoked with three
+ * arguments: (value, index, collection).
+ *
+ * If a property name is provided for `iteratee` the created `_.property`
+ * style callback returns the property value of the given element.
+ *
+ * If a value is also provided for `thisArg` the created `_.matchesProperty`
+ * style callback returns `true` for elements that have a matching property
+ * value, else `false`.
+ *
+ * If an object is provided for `iteratee` the created `_.matches` style
+ * callback returns `true` for elements that have the properties of the given
+ * object, else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Math
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [iteratee] The function invoked per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {*} Returns the minimum value.
+ * @example
+ *
+ * _.min([4, 2, 8, 6]);
+ * // => 2
+ *
+ * _.min([]);
+ * // => Infinity
+ *
+ * var users = [
+ * { 'user': 'barney', 'age': 36 },
+ * { 'user': 'fred', 'age': 40 }
+ * ];
+ *
+ * _.min(users, function(chr) {
+ * return chr.age;
+ * });
+ * // => { 'user': 'barney', 'age': 36 }
+ *
+ * // using the `_.property` callback shorthand
+ * _.min(users, 'age');
+ * // => { 'user': 'barney', 'age': 36 }
+ */
+ var min = createExtremum(arrayMin, true);
+
+ /**
+ * Gets the sum of the values in `collection`.
+ *
+ * @static
+ * @memberOf _
+ * @category Math
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [iteratee] The function invoked per iteration.
+ * @param {*} [thisArg] The `this` binding of `iteratee`.
+ * @returns {number} Returns the sum.
+ * @example
+ *
+ * _.sum([4, 6]);
+ * // => 10
+ *
+ * _.sum({ 'a': 4, 'b': 6 });
+ * // => 10
+ *
+ * var objects = [
+ * { 'n': 4 },
+ * { 'n': 6 }
+ * ];
+ *
+ * _.sum(objects, function(object) {
+ * return object.n;
+ * });
+ * // => 10
+ *
+ * // using the `_.property` callback shorthand
+ * _.sum(objects, 'n');
+ * // => 10
+ */
+ function sum(collection, iteratee, thisArg) {
+ if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {
+ iteratee = null;
+ }
+ var func = getCallback(),
+ noIteratee = iteratee == null;
+
+ if (!(func === baseCallback && noIteratee)) {
+ noIteratee = false;
+ iteratee = func(iteratee, thisArg, 3);
+ }
+ return noIteratee
+ ? arraySum(isArray(collection) ? collection : toIterable(collection))
+ : baseSum(collection, iteratee);
+ }
+
+ /*------------------------------------------------------------------------*/
+
+ // Ensure wrappers are instances of `baseLodash`.
+ lodash.prototype = baseLodash.prototype;
+
+ LodashWrapper.prototype = baseCreate(baseLodash.prototype);
+ LodashWrapper.prototype.constructor = LodashWrapper;
+
+ LazyWrapper.prototype = baseCreate(baseLodash.prototype);
+ LazyWrapper.prototype.constructor = LazyWrapper;
+
+ // Add functions to the `Map` cache.
+ MapCache.prototype['delete'] = mapDelete;
+ MapCache.prototype.get = mapGet;
+ MapCache.prototype.has = mapHas;
+ MapCache.prototype.set = mapSet;
+
+ // Add functions to the `Set` cache.
+ SetCache.prototype.push = cachePush;
+
+ // Assign cache to `_.memoize`.
+ memoize.Cache = MapCache;
+
+ // Add functions that return wrapped values when chaining.
+ lodash.after = after;
+ lodash.ary = ary;
+ lodash.assign = assign;
+ lodash.at = at;
+ lodash.before = before;
+ lodash.bind = bind;
+ lodash.bindAll = bindAll;
+ lodash.bindKey = bindKey;
+ lodash.callback = callback;
+ lodash.chain = chain;
+ lodash.chunk = chunk;
+ lodash.compact = compact;
+ lodash.constant = constant;
+ lodash.countBy = countBy;
+ lodash.create = create;
+ lodash.curry = curry;
+ lodash.curryRight = curryRight;
+ lodash.debounce = debounce;
+ lodash.defaults = defaults;
+ lodash.defer = defer;
+ lodash.delay = delay;
+ lodash.difference = difference;
+ lodash.drop = drop;
+ lodash.dropRight = dropRight;
+ lodash.dropRightWhile = dropRightWhile;
+ lodash.dropWhile = dropWhile;
+ lodash.fill = fill;
+ lodash.filter = filter;
+ lodash.flatten = flatten;
+ lodash.flattenDeep = flattenDeep;
+ lodash.flow = flow;
+ lodash.flowRight = flowRight;
+ lodash.forEach = forEach;
+ lodash.forEachRight = forEachRight;
+ lodash.forIn = forIn;
+ lodash.forInRight = forInRight;
+ lodash.forOwn = forOwn;
+ lodash.forOwnRight = forOwnRight;
+ lodash.functions = functions;
+ lodash.groupBy = groupBy;
+ lodash.indexBy = indexBy;
+ lodash.initial = initial;
+ lodash.intersection = intersection;
+ lodash.invert = invert;
+ lodash.invoke = invoke;
+ lodash.keys = keys;
+ lodash.keysIn = keysIn;
+ lodash.map = map;
+ lodash.mapValues = mapValues;
+ lodash.matches = matches;
+ lodash.matchesProperty = matchesProperty;
+ lodash.memoize = memoize;
+ lodash.merge = merge;
+ lodash.method = method;
+ lodash.methodOf = methodOf;
+ lodash.mixin = mixin;
+ lodash.negate = negate;
+ lodash.omit = omit;
+ lodash.once = once;
+ lodash.pairs = pairs;
+ lodash.partial = partial;
+ lodash.partialRight = partialRight;
+ lodash.partition = partition;
+ lodash.pick = pick;
+ lodash.pluck = pluck;
+ lodash.property = property;
+ lodash.propertyOf = propertyOf;
+ lodash.pull = pull;
+ lodash.pullAt = pullAt;
+ lodash.range = range;
+ lodash.rearg = rearg;
+ lodash.reject = reject;
+ lodash.remove = remove;
+ lodash.rest = rest;
+ lodash.restParam = restParam;
+ lodash.set = set;
+ lodash.shuffle = shuffle;
+ lodash.slice = slice;
+ lodash.sortBy = sortBy;
+ lodash.sortByAll = sortByAll;
+ lodash.sortByOrder = sortByOrder;
+ lodash.spread = spread;
+ lodash.take = take;
+ lodash.takeRight = takeRight;
+ lodash.takeRightWhile = takeRightWhile;
+ lodash.takeWhile = takeWhile;
+ lodash.tap = tap;
+ lodash.throttle = throttle;
+ lodash.thru = thru;
+ lodash.times = times;
+ lodash.toArray = toArray;
+ lodash.toPlainObject = toPlainObject;
+ lodash.transform = transform;
+ lodash.union = union;
+ lodash.uniq = uniq;
+ lodash.unzip = unzip;
+ lodash.values = values;
+ lodash.valuesIn = valuesIn;
+ lodash.where = where;
+ lodash.without = without;
+ lodash.wrap = wrap;
+ lodash.xor = xor;
+ lodash.zip = zip;
+ lodash.zipObject = zipObject;
+
+ // Add aliases.
+ lodash.backflow = flowRight;
+ lodash.collect = map;
+ lodash.compose = flowRight;
+ lodash.each = forEach;
+ lodash.eachRight = forEachRight;
+ lodash.extend = assign;
+ lodash.iteratee = callback;
+ lodash.methods = functions;
+ lodash.object = zipObject;
+ lodash.select = filter;
+ lodash.tail = rest;
+ lodash.unique = uniq;
+
+ // Add functions to `lodash.prototype`.
+ mixin(lodash, lodash);
+
+ /*------------------------------------------------------------------------*/
+
+ // Add functions that return unwrapped values when chaining.
+ lodash.add = add;
+ lodash.attempt = attempt;
+ lodash.camelCase = camelCase;
+ lodash.capitalize = capitalize;
+ lodash.clone = clone;
+ lodash.cloneDeep = cloneDeep;
+ lodash.deburr = deburr;
+ lodash.endsWith = endsWith;
+ lodash.escape = escape;
+ lodash.escapeRegExp = escapeRegExp;
+ lodash.every = every;
+ lodash.find = find;
+ lodash.findIndex = findIndex;
+ lodash.findKey = findKey;
+ lodash.findLast = findLast;
+ lodash.findLastIndex = findLastIndex;
+ lodash.findLastKey = findLastKey;
+ lodash.findWhere = findWhere;
+ lodash.first = first;
+ lodash.get = get;
+ lodash.has = has;
+ lodash.identity = identity;
+ lodash.includes = includes;
+ lodash.indexOf = indexOf;
+ lodash.inRange = inRange;
+ lodash.isArguments = isArguments;
+ lodash.isArray = isArray;
+ lodash.isBoolean = isBoolean;
+ lodash.isDate = isDate;
+ lodash.isElement = isElement;
+ lodash.isEmpty = isEmpty;
+ lodash.isEqual = isEqual;
+ lodash.isError = isError;
+ lodash.isFinite = isFinite;
+ lodash.isFunction = isFunction;
+ lodash.isMatch = isMatch;
+ lodash.isNaN = isNaN;
+ lodash.isNative = isNative;
+ lodash.isNull = isNull;
+ lodash.isNumber = isNumber;
+ lodash.isObject = isObject;
+ lodash.isPlainObject = isPlainObject;
+ lodash.isRegExp = isRegExp;
+ lodash.isString = isString;
+ lodash.isTypedArray = isTypedArray;
+ lodash.isUndefined = isUndefined;
+ lodash.kebabCase = kebabCase;
+ lodash.last = last;
+ lodash.lastIndexOf = lastIndexOf;
+ lodash.max = max;
+ lodash.min = min;
+ lodash.noConflict = noConflict;
+ lodash.noop = noop;
+ lodash.now = now;
+ lodash.pad = pad;
+ lodash.padLeft = padLeft;
+ lodash.padRight = padRight;
+ lodash.parseInt = parseInt;
+ lodash.random = random;
+ lodash.reduce = reduce;
+ lodash.reduceRight = reduceRight;
+ lodash.repeat = repeat;
+ lodash.result = result;
+ lodash.runInContext = runInContext;
+ lodash.size = size;
+ lodash.snakeCase = snakeCase;
+ lodash.some = some;
+ lodash.sortedIndex = sortedIndex;
+ lodash.sortedLastIndex = sortedLastIndex;
+ lodash.startCase = startCase;
+ lodash.startsWith = startsWith;
+ lodash.sum = sum;
+ lodash.template = template;
+ lodash.trim = trim;
+ lodash.trimLeft = trimLeft;
+ lodash.trimRight = trimRight;
+ lodash.trunc = trunc;
+ lodash.unescape = unescape;
+ lodash.uniqueId = uniqueId;
+ lodash.words = words;
+
+ // Add aliases.
+ lodash.all = every;
+ lodash.any = some;
+ lodash.contains = includes;
+ lodash.detect = find;
+ lodash.foldl = reduce;
+ lodash.foldr = reduceRight;
+ lodash.head = first;
+ lodash.include = includes;
+ lodash.inject = reduce;
+
+ mixin(lodash, (function() {
+ var source = {};
+ baseForOwn(lodash, function(func, methodName) {
+ if (!lodash.prototype[methodName]) {
+ source[methodName] = func;
+ }
+ });
+ return source;
+ }()), false);
+
+ /*------------------------------------------------------------------------*/
+
+ // Add functions capable of returning wrapped and unwrapped values when chaining.
+ lodash.sample = sample;
+
+ lodash.prototype.sample = function(n) {
+ if (!this.__chain__ && n == null) {
+ return sample(this.value());
+ }
+ return this.thru(function(value) {
+ return sample(value, n);
+ });
};
- // Provide the compiled function source as a convenience for precompilation.
- template.source = 'function(' + (settings.variable || 'obj') + '){\n' + source + '}';
+ /*------------------------------------------------------------------------*/
- return template;
- };
+ /**
+ * The semantic version number.
+ *
+ * @static
+ * @memberOf _
+ * @type string
+ */
+ lodash.VERSION = VERSION;
- // Add a "chain" function, which will delegate to the wrapper.
- _.chain = function(obj) {
- return _(obj).chain();
- };
+ // Assign default placeholders.
+ arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {
+ lodash[methodName].placeholder = lodash;
+ });
- // OOP
- // ---------------
- // If Underscore is called as a function, it returns a wrapped object that
- // can be used OO-style. This wrapper holds altered versions of all the
- // underscore functions. Wrapped objects may be chained.
+ // Add `LazyWrapper` methods that accept an `iteratee` value.
+ arrayEach(['dropWhile', 'filter', 'map', 'takeWhile'], function(methodName, type) {
+ var isFilter = type != LAZY_MAP_FLAG,
+ isDropWhile = type == LAZY_DROP_WHILE_FLAG;
+
+ LazyWrapper.prototype[methodName] = function(iteratee, thisArg) {
+ var filtered = this.__filtered__,
+ result = (filtered && isDropWhile) ? new LazyWrapper(this) : this.clone(),
+ iteratees = result.__iteratees__ || (result.__iteratees__ = []);
+
+ iteratees.push({
+ 'done': false,
+ 'count': 0,
+ 'index': 0,
+ 'iteratee': getCallback(iteratee, thisArg, 1),
+ 'limit': -1,
+ 'type': type
+ });
- // Helper function to continue chaining intermediate results.
- var result = function(obj) {
- return this._chain ? _(obj).chain() : obj;
- };
+ result.__filtered__ = filtered || isFilter;
+ return result;
+ };
+ });
+
+ // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.
+ arrayEach(['drop', 'take'], function(methodName, index) {
+ var whileName = methodName + 'While';
+
+ LazyWrapper.prototype[methodName] = function(n) {
+ var filtered = this.__filtered__,
+ result = (filtered && !index) ? this.dropWhile() : this.clone();
+
+ n = n == null ? 1 : nativeMax(floor(n) || 0, 0);
+ if (filtered) {
+ if (index) {
+ result.__takeCount__ = nativeMin(result.__takeCount__, n);
+ } else {
+ last(result.__iteratees__).limit = n;
+ }
+ } else {
+ var views = result.__views__ || (result.__views__ = []);
+ views.push({ 'size': n, 'type': methodName + (result.__dir__ < 0 ? 'Right' : '') });
+ }
+ return result;
+ };
+
+ LazyWrapper.prototype[methodName + 'Right'] = function(n) {
+ return this.reverse()[methodName](n).reverse();
+ };
+
+ LazyWrapper.prototype[methodName + 'RightWhile'] = function(predicate, thisArg) {
+ return this.reverse()[whileName](predicate, thisArg).reverse();
+ };
+ });
+
+ // Add `LazyWrapper` methods for `_.first` and `_.last`.
+ arrayEach(['first', 'last'], function(methodName, index) {
+ var takeName = 'take' + (index ? 'Right' : '');
- // Add all of the Underscore functions to the wrapper object.
- _.mixin(_);
-
- // Add all mutator Array functions to the wrapper.
- each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {
- var method = ArrayProto[name];
- _.prototype[name] = function() {
- var obj = this._wrapped;
- method.apply(obj, arguments);
- if ((name == 'shift' || name == 'splice') && obj.length === 0) delete obj[0];
- return result.call(this, obj);
+ LazyWrapper.prototype[methodName] = function() {
+ return this[takeName](1).value()[0];
+ };
+ });
+
+ // Add `LazyWrapper` methods for `_.initial` and `_.rest`.
+ arrayEach(['initial', 'rest'], function(methodName, index) {
+ var dropName = 'drop' + (index ? '' : 'Right');
+
+ LazyWrapper.prototype[methodName] = function() {
+ return this[dropName](1);
+ };
+ });
+
+ // Add `LazyWrapper` methods for `_.pluck` and `_.where`.
+ arrayEach(['pluck', 'where'], function(methodName, index) {
+ var operationName = index ? 'filter' : 'map',
+ createCallback = index ? baseMatches : property;
+
+ LazyWrapper.prototype[methodName] = function(value) {
+ return this[operationName](createCallback(value));
+ };
+ });
+
+ LazyWrapper.prototype.compact = function() {
+ return this.filter(identity);
};
- });
- // Add all accessor Array functions to the wrapper.
- each(['concat', 'join', 'slice'], function(name) {
- var method = ArrayProto[name];
- _.prototype[name] = function() {
- return result.call(this, method.apply(this._wrapped, arguments));
+ LazyWrapper.prototype.reject = function(predicate, thisArg) {
+ predicate = getCallback(predicate, thisArg, 1);
+ return this.filter(function(value) {
+ return !predicate(value);
+ });
};
- });
- _.extend(_.prototype, {
+ LazyWrapper.prototype.slice = function(start, end) {
+ start = start == null ? 0 : (+start || 0);
+ var result = start < 0 ? this.takeRight(-start) : this.drop(start);
- // Start chaining a wrapped Underscore object.
- chain: function() {
- this._chain = true;
- return this;
- },
+ if (end !== undefined) {
+ end = (+end || 0);
+ result = end < 0 ? result.dropRight(-end) : result.take(end - start);
+ }
+ return result;
+ };
- // Extracts the result from a wrapped and chained object.
- value: function() {
- return this._wrapped;
- }
+ LazyWrapper.prototype.toArray = function() {
+ return this.drop(0);
+ };
- });
+ // Add `LazyWrapper` methods to `lodash.prototype`.
+ baseForOwn(LazyWrapper.prototype, function(func, methodName) {
+ var lodashFunc = lodash[methodName];
+ if (!lodashFunc) {
+ return;
+ }
+ var checkIteratee = /^(?:filter|map|reject)|While$/.test(methodName),
+ retUnwrapped = /^(?:first|last)$/.test(methodName);
+
+ lodash.prototype[methodName] = function() {
+ var args = arguments,
+ length = args.length,
+ chainAll = this.__chain__,
+ value = this.__wrapped__,
+ isHybrid = !!this.__actions__.length,
+ isLazy = value instanceof LazyWrapper,
+ iteratee = args[0],
+ useLazy = isLazy || isArray(value);
+
+ if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {
+ // avoid lazy use if the iteratee has a "length" value other than `1`
+ isLazy = useLazy = false;
+ }
+ var onlyLazy = isLazy && !isHybrid;
+ if (retUnwrapped && !chainAll) {
+ return onlyLazy
+ ? func.call(value)
+ : lodashFunc.call(lodash, this.value());
+ }
+ var interceptor = function(value) {
+ var otherArgs = [value];
+ push.apply(otherArgs, args);
+ return lodashFunc.apply(lodash, otherArgs);
+ };
+ if (useLazy) {
+ var wrapper = onlyLazy ? value : new LazyWrapper(this),
+ result = func.apply(wrapper, args);
+
+ if (!retUnwrapped && (isHybrid || result.__actions__)) {
+ var actions = result.__actions__ || (result.__actions__ = []);
+ actions.push({ 'func': thru, 'args': [interceptor], 'thisArg': lodash });
+ }
+ return new LodashWrapper(result, chainAll);
+ }
+ return this.thru(interceptor);
+ };
+ });
+
+ // Add `Array` and `String` methods to `lodash.prototype`.
+ arrayEach(['concat', 'join', 'pop', 'push', 'replace', 'shift', 'sort', 'splice', 'split', 'unshift'],
function(methodName) {
+ var func = (/^(?:replace|split)$/.test(methodName) ? stringProto : arrayProto)[methodName],
+ chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',
+ retUnwrapped = /^(?:join|pop|replace|shift)$/.test(methodName);
+
+ lodash.prototype[methodName] = function() {
+ var args = arguments;
+ if (retUnwrapped && !this.__chain__) {
+ return func.apply(this.value(), args);
+ }
+ return this[chainName](function(value) {
+ return func.apply(value, args);
+ });
+ };
+ });
- // AMD registration happens at the end for compatibility with AMD loaders
- // that may not enforce next-turn semantics on modules. Even though general
- // practice for AMD registration is to be anonymous, underscore registers
- // as a named module because, like jQuery, it is a base library that is
- // popular enough to be bundled in a third party lib, but not be part of
- // an AMD load request. Those cases could generate an error when an
- // anonymous define() is called outside of a loader request.
- if (typeof define === 'function' && define.amd) {
- define('underscore', [], function() {
+ // Map minified function names to their real names.
+ baseForOwn(LazyWrapper.prototype, function(func, methodName) {
+ var lodashFunc = lodash[methodName];
+ if (lodashFunc) {
+ var key = lodashFunc.name,
+ names = realNames[key] || (realNames[key] = []);
+
+ names.push({ 'name': methodName, 'func': lodashFunc });
+ }
+ });
+
+ realNames[createHybridWrapper(null, BIND_KEY_FLAG).name] = [{ 'name': 'wrapper', 'func': null }];
+
+ // Add functions to the lazy wrapper.
+ LazyWrapper.prototype.clone = lazyClone;
+ LazyWrapper.prototype.reverse = lazyReverse;
+ LazyWrapper.prototype.value = lazyValue;
+
+ // Add chaining functions to the `lodash` wrapper.
+ lodash.prototype.chain = wrapperChain;
+ lodash.prototype.commit = wrapperCommit;
+ lodash.prototype.plant = wrapperPlant;
+ lodash.prototype.reverse = wrapperReverse;
+ lodash.prototype.toString = wrapperToString;
+ lodash.prototype.run = lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value =
wrapperValue;
+
+ // Add function aliases to the `lodash` wrapper.
+ lodash.prototype.collect = lodash.prototype.map;
+ lodash.prototype.head = lodash.prototype.first;
+ lodash.prototype.select = lodash.prototype.filter;
+ lodash.prototype.tail = lodash.prototype.rest;
+
+ return lodash;
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ // Export lodash.
+ var _ = runInContext();
+
+ // Some AMD build optimizers like r.js check for condition patterns like the following:
+ if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {
+ // Expose lodash to the global object when an AMD loader is present to avoid
+ // errors in cases where lodash is loaded by a script tag and not intended
+ // as an AMD module. See http://requirejs.org/docs/errors.html#mismatch for
+ // more details.
+ root._ = _;
+
+ // Define as an anonymous module so, through path mapping, it can be
+ // referenced as the "underscore" module.
+ define(function() {
return _;
});
}
-}).call(this);
+ // Check for `exports` after `define` in case a build optimizer adds an `exports` object.
+ else if (freeExports && freeModule) {
+ // Export for Node.js or RingoJS.
+ if (moduleExports) {
+ (freeModule.exports = _)._ = _;
+ }
+ // Export for Narwhal or Rhino -require.
+ else {
+ freeExports._ = _;
+ }
+ }
+ else {
+ // Export for a browser or Rhino.
+ root._ = _;
+ }
+}.call(this));
+}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !==
"undefined" ? window : {})
},{}],13:[function(require,module,exports){
/*
* Lexical analysis and token construction.
@@ -2863,7 +13659,7 @@ function now() {
"use strict";
-var _ = require("underscore");
+var _ = require("lodash");
var events = require("events");
var reg = require("./reg.js");
var state = require("./state.js").state;
@@ -2890,7 +13686,13 @@ var Token = {
RegExp: 9,
TemplateHead: 10,
TemplateMiddle: 11,
- TemplateTail: 12
+ TemplateTail: 12,
+ NoSubstTemplate: 13
+};
+
+var Context = {
+ Block: 1,
+ Template: 2
};
// Object that handles postponed lexing verifications that checks the parsed
@@ -2900,11 +13702,11 @@ function asyncTrigger() {
var _checks = [];
return {
- push: function (fn) {
+ push: function(fn) {
_checks.push(fn);
},
- check: function () {
+ check: function() {
for (var check = 0; check < _checks.length; ++check) {
_checks[check]();
}
@@ -2929,7 +13731,7 @@ function asyncTrigger() {
* to token() method returning the next token, the Lexer object also
* emits events.
*
- * lex.on("Identifier", function (data) {
+ * lex.on("Identifier", function(data) {
* if (data.name.indexOf("_") >= 0) {
* // Produce a warning.
* }
@@ -2970,9 +13772,8 @@ function Lexer(source) {
this.from = 1;
this.input = "";
this.inComment = false;
- this.inTemplate = false;
- this.templateLine = null;
- this.templateChar = null;
+ this.context = [];
+ this.templateStarts = [];
for (var i = 0; i < state.option.indent; i += 1) {
state.tab += " ";
@@ -2982,12 +13783,32 @@ function Lexer(source) {
Lexer.prototype = {
_lines: [],
- getLines: function () {
+ inContext: function(ctxType) {
+ return this.context.length > 0 && this.context[this.context.length - 1].type === ctxType;
+ },
+
+ pushContext: function(ctxType) {
+ this.context.push({ type: ctxType });
+ },
+
+ popContext: function() {
+ return this.context.pop();
+ },
+
+ isContext: function(context) {
+ return this.context.length > 0 && this.context[this.context.length - 1] === context;
+ },
+
+ currentContext: function() {
+ return this.context.length > 0 && this.context[this.context.length - 1];
+ },
+
+ getLines: function() {
this._lines = state.lines;
return this._lines;
},
- setLines: function (val) {
+ setLines: function(val) {
this._lines = val;
state.lines = this._lines;
},
@@ -2996,14 +13817,14 @@ Lexer.prototype = {
* Return the next i character without actually moving the
* char pointer.
*/
- peek: function (i) {
+ peek: function(i) {
return this.input.charAt(i || 0);
},
/*
* Move the char pointer forward i times.
*/
- skip: function (i) {
+ skip: function(i) {
i = i || 1;
this.char += i;
this.input = this.input.slice(i);
@@ -3014,12 +13835,12 @@ Lexer.prototype = {
* Underscore.js i.e. you can subscribe to multiple events with
* one call:
*
- * lex.on("Identifier Number", function (data) {
+ * lex.on("Identifier Number", function(data) {
* // ...
* });
*/
- on: function (names, listener) {
- names.split(" ").forEach(function (name) {
+ on: function(names, listener) {
+ names.split(" ").forEach(function(name) {
this.emitter.on(name, listener);
}.bind(this));
},
@@ -3028,7 +13849,7 @@ Lexer.prototype = {
* Trigger a token event. All arguments will be passed to each
* listener.
*/
- trigger: function () {
+ trigger: function() {
this.emitter.emit.apply(this.emitter, Array.prototype.slice.call(arguments));
},
@@ -3039,8 +13860,8 @@ Lexer.prototype = {
* by the parser. This avoids parser's peek() to give the lexer
* a false context.
*/
- triggerAsync: function (type, args, checks, fn) {
- checks.push(function () {
+ triggerAsync: function(type, args, checks, fn) {
+ checks.push(function() {
if (fn()) {
this.trigger(type, args);
}
@@ -3054,7 +13875,7 @@ Lexer.prototype = {
* This method's implementation was heavily influenced by the
* scanPunctuator function in the Esprima parser's source code.
*/
- scanPunctuator: function () {
+ scanPunctuator: function() {
var ch1 = this.peek();
var ch2, ch3, ch4;
@@ -3075,8 +13896,6 @@ Lexer.prototype = {
case ")":
case ";":
case ",":
- case "{":
- case "}":
case "[":
case "]":
case ":":
@@ -3087,6 +13906,24 @@ Lexer.prototype = {
value: ch1
};
+ // A block/object opener
+ case "{":
+ this.pushContext(Context.Block);
+ return {
+ type: Token.Punctuator,
+ value: ch1
+ };
+
+ // A block/object closer
+ case "}":
+ if (this.inContext(Context.Block)) {
+ this.popContext();
+ }
+ return {
+ type: Token.Punctuator,
+ value: ch1
+ };
+
// A pound sign (for Node shebangs)
case "#":
return {
@@ -3160,7 +13997,7 @@ Lexer.prototype = {
}
// 2-character punctuators: <= >= == != ++ -- << >> && ||
- // += -= *= %= &= |= ^= (but not /=, see below)
+ // += -= *= %= &= |= ^= /=
if (ch1 === ch2 && ("+-<>&|".indexOf(ch1) >= 0)) {
return {
type: Token.Punctuator,
@@ -3168,7 +14005,7 @@ Lexer.prototype = {
};
}
- if ("<>=!+-*%&|^".indexOf(ch1) >= 0) {
+ if ("<>=!+-*%&|^/".indexOf(ch1) >= 0) {
if (ch2 === "=") {
return {
type: Token.Punctuator,
@@ -3182,22 +14019,6 @@ Lexer.prototype = {
};
}
- // Special case: /=.
-
- if (ch1 === "/") {
- if (ch2 === "=") {
- return {
- type: Token.Punctuator,
- value: "/="
- };
- }
-
- return {
- type: Token.Punctuator,
- value: "/"
- };
- }
-
return null;
},
@@ -3211,12 +14032,13 @@ Lexer.prototype = {
* also recognizes JSHint- and JSLint-specific comments such as
* /*jshint, /*jslint, /*globals and so on.
*/
- scanComments: function () {
+ scanComments: function() {
var ch1 = this.peek();
var ch2 = this.peek(1);
var rest = this.input.substr(2);
var startLine = this.line;
var startChar = this.char;
+ var self = this;
// Create a comment token object and make sure it
// has all the data JSHint needs to work with special
@@ -3235,7 +14057,12 @@ Lexer.prototype = {
body = body.replace(/\n/g, " ");
- special.forEach(function (str) {
+ if (label === "/*" && reg.fallsThrough.test(body)) {
+ isSpecial = true;
+ commentType = "falls through";
+ }
+
+ special.forEach(function(str) {
if (isSpecial) {
return;
}
@@ -3271,6 +14098,26 @@ Lexer.prototype = {
commentType = "globals";
break;
default:
+ var options = body.split(":").map(function(v) {
+ return v.replace(/^\s+/, "").replace(/\s+$/, "");
+ });
+
+ if (options.length === 2) {
+ switch (options[0]) {
+ case "ignore":
+ switch (options[1]) {
+ case "start":
+ self.ignoringLinterErrors = true;
+ isSpecial = false;
+ break;
+ case "end":
+ self.ignoringLinterErrors = false;
+ isSpecial = false;
+ break;
+ }
+ }
+ }
+
commentType = str;
}
});
@@ -3351,7 +14198,7 @@ Lexer.prototype = {
* Extract a keyword out of the next sequence of characters or
* return 'null' if its not possible.
*/
- scanKeyword: function () {
+ scanKeyword: function() {
var result = /^[a-zA-Z_$][a-zA-Z0-9_$]*/.exec(this.input);
var keywords = [
"if", "in", "do", "var", "for", "new",
@@ -3380,7 +14227,7 @@ Lexer.prototype = {
* to Identifier this method can also produce BooleanLiteral
* (true/false) and NullLiteral (null).
*/
- scanIdentifier: function () {
+ scanIdentifier: function() {
var id = "";
var index = 0;
var type, char;
@@ -3425,7 +14272,7 @@ Lexer.prototype = {
return null;
}.bind(this);
- var getIdentifierStart = function () {
+ var getIdentifierStart = function() {
/*jshint validthis:true */
var chr = this.peek(index);
var code = chr.charCodeAt(0);
@@ -3451,7 +14298,7 @@ Lexer.prototype = {
return null;
}.bind(this);
- var getIdentifierPart = function () {
+ var getIdentifierPart = function() {
/*jshint validthis:true */
var chr = this.peek(index);
var code = chr.charCodeAt(0);
@@ -3528,7 +14375,7 @@ Lexer.prototype = {
* This method's implementation was heavily influenced by the
* scanNumericLiteral function in the Esprima parser's source code.
*/
- scanNumericLiteral: function () {
+ scanNumericLiteral: function() {
var index = 0;
var value = "";
var length = this.input.length;
@@ -3585,12 +14432,12 @@ Lexer.prototype = {
isAllowedDigit = isOctalDigit;
base = 8;
- if (!state.option.esnext) {
+ if (!state.inES6(true)) {
this.trigger("warning", {
code: "W119",
line: this.line,
character: this.char,
- data: [ "Octal integer literal" ]
+ data: [ "Octal integer literal", "6" ]
});
}
@@ -3603,12 +14450,12 @@ Lexer.prototype = {
isAllowedDigit = isBinaryDigit;
base = 2;
- if (!state.option.esnext) {
+ if (!state.inES6(true)) {
this.trigger("warning", {
code: "W119",
line: this.line,
character: this.char,
- data: [ "Binary integer literal" ]
+ data: [ "Binary integer literal", "6" ]
});
}
@@ -3739,7 +14586,7 @@ Lexer.prototype = {
// Assumes previously parsed character was \ (=== '\\') and was not skipped.
- scanEscapeSequence: function (checks) {
+ scanEscapeSequence: function(checks) {
var allowNewLine = false;
var jump = 1;
this.skip();
@@ -3752,7 +14599,7 @@ Lexer.prototype = {
line: this.line,
character: this.char,
data: [ "\\'" ]
- }, checks, function () {return state.jsonMode; });
+ }, checks, function() {return state.jsonMode; });
break;
case "b":
char = "\\b";
@@ -3780,10 +14627,20 @@ Lexer.prototype = {
line: this.line,
character: this.char
}, checks,
- function () { return n >= 0 && n <= 7 && state.directive["use strict"]; });
+ function() { return n >= 0 && n <= 7 && state.isStrict(); });
break;
case "u":
- char = String.fromCharCode(parseInt(this.input.substr(1, 4), 16));
+ var hexCode = this.input.substr(1, 4);
+ var code = parseInt(hexCode, 16);
+ if (isNaN(code)) {
+ this.trigger("warning", {
+ code: "W052",
+ line: this.line,
+ character: this.char,
+ data: [ "u" + hexCode ]
+ });
+ }
+ char = String.fromCharCode(code);
jump = 5;
break;
case "v":
@@ -3792,7 +14649,7 @@ Lexer.prototype = {
line: this.line,
character: this.char,
data: [ "\\v" ]
- }, checks, function () { return state.jsonMode; });
+ }, checks, function() { return state.jsonMode; });
char = "\v";
break;
@@ -3804,7 +14661,7 @@ Lexer.prototype = {
line: this.line,
character: this.char,
data: [ "\\x-" ]
- }, checks, function () { return state.jsonMode; });
+ }, checks, function() { return state.jsonMode; });
char = String.fromCharCode(x);
jump = 3;
@@ -3823,7 +14680,7 @@ Lexer.prototype = {
break;
}
- return {char: char, jump: jump, allowNewLine: allowNewLine};
+ return { char: char, jump: jump, allowNewLine: allowNewLine };
},
/*
@@ -3832,78 +14689,96 @@ Lexer.prototype = {
* literals can span across multiple lines, this method has to move
* the char pointer.
*/
- scanTemplateLiteral: function (checks) {
+ scanTemplateLiteral: function(checks) {
var tokenType;
- var value = '';
+ var value = "";
var ch;
+ var startLine = this.line;
+ var startChar = this.char;
+ var depth = this.templateStarts.length;
- // String must start with a backtick.
- if (!this.inTemplate) {
- if (!state.option.esnext || this.peek() !== "`") {
- return null;
+ if (this.peek() === "`") {
+ if (!state.inES6(true)) {
+ this.trigger("warning", {
+ code: "W119",
+ line: this.line,
+ character: this.char,
+ data: ["template literal syntax", "6"]
+ });
}
- this.templateLine = this.line;
- this.templateChar = this.char;
+ // Template must start with a backtick.
+ tokenType = Token.TemplateHead;
+ this.templateStarts.push({ line: this.line, char: this.char });
+ depth = this.templateStarts.length;
this.skip(1);
- } else if (this.peek() !== '}') {
- // If we're in a template, and we don't have a '}', lex something else instead.
+ this.pushContext(Context.Template);
+ } else if (this.inContext(Context.Template) && this.peek() === "}") {
+ // If we're in a template context, and we have a '}', lex a TemplateMiddle.
+ tokenType = Token.TemplateMiddle;
+ } else {
+ // Go lex something else.
return null;
}
while (this.peek() !== "`") {
while ((ch = this.peek()) === "") {
+ value += "\n";
if (!this.nextLine()) {
- // Unclosed template literal --- point to the starting line, or the EOF?
- tokenType = this.inTemplate ? Token.TemplateHead : Token.TemplateMiddle;
- this.inTemplate = false;
+ // Unclosed template literal --- point to the starting "`"
+ var startPos = this.templateStarts.pop();
this.trigger("error", {
code: "E052",
- line: this.templateLine,
- character: this.templateChar
+ line: startPos.line,
+ character: startPos.char
});
return {
type: tokenType,
value: value,
- isUnclosed: true
+ startLine: startLine,
+ startChar: startChar,
+ isUnclosed: true,
+ depth: depth,
+ context: this.popContext()
};
}
}
if (ch === '$' && this.peek(1) === '{') {
value += '${';
- tokenType = value.charAt(0) === '}' ? Token.TemplateMiddle : Token.TemplateHead;
- // Either TokenHead or TokenMiddle --- depending on if the initial value
- // is '}' or not.
this.skip(2);
- this.inTemplate = true;
return {
type: tokenType,
value: value,
- isUnclosed: false
+ startLine: startLine,
+ startChar: startChar,
+ isUnclosed: false,
+ depth: depth,
+ context: this.currentContext()
};
} else if (ch === '\\') {
var escape = this.scanEscapeSequence(checks);
value += escape.char;
this.skip(escape.jump);
- } else if (ch === '`') {
- break;
- } else {
+ } else if (ch !== '`') {
// Otherwise, append the value and continue.
value += ch;
this.skip(1);
}
}
- // Final value is either TokenTail or NoSubstititionTemplate --- essentially a string
- tokenType = this.inTemplate ? Token.TemplateTail : Token.StringLiteral;
- this.inTemplate = false;
+ // Final value is either NoSubstTemplate or TemplateTail
+ tokenType = tokenType === Token.TemplateHead ? Token.NoSubstTemplate : Token.TemplateTail;
this.skip(1);
+ this.templateStarts.pop();
return {
type: tokenType,
value: value,
+ startLine: startLine,
+ startChar: startChar,
isUnclosed: false,
- quote: "`"
+ depth: depth,
+ context: this.popContext()
};
},
@@ -3918,7 +14793,7 @@ Lexer.prototype = {
* var str = "hello\
* world";
*/
- scanStringLiteral: function (checks) {
+ scanStringLiteral: function(checks) {
/*jshint loopfunc:true */
var quote = this.peek();
@@ -3932,7 +14807,7 @@ Lexer.prototype = {
code: "W108",
line: this.line,
character: this.char // +1?
- }, checks, function () { return state.jsonMode && quote !== "\""; });
+ }, checks, function() { return state.jsonMode && quote !== "\""; });
var value = "";
var startLine = this.line;
@@ -3942,7 +14817,7 @@ Lexer.prototype = {
this.skip();
while (this.peek() !== quote) {
- while (this.peek() === "") { // End Of Line
+ if (this.peek() === "") { // End Of Line
// If an EOL is not preceded by a backslash, show a warning
// and proceed like it was a legit multi-line string where
@@ -3967,13 +14842,13 @@ Lexer.prototype = {
code: "W043",
line: this.line,
character: this.char
- }, checks, function () { return !state.option.multistr; });
+ }, checks, function() { return !state.option.multistr; });
this.triggerAsync("warning", {
code: "W042",
line: this.line,
character: this.char
- }, checks, function () { return state.jsonMode && state.option.multistr; });
+ }, checks, function() { return state.jsonMode && state.option.multistr; });
}
// If we get an EOF inside of an unclosed string, show an
@@ -3989,43 +14864,49 @@ Lexer.prototype = {
return {
type: Token.StringLiteral,
value: value,
+ startLine: startLine,
+ startChar: startChar,
isUnclosed: true,
quote: quote
};
}
- }
- allowNewLine = false;
- var char = this.peek();
- var jump = 1; // A length of a jump, after we're done
- // parsing this character.
+ } else { // Any character other than End Of Line
- if (char < " ") {
- // Warn about a control character in a string.
- this.trigger("warning", {
- code: "W113",
- line: this.line,
- character: this.char,
- data: [ "<non-printable>" ]
- });
- }
+ allowNewLine = false;
+ var char = this.peek();
+ var jump = 1; // A length of a jump, after we're done
+ // parsing this character.
- // Special treatment for some escaped characters.
- if (char === "\\") {
- var parsed = this.scanEscapeSequence(checks);
- char = parsed.char;
- jump = parsed.jump;
- allowNewLine = parsed.allowNewLine;
- }
+ if (char < " ") {
+ // Warn about a control character in a string.
+ this.trigger("warning", {
+ code: "W113",
+ line: this.line,
+ character: this.char,
+ data: [ "<non-printable>" ]
+ });
+ }
- value += char;
- this.skip(jump);
+ // Special treatment for some escaped characters.
+ if (char === "\\") {
+ var parsed = this.scanEscapeSequence(checks);
+ char = parsed.char;
+ jump = parsed.jump;
+ allowNewLine = parsed.allowNewLine;
+ }
+
+ value += char;
+ this.skip(jump);
+ }
}
this.skip();
return {
type: Token.StringLiteral,
value: value,
+ startLine: startLine,
+ startChar: startChar,
isUnclosed: false,
quote: quote
};
@@ -4041,7 +14922,7 @@ Lexer.prototype = {
* rare edge cases where one JavaScript engine complains about
* your regular expression while others don't.
*/
- scanRegExp: function () {
+ scanRegExp: function() {
var index = 0;
var length = this.input.length;
var char = this.peek();
@@ -4052,7 +14933,7 @@ Lexer.prototype = {
var isCharSet = false;
var terminated;
- var scanUnexpectedChars = function () {
+ var scanUnexpectedChars = function() {
// Unexpected control character
if (char < " ") {
malformed = true;
@@ -4203,7 +15084,7 @@ Lexer.prototype = {
* can be mistakenly typed on OS X with option-space. Non UTF-8 web
* pages with non-breaking pages produce syntax errors.
*/
- scanNonBreakingSpaces: function () {
+ scanNonBreakingSpaces: function() {
return state.option.nonbsp ?
this.input.search(/(\u00A0)/) : -1;
},
@@ -4211,7 +15092,7 @@ Lexer.prototype = {
/*
* Scan for characters that get silently deleted by one or more browsers.
*/
- scanUnsafeChars: function () {
+ scanUnsafeChars: function() {
return this.input.search(reg.unsafeChars);
},
@@ -4219,18 +15100,13 @@ Lexer.prototype = {
* Produce the next raw token or return 'null' if no tokens can be matched.
* This method skips over all space characters.
*/
- next: function (checks) {
+ next: function(checks) {
this.from = this.char;
// Move to the next non-space character.
- var start;
- if (/\s/.test(this.peek())) {
- start = this.char;
-
- while (/\s/.test(this.peek())) {
- this.from += 1;
- this.skip();
- }
+ while (/\s/.test(this.peek())) {
+ this.from += 1;
+ this.skip();
}
// Methods that work with multi-line structures and move the
@@ -4267,7 +15143,7 @@ Lexer.prototype = {
* Switch to the next line and reset all char pointers. Once
* switched, this method also checks for other minor warnings.
*/
- nextLine: function () {
+ nextLine: function() {
var char;
if (this.line >= this.getLines().length) {
@@ -4281,21 +15157,21 @@ Lexer.prototype = {
var inputTrimmed = this.input.trim();
- var startsWith = function () {
- return _.some(arguments, function (prefix) {
+ var startsWith = function() {
+ return _.some(arguments, function(prefix) {
return inputTrimmed.indexOf(prefix) === 0;
});
};
- var endsWith = function () {
- return _.some(arguments, function (suffix) {
+ var endsWith = function() {
+ return _.some(arguments, function(suffix) {
return inputTrimmed.indexOf(suffix, inputTrimmed.length - suffix.length) !== -1;
});
};
// If we are ignoring linter errors, replace the input with empty string
// if it doesn't already at least start or end a multi-line comment
- if (state.ignoreLinterErrors === true) {
+ if (this.ignoringLinterErrors === true) {
if (!startsWith("/*", "//") && !(this.inComment && endsWith("*/"))) {
this.input = "";
}
@@ -4316,7 +15192,8 @@ Lexer.prototype = {
// If there is a limit on line length, warn when lines get too
// long.
- if (state.option.maxlen && state.option.maxlen < this.input.length) {
+ if (!this.ignoringLinterErrors && state.option.maxlen &&
+ state.option.maxlen < this.input.length) {
var inComment = this.inComment ||
startsWith.call(inputTrimmed, "//") ||
startsWith.call(inputTrimmed, "/*");
@@ -4335,7 +15212,7 @@ Lexer.prototype = {
* This is simply a synonym for nextLine() method with a friendlier
* public name.
*/
- start: function () {
+ start: function() {
this.nextLine();
},
@@ -4343,7 +15220,7 @@ Lexer.prototype = {
* Produce the next token. This function is called by advance() to get
* the next token. It returns a token in a JSLint-compatible format.
*/
- token: function () {
+ token: function() {
/*jshint loopfunc:true */
var checks = asyncTrigger();
var token;
@@ -4355,7 +15232,7 @@ Lexer.prototype = {
}
var meta = token.meta;
- if (meta && meta.isFutureReservedWord && state.option.inES5()) {
+ if (meta && meta.isFutureReservedWord && state.inES5()) {
// ES3 FutureReservedWord in an ES5 environment.
if (!meta.es5) {
return false;
@@ -4364,7 +15241,7 @@ Lexer.prototype = {
// Some ES5 FutureReservedWord identifiers are active only
// within a strict mode environment.
if (meta.strictOnly) {
- if (!state.option.strict && !state.directive["use strict"]) {
+ if (!state.option.strict && !state.isStrict()) {
return false;
}
}
@@ -4378,7 +15255,7 @@ Lexer.prototype = {
}
// Produce a token object.
- var create = function (type, value, isProperty, token) {
+ var create = function(type, value, isProperty, token) {
/*jshint validthis:true */
var obj;
@@ -4405,7 +15282,8 @@ Lexer.prototype = {
}
if (type === "(identifier)") {
- if (value === "return" || value === "case" || value === "typeof") {
+ if (value === "return" || value === "case" ||
+ value === "typeof" || value === "instanceof") {
this.prereg = true;
}
@@ -4419,6 +15297,10 @@ Lexer.prototype = {
}
}
+ if (type === "(template)" || type === "(template middle)") {
+ this.prereg = true;
+ }
+
if (!obj) {
obj = Object.create(state.syntax[type]);
}
@@ -4430,6 +15312,21 @@ Lexer.prototype = {
obj.character = this.char;
obj.from = this.from;
if (obj.identifier && token) obj.raw_text = token.text || token.value;
+ if (token && token.startLine && token.startLine !== this.line) {
+ obj.startLine = token.startLine;
+ }
+ if (token && token.context) {
+ // Context of current token
+ obj.context = token.context;
+ }
+ if (token && token.depth) {
+ // Nested template depth
+ obj.depth = token.depth;
+ }
+ if (token && token.isUnclosed) {
+ // Mark token as unclosed string / template literal
+ obj.isUnclosed = token.isUnclosed;
+ }
if (isProperty && obj.identifier) {
obj.isProperty = isProperty;
@@ -4442,7 +15339,16 @@ Lexer.prototype = {
for (;;) {
if (!this.input.length) {
- return create(this.nextLine() ? "(endline)" : "(end)", "");
+ if (this.nextLine()) {
+ return create("(endline)", "");
+ }
+
+ if (this.exhausted) {
+ return null;
+ }
+
+ this.exhausted = true;
+ return create("(end)", "");
}
token = this.next(checks);
@@ -4469,48 +15375,67 @@ Lexer.prototype = {
line: this.line,
char: this.char,
from: this.from,
+ startLine: token.startLine,
+ startChar: token.startChar,
value: token.value,
quote: token.quote
- }, checks, function () { return true; });
+ }, checks, function() { return true; });
- return create("(string)", token.value);
+ return create("(string)", token.value, null, token);
case Token.TemplateHead:
this.trigger("TemplateHead", {
line: this.line,
char: this.char,
from: this.from,
+ startLine: token.startLine,
+ startChar: token.startChar,
value: token.value
});
- return create("(template)", token.value);
+ return create("(template)", token.value, null, token);
case Token.TemplateMiddle:
this.trigger("TemplateMiddle", {
line: this.line,
char: this.char,
from: this.from,
+ startLine: token.startLine,
+ startChar: token.startChar,
value: token.value
});
- return create("(template middle)", token.value);
+ return create("(template middle)", token.value, null, token);
case Token.TemplateTail:
this.trigger("TemplateTail", {
line: this.line,
char: this.char,
from: this.from,
+ startLine: token.startLine,
+ startChar: token.startChar,
value: token.value
});
- return create("(template tail)", token.value);
+ return create("(template tail)", token.value, null, token);
+
+ case Token.NoSubstTemplate:
+ this.trigger("NoSubstTemplate", {
+ line: this.line,
+ char: this.char,
+ from: this.from,
+ startLine: token.startLine,
+ startChar: token.startChar,
+ value: token.value
+ });
+ return create("(no subst template)", token.value, null, token);
case Token.Identifier:
- this.trigger("Identifier", {
+ this.triggerAsync("Identifier", {
line: this.line,
char: this.char,
- from: this.form,
+ from: this.from,
name: token.value,
raw_name: token.text,
isProperty: state.tokens.curr.id === "."
- });
+ }, checks, function() { return true; });
/* falls through */
case Token.Keyword:
@@ -4533,14 +15458,14 @@ Lexer.prototype = {
line: this.line,
character: this.char,
data: [ "0x-" ]
- }, checks, function () { return token.base === 16 && state.jsonMode; });
+ }, checks, function() { return token.base === 16 && state.jsonMode; });
this.triggerAsync("warning", {
code: "W115",
line: this.line,
character: this.char
- }, checks, function () {
- return state.directive["use strict"] && token.base === 8 && token.isLegacy;
+ }, checks, function() {
+ return state.isStrict() && token.base === 8 && token.isLegacy;
});
this.trigger("Number", {
@@ -4586,11 +15511,12 @@ Lexer.prototype = {
};
exports.Lexer = Lexer;
+exports.Context = Context;
-},{"../data/ascii-identifier-data.js":1,"../data/non-ascii-identifier-part-only.js":2,"../data/non-ascii-identifier-start.js":3,"./reg.js":17,"./state.js":18,"events":5,"underscore":12}],14:[function(require,module,exports){
+},{"../data/ascii-identifier-data.js":1,"../data/non-ascii-identifier-part-only.js":2,"../data/non-ascii-identifier-start.js":3,"./reg.js":17,"./state.js":19,"events":5,"lodash":12}],14:[function(require,module,exports){
"use strict";
-var _ = require("underscore");
+var _ = require("lodash");
var errors = {
// JSHint options
@@ -4610,7 +15536,7 @@ var errors = {
E010: "'with' is not allowed in strict mode.",
// Constants
- E011: "const '{a}' has already been declared.",
+ E011: "'{a}' has already been declared.",
E012: "const '{a}' is initialized to 'undefined'.",
E013: "Attempting to override '{a}' which is a constant.",
@@ -4652,14 +15578,19 @@ var errors = {
E044: null,
E045: "Invalid for each loop.",
E046: "A yield statement shall be within a generator function (with syntax: `function*`)",
- E047: null, // Vacant
- E048: "Let declaration not directly within block.",
+ E047: null,
+ E048: "{a} declaration not directly within block.",
E049: "A {a} cannot be named '{b}'.",
E050: "Mozilla requires the yield expression to be parenthesized here.",
- E051: "Regular parameters cannot come after default parameters.",
+ E051: null,
E052: "Unclosed template literal.",
E053: "Export declaration must be in global scope.",
- E054: "Class properties must be methods. Expected '(' but instead saw '{a}'."
+ E054: "Class properties must be methods. Expected '(' but instead saw '{a}'.",
+ E055: "The '{a}' option cannot be set after any executable code.",
+ E056: "'{a}' was used before it was declared, which is illegal for '{b}' variables.",
+ E057: "Invalid meta property: '{a}.{b}'.",
+ E058: "Missing semicolon.",
+ E059: "Incompatible values for the '{a}' and '{b}' linting options."
};
var warnings = {
@@ -4683,7 +15614,8 @@ var warnings = {
W018: "Confusing use of '{a}'.",
W019: "Use the isNaN function to compare with NaN.",
W020: "Read only.",
- W021: "'{a}' is a function.",
+ W021: "Reassignment of '{a}', which is is a {b}. " +
+ "Use 'var' or 'let' to declare bindings that may change.",
W022: "Do not assign to the exception parameter.",
W023: "Expected an identifier in an assignment and instead saw a function invocation.",
W024: "Expected an identifier and instead saw '{a}' (a reserved word).",
@@ -4757,7 +15689,7 @@ var warnings = {
W089: "The body of a for in should be wrapped in an if statement to filter " +
"unwanted properties from the prototype.",
W090: "'{a}' is not a statement label.",
- W091: "'{a}' is out of scope.",
+ W091: null,
W093: "Did you mean to return a conditional instead of an assignment?",
W094: "Unexpected comma.",
W095: "Expected a string and instead saw {a}.",
@@ -4769,7 +15701,7 @@ var warnings = {
W101: "Line is too long.",
W102: null,
W103: "The '{a}' property is deprecated.",
- W104: "'{a}' is available in ES6 (use esnext option) or Mozilla JS extensions (use moz).",
+ W104: "'{a}' is available in ES{b} (use 'esversion: {b}') or Mozilla JS extensions (use moz).",
W105: "Unexpected {a} in '{b}'.",
W106: "Identifier '{a}' is not in camel case.",
W107: "Script URL.",
@@ -4783,15 +15715,27 @@ var warnings = {
W116: "Expected '{a}' and instead saw '{b}'.",
W117: "'{a}' is not defined.",
W118: "'{a}' is only available in Mozilla JavaScript extensions (use moz option).",
- W119: "'{a}' is only available in ES6 (use esnext option).",
+ W119: "'{a}' is only available in ES{b} (use 'esversion: {b}').",
W120: "You might be leaking a variable ({a}) here.",
W121: "Extending prototype of native object: '{a}'.",
W122: "Invalid typeof value '{a}'",
W123: "'{a}' is already defined in outer scope.",
W124: "A generator function shall contain a yield statement.",
- W125: "This line contains non-breaking spaces: http://jshint.com/doc/options/#nonbsp";,
- W126: "Grouping operator is unnecessary for lone expressions.",
- W127: "Unexpected use of a comma operator."
+ W125: "This line contains non-breaking spaces: http://jshint.com/docs/options/#nonbsp";,
+ W126: "Unnecessary grouping operator.",
+ W127: "Unexpected use of a comma operator.",
+ W128: "Empty array elements require elision=true.",
+ W129: "'{a}' is defined in a future version of JavaScript. Use a " +
+ "different variable name to avoid migration issues.",
+ W130: "Invalid element after rest element.",
+ W131: "Invalid parameter after rest parameter.",
+ W132: "`var` declarations are forbidden. Use `let` or `const` instead.",
+ W133: "Invalid for-{a} loop left-hand-side: {b}.",
+ W134: "The '{a}' option is only available when linting ECMAScript {b} code.",
+ W135: "{a} may not be supported by non-browser environments.",
+ W136: "'{a}' must be in function scope.",
+ W137: "Empty destructuring.",
+ W138: "Regular parameters should not come after default parameters."
};
var info = {
@@ -4804,19 +15748,19 @@ exports.errors = {};
exports.warnings = {};
exports.info = {};
-_.each(errors, function (desc, code) {
+_.each(errors, function(desc, code) {
exports.errors[code] = { code: code, desc: desc };
});
-_.each(warnings, function (desc, code) {
+_.each(warnings, function(desc, code) {
exports.warnings[code] = { code: code, desc: desc };
});
-_.each(info, function (desc, code) {
+_.each(info, function(desc, code) {
exports.info[code] = { code: code, desc: desc };
});
-},{"underscore":12}],15:[function(require,module,exports){
+},{"lodash":12}],15:[function(require,module,exports){
"use strict";
function NameStack() {
@@ -4920,6 +15864,11 @@ exports.bool = {
/**
* This option allows you to force all variable names to use either
* camelCase style or UPPER_CASE with underscores.
+ *
+ * @deprecated JSHint is limiting its scope to issues of code correctness.
+ * If you would like to enforce rules relating to code style,
+ * check out [the JSCS
+ * project](https://github.com/jscs-dev/node-jscs).
*/
camelcase : true,
@@ -4952,6 +15901,14 @@ exports.bool = {
eqeqeq : true,
/**
+ * This option enables warnings about the use of identifiers which are
+ * defined in future versions of JavaScript. Although overwriting them has
+ * no effect in contexts where they are not implemented, this practice can
+ * cause issues when migrating codebases to newer versions of the language.
+ */
+ futurehostile: true,
+
+ /**
* This option suppresses warnings about invalid `typeof` operator values.
* This operator has only [a limited set of possible return
* values](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/typeof).
@@ -4973,6 +15930,8 @@ exports.bool = {
* specification. Use this option if you need your program to be executable
* in older browsers—such as Internet Explorer 6/7/8/9—and other legacy
* JavaScript environments.
+ *
+ * @deprecated Use `esversion: 3` instead.
*/
es3 : true,
@@ -4980,6 +15939,8 @@ exports.bool = {
* This option enables syntax first defined in [the ECMAScript 5.1
* specification](http://es5.github.io/). This includes allowing reserved
* keywords as object properties.
+ *
+ * @deprecated Use `esversion: 5` instead.
*/
es5 : true,
@@ -5025,19 +15986,15 @@ exports.bool = {
funcscope : true,
/**
- * This option suppresses warnings about the use of global strict mode.
- * Global strict mode can break third-party widgets so it is not
- * recommended.
- *
- * For more info about strict mode see the `strict` option.
- */
- globalstrict: true,
-
- /**
* This option prohibits the use of immediate function invocations without
* wrapping them in parentheses. Wrapping parentheses assists readers of
* your code in understanding that the expression is the result of a
* function, and not the function itself.
+ *
+ * @deprecated JSHint is limiting its scope to issues of code correctness.
+ * If you would like to enforce rules relating to code style,
+ * check out [the JSCS
+ * project](https://github.com/jscs-dev/node-jscs).
*/
immed : true,
@@ -5060,6 +16017,11 @@ exports.bool = {
* important because when the function that was intended to be used with
* `new` is used without it, `this` will point to the global object instead
* of a new object.
+ *
+ * @deprecated JSHint is limiting its scope to issues of code correctness.
+ * If you would like to enforce rules relating to code style,
+ * check out [the JSCS
+ * project](https://github.com/jscs-dev/node-jscs).
*/
newcap : true,
@@ -5084,6 +16046,11 @@ exports.bool = {
* originally warning for all empty blocks and we simply made it optional.
* There were no studies reporting that empty blocks in JavaScript break
* your code in any way.
+ *
+ * @deprecated JSHint is limiting its scope to issues of code correctness.
+ * If you would like to enforce rules relating to code style,
+ * check out [the JSCS
+ * project](https://github.com/jscs-dev/node-jscs).
*/
noempty : true,
@@ -5124,19 +16091,35 @@ exports.bool = {
undef : true,
/**
- * This option prohibits the use of the grouping operator for
- * single-expression statements. This unecessary usage commonly reflects
- * a misunderstanding of unary operators, for example:
+ * This option prohibits the use of the grouping operator when it is not
+ * strictly required. Such usage commonly reflects a misunderstanding of
+ * unary operators, for example:
*
* // jshint singleGroups: true
*
- * delete(obj.attr); // Warning: Grouping operator is unnecessary for lone expressions.
+ * delete(obj.attr); // Warning: Unnecessary grouping operator.
*/
singleGroups: false,
/**
- * This option is a short hand for the most strict JSHint configuration. It
- * enables all enforcing options and disables all relaxing options.
+ * When set to true, the use of VariableStatements are forbidden.
+ * For example:
+ *
+ * // jshint varstmt: true
+ *
+ * var a; // Warning: `var` declarations are forbidden. Use `let` or `const` instead.
+ */
+ varstmt: false,
+
+ /**
+ * This option is a short hand for the most strict JSHint configuration as
+ * available in JSHint version 2.6.3. It enables all enforcing options and
+ * disables all relaxing options that were defined in that release.
+ *
+ * @deprecated The option cannot be maintained without automatically opting
+ * users in to new features. This can lead to unexpected
+ * warnings/errors in when upgrading between minor versions of
+ * JSHint.
*/
enforceall : false
},
@@ -5178,6 +16161,11 @@ exports.bool = {
*
* text = "Hello\
* World"; // Warning, there is a space after \
+ *
+ * @deprecated JSHint is limiting its scope to issues of code correctness.
+ * If you would like to enforce rules relating to code style,
+ * check out [the JSCS
+ * project](https://github.com/jscs-dev/node-jscs).
*/
multistr : true,
@@ -5202,15 +16190,6 @@ exports.bool = {
boss : true,
/**
- * This option defines globals available when your core is running inside
- * of the PhantomJS runtime environment. [PhantomJS](http://phantomjs.org/)
- * is a headless WebKit scriptable with a JavaScript API. It has fast and
- * native support for various web standards: DOM handling, CSS selector,
- * JSON, Canvas, and SVG.
- */
- phantom : true,
-
- /**
* This option suppresses warnings about the use of `eval`. The use of
* `eval` is discouraged because it can make your code vulnerable to
* various injection attacks and it makes it hard for JavaScript
@@ -5219,6 +16198,17 @@ exports.bool = {
evil : true,
/**
+ * This option suppresses warnings about the use of global strict mode.
+ * Global strict mode can break third-party widgets so it is not
+ * recommended.
+ *
+ * For more info about strict mode see the `strict` option.
+ *
+ * @deprecated Use `strict: "global"`.
+ */
+ globalstrict: true,
+
+ /**
* This option prohibits the use of unary increment and decrement
* operators. Some people think that `++` and `--` reduces the quality of
* their coding styles and there are programming languages—such as
@@ -5238,23 +16228,13 @@ exports.bool = {
scripturl : true,
/**
- * This option requires all functions to run in ECMAScript 5's strict mode.
- * [Strict mode](https://developer.mozilla.org/en/JavaScript/Strict_mode)
- * is a way to opt in to a restricted variant of JavaScript. Strict mode
- * eliminates some JavaScript pitfalls that didn't cause errors by changing
- * them to produce errors. It also fixes mistakes that made it difficult
- * for the JavaScript engines to perform certain optimizations.
- *
- * *Note:* This option enables strict mode for function scope only. It
- * *prohibits* the global scoped strict mode because it might break
- * third-party widgets on your page. If you really want to use global
- * strict mode, see the *globalstrict* option.
- */
- strict : true,
-
- /**
* This option suppresses warnings about using `[]` notation when it can be
* expressed in dot notation: `person['name']` vs. `person.name`.
+ *
+ * @deprecated JSHint is limiting its scope to issues of code correctness.
+ * If you would like to enforce rules relating to code style,
+ * check out [the JSCS
+ * project](https://github.com/jscs-dev/node-jscs).
*/
sub : true,
@@ -5276,6 +16256,11 @@ exports.bool = {
* This option suppresses most of the warnings about possibly unsafe line
* breakings in your code. It doesn't suppress warnings about comma-first
* coding style. To suppress those you have to use `laxcomma` (see below).
+ *
+ * @deprecated JSHint is limiting its scope to issues of code correctness.
+ * If you would like to enforce rules relating to code style,
+ * check out [the JSCS
+ * project](https://github.com/jscs-dev/node-jscs).
*/
laxbreak : true,
@@ -5287,6 +16272,11 @@ exports.bool = {
* , handle: 'valueof'
* , role: 'SW Engineer'
* };
+ *
+ * @deprecated JSHint is limiting its scope to issues of code correctness.
+ * If you would like to enforce rules relating to code style,
+ * check out [the JSCS
+ * project](https://github.com/jscs-dev/node-jscs).
*/
laxcomma : true,
@@ -5390,15 +16380,22 @@ exports.bool = {
/**
* This option tells JSHint that your code uses ECMAScript 6 specific
- * syntax. Note that these features are not finalized yet and not all
- * browsers implement them.
+ * syntax. Note that not all browsers implement these features.
*
* More info:
*
- * * [Draft Specification for ES.next (ECMA-262 Ed.
- * 6)](http://wiki.ecmascript.org/doku.php?id=harmony:specification_drafts)
+ * * [Specification for ECMAScript
+ * 6](http://www.ecma-international.org/ecma-262/6.0/index.html)
+ *
+ * @deprecated Use `esversion: 6` instead.
*/
- esnext : true
+ esnext : true,
+
+ /**
+ * This option tells JSHint that your code uses ES3 array elision elements,
+ * or empty elements (for example, `[1, , , 4, , , 7]`).
+ */
+ elision : true,
},
// Third party globals
@@ -5478,6 +16475,12 @@ exports.bool = {
mocha : true,
/**
+ * This option informs JSHint that the input code describes an ECMAScript 6
+ * module. All module code is interpreted as strict mode code.
+ */
+ module : true,
+
+ /**
* This option defines globals available when your code is running as a
* script for the [Windows Script
* Host](http://en.wikipedia.org/wiki/Windows_Script_Host).
@@ -5536,7 +16539,16 @@ exports.bool = {
* * [JavaScript typed
* arrays](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Typed_arrays)
*/
- typed : true
+ typed : true,
+
+ /**
+ * This option defines globals available when your core is running inside
+ * of the PhantomJS runtime environment. [PhantomJS](http://phantomjs.org/)
+ * is a headless WebKit scriptable with a JavaScript API. It has fast and
+ * native support for various web standards: DOM handling, CSS selector,
+ * JSON, Canvas, and SVG.
+ */
+ phantom : true
},
// Obsolete options
@@ -5554,11 +16566,19 @@ exports.val = {
/**
* This option lets you set the maximum length of a line.
+ *
+ * @deprecated JSHint is limiting its scope to issues of code correctness. If
+ * you would like to enforce rules relating to code style, check
+ * out [the JSCS project](https://github.com/jscs-dev/node-jscs).
*/
maxlen : false,
/**
* This option sets a specific tab width for your code.
+ *
+ * @deprecated JSHint is limiting its scope to issues of code correctness. If
+ * you would like to enforce rules relating to code style, check
+ * out [the JSCS project](https://github.com/jscs-dev/node-jscs).
*/
indent : false,
@@ -5568,7 +16588,18 @@ exports.val = {
*/
maxerr : false,
- predef : false, // predef is deprecated and being replaced by globals
+ /**
+ * This option allows you to control which variables JSHint considers to be
+ * implicitly defined in the environment. Configure it with an array of
+ * string values. Prefixing a variable name with a hyphen (-) character will
+ * remove that name from the collection of predefined variables.
+ *
+ * JSHint will consider variables declared in this way to be read-only.
+ *
+ * This option cannot be specified in-line; it may only be used via the
+ * JavaScript API or from an external configuration file.
+ */
+ predef : false,
/**
* This option can be used to specify a white list of global variables that
@@ -5583,6 +16614,9 @@ exports.val = {
* See also the "environment" options: a set of options to be used as short
* hand for enabling global variables defined in common JavaScript
* environments.
+ *
+ * To configure `globals` within an individual file, see [Inline
+ * Configuration](http://jshint.com/docs/#inline-configuration).
*/
globals : false,
@@ -5592,6 +16626,10 @@ exports.val = {
* one particular style but want some consistency, `"single"` if you want to
* allow only single quotes and `"double"` if you want to allow only double
* quotes.
+ *
+ * @deprecated JSHint is limiting its scope to issues of code correctness. If
+ * you would like to enforce rules relating to code style, check
+ * out [the JSCS project](https://github.com/jscs-dev/node-jscs).
*/
quotmark : false,
@@ -5679,6 +16717,25 @@ exports.val = {
shadow : false,
/**
+ * This option requires the code to run in ECMAScript 5's strict mode.
+ * [Strict mode](https://developer.mozilla.org/en/JavaScript/Strict_mode)
+ * is a way to opt in to a restricted variant of JavaScript. Strict mode
+ * eliminates some JavaScript pitfalls that didn't cause errors by changing
+ * them to produce errors. It also fixes mistakes that made it difficult
+ * for the JavaScript engines to perform certain optimizations.
+ *
+ * - "global" - there must be a `"use strict";` directive at global level
+ * - "implied" - lint the code as if there is the `"use strict";` directive
+ * - false - disable warnings about strict mode
+ * - true - there must be a `"use strict";` directive at function level;
+ * this is preferable for scripts intended to be loaded in web
+ * browsers directly because enabling strict mode globally
+ * could adversely effect other scripts running on the same
+ * page
+ */
+ strict : true,
+
+ /**
* This option warns when you define and never use your variables. It is very
* useful for general code cleanup, especially when used in addition to
* `undef`.
@@ -5728,8 +16785,24 @@ exports.val = {
// end - stop ignoring lines, starting on the next line
// line - ignore warnings / errors for just a single line
// (this option does not bypass the lexer)
- ignoreDelimiters: false // array of start/end delimiters used to ignore
- // certain chunks from code
+
+ ignoreDelimiters: false, // array of start/end delimiters used to ignore
+ // certain chunks from code
+
+ /**
+ * This option is used to specify the ECMAScript version to which the code
+ * must adhere. It can assume one of the following values:
+ * - `3` - If you need your program to be executable
+ * in older browsers—such as Internet Explorer 6/7/8/9—and other legacy
+ * JavaScript environments
+ * - `5` - To enable syntax first defined in [the ECMAScript 5.1
+ * specification](http://www.ecma-international.org/ecma-262/5.1/index.html).
+ * This includes allowing reserved keywords as object properties.
+ * - `6` - To tell JSHint that your code uses [ECMAScript
+ * 6](http://www.ecma-international.org/ecma-262/6.0/index.html) specific
+ * syntax. Note that not all browsers implement them.
+ */
+ esversion: 5
};
// These are JSHint boolean options which are shared with JSLint
@@ -5771,6 +16844,13 @@ exports.removed = {
trailing: true
};
+// Add options here which should not be automatically enforced by
+// `enforceall`.
+exports.noenforceall = {
+ varstmt: true,
+ strict: true
+};
+
},{}],17:[function(require,module,exports){
/*
* Regular expressions. Some of these are stupidly long.
@@ -5805,7 +16885,7 @@ exports.identifier = /^([a-zA-Z_$][a-zA-Z0-9_$]*)$/;
exports.javascriptURL = /^(?:javascript|jscript|ecmascript|vbscript|livescript)\s*:/i;
// Catches /* falls through */ comments (ft)
-exports.fallsThrough = /^\s*\/\*\s*falls?\sthrough\s*\*\/\s*$/;
+exports.fallsThrough = /^\s*falls?\sthrough\s*$/;
// very conservative rule (eg: only one space between the start of the comment and the first character)
// to relax the maxlen option
@@ -5813,12 +16893,990 @@ exports.maxlenException = /^(?:(?:\/\/|\/\*|\*) ?)?[^ ]+$/;
},{}],18:[function(require,module,exports){
"use strict";
+
+var _ = require("lodash");
+var events = require("events");
+
+// Used to denote membership in lookup tables (a primitive value such as `true`
+// would be silently rejected for the property name "__proto__" in some
+// environments)
+var marker = {};
+
+/**
+ * Creates a scope manager that handles variables and labels, storing usages
+ * and resolving when variables are used and undefined
+ */
+var scopeManager = function(state, predefined, exported, declared) {
+
+ var _current;
+ var _scopeStack = [];
+
+ function _newScope(type) {
+ _current = {
+ "(labels)": Object.create(null),
+ "(usages)": Object.create(null),
+ "(breakLabels)": Object.create(null),
+ "(parent)": _current,
+ "(type)": type,
+ "(params)": (type === "functionparams" || type === "catchparams") ? [] : null
+ };
+ _scopeStack.push(_current);
+ }
+
+ _newScope("global");
+ _current["(predefined)"] = predefined;
+
+ var _currentFunctBody = _current; // this is the block after the params = function
+
+ var usedPredefinedAndGlobals = Object.create(null);
+ var impliedGlobals = Object.create(null);
+ var unuseds = [];
+ var emitter = new events.EventEmitter();
+
+ function warning(code, token) {
+ emitter.emit("warning", {
+ code: code,
+ token: token,
+ data: _.slice(arguments, 2)
+ });
+ }
+
+ function error(code, token) {
+ emitter.emit("warning", {
+ code: code,
+ token: token,
+ data: _.slice(arguments, 2)
+ });
+ }
+
+ function _setupUsages(labelName) {
+ if (!_current["(usages)"][labelName]) {
+ _current["(usages)"][labelName] = {
+ "(modified)": [],
+ "(reassigned)": [],
+ "(tokens)": []
+ };
+ }
+ }
+
+ var _getUnusedOption = function(unused_opt) {
+ if (unused_opt === undefined) {
+ unused_opt = state.option.unused;
+ }
+
+ if (unused_opt === true) {
+ unused_opt = "last-param";
+ }
+
+ return unused_opt;
+ };
+
+ var _warnUnused = function(name, tkn, type, unused_opt) {
+ var line = tkn.line;
+ var chr = tkn.from;
+ var raw_name = tkn.raw_text || name;
+
+ unused_opt = _getUnusedOption(unused_opt);
+
+ var warnable_types = {
+ "vars": ["var"],
+ "last-param": ["var", "param"],
+ "strict": ["var", "param", "last-param"]
+ };
+
+ if (unused_opt) {
+ if (warnable_types[unused_opt] && warnable_types[unused_opt].indexOf(type) !== -1) {
+ warning("W098", { line: line, from: chr }, raw_name);
+ }
+ }
+
+ // inconsistent - see gh-1894
+ if (unused_opt || type === "var") {
+ unuseds.push({
+ name: name,
+ line: line,
+ character: chr
+ });
+ }
+ };
+
+ /**
+ * Checks the current scope for unused identifiers
+ */
+ function _checkForUnused() {
+ // function params are handled specially
+ // assume that parameters are the only thing declared in the param scope
+ if (_current["(type)"] === "functionparams") {
+ _checkParams();
+ return;
+ }
+ var curentLabels = _current["(labels)"];
+ for (var labelName in curentLabels) {
+ if (curentLabels[labelName]) {
+ if (curentLabels[labelName]["(type)"] !== "exception" &&
+ curentLabels[labelName]["(unused)"]) {
+ _warnUnused(labelName, curentLabels[labelName]["(token)"], "var");
+ }
+ }
+ }
+ }
+
+ /**
+ * Checks the current scope for unused parameters
+ * Must be called in a function parameter scope
+ */
+ function _checkParams() {
+ var params = _current["(params)"];
+
+ if (!params) {
+ return;
+ }
+
+ var param = params.pop();
+ var unused_opt;
+
+ while (param) {
+ var label = _current["(labels)"][param];
+
+ unused_opt = _getUnusedOption(state.funct["(unusedOption)"]);
+
+ // 'undefined' is a special case for (function(window, undefined) { ... })();
+ // patterns.
+ if (param === "undefined")
+ return;
+
+ if (label["(unused)"]) {
+ _warnUnused(param, label["(token)"], "param", state.funct["(unusedOption)"]);
+ } else if (unused_opt === "last-param") {
+ return;
+ }
+
+ param = params.pop();
+ }
+ }
+
+ /**
+ * Finds the relevant label's scope, searching from nearest outwards
+ * @returns {Object} the scope the label was found in
+ */
+ function _getLabel(labelName) {
+ for (var i = _scopeStack.length - 1 ; i >= 0; --i) {
+ var scopeLabels = _scopeStack[i]["(labels)"];
+ if (scopeLabels[labelName]) {
+ return scopeLabels;
+ }
+ }
+ }
+
+ function usedSoFarInCurrentFunction(labelName) {
+ // used so far in this whole function and any sub functions
+ for (var i = _scopeStack.length - 1; i >= 0; i--) {
+ var current = _scopeStack[i];
+ if (current["(usages)"][labelName]) {
+ return current["(usages)"][labelName];
+ }
+ if (current === _currentFunctBody) {
+ break;
+ }
+ }
+ return false;
+ }
+
+ function _checkOuterShadow(labelName, token) {
+
+ // only check if shadow is outer
+ if (state.option.shadow !== "outer") {
+ return;
+ }
+
+ var isGlobal = _currentFunctBody["(type)"] === "global",
+ isNewFunction = _current["(type)"] === "functionparams";
+
+ var outsideCurrentFunction = !isGlobal;
+ for (var i = 0; i < _scopeStack.length; i++) {
+ var stackItem = _scopeStack[i];
+
+ if (!isNewFunction && _scopeStack[i + 1] === _currentFunctBody) {
+ outsideCurrentFunction = false;
+ }
+ if (outsideCurrentFunction && stackItem["(labels)"][labelName]) {
+ warning("W123", token, labelName);
+ }
+ if (stackItem["(breakLabels)"][labelName]) {
+ warning("W123", token, labelName);
+ }
+ }
+ }
+
+ function _latedefWarning(type, labelName, token) {
+ if (state.option.latedef) {
+ // if either latedef is strict and this is a function
+ // or this is not a function
+ if ((state.option.latedef === true && type === "function") ||
+ type !== "function") {
+ warning("W003", token, labelName);
+ }
+ }
+ }
+
+ var scopeManagerInst = {
+
+ on: function(names, listener) {
+ names.split(" ").forEach(function(name) {
+ emitter.on(name, listener);
+ });
+ },
+
+ isPredefined: function(labelName) {
+ return !this.has(labelName) && _.has(_scopeStack[0]["(predefined)"], labelName);
+ },
+
+ /**
+ * Tell the manager we are entering a new block of code
+ * @param {string} [type] - The type of the block. Valid values are
+ * "functionparams", "catchparams" and
+ * "functionouter"
+ */
+ stack: function(type) {
+ var previousScope = _current;
+ _newScope(type);
+
+ if (!type && previousScope["(type)"] === "functionparams") {
+
+ _current["(isFuncBody)"] = true;
+ _current["(context)"] = _currentFunctBody;
+ _currentFunctBody = _current;
+ }
+ },
+
+ unstack: function() {
+ // jshint proto: true
+ var subScope = _scopeStack.length > 1 ? _scopeStack[_scopeStack.length - 2] : null;
+ var isUnstackingFunctionBody = _current === _currentFunctBody,
+ isUnstackingFunctionParams = _current["(type)"] === "functionparams",
+ isUnstackingFunctionOuter = _current["(type)"] === "functionouter";
+
+ var i, j;
+ var currentUsages = _current["(usages)"];
+ var currentLabels = _current["(labels)"];
+ var usedLabelNameList = Object.keys(currentUsages);
+
+ if (currentUsages.__proto__ && usedLabelNameList.indexOf("__proto__") === -1) {
+ usedLabelNameList.push("__proto__");
+ }
+
+ for (i = 0; i < usedLabelNameList.length; i++) {
+ var usedLabelName = usedLabelNameList[i];
+
+ var usage = currentUsages[usedLabelName];
+ var usedLabel = currentLabels[usedLabelName];
+ if (usedLabel) {
+ var usedLabelType = usedLabel["(type)"];
+
+ if (usedLabel["(useOutsideOfScope)"] && !state.option.funcscope) {
+ var usedTokens = usage["(tokens)"];
+ if (usedTokens) {
+ for (j = 0; j < usedTokens.length; j++) {
+ // Keep the consistency of https://github.com/jshint/jshint/issues/2409
+ if (usedLabel["(function)"] === usedTokens[j]["(function)"]) {
+ error("W038", usedTokens[j], usedLabelName);
+ }
+ }
+ }
+ }
+
+ // mark the label used
+ _current["(labels)"][usedLabelName]["(unused)"] = false;
+
+ // check for modifying a const
+ if (usedLabelType === "const" && usage["(modified)"]) {
+ for (j = 0; j < usage["(modified)"].length; j++) {
+ error("E013", usage["(modified)"][j], usedLabelName);
+ }
+ }
+
+ // check for re-assigning a function declaration
+ if ((usedLabelType === "function" || usedLabelType === "class") &&
+ usage["(reassigned)"]) {
+ for (j = 0; j < usage["(reassigned)"].length; j++) {
+ if (!usage["(reassigned)"][j].ignoreW021) {
+ warning("W021", usage["(reassigned)"][j], usedLabelName, usedLabelType);
+ }
+ }
+ }
+ continue;
+ }
+
+ if (isUnstackingFunctionOuter) {
+ state.funct["(isCapturing)"] = true;
+ }
+
+ if (subScope) {
+ // not exiting the global scope, so copy the usage down in case its an out of scope usage
+ if (!subScope["(usages)"][usedLabelName]) {
+ subScope["(usages)"][usedLabelName] = usage;
+ if (isUnstackingFunctionBody) {
+ subScope["(usages)"][usedLabelName]["(onlyUsedSubFunction)"] = true;
+ }
+ } else {
+ var subScopeUsage = subScope["(usages)"][usedLabelName];
+ subScopeUsage["(modified)"] = subScopeUsage["(modified)"].concat(usage["(modified)"]);
+ subScopeUsage["(tokens)"] = subScopeUsage["(tokens)"].concat(usage["(tokens)"]);
+ subScopeUsage["(reassigned)"] =
+ subScopeUsage["(reassigned)"].concat(usage["(reassigned)"]);
+ }
+ } else {
+ // this is exiting global scope, so we finalise everything here - we are at the end of the file
+ if (typeof _current["(predefined)"][usedLabelName] === "boolean") {
+
+ // remove the declared token, so we know it is used
+ delete declared[usedLabelName];
+
+ // note it as used so it can be reported
+ usedPredefinedAndGlobals[usedLabelName] = marker;
+
+ // check for re-assigning a read-only (set to false) predefined
+ if (_current["(predefined)"][usedLabelName] === false && usage["(reassigned)"]) {
+ for (j = 0; j < usage["(reassigned)"].length; j++) {
+ if (!usage["(reassigned)"][j].ignoreW020) {
+ warning("W020", usage["(reassigned)"][j]);
+ }
+ }
+ }
+ }
+ else {
+ // label usage is not predefined and we have not found a declaration
+ // so report as undeclared
+ if (usage["(tokens)"]) {
+ for (j = 0; j < usage["(tokens)"].length; j++) {
+ var undefinedToken = usage["(tokens)"][j];
+ // if its not a forgiven undefined (e.g. typof x)
+ if (!undefinedToken.forgiveUndef) {
+ // if undef is on and undef was on when the token was defined
+ if (state.option.undef && !undefinedToken.ignoreUndef) {
+ warning("W117", undefinedToken, usedLabelName);
+ }
+ if (impliedGlobals[usedLabelName]) {
+ impliedGlobals[usedLabelName].line.push(undefinedToken.line);
+ } else {
+ impliedGlobals[usedLabelName] = {
+ name: usedLabelName,
+ line: [undefinedToken.line]
+ };
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+
+ // if exiting the global scope, we can warn about declared globals that haven't been used yet
+ if (!subScope) {
+ Object.keys(declared)
+ .forEach(function(labelNotUsed) {
+ _warnUnused(labelNotUsed, declared[labelNotUsed], "var");
+ });
+ }
+
+ // If this is not a function boundary, transfer function-scoped labels to
+ // the parent block (a rough simulation of variable hoisting). Previously
+ // existing labels in the parent block should take precedence so that things and stuff.
+ if (subScope && !isUnstackingFunctionBody &&
+ !isUnstackingFunctionParams && !isUnstackingFunctionOuter) {
+ var labelNames = Object.keys(currentLabels);
+ for (i = 0; i < labelNames.length; i++) {
+
+ var defLabelName = labelNames[i];
+ var defLabel = currentLabels[defLabelName];
+
+ if (!defLabel["(blockscoped)"] && defLabel["(type)"] !== "exception") {
+ var shadowed = subScope["(labels)"][defLabelName];
+
+ // Do not overwrite a label if it exists in the parent scope
+ // because it is shared by adjacent blocks. Copy the `unused`
+ // property so that any references found within the current block
+ // are counted toward that higher-level declaration.
+ if (shadowed) {
+ shadowed["(unused)"] &= defLabel["(unused)"];
+
+ // "Hoist" the variable to the parent block, decorating the label
+ // so that future references, though technically valid, can be
+ // reported as "out-of-scope" in the absence of the `funcscope`
+ // option.
+ } else {
+ defLabel["(useOutsideOfScope)"] =
+ // Do not warn about out-of-scope usages in the global scope
+ _currentFunctBody["(type)"] !== "global" &&
+ // When a higher scope contains a binding for the label, the
+ // label is a re-declaration and should not prompt "used
+ // out-of-scope" warnings.
+ !this.funct.has(defLabelName, { excludeCurrent: true });
+
+ subScope["(labels)"][defLabelName] = defLabel;
+ }
+
+ delete currentLabels[defLabelName];
+ }
+ }
+ }
+
+ _checkForUnused();
+
+ _scopeStack.pop();
+ if (isUnstackingFunctionBody) {
+ _currentFunctBody = _scopeStack[_.findLastIndex(_scopeStack, function(scope) {
+ // if function or if global (which is at the bottom so it will only return true if we call back)
+ return scope["(isFuncBody)"] || scope["(type)"] === "global";
+ })];
+ }
+
+ _current = subScope;
+ },
+
+ /**
+ * Add a param to the current scope
+ * @param {string} labelName
+ * @param {Token} token
+ * @param {string} [type="param"] param type
+ */
+ addParam: function(labelName, token, type) {
+ type = type || "param";
+
+ if (type === "exception") {
+ // if defined in the current function
+ var previouslyDefinedLabelType = this.funct.labeltype(labelName);
+ if (previouslyDefinedLabelType && previouslyDefinedLabelType !== "exception") {
+ // and has not been used yet in the current function scope
+ if (!state.option.node) {
+ warning("W002", state.tokens.next, labelName);
+ }
+ }
+ }
+
+ // The variable was declared in the current scope
+ if (_.has(_current["(labels)"], labelName)) {
+ _current["(labels)"][labelName].duplicated = true;
+
+ // The variable was declared in an outer scope
+ } else {
+ // if this scope has the variable defined, it's a re-definition error
+ _checkOuterShadow(labelName, token, type);
+
+ _current["(labels)"][labelName] = {
+ "(type)" : type,
+ "(token)": token,
+ "(unused)": true };
+
+ _current["(params)"].push(labelName);
+ }
+
+ if (_.has(_current["(usages)"], labelName)) {
+ var usage = _current["(usages)"][labelName];
+ // if its in a sub function it is not necessarily an error, just latedef
+ if (usage["(onlyUsedSubFunction)"]) {
+ _latedefWarning(type, labelName, token);
+ } else {
+ // this is a clear illegal usage for block scoped variables
+ warning("E056", token, labelName, type);
+ }
+ }
+ },
+
+ validateParams: function() {
+ // This method only concerns errors for function parameters
+ if (_currentFunctBody["(type)"] === "global") {
+ return;
+ }
+
+ var isStrict = state.isStrict();
+ var currentFunctParamScope = _currentFunctBody["(parent)"];
+
+ if (!currentFunctParamScope["(params)"]) {
+ return;
+ }
+
+ currentFunctParamScope["(params)"].forEach(function(labelName) {
+ var label = currentFunctParamScope["(labels)"][labelName];
+
+ if (label && label.duplicated) {
+ if (isStrict) {
+ warning("E011", label["(token)"], labelName);
+ } else if (state.option.shadow !== true) {
+ warning("W004", label["(token)"], labelName);
+ }
+ }
+ });
+ },
+
+ getUsedOrDefinedGlobals: function() {
+ // jshint proto: true
+ var list = Object.keys(usedPredefinedAndGlobals);
+
+ // If `__proto__` is used as a global variable name, its entry in the
+ // lookup table may not be enumerated by `Object.keys` (depending on the
+ // environment).
+ if (usedPredefinedAndGlobals.__proto__ === marker &&
+ list.indexOf("__proto__") === -1) {
+ list.push("__proto__");
+ }
+
+ return list;
+ },
+
+ /**
+ * Gets an array of implied globals
+ * @returns {Array.<{ name: string, line: Array.<number>}>}
+ */
+ getImpliedGlobals: function() {
+ // jshint proto: true
+ var values = _.values(impliedGlobals);
+ var hasProto = false;
+
+ // If `__proto__` is an implied global variable, its entry in the lookup
+ // table may not be enumerated by `_.values` (depending on the
+ // environment).
+ if (impliedGlobals.__proto__) {
+ hasProto = values.some(function(value) {
+ return value.name === "__proto__";
+ });
+
+ if (!hasProto) {
+ values.push(impliedGlobals.__proto__);
+ }
+ }
+
+ return values;
+ },
+
+ /**
+ * Returns a list of unused variables
+ * @returns {Array}
+ */
+ getUnuseds: function() {
+ return unuseds;
+ },
+
+ has: function(labelName) {
+ return Boolean(_getLabel(labelName));
+ },
+
+ labeltype: function(labelName) {
+ // returns a labels type or null if not present
+ var scopeLabels = _getLabel(labelName);
+ if (scopeLabels) {
+ return scopeLabels[labelName]["(type)"];
+ }
+ return null;
+ },
+
+ /**
+ * for the exported options, indicating a variable is used outside the file
+ */
+ addExported: function(labelName) {
+ var globalLabels = _scopeStack[0]["(labels)"];
+ if (_.has(declared, labelName)) {
+ // remove the declared token, so we know it is used
+ delete declared[labelName];
+ } else if (_.has(globalLabels, labelName)) {
+ globalLabels[labelName]["(unused)"] = false;
+ } else {
+ for (var i = 1; i < _scopeStack.length; i++) {
+ var scope = _scopeStack[i];
+ // if `scope.(type)` is not defined, it is a block scope
+ if (!scope["(type)"]) {
+ if (_.has(scope["(labels)"], labelName) &&
+ !scope["(labels)"][labelName]["(blockscoped)"]) {
+ scope["(labels)"][labelName]["(unused)"] = false;
+ return;
+ }
+ } else {
+ break;
+ }
+ }
+ exported[labelName] = true;
+ }
+ },
+
+ /**
+ * Mark an indentifier as es6 module exported
+ */
+ setExported: function(labelName, token) {
+ this.block.use(labelName, token);
+ },
+
+ /**
+ * adds an indentifier to the relevant current scope and creates warnings/errors as necessary
+ * @param {string} labelName
+ * @param {Object} opts
+ * @param {String} opts.type - the type of the label e.g. "param", "var", "let, "const", "function"
+ * @param {Token} opts.token - the token pointing at the declaration
+ */
+ addlabel: function(labelName, opts) {
+
+ var type = opts.type;
+ var token = opts.token;
+ var isblockscoped = type === "let" || type === "const" || type === "class";
+ var isexported = (isblockscoped ? _current : _currentFunctBody)["(type)"] === "global" &&
+ _.has(exported, labelName);
+
+ // outer shadow check (inner is only on non-block scoped)
+ _checkOuterShadow(labelName, token, type);
+
+ // if is block scoped (let or const)
+ if (isblockscoped) {
+
+ var declaredInCurrentScope = _current["(labels)"][labelName];
+ // for block scoped variables, params are seen in the current scope as the root function
+ // scope, so check these too.
+ if (!declaredInCurrentScope && _current === _currentFunctBody &&
+ _current["(type)"] !== "global") {
+ declaredInCurrentScope = !!_currentFunctBody["(parent)"]["(labels)"][labelName];
+ }
+
+ // if its not already defined (which is an error, so ignore) and is used in TDZ
+ if (!declaredInCurrentScope && _current["(usages)"][labelName]) {
+ var usage = _current["(usages)"][labelName];
+ // if its in a sub function it is not necessarily an error, just latedef
+ if (usage["(onlyUsedSubFunction)"]) {
+ _latedefWarning(type, labelName, token);
+ } else {
+ // this is a clear illegal usage for block scoped variables
+ warning("E056", token, labelName, type);
+ }
+ }
+
+ // if this scope has the variable defined, its a re-definition error
+ if (declaredInCurrentScope) {
+ warning("E011", token, labelName);
+ }
+ else if (state.option.shadow === "outer") {
+
+ // if shadow is outer, for block scope we want to detect any shadowing within this function
+ if (scopeManagerInst.funct.has(labelName)) {
+ warning("W004", token, labelName);
+ }
+ }
+
+ scopeManagerInst.block.add(labelName, type, token, !isexported);
+
+ } else {
+
+ var declaredInCurrentFunctionScope = scopeManagerInst.funct.has(labelName);
+
+ // check for late definition, ignore if already declared
+ if (!declaredInCurrentFunctionScope && usedSoFarInCurrentFunction(labelName)) {
+ _latedefWarning(type, labelName, token);
+ }
+
+ // defining with a var or a function when a block scope variable of the same name
+ // is in scope is an error
+ if (scopeManagerInst.funct.has(labelName, { onlyBlockscoped: true })) {
+ warning("E011", token, labelName);
+ } else if (state.option.shadow !== true) {
+ // now since we didn't get any block scope variables, test for var/function
+ // shadowing
+ if (declaredInCurrentFunctionScope && labelName !== "__proto__") {
+
+ // see https://github.com/jshint/jshint/issues/2400
+ if (_currentFunctBody["(type)"] !== "global") {
+ warning("W004", token, labelName);
+ }
+ }
+ }
+
+ scopeManagerInst.funct.add(labelName, type, token, !isexported);
+
+ if (_currentFunctBody["(type)"] === "global" && !state.impliedClosure()) {
+ usedPredefinedAndGlobals[labelName] = marker;
+ }
+ }
+ },
+
+ funct: {
+ /**
+ * Returns the label type given certain options
+ * @param labelName
+ * @param {Object=} options
+ * @param {Boolean=} options.onlyBlockscoped - only include block scoped labels
+ * @param {Boolean=} options.excludeParams - exclude the param scope
+ * @param {Boolean=} options.excludeCurrent - exclude the current scope
+ * @returns {String}
+ */
+ labeltype: function(labelName, options) {
+ var onlyBlockscoped = options && options.onlyBlockscoped;
+ var excludeParams = options && options.excludeParams;
+ var currentScopeIndex = _scopeStack.length - (options && options.excludeCurrent ? 2 : 1);
+ for (var i = currentScopeIndex; i >= 0; i--) {
+ var current = _scopeStack[i];
+ if (current["(labels)"][labelName] &&
+ (!onlyBlockscoped || current["(labels)"][labelName]["(blockscoped)"])) {
+ return current["(labels)"][labelName]["(type)"];
+ }
+ var scopeCheck = excludeParams ? _scopeStack[ i - 1 ] : current;
+ if (scopeCheck && scopeCheck["(type)"] === "functionparams") {
+ return null;
+ }
+ }
+ return null;
+ },
+ /**
+ * Returns if a break label exists in the function scope
+ * @param {string} labelName
+ * @returns {boolean}
+ */
+ hasBreakLabel: function(labelName) {
+ for (var i = _scopeStack.length - 1; i >= 0; i--) {
+ var current = _scopeStack[i];
+
+ if (current["(breakLabels)"][labelName]) {
+ return true;
+ }
+ if (current["(type)"] === "functionparams") {
+ return false;
+ }
+ }
+ return false;
+ },
+ /**
+ * Returns if the label is in the current function scope
+ * See scopeManager.funct.labelType for options
+ */
+ has: function(labelName, options) {
+ return Boolean(this.labeltype(labelName, options));
+ },
+
+ /**
+ * Adds a new function scoped variable
+ * see block.add for block scoped
+ */
+ add: function(labelName, type, tok, unused) {
+ _current["(labels)"][labelName] = {
+ "(type)" : type,
+ "(token)": tok,
+ "(blockscoped)": false,
+ "(function)": _currentFunctBody,
+ "(unused)": unused };
+ }
+ },
+
+ block: {
+
+ /**
+ * is the current block global?
+ * @returns Boolean
+ */
+ isGlobal: function() {
+ return _current["(type)"] === "global";
+ },
+
+ use: function(labelName, token) {
+
+ // if resolves to current function params, then do not store usage just resolve
+ // this is because function(a) { var a; a = a; } will resolve to the param, not
+ // to the unset var
+ // first check the param is used
+ var paramScope = _currentFunctBody["(parent)"];
+ if (paramScope && paramScope["(labels)"][labelName] &&
+ paramScope["(labels)"][labelName]["(type)"] === "param") {
+
+ // then check its not declared by a block scope variable
+ if (!scopeManagerInst.funct.has(labelName,
+ { excludeParams: true, onlyBlockscoped: true })) {
+ paramScope["(labels)"][labelName]["(unused)"] = false;
+ }
+ }
+
+ if (token && (state.ignored.W117 || state.option.undef === false)) {
+ token.ignoreUndef = true;
+ }
+
+ _setupUsages(labelName);
+
+ _current["(usages)"][labelName]["(onlyUsedSubFunction)"] = false;
+
+ if (token) {
+ token["(function)"] = _currentFunctBody;
+ _current["(usages)"][labelName]["(tokens)"].push(token);
+ }
+ },
+
+ reassign: function(labelName, token) {
+ token.ignoreW020 = state.ignored.W020;
+ token.ignoreW021 = state.ignored.W021;
+
+ this.modify(labelName, token);
+
+ _current["(usages)"][labelName]["(reassigned)"].push(token);
+ },
+
+ modify: function(labelName, token) {
+
+ _setupUsages(labelName);
+
+ _current["(usages)"][labelName]["(onlyUsedSubFunction)"] = false;
+ _current["(usages)"][labelName]["(modified)"].push(token);
+ },
+
+ /**
+ * Adds a new variable
+ */
+ add: function(labelName, type, tok, unused) {
+ _current["(labels)"][labelName] = {
+ "(type)" : type,
+ "(token)": tok,
+ "(blockscoped)": true,
+ "(unused)": unused };
+ },
+
+ addBreakLabel: function(labelName, opts) {
+ var token = opts.token;
+ if (scopeManagerInst.funct.hasBreakLabel(labelName)) {
+ warning("E011", token, labelName);
+ }
+ else if (state.option.shadow === "outer") {
+ if (scopeManagerInst.funct.has(labelName)) {
+ warning("W004", token, labelName);
+ } else {
+ _checkOuterShadow(labelName, token);
+ }
+ }
+ _current["(breakLabels)"][labelName] = token;
+ }
+ }
+ };
+ return scopeManagerInst;
+};
+
+module.exports = scopeManager;
+
+},{"events":5,"lodash":12}],19:[function(require,module,exports){
+"use strict";
var NameStack = require("./name-stack.js");
var state = {
syntax: {},
- reset: function () {
+ /**
+ * Determine if the code currently being linted is strict mode code.
+ *
+ * @returns {boolean}
+ */
+ isStrict: function() {
+ return this.directive["use strict"] || this.inClassBody ||
+ this.option.module || this.option.strict === "implied";
+ },
+
+ /**
+ * Determine if the current state warrants a warning for statements outside
+ * of strict mode code.
+ *
+ * While emitting warnings based on function scope would be more intuitive
+ * (and less noisy), JSHint observes statement-based semantics in order to
+ * preserve legacy behavior.
+ *
+ * This method does not take the state of the parser into account, making no
+ * distinction between global code and function code. Because the "missing
+ * 'use strict'" warning is *also* reported at function boundaries, this
+ * function interprets `strict` option values `true` and `undefined` as
+ * equivalent.
+ */
+ stmtMissingStrict: function() {
+ if (this.option.strict === "global") {
+ return true;
+ }
+
+ if (this.option.strict === false) {
+ return false;
+ }
+
+ if (this.option.globalstrict) {
+ return true;
+ }
+
+ return false;
+ },
+
+ allowsGlobalUsd: function() {
+ return this.option.strict === "global" || this.option.globalstrict ||
+ this.option.module || this.impliedClosure();
+ },
+
+ /**
+ * Determine if the current configuration describes an environment that is
+ * wrapped in an immediately-invoked function expression prior to evaluation.
+ *
+ * @returns {boolean}
+ */
+ impliedClosure: function() {
+ return this.option.node || this.option.phantom || this.option.browserify;
+ },
+
+ // Assumption: chronologically ES3 < ES5 < ES6 < Moz
+
+ inMoz: function() {
+ return this.option.moz;
+ },
+
+ /**
+ * @param {boolean} strict - When `true`, only consider ES6 when in
+ * "esversion: 6" code.
+ */
+ inES6: function(strict) {
+ if (strict) {
+ return this.esVersion === 6;
+ }
+ return this.option.moz || this.esVersion >= 6;
+ },
+
+ /**
+ * @param {boolean} strict - When `true`, return `true` only when
+ * esVersion is exactly 5
+ */
+ inES5: function(strict) {
+ if (strict) {
+ return (!this.esVersion || this.esVersion === 5) && !this.option.moz;
+ }
+ return !this.esVersion || this.esVersion >= 5 || this.option.moz;
+ },
+
+ /**
+ * Determine the current version of the input language by inspecting the
+ * value of all ECMAScript-version-related options. This logic is necessary
+ * to ensure compatibility with deprecated options `es3`, `es5`, and
+ * `esnext`, and it may be drastically simplified when those options are
+ * removed.
+ *
+ * @returns {string|null} - the name of any incompatible option detected,
+ * `null` otherwise
+ */
+ inferEsVersion: function() {
+ var badOpt = null;
+
+ if (this.option.esversion) {
+ if (this.option.es3) {
+ badOpt = "es3";
+ } else if (this.option.es5) {
+ badOpt = "es5";
+ } else if (this.option.esnext) {
+ badOpt = "esnext";
+ }
+
+ if (badOpt) {
+ return badOpt;
+ }
+
+ this.esVersion = this.option.esversion;
+ } else if (this.option.es3) {
+ this.esVersion = 3;
+ } else if (this.option.esnext) {
+ this.esVersion = 6;
+ }
+
+ return null;
+ },
+
+ reset: function() {
this.tokens = {
prev: null,
next: null,
@@ -5826,6 +17884,8 @@ var state = {
};
this.option = {};
+ this.esVersion = 5;
+ this.funct = null;
this.ignored = {};
this.directive = {};
this.jsonMode = false;
@@ -5836,18 +17896,16 @@ var state = {
this.ignoredLines = {};
this.forinifcheckneeded = false;
this.nameStack = new NameStack();
-
- // Blank out non-multi-line-commented lines when ignoring linter errors
- this.ignoreLinterErrors = false;
+ this.inClassBody = false;
}
};
exports.state = state;
-},{"./name-stack.js":15}],19:[function(require,module,exports){
+},{"./name-stack.js":15}],20:[function(require,module,exports){
"use strict";
-exports.register = function (linter) {
+exports.register = function(linter) {
// Check for properties named __proto__. This special property was
// deprecated and then re-introduced for ES6.
@@ -5860,13 +17918,14 @@ exports.register = function (linter) {
linter.warn("W103", {
line: data.line,
char: data.char,
- data: [ data.name ]
+ data: [ data.name, "6" ]
});
}
});
// Check for properties named __iterator__. This is a special property
- // available only in browsers with JavaScript 1.7 implementation.
+ // available only in browsers with JavaScript 1.7 implementation, but
+ // it is deprecated for ES6
linter.on("Identifier", function style_scanIterator(data) {
if (linter.getOption("iterator")) {
@@ -5874,7 +17933,7 @@ exports.register = function (linter) {
}
if (data.name === "__iterator__") {
- linter.warn("W104", {
+ linter.warn("W103", {
line: data.line,
char: data.char,
data: [ data.name ]
@@ -5893,7 +17952,7 @@ exports.register = function (linter) {
if (data.name.replace(/^_+|_+$/g, "").indexOf("_") > -1 && !data.name.match(/^[A-Z0-9_]*$/)) {
linter.warn("W106", {
line: data.line,
- char: data.from,
+ char: data.char,
data: [ data.name ]
});
}
@@ -5903,18 +17962,12 @@ exports.register = function (linter) {
linter.on("String", function style_scanQuotes(data) {
var quotmark = linter.getOption("quotmark");
- var esnext = linter.getOption("esnext");
var code;
if (!quotmark) {
return;
}
- // If quotmark is enabled, return if this is a template literal.
- if (esnext && data.quote === "`") {
- return;
- }
-
// If quotmark is set to 'single' warn about all double-quotes.
if (quotmark === "single" && data.quote !== "'") {
@@ -5995,7 +18048,7 @@ exports.register = function (linter) {
});
};
-},{}],20:[function(require,module,exports){
+},{}],21:[function(require,module,exports){
// jshint -W001
"use strict";
@@ -6008,51 +18061,47 @@ exports.reservedVars = {
};
exports.ecmaIdentifiers = {
- Array : false,
- Boolean : false,
- Date : false,
- decodeURI : false,
- decodeURIComponent : false,
- encodeURI : false,
- encodeURIComponent : false,
- Error : false,
- "eval" : false,
- EvalError : false,
- Function : false,
- hasOwnProperty : false,
- isFinite : false,
- isNaN : false,
- JSON : false,
- Map : false,
- Math : false,
- Number : false,
- Object : false,
- Proxy : false,
- Promise : false,
- parseInt : false,
- parseFloat : false,
- RangeError : false,
- ReferenceError : false,
- RegExp : false,
- Set : false,
- String : false,
- SyntaxError : false,
- TypeError : false,
- URIError : false,
- WeakMap : false,
- WeakSet : false
-};
-
-exports.newEcmaIdentifiers = {
- Set : false,
- Map : false,
- WeakMap : false,
- WeakSet : false,
- Proxy : false,
- Promise : false,
- Reflect : false,
- Symbol : false,
- System : false
+ 3: {
+ Array : false,
+ Boolean : false,
+ Date : false,
+ decodeURI : false,
+ decodeURIComponent : false,
+ encodeURI : false,
+ encodeURIComponent : false,
+ Error : false,
+ "eval" : false,
+ EvalError : false,
+ Function : false,
+ hasOwnProperty : false,
+ isFinite : false,
+ isNaN : false,
+ Math : false,
+ Number : false,
+ Object : false,
+ parseInt : false,
+ parseFloat : false,
+ RangeError : false,
+ ReferenceError : false,
+ RegExp : false,
+ String : false,
+ SyntaxError : false,
+ TypeError : false,
+ URIError : false
+ },
+ 5: {
+ JSON : false
+ },
+ 6: {
+ Map : false,
+ Promise : false,
+ Proxy : false,
+ Reflect : false,
+ Set : false,
+ Symbol : false,
+ WeakMap : false,
+ WeakSet : false
+ }
};
// Global variables commonly provided by a web browser environment.
@@ -6074,15 +18123,21 @@ exports.browser = {
clearTimeout : false,
close : false,
closed : false,
+ Comment : false,
+ CompositionEvent : false,
CustomEvent : false,
DOMParser : false,
defaultStatus : false,
Document : false,
document : false,
+ DocumentFragment : false,
Element : false,
ElementTimeControl : false,
Event : false,
event : false,
+ fetch : false,
+ File : false,
+ FileList : false,
FileReader : false,
FormData : false,
focus : false,
@@ -6096,6 +18151,7 @@ exports.browser = {
HTMLBRElement : false,
HTMLButtonElement : false,
HTMLCanvasElement : false,
+ HTMLCollection : false,
HTMLDirectoryElement : false,
HTMLDivElement : false,
HTMLDListElement : false,
@@ -6138,6 +18194,7 @@ exports.browser = {
HTMLTableElement : false,
HTMLTableRowElement : false,
HTMLTableSectionElement: false,
+ HTMLTemplateElement : false,
HTMLTextAreaElement : false,
HTMLTitleElement : false,
HTMLUListElement : false,
@@ -6160,6 +18217,7 @@ exports.browser = {
Node : false,
NodeFilter : false,
NodeList : false,
+ Notification : false,
navigator : false,
onbeforeunload : true,
onblur : true,
@@ -6173,7 +18231,9 @@ exports.browser = {
opener : false,
Option : false,
parent : false,
+ performance : false,
print : false,
+ Range : false,
requestAnimationFrame : false,
removeEventListener : false,
resizeBy : false,
@@ -6342,6 +18402,7 @@ exports.browser = {
SVGViewElement : false,
SVGViewSpec : false,
SVGZoomAndPan : false,
+ Text : false,
TextDecoder : false,
TextEncoder : false,
TimeEvent : false,
@@ -6360,6 +18421,7 @@ exports.browser = {
WebGLUniformLocation : false,
WebSocket : false,
window : false,
+ Window : false,
Worker : false,
XDomainRequest : false,
XMLHttpRequest : false,
@@ -6460,6 +18522,7 @@ exports.qunit = {
module : false,
notDeepEqual : false,
notEqual : false,
+ notOk : false,
notPropEqual : false,
notStrictEqual : false,
ok : false,
@@ -6665,9 +18728,15 @@ exports.yui = {
};
exports.mocha = {
+ // Global (for config etc.)
+ mocha : false,
// BDD
describe : false,
+ xdescribe : false,
it : false,
+ xit : false,
+ context : false,
+ xcontext : false,
before : false,
after : false,
beforeEach : false,
@@ -6684,6 +18753,7 @@ exports.mocha = {
exports.jasmine = {
jasmine : false,
describe : false,
+ xdescribe : false,
it : false,
xit : false,
beforeEach : false,
@@ -6695,7 +18765,14 @@ exports.jasmine = {
// Jasmine 1.3
runs : false,
waitsFor : false,
- waits : false
+ waits : false,
+ // Jasmine 2.1
+ beforeAll : false,
+ afterAll : false,
+ fail : false,
+ fdescribe : false,
+ fit : false,
+ pending : false
};
},{}],"jshint":[function(require,module,exports){
@@ -6733,15 +18810,16 @@ exports.jasmine = {
/*global console:true */
/*exported console */
-var _ = require("underscore");
-var events = require("events");
-var vars = require("./vars.js");
-var messages = require("./messages.js");
-var Lexer = require("./lex.js").Lexer;
-var reg = require("./reg.js");
-var state = require("./state.js").state;
-var style = require("./style.js");
-var options = require("./options.js");
+var _ = require("lodash");
+var events = require("events");
+var vars = require("./vars.js");
+var messages = require("./messages.js");
+var Lexer = require("./lex.js").Lexer;
+var reg = require("./reg.js");
+var state = require("./state.js").state;
+var style = require("./style.js");
+var options = require("./options.js");
+var scopeManager = require("./scope-manager.js");
// We need this module here because environments such as IE and Rhino
// don't necessarilly expose the 'console' API and browserify uses
@@ -6752,7 +18830,7 @@ var console = require("console-browserify");
// variable. That function will be invoked immediately, and its return value is
// the JSHINT function itself.
-var JSHINT = (function () {
+var JSHINT = (function() {
"use strict";
var api, // Extension API
@@ -6775,18 +18853,14 @@ var JSHINT = (function () {
},
declared, // Globals that were declared using /*global ... */ syntax.
- exported, // Variables that are used outside of the current file.
functionicity = [
"closure", "exception", "global", "label",
"outer", "unused", "var"
],
- funct, // The current function
functions, // All of the functions
- global, // The global scope
- implied, // Implied globals
inblock,
indent,
lookahead,
@@ -6795,9 +18869,7 @@ var JSHINT = (function () {
membersOnly,
predefined, // Global variables defined by option
- scope, // The current scope
stack,
- unuseds,
urls,
extraModules = [],
@@ -6840,22 +18912,28 @@ var JSHINT = (function () {
}
var meta = token.meta;
- if (meta && meta.isFutureReservedWord && state.option.inES5()) {
- // ES3 FutureReservedWord in an ES5 environment.
- if (!meta.es5) {
+ if (meta && meta.isFutureReservedWord) {
+ if (meta.moduleOnly && !state.option.module) {
return false;
}
- // Some ES5 FutureReservedWord identifiers are active only
- // within a strict mode environment.
- if (meta.strictOnly) {
- if (!state.option.strict && !state.directive["use strict"]) {
+ if (state.inES5()) {
+ // ES3 FutureReservedWord in an ES5 environment.
+ if (!meta.es5) {
return false;
}
- }
- if (token.isProperty) {
- return false;
+ // Some ES5 FutureReservedWord identifiers are active only
+ // within a strict mode environment.
+ if (meta.strictOnly) {
+ if (!state.option.strict && !state.isStrict()) {
+ return false;
+ }
+ }
+
+ if (token.isProperty) {
+ return false;
+ }
}
}
@@ -6863,14 +18941,14 @@ var JSHINT = (function () {
}
function supplant(str, data) {
- return str.replace(/\{([^{}]*)\}/g, function (a, b) {
+ return str.replace(/\{([^{}]*)\}/g, function(a, b) {
var r = data[b];
return typeof r === "string" || typeof r === "number" ? r : a;
});
}
function combine(dest, src) {
- Object.keys(src).forEach(function (name) {
+ Object.keys(src).forEach(function(name) {
if (_.has(JSHINT.blacklist, name)) return;
dest[name] = src[name];
});
@@ -6879,9 +18957,10 @@ var JSHINT = (function () {
function processenforceall() {
if (state.option.enforceall) {
for (var enforceopt in options.bool.enforcing) {
- if (state.option[enforceopt] === undefined) {
+ if (state.option[enforceopt] === undefined &&
+ !options.noenforceall[enforceopt]) {
state.option[enforceopt] = true;
- }
+ }
}
for (var relaxopt in options.bool.relaxing) {
if (state.option[relaxopt] === undefined) {
@@ -6892,14 +18971,40 @@ var JSHINT = (function () {
}
function assume() {
- if (state.option.es5) {
- warning("I003");
+ var badESOpt = null;
+ processenforceall();
+
+ /**
+ * TODO: Remove in JSHint 3
+ */
+ badESOpt = state.inferEsVersion();
+ if (badESOpt) {
+ quit("E059", state.tokens.next, "esversion", badESOpt);
}
- processenforceall();
+ if (state.inES5()) {
+ combine(predefined, vars.ecmaIdentifiers[5]);
+ }
+
+ if (state.inES6()) {
+ combine(predefined, vars.ecmaIdentifiers[6]);
+ }
- if (state.option.esnext) {
- combine(predefined, vars.newEcmaIdentifiers);
+ /**
+ * Use `in` to check for the presence of any explicitly-specified value for
+ * `globalstrict` because both `true` and `false` should trigger an error.
+ */
+ if (state.option.strict === "global" && "globalstrict" in state.option) {
+ quit("E059", state.tokens.next, "strict", "globalstrict");
+ }
+
+ if (state.option.module) {
+ /**
+ * TODO: Extend this restriction to *all* ES6-specific options.
+ */
+ if (!state.inES6()) {
+ warning("W134", state.tokens.next, "module", 6);
+ }
}
if (state.option.couch) {
@@ -6978,10 +19083,6 @@ var JSHINT = (function () {
combine(predefined, vars.wsh);
}
- if (state.option.globalstrict && state.option.strict !== false) {
- state.option.strict = true;
- }
-
if (state.option.yui) {
combine(predefined, vars.yui);
}
@@ -6989,59 +19090,35 @@ var JSHINT = (function () {
if (state.option.mocha) {
combine(predefined, vars.mocha);
}
-
- // Let's assume that chronologically ES3 < ES5 < ES6/ESNext < Moz
-
- state.option.inMoz = function (strict) {
- if (strict) {
- return state.option.moz && !state.option.esnext;
- }
- return state.option.moz;
- };
-
- state.option.inESNext = function (strict) {
- if (strict) {
- return !state.option.moz && state.option.esnext;
- }
- return state.option.moz || state.option.esnext;
- };
-
- state.option.inES5 = function (/* strict */) {
- return !state.option.es3;
- };
-
- state.option.inES3 = function (strict) {
- if (strict) {
- return !state.option.moz && !state.option.esnext && state.option.es3;
- }
- return state.option.es3;
- };
}
// Produce an error warning.
- function quit(code, line, chr) {
- var percentage = Math.floor((line / state.lines.length) * 100);
+ function quit(code, token, a, b) {
+ var percentage = Math.floor((token.line / state.lines.length) * 100);
var message = messages.errors[code].desc;
- throw {
+ var exception = {
name: "JSHintError",
- line: line,
- character: chr,
+ line: token.line,
+ character: token.from,
message: message + " (" + percentage + "% scanned).",
raw: message,
- code: code
+ code: code,
+ a: a,
+ b: b
};
- }
- function isundef(scope, code, token, a) {
- return JSHINT.undefs.push([scope, code, token, a]);
+ exception.reason = supplant(message, exception) + " (" + percentage +
+ "% scanned).";
+
+ throw exception;
}
function removeIgnoredMessages() {
var ignored = state.ignoredLines;
if (_.isEmpty(ignored)) return;
- JSHINT.errors = _.reject(JSHINT.errors, function (err) { return ignored[err.line] });
+ JSHINT.errors = _.reject(JSHINT.errors, function(err) { return ignored[err.line] });
}
function warning(code, t, a, b, c, d) {
@@ -7058,13 +19135,13 @@ var JSHINT = (function () {
msg = messages.info[code];
}
- t = t || state.tokens.next;
+ t = t || state.tokens.next || {};
if (t.id === "(end)") { // `~
t = state.tokens.curr;
}
- l = t.line || 0;
- ch = t.from || 0;
+ l = t.line;
+ ch = t.from;
w = {
id: "(error)",
@@ -7086,7 +19163,7 @@ var JSHINT = (function () {
removeIgnoredMessages();
if (JSHINT.errors.length >= state.option.maxerr)
- quit("E043", l, ch);
+ quit("E043", t);
return w;
}
@@ -7121,92 +19198,26 @@ var JSHINT = (function () {
return i;
}
- // name: string
- // opts: { type: string, token: token, islet: bool }
- function addlabel(name, opts) {
- opts = opts || {};
-
- var type = opts.type;
- var token = opts.token;
- var islet = opts.islet;
-
- // Define label in the current function in the current scope.
- if (type === "exception") {
- if (_.has(funct["(context)"], name)) {
- if (funct[name] !== true && !state.option.node) {
- warning("W002", state.tokens.next, name);
- }
- }
- }
-
- if (_.has(funct, name) && !funct["(global)"]) {
- if (funct[name] === true) {
- if (state.option.latedef) {
- if ((state.option.latedef === true && _.contains([funct[name], type], "unction")) ||
- !_.contains([funct[name], type], "unction")) {
- warning("W003", state.tokens.next, name);
- }
- }
- } else {
- if (((!state.option.shadow && !opts.param) ||
- _.contains([ "inner", "outer" ], state.option.shadow)) &&
- type !== "exception" || funct["(blockscope)"].getlabel(name)) {
- warning("W004", state.tokens.next, name);
- }
- }
- }
-
- if (funct["(context)"] && _.has(funct["(context)"], name) && type !== "function") {
- if (state.option.shadow === "outer") {
- warning("W123", state.tokens.next, name);
- }
- }
-
- // if the identifier is from a let, adds it only to the current blockscope
- if (islet) {
- funct["(blockscope)"].current.add(name, type, state.tokens.curr);
- if (funct["(blockscope)"].atTop() && exported[name]) {
- state.tokens.curr.exported = true;
- }
- } else {
- funct["(blockscope)"].shadow(name);
- funct[name] = type;
-
- if (token) {
- funct["(tokens)"][name] = token;
- }
-
- setprop(funct, name, { unused: opts.unused || false });
-
- if (funct["(global)"]) {
- global[name] = funct;
- if (_.has(implied, name)) {
- if (state.option.latedef) {
- if ((state.option.latedef === true && _.contains([funct[name], type], "unction")) ||
- !_.contains([funct[name], type], "unction")) {
- warning("W003", state.tokens.next, name);
- }
- }
-
- delete implied[name];
- }
- } else {
- scope[name] = funct;
- }
- }
- }
-
function doOption() {
var nt = state.tokens.next;
- var body = nt.body.split(",").map(function (s) { return s.trim(); });
- var predef = {};
+ var body = nt.body.split(",").map(function(s) { return s.trim(); });
+ var predef = {};
if (nt.type === "globals") {
- body.forEach(function (g) {
+ body.forEach(function(g, idx) {
g = g.split(":");
var key = (g[0] || "").trim();
var val = (g[1] || "").trim();
+ if (key === "-" || !key.length) {
+ // Ignore trailing comma
+ if (idx > 0 && idx === body.length - 1) {
+ return;
+ }
+ error("E002", nt);
+ return;
+ }
+
if (key.charAt(0) === "-") {
key = key.slice(1);
val = false;
@@ -7228,15 +19239,24 @@ var JSHINT = (function () {
}
if (nt.type === "exported") {
- body.forEach(function (e) {
- exported[e] = true;
+ body.forEach(function(e, idx) {
+ if (!e.length) {
+ // Ignore trailing comma
+ if (idx > 0 && idx === body.length - 1) {
+ return;
+ }
+ error("E002", nt);
+ return;
+ }
+
+ state.funct["(scope)"].addExported(e);
});
}
if (nt.type === "members") {
membersOnly = membersOnly || {};
- body.forEach(function (m) {
+ body.forEach(function(m) {
var ch1 = m.charAt(0);
var ch2 = m.charAt(m.length - 1);
@@ -7261,7 +19281,7 @@ var JSHINT = (function () {
];
if (nt.type === "jshint" || nt.type === "jslint") {
- body.forEach(function (g) {
+ body.forEach(function(g) {
g = g.split(":");
var key = (g[0] || "").trim();
var val = (g[1] || "").trim();
@@ -7291,7 +19311,7 @@ var JSHINT = (function () {
if (key === "validthis") {
// `validthis` is valid only within a function scope.
- if (funct["(global)"])
+ if (state.funct["(global)"])
return void error("E009");
if (val !== "true" && val !== "false")
@@ -7372,12 +19392,6 @@ var JSHINT = (function () {
if (key === "ignore") {
switch (val) {
- case "start":
- state.ignoreLinterErrors = true;
- break;
- case "end":
- state.ignoreLinterErrors = false;
- break;
case "line":
state.ignoredLines[nt.line] = true;
removeIgnoredMessages();
@@ -7388,6 +19402,54 @@ var JSHINT = (function () {
return;
}
+ if (key === "strict") {
+ switch (val) {
+ case "true":
+ state.option.strict = true;
+ break;
+ case "false":
+ state.option.strict = false;
+ break;
+ case "global":
+ case "implied":
+ state.option.strict = val;
+ break;
+ default:
+ error("E002", nt);
+ }
+ return;
+ }
+
+ if (key === "module") {
+ /**
+ * TODO: Extend this restriction to *all* "environmental" options.
+ */
+ if (!hasParsedCode(state.funct)) {
+ error("E055", state.tokens.next, "module");
+ }
+ }
+
+ if (key === "esversion") {
+ switch (val) {
+ case "3":
+ case "5":
+ case "6":
+ state.option.moz = false;
+ state.option.esversion = +val;
+ break;
+ case "2015":
+ state.option.moz = false;
+ state.option.esversion = 6;
+ break;
+ default:
+ error("E002", nt);
+ }
+ if (!hasParsedCode(state.funct)) {
+ error("E055", state.tokens.next, "esversion");
+ }
+ return;
+ }
+
var match = /^([+-])(W\d{3})$/g.exec(key);
if (match) {
// ignore for -W..., unignore for +W...
@@ -7408,9 +19470,6 @@ var JSHINT = (function () {
state.option[key] = (val === "true");
}
- if (key === "newcap") {
- state.option["(explicitNewcap)"] = true;
- }
return;
}
@@ -7428,7 +19487,11 @@ var JSHINT = (function () {
// for ( var i = ...
function peek(p) {
- var i = p || 0, j = 0, t;
+ var i = p || 0, j = lookahead.length, t;
+
+ if (i < j) {
+ return lookahead[i];
+ }
while (j <= i) {
t = lookahead[j];
@@ -7437,6 +19500,12 @@ var JSHINT = (function () {
}
j += 1;
}
+
+ // Peeking past the end of the program should produce the "(end)" token.
+ if (!t && state.tokens.next.id === "(end)") {
+ return state.tokens.next;
+ }
+
return t;
}
@@ -7479,14 +19548,7 @@ var JSHINT = (function () {
error("E020", state.tokens.next, id, t.id, t.line, state.tokens.next.value);
}
} else if (state.tokens.next.type !== "(identifier)" || state.tokens.next.value !== id) {
- // parameter destructuring with rest operator
- if (state.tokens.next.value === "...") {
- if (!state.option.esnext) {
- warning("W119", state.tokens.next, "spread/rest operator");
- }
- } else {
- warning("W116", state.tokens.next, id, state.tokens.next.value);
- }
+ warning("W116", state.tokens.next, id, state.tokens.next.value);
}
}
@@ -7496,7 +19558,7 @@ var JSHINT = (function () {
state.tokens.next = lookahead.shift() || lex.token();
if (!state.tokens.next) { // No more tokens left, give up
- quit("E041", state.tokens.curr.line);
+ quit("E041", state.tokens.curr);
}
if (state.tokens.next.id === "(end)" || state.tokens.next.id === "(error)") {
@@ -7508,7 +19570,11 @@ var JSHINT = (function () {
}
if (state.tokens.next.isSpecial) {
- doOption();
+ if (state.tokens.next.type === "falls through") {
+ state.tokens.curr.caseFallsThrough = true;
+ } else {
+ doOption();
+ }
} else {
if (state.tokens.next.id !== "(endline)") {
break;
@@ -7518,7 +19584,7 @@ var JSHINT = (function () {
}
function isInfix(token) {
- return token.infix || (!token.identifier && !!token.led);
+ return token.infix || (!token.identifier && !token.template && !!token.led);
}
function isEndOfExpr() {
@@ -7527,12 +19593,16 @@ var JSHINT = (function () {
if (next.id === ";" || next.id === "}" || next.id === ":") {
return true;
}
- if (isInfix(next) === isInfix(curr) || (curr.id === "yield" && state.option.inMoz(true))) {
- return curr.line !== next.line;
+ if (isInfix(next) === isInfix(curr) || (curr.id === "yield" && state.inMoz())) {
+ return curr.line !== startLine(next);
}
return false;
}
+ function isBeginOfExpr(prev) {
+ return !prev.left && prev.arity !== "unary";
+ }
+
// This is the heart of JSHINT, the Pratt parser. In addition to parsing, it
// is looking for ad hoc lint patterns. We add .fud to Pratt's model, which is
// like .nud except that it is only used on the first token of a statement.
@@ -7548,35 +19618,30 @@ var JSHINT = (function () {
// They are elements of the parsing method called Top Down Operator Precedence.
function expression(rbp, initial) {
- var left, isArray = false, isObject = false, isLetExpr = false,
- isFatArrowBody = state.tokens.curr.value === "=>";
+ var left, isArray = false, isObject = false, isLetExpr = false;
state.nameStack.push();
// if current expression is a let expression
if (!initial && state.tokens.next.value === "let" && peek(0).value === "(") {
- if (!state.option.inMoz(true)) {
+ if (!state.inMoz()) {
warning("W118", state.tokens.next, "let expressions");
}
isLetExpr = true;
// create a new block scope we use only for the current expression
- funct["(blockscope)"].stack();
+ state.funct["(scope)"].stack();
advance("let");
advance("(");
- state.syntax["let"].fud.call(state.syntax["let"].fud, false);
+ state.tokens.prev.fud();
advance(")");
}
if (state.tokens.next.id === "(end)")
error("E006", state.tokens.curr);
- if (state.tokens.next.type === "(template)") {
- doTemplateLiteral();
- }
-
var isDangerous =
state.option.asi &&
- state.tokens.prev.line < state.tokens.curr.line &&
+ state.tokens.prev.line !== startLine(state.tokens.curr) &&
_.contains(["]", ")"], state.tokens.prev.id) &&
_.contains(["[", "("], state.tokens.curr.id);
@@ -7586,7 +19651,8 @@ var JSHINT = (function () {
advance();
if (initial) {
- funct["(verb)"] = state.tokens.curr.value;
+ state.funct["(verb)"] = state.tokens.curr.value;
+ state.tokens.curr.beginsStmt = true;
}
if (initial === true && state.tokens.curr.fud) {
@@ -7638,12 +19704,7 @@ var JSHINT = (function () {
}
}
if (isLetExpr) {
- funct["(blockscope)"].unstack();
- }
-
- if (state.option.singleGroups && left && left.paren && !left.exprs &&
- !isFatArrowBody && !left.triggerFnExpr) {
- warning("W126");
+ state.funct["(scope)"].unstack();
}
state.nameStack.pop();
@@ -7654,40 +19715,40 @@ var JSHINT = (function () {
// Functions for conformance of style.
+ function startLine(token) {
+ return token.startLine || token.line;
+ }
+
function nobreaknonadjacent(left, right) {
left = left || state.tokens.curr;
right = right || state.tokens.next;
- if (!state.option.laxbreak && left.line !== right.line) {
+ if (!state.option.laxbreak && left.line !== startLine(right)) {
warning("W014", right, right.value);
}
}
function nolinebreak(t) {
t = t || state.tokens.curr;
- if (t.line !== state.tokens.next.line) {
+ if (t.line !== startLine(state.tokens.next)) {
warning("E022", t, t.value);
}
}
function nobreakcomma(left, right) {
- if (left.line !== right.line) {
+ if (left.line !== startLine(right)) {
if (!state.option.laxcomma) {
- if (comma.first) {
+ if (parseComma.first) {
warning("I001");
- comma.first = false;
+ parseComma.first = false;
}
warning("W014", left, right.value);
}
}
}
- function comma(opts) {
+ function parseComma(opts) {
opts = opts || {};
- if (state.option.nocomma) {
- warning("W127");
- }
-
if (!opts.peek) {
nobreakcomma(state.tokens.curr, state.tokens.next);
advance(",");
@@ -7695,7 +19756,7 @@ var JSHINT = (function () {
nobreakcomma(state.tokens.prev, state.tokens.curr);
}
- if (state.tokens.next.identifier && !(opts.property && state.option.inES5())) {
+ if (state.tokens.next.identifier && !(opts.property && state.inES5())) {
// Keywords that cannot follow a comma operator.
switch (state.tokens.next.value) {
case "break":
@@ -7757,7 +19818,9 @@ var JSHINT = (function () {
}
function delim(s) {
- return symbol(s, 0);
+ var x = symbol(s, 0);
+ x.delim = true;
+ return x;
}
function stmt(s, f) {
@@ -7785,9 +19848,9 @@ var JSHINT = (function () {
var x = symbol(s, 150);
reserveName(x);
- x.nud = (typeof f === "function") ? f : function () {
- this.right = expression(150);
+ x.nud = (typeof f === "function") ? f : function() {
this.arity = "unary";
+ this.right = expression(150);
if (this.id === "++" || this.id === "--") {
if (state.option.plusplus) {
@@ -7796,6 +19859,14 @@ var JSHINT = (function () {
this.right.id !== "." && this.right.id !== "[") {
warning("W017", this);
}
+
+ if (this.right && this.right.isMetaProperty) {
+ error("E031", this);
+ // detect increment/decrement of a const
+ // in the case of a.b, right will be the "." punctuator
+ } else if (this.right && this.right.identifier) {
+ state.funct["(scope)"].block.modify(this.right.value, this);
+ }
}
return this;
@@ -7819,7 +19890,7 @@ var JSHINT = (function () {
}
function FutureReservedWord(name, meta) {
- var x = type(name, (meta && meta.nud) || function () {
+ var x = type(name, (meta && meta.nud) || function() {
return this;
});
@@ -7835,7 +19906,7 @@ var JSHINT = (function () {
}
function reservevar(s, v) {
- return reserve(s, function () {
+ return reserve(s, function() {
if (typeof v === "function") {
v(this);
}
@@ -7847,11 +19918,11 @@ var JSHINT = (function () {
var x = symbol(s, p);
reserveName(x);
x.infix = true;
- x.led = function (left) {
+ x.led = function(left) {
if (!w) {
nobreaknonadjacent(state.tokens.prev, state.tokens.curr);
}
- if (s === "in" && left.id === "!") {
+ if ((s === "in" || s === "instanceof") && left.id === "!") {
warning("W018", left, "!");
}
if (typeof f === "function") {
@@ -7865,19 +19936,14 @@ var JSHINT = (function () {
return x;
}
-
function application(s) {
var x = symbol(s, 42);
- x.led = function (left) {
- if (!state.option.esnext) {
- warning("W119", state.tokens.curr, "arrow function syntax (=>)");
- }
-
+ x.led = function(left) {
nobreaknonadjacent(state.tokens.prev, state.tokens.curr);
this.left = left;
- this.right = doFunction(undefined, undefined, false, left);
+ this.right = doFunction({ type: "arrow", loneArg: left });
return this;
};
return x;
@@ -7886,9 +19952,10 @@ var JSHINT = (function () {
function relation(s, f) {
var x = symbol(s, 100);
- x.led = function (left) {
+ x.led = function(left) {
nobreaknonadjacent(state.tokens.prev, state.tokens.curr);
- var right = expression(100);
+ this.left = left;
+ var right = this.right = expression(100);
if (isIdentifier(left, "NaN") || isIdentifier(right, "NaN")) {
warning("W019", this);
@@ -7897,7 +19964,7 @@ var JSHINT = (function () {
}
if (!left || !right) {
- quit("E041", state.tokens.curr.line);
+ quit("E041", state.tokens.curr);
}
if (left.id === "!") {
@@ -7908,8 +19975,6 @@ var JSHINT = (function () {
warning("W018", right, "!");
}
- this.left = left;
- this.right = right;
return this;
};
return x;
@@ -7925,21 +19990,38 @@ var JSHINT = (function () {
node.type === "undefined");
}
+ var typeofValues = {};
+ typeofValues.legacy = [
+ // E4X extended the `typeof` operator to return "xml" for the XML and
+ // XMLList types it introduced.
+ // Ref: 11.3.2 The typeof Operator
+ // http://www.ecma-international.org/publications/files/ECMA-ST/Ecma-357.pdf
+ "xml",
+ // IE<9 reports "unknown" when the `typeof` operator is applied to an
+ // object existing across a COM+ bridge. In lieu of official documentation
+ // (which does not exist), see:
+ // http://robertnyman.com/2005/12/21/what-is-typeof-unknown/
+ "unknown"
+ ];
+ typeofValues.es3 = [
+ "undefined", "boolean", "number", "string", "function", "object",
+ ];
+ typeofValues.es3 = typeofValues.es3.concat(typeofValues.legacy);
+ typeofValues.es6 = typeofValues.es3.concat("symbol");
+
// Checks whether the 'typeof' operator is used with the correct
// value. For docs on 'typeof' see:
// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/typeof
+ function isTypoTypeof(left, right, state) {
+ var values;
- function isTypoTypeof(left, right) {
if (state.option.notypeof)
return false;
if (!left || !right)
return false;
- var values = [
- "undefined", "object", "boolean", "number",
- "string", "function", "xml", "object", "unknown"
- ];
+ values = state.inES6() ? typeofValues.es6 : typeofValues.es3;
if (right.type === "(identifier)" && right.value === "typeof" && left.type === "(string)")
return !_.contains(values, left.value);
@@ -7947,6 +20029,27 @@ var JSHINT = (function () {
return false;
}
+ function isGlobalEval(left, state) {
+ var isGlobal = false;
+
+ // permit methods to refer to an "eval" key in their own context
+ if (left.type === "this" && state.funct["(context)"] === null) {
+ isGlobal = true;
+ }
+ // permit use of "eval" members of objects
+ else if (left.type === "(identifier)") {
+ if (state.option.node && left.value === "global") {
+ isGlobal = true;
+ }
+
+ else if (state.option.browser && (left.value === "window" || left.value === "document")) {
+ isGlobal = true;
+ }
+ }
+
+ return isGlobal;
+ }
+
function findNativePrototype(left) {
var natives = [
"Array", "ArrayBuffer", "Boolean", "Collator", "DataView", "Date",
@@ -7967,78 +20070,99 @@ var JSHINT = (function () {
while (!obj.identifier && typeof obj.left === "object")
obj = obj.left;
- if (obj.identifier && natives.indexOf(obj.value) >= 0)
+ if (obj.identifier && natives.indexOf(obj.value) >= 0 &&
+ state.funct["(scope)"].isPredefined(obj.value)) {
return obj.value;
+ }
}
var prototype = walkPrototype(left);
if (prototype) return walkNative(prototype);
}
- function assignop(s, f, p) {
- var x = infix(s, typeof f === "function" ? f : function (left, that) {
- that.left = left;
-
- if (left) {
- if (state.option.freeze) {
- var nativeObject = findNativePrototype(left);
- if (nativeObject)
- warning("W121", left, nativeObject);
- }
+ /**
+ * Checks the left hand side of an assignment for issues, returns if ok
+ * @param {token} left - the left hand side of the assignment
+ * @param {token=} assignToken - the token for the assignment, used for reporting
+ * @param {object=} options - optional object
+ * @param {boolean} options.allowDestructuring - whether to allow destructuting binding
+ * @returns {boolean} Whether the left hand side is OK
+ */
+ function checkLeftSideAssign(left, assignToken, options) {
- if (predefined[left.value] === false &&
- scope[left.value]["(global)"] === true) {
- warning("W020", left);
- } else if (left["function"]) {
- warning("W021", left, left.value);
- }
+ var allowDestructuring = options && options.allowDestructuring;
- if (funct[left.value] === "const") {
- error("E013", left, left.value);
- }
+ assignToken = assignToken || left;
- if (left.id === ".") {
- if (!left.left) {
- warning("E031", that);
- } else if (left.left.value === "arguments" && !state.directive["use strict"]) {
- warning("E031", that);
- }
+ if (state.option.freeze) {
+ var nativeObject = findNativePrototype(left);
+ if (nativeObject)
+ warning("W121", left, nativeObject);
+ }
+ if (checkPunctuator(left, "...")) {
+ left = left.right;
+ }
- state.nameStack.set(state.tokens.prev);
- that.right = expression(10);
- return that;
- } else if (left.id === "[") {
- if (state.tokens.curr.left.first) {
- state.tokens.curr.left.first.forEach(function (t) {
- if (t && funct[t.value] === "const") {
- error("E013", t, t.value);
- }
- });
- } else if (!left.left) {
- warning("E031", that);
- } else if (left.left.value === "arguments" && !state.directive["use strict"]) {
- warning("E031", that);
- }
+ if (left.identifier && !left.isMetaProperty) {
+ // reassign also calls modify
+ // but we are specific in order to catch function re-assignment
+ // and globals re-assignment
+ state.funct["(scope)"].block.reassign(left.value, left);
+ }
- state.nameStack.set(left.right);
+ if (left.id === ".") {
+ if (!left.left || left.left.value === "arguments" && !state.isStrict()) {
+ warning("E031", assignToken);
+ }
- that.right = expression(10);
- return that;
- } else if (left.identifier && !isReserved(left)) {
- if (funct[left.value] === "exception") {
- warning("W022", left);
+ state.nameStack.set(state.tokens.prev);
+ return true;
+ } else if (left.id === "{" || left.id === "[") {
+ if (allowDestructuring && left.destructAssign) {
+ left.destructAssign.forEach(function(t) {
+ if (t.id) {
+ state.funct["(scope)"].block.modify(t.id, t.token);
}
- state.nameStack.set(left);
- that.right = expression(10);
- return that;
+ });
+ } else {
+ if (left.id === "{" || !left.left) {
+ warning("E031", assignToken);
+ } else if (left.left.value === "arguments" && !state.isStrict()) {
+ warning("E031", assignToken);
}
+ }
- if (left === state.syntax["function"]) {
- warning("W023", state.tokens.curr);
- }
+ if (left.id === "[") {
+ state.nameStack.set(left.right);
}
- error("E031", that);
+ return true;
+ } else if (left.identifier && !isReserved(left) && !left.isMetaProperty) {
+ if (state.funct["(scope)"].labeltype(left.value) === "exception") {
+ warning("W022", left);
+ }
+ state.nameStack.set(left);
+ return true;
+ }
+
+ if (left === state.syntax["function"]) {
+ warning("W023", state.tokens.curr);
+ } else {
+ error("E031", assignToken);
+ }
+
+ return false;
+ }
+
+ function assignop(s, f, p) {
+ var x = infix(s, typeof f === "function" ? f : function(left, that) {
+ that.left = left;
+
+ checkLeftSideAssign(left, that, { allowDestructuring: true });
+
+ that.right = expression(10);
+
+ return that;
}, p);
x.exps = true;
@@ -8050,7 +20174,7 @@ var JSHINT = (function () {
function bitwise(s, f, p) {
var x = symbol(s, p);
reserveName(x);
- x.led = (typeof f === "function") ? f : function (left) {
+ x.led = (typeof f === "function") ? f : function(left) {
if (state.option.bitwise) {
warning("W016", this, this.id);
}
@@ -8061,39 +20185,40 @@ var JSHINT = (function () {
return x;
}
-
function bitwiseassignop(s) {
- return assignop(s, function (left, that) {
+ return assignop(s, function(left, that) {
if (state.option.bitwise) {
warning("W016", that, that.id);
}
- if (left) {
- if (left.id === "." || left.id === "[" ||
- (left.identifier && !isReserved(left))) {
- expression(10);
- return that;
- }
- if (left === state.syntax["function"]) {
- warning("W023", state.tokens.curr);
- }
- return that;
- }
- error("E031", that);
+ checkLeftSideAssign(left, that);
+
+ that.right = expression(10);
+
+ return that;
}, 20);
}
-
function suffix(s) {
var x = symbol(s, 150);
- x.led = function (left) {
+ x.led = function(left) {
+ // this = suffix e.g. "++" punctuator
+ // left = symbol operated e.g. "a" identifier or "a.b" punctuator
if (state.option.plusplus) {
warning("W016", this, this.id);
} else if ((!left.identifier || isReserved(left)) && left.id !== "." && left.id !== "[") {
warning("W017", this);
}
+ if (left.isMetaProperty) {
+ error("E031", this);
+ // detect increment/decrement of a const
+ // in the case of a.b, left will be the "." punctuator
+ } else if (left && left.identifier) {
+ state.funct["(scope)"].block.modify(left.value, left);
+ }
+
this.left = left;
return this;
};
@@ -8103,9 +20228,8 @@ var JSHINT = (function () {
// fnparam means that this identifier is being defined as a function
// argument (see identifier())
// prop means that this identifier is that of an object property
- // exported means that the identifier is part of a valid ES6 `export` declaration
- function optionalidentifier(fnparam, prop, preserve, exported) {
+ function optionalidentifier(fnparam, prop, preserve) {
if (!state.tokens.next.identifier) {
return;
}
@@ -8117,16 +20241,12 @@ var JSHINT = (function () {
var curr = state.tokens.curr;
var val = state.tokens.curr.value;
- if (exported) {
- state.tokens.curr.exported = true;
- }
-
if (!isReserved(curr)) {
return val;
}
if (prop) {
- if (state.option.inES5()) {
+ if (state.inES5()) {
return val;
}
}
@@ -8142,20 +20262,42 @@ var JSHINT = (function () {
// fnparam means that this identifier is being defined as a function
// argument
// prop means that this identifier is that of an object property
- // `exported` means that the identifier token should be exported.
- function identifier(fnparam, prop, exported) {
- var i = optionalidentifier(fnparam, prop, false, exported);
+ function identifier(fnparam, prop) {
+ var i = optionalidentifier(fnparam, prop, false);
if (i) {
return i;
}
// parameter destructuring with rest operator
if (state.tokens.next.value === "...") {
- if (!state.option.esnext) {
- warning("W119", state.tokens.next, "spread/rest operator");
+ if (!state.inES6(true)) {
+ warning("W119", state.tokens.next, "spread/rest operator", "6");
}
+ advance();
+
+ if (checkPunctuator(state.tokens.next, "...")) {
+ warning("E024", state.tokens.next, "...");
+ while (checkPunctuator(state.tokens.next, "...")) {
+ advance();
+ }
+ }
+
+ if (!state.tokens.next.identifier) {
+ warning("E024", state.tokens.curr, "...");
+ return;
+ }
+
+ return identifier(fnparam, prop);
} else {
error("E030", state.tokens.next, state.tokens.next.value);
+
+ // The token should be consumed after a warning is issued so the parser
+ // can continue as though an identifier were found. The semicolon token
+ // should not be consumed in this way so that the parser interprets it as
+ // a statement delimeter;
+ if (state.tokens.next.id !== ";") {
+ advance();
+ }
}
}
@@ -8169,7 +20311,7 @@ var JSHINT = (function () {
do {
t = peek(i);
i += 1;
- } while (t.id != "(end)" && t.id === "(comment)");
+ } while (t.id !== "(end)" && t.id === "(comment)");
if (t.reach) {
return;
@@ -8190,12 +20332,20 @@ var JSHINT = (function () {
function parseFinalSemicolon() {
if (state.tokens.next.id !== ";") {
- if (!state.option.asi) {
+ // don't complain about unclosed templates / strings
+ if (state.tokens.next.isUnclosed) return advance();
+
+ var sameLine = startLine(state.tokens.next) === state.tokens.curr.line &&
+ state.tokens.next.id !== "(end)";
+ var blockEnd = checkPunctuator(state.tokens.next, "}");
+
+ if (sameLine && !blockEnd) {
+ errorAt("E058", state.tokens.curr.line, state.tokens.curr.character);
+ } else if (!state.option.asi) {
// If this is the last statement in a block that ends on
// the same line *and* option lastsemic is on, ignore the warning.
// Otherwise, complain about missing semicolon.
- if (!state.option.lastsemic || state.tokens.next.id !== "}" ||
- state.tokens.next.line !== state.tokens.curr.line) {
+ if ((blockEnd && !state.option.lastsemic) || !sameLine) {
warningAt("W033", state.tokens.curr.line, state.tokens.curr.character);
}
}
@@ -8205,8 +20355,7 @@ var JSHINT = (function () {
}
function statement() {
- var values;
- var i = indent, r, s = scope, t = state.tokens.next;
+ var i = indent, r, t = state.tokens.next, hasOwnScope = false;
if (t.id === ";") {
advance(";");
@@ -8225,44 +20374,13 @@ var JSHINT = (function () {
res = false;
}
- // detect a module import declaration
- if (t.value === "module" && t.type === "(identifier)") {
- if (peek().type === "(identifier)") {
- if (!state.option.inESNext()) {
- warning("W119", state.tokens.curr, "module");
- }
-
- advance("module");
- var name = identifier();
- addlabel(name, { type: "unused", token: state.tokens.curr });
- advance("from");
- advance("(string)");
- parseFinalSemicolon();
- return;
- }
- }
-
- // detect a destructuring assignment
- if (_.has(["[", "{"], t.value)) {
- if (lookupBlockType().isDestAssign) {
- if (!state.option.inESNext()) {
- warning("W104", state.tokens.curr, "destructuring expression");
- }
- values = destructuringExpression();
- values.forEach(function (tok) {
- isundef(funct, "W117", tok.token, tok.id);
- });
- advance("=");
- destructuringExpressionMatch(values, expression(10, true));
- advance(";");
- return;
- }
- }
if (t.identifier && !res && peek().id === ":") {
advance();
advance(":");
- scope = Object.create(s);
- addlabel(t.value, { type: "label" });
+
+ hasOwnScope = true;
+ state.funct["(scope)"].stack();
+ state.funct["(scope)"].block.addBreakLabel(t.value, { token: state.tokens.curr });
if (!state.tokens.next.labelled && state.tokens.next.value !== "{") {
warning("W028", state.tokens.next, t.value, state.tokens.next.value);
@@ -8282,7 +20400,7 @@ var JSHINT = (function () {
// ...
// }
// }
- var iscase = (funct["(verb)"] === "case" && state.tokens.curr.value === ":");
+ var iscase = (state.funct["(verb)"] === "case" && state.tokens.curr.value === ":");
block(true, true, false, false, iscase);
return;
}
@@ -8291,10 +20409,10 @@ var JSHINT = (function () {
r = expression(0, true);
- if (r && (!r.identifier || r.value !== "function") && (r.type !== "(punctuator)")) {
- if (!state.directive["use strict"] &&
- state.option.globalstrict &&
- state.option.strict) {
+ if (r && !(r.identifier && r.value === "function") &&
+ !(r.type === "(punctuator)" && r.left &&
+ r.left.identifier && r.left.value === "function")) {
+ if (!state.isStrict() && state.stmtMissingStrict()) {
warning("E007");
}
}
@@ -8314,7 +20432,9 @@ var JSHINT = (function () {
// Restore the indentation.
indent = i;
- scope = s;
+ if (hasOwnScope) {
+ state.funct["(scope)"].unstack();
+ }
return r;
}
@@ -8358,36 +20478,35 @@ var JSHINT = (function () {
p = pn;
} else if (pn.value === "[" || pn.value === ".") {
// string -> [ | . is a valid production
- return;
+ break;
} else if (!state.option.asi || pn.value === "(") {
// string -> ( is not a valid production
warning("W033", state.tokens.next);
}
} else if (p.id === "." || p.id === "[") {
- return;
+ break;
} else if (p.id !== ";") {
warning("W033", p);
}
advance();
- if (state.directive[state.tokens.curr.value]) {
- warning("W034", state.tokens.curr, state.tokens.curr.value);
- }
-
- if (state.tokens.curr.value === "use strict") {
- if (!state.option["(explicitNewcap)"]) {
- state.option.newcap = true;
- }
- state.option.undef = true;
+ var directive = state.tokens.curr.value;
+ if (state.directive[directive] ||
+ (directive === "use strict" && state.option.strict === "implied")) {
+ warning("W034", state.tokens.curr, directive);
}
// there's no directive negation, so always set to true
- state.directive[state.tokens.curr.value] = true;
+ state.directive[directive] = true;
if (p.id === ";") {
advance(";");
}
}
+
+ if (state.isStrict()) {
+ state.option.undef = true;
+ }
}
@@ -8406,19 +20525,15 @@ var JSHINT = (function () {
b = inblock,
old_indent = indent,
m,
- s = scope,
t,
line,
d;
inblock = ordinary;
- if (!ordinary || !state.option.funcscope)
- scope = Object.create(scope);
-
t = state.tokens.next;
- var metrics = funct["(metrics)"];
+ var metrics = state.funct["(metrics)"];
metrics.nestedBlockDepth += 1;
metrics.verifyMaxNestedBlockDepthPerFunction();
@@ -8426,7 +20541,8 @@ var JSHINT = (function () {
advance("{");
// create a new block scope
- funct["(blockscope)"].stack();
+ state.funct["(scope)"].stack();
+ state.funct["(noblockscopedvar)"] = false;
line = state.tokens.curr.line;
if (state.tokens.next.id !== "}") {
@@ -8444,8 +20560,8 @@ var JSHINT = (function () {
}
directives();
- if (state.option.strict && funct["(context)"]["(global)"]) {
- if (!m["use strict"] && !state.directive["use strict"]) {
+ if (state.option.strict && state.funct["(context)"]["(global)"]) {
+ if (!m["use strict"] && !state.isStrict()) {
warning("E007");
}
}
@@ -8455,22 +20571,27 @@ var JSHINT = (function () {
metrics.statementCount += a.length;
- if (isfunc) {
- state.directive = m;
- }
-
indent -= state.option.indent;
}
advance("}", t);
- funct["(blockscope)"].unstack();
+ if (isfunc) {
+ state.funct["(scope)"].validateParams();
+ if (m) {
+ state.directive = m;
+ }
+ }
+
+ state.funct["(scope)"].unstack();
indent = old_indent;
} else if (!ordinary) {
if (isfunc) {
+ state.funct["(scope)"].stack();
+
m = {};
- if (stmt && !isfatarrow && !state.option.inMoz(true)) {
+ if (stmt && !isfatarrow && !state.inMoz()) {
error("W118", state.tokens.curr, "function closure expressions");
}
@@ -8483,18 +20604,22 @@ var JSHINT = (function () {
}
expression(10);
- if (state.option.strict && funct["(context)"]["(global)"]) {
- if (!m["use strict"] && !state.directive["use strict"]) {
+ if (state.option.strict && state.funct["(context)"]["(global)"]) {
+ if (!m["use strict"] && !state.isStrict()) {
warning("E007");
}
}
+
+ state.funct["(scope)"].unstack();
} else {
error("E021", state.tokens.next, "{", state.tokens.next.value);
}
} else {
// check to avoid let declaration not within a block
- funct["(nolet)"] = true;
+ // though is fine inside for loop initializer section
+ state.funct["(noblockscopedvar)"] = state.tokens.next.id !== "for";
+ state.funct["(scope)"].stack();
if (!stmt || state.option.curly) {
warning("W116", state.tokens.next, "{", state.tokens.next.value);
@@ -8506,11 +20631,12 @@ var JSHINT = (function () {
a = [statement()];
indent -= state.option.indent;
- delete funct["(nolet)"];
+ state.funct["(scope)"].unstack();
+ delete state.funct["(noblockscopedvar)"];
}
// Don't clear and let it propagate out if it is "break", "return" or similar in switch case
- switch (funct["(verb)"]) {
+ switch (state.funct["(verb)"]) {
case "break":
case "continue":
case "return":
@@ -8521,10 +20647,9 @@ var JSHINT = (function () {
/* falls through */
default:
- funct["(verb)"] = null;
+ state.funct["(verb)"] = null;
}
- if (!ordinary || !state.option.funcscope) scope = s;
inblock = b;
if (ordinary && state.option.noempty && (!a || a.length === 0)) {
warning("W035", state.tokens.prev);
@@ -8545,25 +20670,13 @@ var JSHINT = (function () {
}
}
-
- function note_implied(tkn) {
- var name = tkn.value;
- var desc = Object.getOwnPropertyDescriptor(implied, name);
-
- if (!desc)
- implied[name] = [tkn.line];
- else
- desc.value.push(tkn.line);
- }
-
-
// Build the syntax table by declaring the syntactic elements of the language.
- type("(number)", function () {
+ type("(number)", function() {
return this;
});
- type("(string)", function () {
+ type("(string)", function() {
return this;
});
@@ -8572,146 +20685,77 @@ var JSHINT = (function () {
lbp: 0,
identifier: true,
- nud: function () {
+ nud: function() {
var v = this.value;
- var s = scope[v];
- var f;
- var block;
-
- if (typeof s === "function") {
- // Protection against accidental inheritance.
- s = undefined;
- } else if (!funct["(blockscope)"].current.has(v) && typeof s === "boolean") {
- f = funct;
- funct = functions[0];
- addlabel(v, { type: "var" });
- s = funct;
- funct = f;
- }
-
- block = funct["(blockscope)"].getlabel(v);
-
- // The name is in scope and defined in the current function.
- if (funct === s || block) {
- // Change 'unused' to 'var', and reject labels.
- // the name is in a block scope.
- switch (block ? block[v]["(type)"] : funct[v]) {
- case "unused":
- if (block) block[v]["(type)"] = "var";
- else funct[v] = "var";
- break;
- case "unction":
- if (block) block[v]["(type)"] = "function";
- else funct[v] = "function";
- this["function"] = true;
- break;
- case "const":
- setprop(funct, v, { unused: false });
- break;
- case "function":
- this["function"] = true;
- break;
- case "label":
- warning("W037", state.tokens.curr, v);
- break;
- }
- } else {
- // If the name is already defined in the current
- // function, but not as outer, then there is a scope error.
-
- switch (funct[v]) {
- case "closure":
- case "function":
- case "var":
- case "unused":
- warning("W038", state.tokens.curr, v);
- break;
- case "label":
- warning("W037", state.tokens.curr, v);
- break;
- case "outer":
- case "global":
- break;
- default:
- // If the name is defined in an outer function, make an outer entry,
- // and if it was unused, make it var.
- if (s === true) {
- funct[v] = true;
- } else if (s === null) {
- warning("W039", state.tokens.curr, v);
- note_implied(state.tokens.curr);
- } else if (typeof s !== "object") {
- // if we're in a list comprehension, variables are declared
- // locally and used before being defined. So we check
- // the presence of the given variable in the comp array
- // before declaring it undefined.
-
- if (!funct["(comparray)"].check(v)) {
- isundef(funct, "W117", state.tokens.curr, v);
- }
- // Explicitly mark the variable as used within function scopes
- if (!funct["(global)"]) {
- funct[v] = true;
- }
+ // If this identifier is the lone parameter to a shorthand "fat arrow"
+ // function definition, i.e.
+ //
+ // x => x;
+ //
+ // ...it should not be considered as a variable in the current scope. It
+ // will be added to the scope of the new function when the next token is
+ // parsed, so it can be safely ignored for now.
+ if (state.tokens.next.id === "=>") {
+ return this;
+ }
- note_implied(state.tokens.curr);
- } else {
- switch (s[v]) {
- case "function":
- case "unction":
- this["function"] = true;
- s[v] = "closure";
- funct[v] = s["(global)"] ? "global" : "outer";
- break;
- case "var":
- case "unused":
- s[v] = "closure";
- funct[v] = s["(global)"] ? "global" : "outer";
- break;
- case "const":
- setprop(s, v, { unused: false });
- break;
- case "closure":
- funct[v] = s["(global)"] ? "global" : "outer";
- break;
- case "label":
- warning("W037", state.tokens.curr, v);
- }
- }
- }
+ if (!state.funct["(comparray)"].check(v)) {
+ state.funct["(scope)"].block.use(v, state.tokens.curr);
}
return this;
},
- led: function () {
+ led: function() {
error("E033", state.tokens.next, state.tokens.next.value);
}
};
- state.syntax["(template)"] = {
- type: "(template)",
- lbp: 0,
+ var baseTemplateSyntax = {
identifier: false,
- fud: doTemplateLiteral
+ template: true,
};
+ state.syntax["(template)"] = _.extend({
+ lbp: 155,
+ type: "(template)",
+ nud: doTemplateLiteral,
+ led: doTemplateLiteral,
+ noSubst: false
+ }, baseTemplateSyntax);
- type("(template middle)", function () {
- return this;
- });
+ state.syntax["(template middle)"] = _.extend({
+ lbp: 0,
+ type: "(template middle)",
+ middle: true,
+ noSubst: false
+ }, baseTemplateSyntax);
- type("(template tail)", function () {
- return this;
- });
+ state.syntax["(template tail)"] = _.extend({
+ lbp: 0,
+ type: "(template tail)",
+ tail: true,
+ noSubst: false
+ }, baseTemplateSyntax);
+
+ state.syntax["(no subst template)"] = _.extend({
+ lbp: 155,
+ type: "(template)",
+ nud: doTemplateLiteral,
+ led: doTemplateLiteral,
+ noSubst: true,
+ tail: true // mark as tail, since it's always the last component
+ }, baseTemplateSyntax);
- type("(regexp)", function () {
+ type("(regexp)", function() {
return this;
});
// ECMAScript parser
delim("(endline)");
- delim("(begin)");
+ (function(x) {
+ x.line = x.from = 0;
+ })(delim("(begin)"));
delim("(end)").reach = true;
delim("(error)").reach = true;
delim("}").reach = true;
@@ -8728,8 +20772,8 @@ var JSHINT = (function () {
reserve("catch");
reserve("default").reach = true;
reserve("finally");
- reservevar("arguments", function (x) {
- if (state.directive["use strict"] && funct["(global)"]) {
+ reservevar("arguments", function(x) {
+ if (state.isStrict() && state.funct["(global)"]) {
warning("E008", x);
}
});
@@ -8737,10 +20781,10 @@ var JSHINT = (function () {
reservevar("false");
reservevar("Infinity");
reservevar("null");
- reservevar("this", function (x) {
- if (state.directive["use strict"] && !isMethod() &&
- !state.option.validthis && ((funct["(statement)"] &&
- funct["(name)"].charAt(0) > "Z") || funct["(global)"])) {
+ reservevar("this", function(x) {
+ if (state.isStrict() && !isMethod() &&
+ !state.option.validthis && ((state.funct["(statement)"] &&
+ state.funct["(name)"].charAt(0) > "Z") || state.funct["(global)"])) {
warning("W040", x);
}
});
@@ -8751,7 +20795,7 @@ var JSHINT = (function () {
assignop("+=", "assignadd", 20);
assignop("-=", "assignsub", 20);
assignop("*=", "assignmult", 20);
- assignop("/=", "assigndiv", 20).nud = function () {
+ assignop("/=", "assigndiv", 20).nud = function() {
error("E014");
};
assignop("%=", "assignmod", 20);
@@ -8762,25 +20806,30 @@ var JSHINT = (function () {
bitwiseassignop("<<=");
bitwiseassignop(">>=");
bitwiseassignop(">>>=");
- infix(",", function (left, that) {
+ infix(",", function(left, that) {
var expr;
that.exprs = [left];
- if (!comma({peek: true})) {
+
+ if (state.option.nocomma) {
+ warning("W127");
+ }
+
+ if (!parseComma({ peek: true })) {
return that;
}
while (true) {
- if (!(expr = expression(10))) {
+ if (!(expr = expression(10))) {
break;
}
that.exprs.push(expr);
- if (state.tokens.next.value !== "," || !comma()) {
+ if (state.tokens.next.value !== "," || !parseComma()) {
break;
}
}
return that;
}, 10, true);
- infix("?", function (left, that) {
+ infix("?", function(left, that) {
increaseComplexityCount();
that.left = left;
that.right = expression(10);
@@ -8790,7 +20839,7 @@ var JSHINT = (function () {
}, 30);
var orPrecendence = 40;
- infix("||", function (left, that) {
+ infix("||", function(left, that) {
increaseComplexityCount();
that.left = left;
that.right = expression(orPrecendence);
@@ -8800,8 +20849,9 @@ var JSHINT = (function () {
bitwise("|", "bitor", 70);
bitwise("^", "bitxor", 80);
bitwise("&", "bitand", 90);
- relation("==", function (left, right) {
- var eqnull = state.option.eqnull && (left.value === "null" || right.value === "null");
+ relation("==", function(left, right) {
+ var eqnull = state.option.eqnull &&
+ ((left && left.value) === "null" || (right && right.value) === "null");
switch (true) {
case !eqnull && state.option.eqeqeq:
@@ -8814,27 +20864,27 @@ var JSHINT = (function () {
case isPoorRelation(right):
warning("W041", this, "===", right.value);
break;
- case isTypoTypeof(right, left):
+ case isTypoTypeof(right, left, state):
warning("W122", this, right.value);
break;
- case isTypoTypeof(left, right):
+ case isTypoTypeof(left, right, state):
warning("W122", this, left.value);
break;
}
return this;
});
- relation("===", function (left, right) {
- if (isTypoTypeof(right, left)) {
+ relation("===", function(left, right) {
+ if (isTypoTypeof(right, left, state)) {
warning("W122", this, right.value);
- } else if (isTypoTypeof(left, right)) {
+ } else if (isTypoTypeof(left, right, state)) {
warning("W122", this, left.value);
}
return this;
});
- relation("!=", function (left, right) {
+ relation("!=", function(left, right) {
var eqnull = state.option.eqnull &&
- (left.value === "null" || right.value === "null");
+ ((left && left.value) === "null" || (right && right.value) === "null");
if (!eqnull && state.option.eqeqeq) {
this.from = this.character;
@@ -8843,17 +20893,17 @@ var JSHINT = (function () {
warning("W041", this, "!==", left.value);
} else if (isPoorRelation(right)) {
warning("W041", this, "!==", right.value);
- } else if (isTypoTypeof(right, left)) {
+ } else if (isTypoTypeof(right, left, state)) {
warning("W122", this, right.value);
- } else if (isTypoTypeof(left, right)) {
+ } else if (isTypoTypeof(left, right, state)) {
warning("W122", this, left.value);
}
return this;
});
- relation("!==", function (left, right) {
- if (isTypoTypeof(right, left)) {
+ relation("!==", function(left, right) {
+ if (isTypoTypeof(right, left, state)) {
warning("W122", this, right.value);
- } else if (isTypoTypeof(left, right)) {
+ } else if (isTypoTypeof(left, right, state)) {
warning("W122", this, left.value);
}
return this;
@@ -8867,8 +20917,11 @@ var JSHINT = (function () {
bitwise(">>>", "shiftrightunsigned", 120);
infix("in", "in", 120);
infix("instanceof", "instanceof", 120);
- infix("+", function (left, that) {
- var right = expression(130);
+ infix("+", function(left, that) {
+ var right;
+ that.left = left;
+ that.right = right = expression(130);
+
if (left && right && left.id === "(string)" && right.id === "(string)") {
left.value += right.value;
left.character = right.character;
@@ -8877,18 +20930,17 @@ var JSHINT = (function () {
}
return left;
}
- that.left = left;
- that.right = right;
+
return that;
}, 130);
prefix("+", "num");
- prefix("+++", function () {
+ prefix("+++", function() {
warning("W007");
- this.right = expression(150);
this.arity = "unary";
+ this.right = expression(150);
return this;
});
- infix("+++", function (left) {
+ infix("+++", function(left) {
warning("W007");
this.left = left;
this.right = expression(130);
@@ -8896,13 +20948,13 @@ var JSHINT = (function () {
}, 130);
infix("-", "sub", 130);
prefix("-", "neg");
- prefix("---", function () {
+ prefix("---", function() {
warning("W006");
- this.right = expression(150);
this.arity = "unary";
+ this.right = expression(150);
return this;
});
- infix("---", function (left) {
+ infix("---", function(left) {
warning("W006");
this.left = left;
this.right = expression(130);
@@ -8919,46 +20971,86 @@ var JSHINT = (function () {
suffix("--");
prefix("--", "predec");
state.syntax["--"].exps = true;
- prefix("delete", function () {
+ prefix("delete", function() {
var p = expression(10);
- if (!p || (p.id !== "." && p.id !== "[")) {
+ if (!p) {
+ return this;
+ }
+
+ if (p.id !== "." && p.id !== "[") {
warning("W051");
}
this.first = p;
// The `delete` operator accepts unresolvable references when not in strict
// mode, so the operand may be undefined.
- if (p.identifier && !state.directive["use strict"]) {
+ if (p.identifier && !state.isStrict()) {
p.forgiveUndef = true;
}
return this;
}).exps = true;
- prefix("~", function () {
+ prefix("~", function() {
if (state.option.bitwise) {
- warning("W052", this, "~");
+ warning("W016", this, "~");
}
- expression(150);
+ this.arity = "unary";
+ this.right = expression(150);
return this;
});
- prefix("...", function () {
- if (!state.option.esnext) {
- warning("W119", this, "spread/rest operator");
- }
- if (!state.tokens.next.identifier) {
+ prefix("...", function() {
+ if (!state.inES6(true)) {
+ warning("W119", this, "spread/rest operator", "6");
+ }
+
+ // TODO: Allow all AssignmentExpression
+ // once parsing permits.
+ //
+ // How to handle eg. number, boolean when the built-in
+ // prototype of may have an @@iterator definition?
+ //
+ // Number.prototype[Symbol.iterator] = function * () {
+ // yield this.valueOf();
+ // };
+ //
+ // var a = [ ...1 ];
+ // console.log(a); // [1];
+ //
+ // for (let n of [...10]) {
+ // console.log(n);
+ // }
+ // // 10
+ //
+ //
+ // Boolean.prototype[Symbol.iterator] = function * () {
+ // yield this.valueOf();
+ // };
+ //
+ // var a = [ ...true ];
+ // console.log(a); // [true];
+ //
+ // for (let n of [...false]) {
+ // console.log(n);
+ // }
+ // // false
+ //
+ if (!state.tokens.next.identifier &&
+ state.tokens.next.type !== "(string)" &&
+ !checkPunctuators(state.tokens.next, ["[", "("])) {
+
error("E030", state.tokens.next, state.tokens.next.value);
}
- expression(150);
+ this.right = expression(150);
return this;
});
- prefix("!", function () {
- this.right = expression(150);
+ prefix("!", function() {
this.arity = "unary";
+ this.right = expression(150);
if (!this.right) { // '!' followed by nothing? Give up.
- quit("E041", this.line || 0);
+ quit("E041", this);
}
if (bang[this.right.id] === true) {
@@ -8967,9 +21059,13 @@ var JSHINT = (function () {
return this;
});
- prefix("typeof", (function () {
+ prefix("typeof", (function() {
var p = expression(150);
- this.first = p;
+ this.first = this.right = p;
+
+ if (!p) { // 'typeof' followed by nothing? Give up.
+ quit("E041", this);
+ }
// The `typeof` operator accepts unresolvable references, so the operand
// may be undefined.
@@ -8978,7 +21074,23 @@ var JSHINT = (function () {
}
return this;
}));
- prefix("new", function () {
+ prefix("new", function() {
+ var mp = metaProperty("target", function() {
+ if (!state.inES6(true)) {
+ warning("W119", state.tokens.prev, "new.target", "6");
+ }
+ var inFunction, c = state.funct;
+ while (c) {
+ inFunction = !c["(global)"];
+ if (!c["(arrow)"]) { break; }
+ c = c["(context)"];
+ }
+ if (!inFunction) {
+ warning("W136", state.tokens.prev, "new.target");
+ }
+ });
+ if (mp) { return mp; }
+
var c = expression(155), i;
if (c && c.id !== "function") {
if (c.identifier) {
@@ -8992,7 +21104,7 @@ var JSHINT = (function () {
warning("W053", state.tokens.prev, c.value);
break;
case "Symbol":
- if (state.option.esnext) {
+ if (state.inES6()) {
warning("W053", state.tokens.prev, c.value);
}
break;
@@ -9008,7 +21120,8 @@ var JSHINT = (function () {
default:
if (c.id !== "function") {
i = c.value.substr(0, 1);
- if (state.option.newcap && (i < "A" || i > "Z") && !_.has(global, c.value)) {
+ if (state.option.newcap && (i < "A" || i > "Z") &&
+ !state.funct["(scope)"].isPredefined(c.value)) {
warning("W055", state.tokens.curr);
}
}
@@ -9025,14 +21138,14 @@ var JSHINT = (function () {
if (state.tokens.next.id !== "(" && !state.option.supernew) {
warning("W058", state.tokens.curr, state.tokens.curr.value);
}
- this.first = c;
+ this.first = this.right = c;
return this;
});
state.syntax["new"].exps = true;
prefix("void").exps = true;
- infix(".", function (left, that) {
+ infix(".", function(left, that) {
var m = identifier(false, true);
if (typeof m === "string") {
@@ -9049,7 +21162,7 @@ var JSHINT = (function () {
if (left && left.value === "arguments" && (m === "callee" || m === "caller")) {
if (state.option.noarg)
warning("W059", left, m);
- else if (state.directive["use strict"])
+ else if (state.isStrict())
error("E008");
} else if (!state.option.evil && left && left.value === "document" &&
(m === "write" || m === "writeln")) {
@@ -9057,13 +21170,15 @@ var JSHINT = (function () {
}
if (!state.option.evil && (m === "eval" || m === "execScript")) {
- warning("W061");
+ if (isGlobalEval(left, state)) {
+ warning("W061");
+ }
}
return that;
}, 160, true);
- infix("(", function (left, that) {
+ infix("(", function(left, that) {
if (state.option.immed && left && !left.immed && left.id === "function") {
warning("W062");
}
@@ -9074,7 +21189,7 @@ var JSHINT = (function () {
if (left) {
if (left.type === "(identifier)") {
if (left.value.match(/^[A-Z]([A-Z0-9_$]*[a-z][A-Za-z0-9_$]*)?$/)) {
- if ("Number String Boolean Date Object Error Symbol".indexOf(left.value) === -1) {
+ if ("Array Number String Boolean Date Object Error Symbol".indexOf(left.value) === -1) {
if (left.value === "Math") {
warning("W063", left);
} else if (state.option.newcap) {
@@ -9092,14 +21207,14 @@ var JSHINT = (function () {
if (state.tokens.next.id !== ",") {
break;
}
- comma();
+ parseComma();
}
}
advance(")");
if (typeof left === "object") {
- if (state.option.inES3() && left.value === "parseInt" && n === 1) {
+ if (!state.inES5() && left.value === "parseInt" && n === 1) {
warning("W065", state.tokens.curr);
}
if (!state.option.evil) {
@@ -9126,10 +21241,10 @@ var JSHINT = (function () {
addInternalSrc(left, p[0].value);
}
}
- if (!left.identifier && left.id !== "." && left.id !== "[" &&
- left.id !== "(" && left.id !== "&&" && left.id !== "||" &&
- left.id !== "?" && !(state.option.esnext && left.id === "=>")) {
- warning("W067", left);
+ if (!left.identifier && left.id !== "." && left.id !== "[" && left.id !== "=>" &&
+ left.id !== "(" && left.id !== "&&" && left.id !== "||" && left.id !== "?" &&
+ !(state.inES6() && left["(name)"])) {
+ warning("W067", that);
}
}
@@ -9137,15 +21252,15 @@ var JSHINT = (function () {
return that;
}, 155, true).exps = true;
- prefix("(", function () {
- var bracket, brackets = [];
- var pn, pn1, i = 0;
- var ret, triggerFnExpr;
+ prefix("(", function() {
+ var pn = state.tokens.next, pn1, i = -1;
+ var ret, triggerFnExpr, first, last;
var parens = 1;
+ var opening = state.tokens.curr;
+ var preceeding = state.tokens.prev;
+ var isNecessary = !state.option.singleGroups;
do {
- pn = peek(i);
-
if (pn.value === "(") {
parens += 1;
} else if (pn.value === ")") {
@@ -9153,32 +21268,36 @@ var JSHINT = (function () {
}
i += 1;
- pn1 = peek(i);
- } while (!(parens === 0 && pn.value === ")") &&
- pn1.value !== "=>" && pn1.value !== ";" && pn1.type !== "(end)");
+ pn1 = pn;
+ pn = peek(i);
+ } while (!(parens === 0 && pn1.value === ")") && pn.value !== ";" && pn.type !== "(end)");
if (state.tokens.next.id === "function") {
triggerFnExpr = state.tokens.next.immed = true;
}
+ // If the balanced grouping operator is followed by a "fat arrow", the
+ // current token marks the beginning of a "fat arrow" function and parsing
+ // should proceed accordingly.
+ if (pn.value === "=>") {
+ return doFunction({ type: "arrow", parsedOpening: true });
+ }
+
var exprs = [];
if (state.tokens.next.id !== ")") {
for (;;) {
- if (pn1.value === "=>" && _.contains(["{", "["], state.tokens.next.value)) {
- bracket = state.tokens.next;
- bracket.left = destructuringExpression();
- brackets.push(bracket);
- for (var t in bracket.left) {
- exprs.push(bracket.left[t].token);
- }
- } else {
- exprs.push(expression(10));
- }
+ exprs.push(expression(10));
+
if (state.tokens.next.id !== ",") {
break;
}
- comma();
+
+ if (state.option.nocomma) {
+ warning("W127");
+ }
+
+ parseComma();
}
}
@@ -9190,32 +21309,78 @@ var JSHINT = (function () {
}
}
- if (state.tokens.next.value === "=>") {
- return exprs;
- }
if (!exprs.length) {
return;
}
if (exprs.length > 1) {
ret = Object.create(state.syntax[","]);
ret.exprs = exprs;
+
+ first = exprs[0];
+ last = exprs[exprs.length - 1];
+
+ if (!isNecessary) {
+ isNecessary = preceeding.assign || preceeding.delim;
+ }
} else {
- ret = exprs[0];
+ ret = first = last = exprs[0];
+
+ if (!isNecessary) {
+ isNecessary =
+ // Used to distinguish from an ExpressionStatement which may not
+ // begin with the `{` and `function` tokens
+ (opening.beginsStmt && (ret.id === "{" || triggerFnExpr || isFunctor(ret))) ||
+ // Used to signal that a function expression is being supplied to
+ // some other operator.
+ (triggerFnExpr &&
+ // For parenthesis wrapping a function expression to be considered
+ // necessary, the grouping operator should be the left-hand-side of
+ // some other operator--either within the parenthesis or directly
+ // following them.
+ (!isEndOfExpr() || state.tokens.prev.id !== "}")) ||
+ // Used to demarcate an arrow function as the left-hand side of some
+ // operator.
+ (isFunctor(ret) && !isEndOfExpr()) ||
+ // Used as the return value of a single-statement arrow function
+ (ret.id === "{" && preceeding.id === "=>") ||
+ // Used to delineate an integer number literal from a dereferencing
+ // punctuator (otherwise interpreted as a decimal point)
+ (ret.type === "(number)" &&
+ checkPunctuator(pn, ".") && /^\d+$/.test(ret.value)) ||
+ // Used to wrap object destructuring assignment
+ (opening.beginsStmt && ret.id === "=" && ret.left.id === "{");
+ }
}
+
if (ret) {
+ // The operator may be necessary to override the default binding power of
+ // neighboring operators (whenever there is an operator in use within the
+ // first expression *or* the current group contains multiple expressions)
+ if (!isNecessary && (first.left || first.right || ret.exprs)) {
+ isNecessary =
+ (!isBeginOfExpr(preceeding) && first.lbp <= preceeding.lbp) ||
+ (!isEndOfExpr() && last.lbp < state.tokens.next.lbp);
+ }
+
+ if (!isNecessary) {
+ warning("W126", opening);
+ }
+
ret.paren = true;
- ret.triggerFnExpr = triggerFnExpr;
}
+
return ret;
});
application("=>");
- infix("[", function (left, that) {
+ infix("[", function(left, that) {
var e = expression(10), s;
if (e && e.type === "(string)") {
if (!state.option.evil && (e.value === "eval" || e.value === "execScript")) {
- warning("W061", that);
+ if (isGlobalEval(left, state)) {
+ warning("W061");
+ }
}
countMember(e.value);
@@ -9240,67 +21405,68 @@ var JSHINT = (function () {
function comprehensiveArrayExpression() {
var res = {};
res.exps = true;
- funct["(comparray)"].stack();
+ state.funct["(comparray)"].stack();
// Handle reversed for expressions, used in spidermonkey
var reversed = false;
if (state.tokens.next.value !== "for") {
reversed = true;
- if (!state.option.inMoz(true)) {
+ if (!state.inMoz()) {
warning("W116", state.tokens.next, "for", state.tokens.next.value);
}
- funct["(comparray)"].setState("use");
+ state.funct["(comparray)"].setState("use");
res.right = expression(10);
}
advance("for");
if (state.tokens.next.value === "each") {
advance("each");
- if (!state.option.inMoz(true)) {
+ if (!state.inMoz()) {
warning("W118", state.tokens.curr, "for each");
}
}
advance("(");
- funct["(comparray)"].setState("define");
+ state.funct["(comparray)"].setState("define");
res.left = expression(130);
if (_.contains(["in", "of"], state.tokens.next.value)) {
advance();
} else {
error("E045", state.tokens.curr);
}
- funct["(comparray)"].setState("generate");
+ state.funct["(comparray)"].setState("generate");
expression(10);
advance(")");
if (state.tokens.next.value === "if") {
advance("if");
advance("(");
- funct["(comparray)"].setState("filter");
+ state.funct["(comparray)"].setState("filter");
res.filter = expression(10);
advance(")");
}
if (!reversed) {
- funct["(comparray)"].setState("use");
+ state.funct["(comparray)"].setState("use");
res.right = expression(10);
}
advance("]");
- funct["(comparray)"].unstack();
+ state.funct["(comparray)"].unstack();
return res;
}
- prefix("[", function () {
+ prefix("[", function() {
var blocktype = lookupBlockType();
if (blocktype.isCompArray) {
- if (!state.option.inESNext()) {
- warning("W119", state.tokens.curr, "array comprehension");
+ if (!state.option.esnext && !state.inMoz()) {
+ warning("W118", state.tokens.curr, "array comprehension");
}
return comprehensiveArrayExpression();
- } else if (blocktype.isDestAssign && !state.option.inESNext()) {
- warning("W104", state.tokens.curr, "destructuring assignment");
+ } else if (blocktype.isDestAssign) {
+ this.destructAssign = destructuringPattern({ openingParsed: true, assignment: true });
+ return this;
}
- var b = state.tokens.curr.line !== state.tokens.next.line;
+ var b = state.tokens.curr.line !== startLine(state.tokens.next);
this.first = [];
if (b) {
indent += state.option.indent;
@@ -9310,8 +21476,19 @@ var JSHINT = (function () {
}
while (state.tokens.next.id !== "(end)") {
while (state.tokens.next.id === ",") {
- if (!state.option.inES5())
- warning("W070");
+ if (!state.option.elision) {
+ if (!state.inES5()) {
+ // Maintain compat with old options --- ES5 mode without
+ // elision=true will warn once per comma
+ warning("W070");
+ } else {
+ warning("W128");
+ do {
+ advance(",");
+ } while (state.tokens.next.id === ",");
+ continue;
+ }
+ }
advance(",");
}
@@ -9321,8 +21498,8 @@ var JSHINT = (function () {
this.first.push(expression(10));
if (state.tokens.next.id === ",") {
- comma({ allowTrailing: true });
- if (state.tokens.next.id === "]" && !state.option.inES5(true)) {
+ parseComma({ allowTrailing: true });
+ if (state.tokens.next.id === "]" && !state.inES5()) {
warning("W070", state.tokens.curr);
break;
}
@@ -9339,8 +21516,8 @@ var JSHINT = (function () {
function isMethod() {
- return funct["(statement)"] && funct["(statement)"].type === "class" ||
- funct["(context)"] && funct["(context)"]["(verb)"] === "class";
+ return state.funct["(statement)"] && state.funct["(statement)"].type === "class" ||
+ state.funct["(context)"] && state.funct["(context)"]["(verb)"] === "class";
}
@@ -9383,114 +21560,109 @@ var JSHINT = (function () {
return id;
}
- function functionparams(parsed) {
- var curr, next;
- var params = [];
+ /**
+ * @param {Object} [options]
+ * @param {token} [options.loneArg] The argument to the function in cases
+ * where it was defined using the
+ * single-argument shorthand.
+ * @param {bool} [options.parsedOpening] Whether the opening parenthesis has
+ * already been parsed.
+ * @returns {{ arity: number, params: Array.<string>}}
+ */
+ function functionparams(options) {
+ var next;
+ var paramsIds = [];
var ident;
var tokens = [];
var t;
var pastDefault = false;
+ var pastRest = false;
+ var arity = 0;
+ var loneArg = options && options.loneArg;
- if (parsed) {
- if (Array.isArray(parsed)) {
- for (var i in parsed) {
- curr = parsed[i];
- if (curr.value === "...") {
- if (!state.option.esnext) {
- warning("W119", curr, "spread/rest operator");
- }
- continue;
- } else if (curr.value !== ",") {
- params.push(curr.value);
- addlabel(curr.value, { type: "unused", token: curr, param: true });
- }
- }
- return params;
- } else {
- if (parsed.identifier === true) {
- addlabel(parsed.value, { type: "unused", token: parsed, param: true });
- return [parsed];
- }
- }
+ if (loneArg && loneArg.identifier === true) {
+ state.funct["(scope)"].addParam(loneArg.value, loneArg);
+ return { arity: 1, params: [ loneArg.value ] };
}
next = state.tokens.next;
- advance("(");
+ if (!options || !options.parsedOpening) {
+ advance("(");
+ }
if (state.tokens.next.id === ")") {
advance(")");
return;
}
+ function addParam(addParamArgs) {
+ state.funct["(scope)"].addParam.apply(state.funct["(scope)"], addParamArgs);
+ }
+
for (;;) {
+ arity++;
+ // are added to the param scope
+ var currentParams = [];
+
if (_.contains(["{", "["], state.tokens.next.id)) {
- tokens = destructuringExpression();
+ tokens = destructuringPattern();
for (t in tokens) {
t = tokens[t];
if (t.id) {
- params.push(t.id);
- addlabel(t.id, { type: "unused", token: t.token, param: true });
+ paramsIds.push(t.id);
+ currentParams.push([t.id, t.token]);
}
}
- } else if (state.tokens.next.value === "...") {
- if (!state.option.esnext) {
- warning("W119", state.tokens.next, "spread/rest operator");
- }
- advance("...");
- ident = identifier(true);
- params.push(ident);
- addlabel(ident, { type: "unused", token: state.tokens.curr, param: true });
} else {
+ if (checkPunctuator(state.tokens.next, "...")) pastRest = true;
ident = identifier(true);
- params.push(ident);
- addlabel(ident, { type: "unused", token: state.tokens.curr, param: true });
+ if (ident) {
+ paramsIds.push(ident);
+ currentParams.push([ident, state.tokens.curr]);
+ } else {
+ // Skip invalid parameter.
+ while (!checkPunctuators(state.tokens.next, [",", ")"])) advance();
+ }
}
- // it is a syntax error to have a regular argument after a default argument
+ // It is valid to have a regular argument after a default argument
+ // since undefined can be used for missing parameters. Still warn as it is
+ // a possible code smell.
if (pastDefault) {
if (state.tokens.next.id !== "=") {
- error("E051", state.tokens.current);
+ error("W138", state.tokens.current);
}
}
if (state.tokens.next.id === "=") {
- if (!state.option.inESNext()) {
- warning("W119", state.tokens.next, "default parameters");
+ if (!state.inES6()) {
+ warning("W119", state.tokens.next, "default parameters", "6");
}
advance("=");
pastDefault = true;
expression(10);
}
+
+ // now we have evaluated the default expression, add the variable to the param scope
+ currentParams.forEach(addParam);
+
if (state.tokens.next.id === ",") {
- comma();
+ if (pastRest) {
+ warning("W131", state.tokens.next);
+ }
+ parseComma();
} else {
advance(")", next);
- return params;
+ return { arity: arity, params: paramsIds };
}
}
}
- function setprop(funct, name, values) {
- if (!funct["(properties)"][name]) {
- funct["(properties)"][name] = { unused: false };
- }
-
- _.extend(funct["(properties)"][name], values);
- }
-
- function getprop(funct, name, prop) {
- if (!funct["(properties)"][name])
- return null;
-
- return funct["(properties)"][name][prop] || null;
- }
-
- function functor(name, token, scope, overwrites) {
+ function functor(name, token, overwrites) {
var funct = {
"(name)" : name,
"(breakage)" : 0,
"(loopage)" : 0,
- "(scope)" : scope,
"(tokens)" : {},
"(properties)": {},
@@ -9502,9 +21674,10 @@ var JSHINT = (function () {
"(metrics)" : null,
"(statement)" : null,
"(context)" : null,
- "(blockscope)": null,
+ "(scope)" : null,
"(comparray)" : null,
"(generator)" : null,
+ "(arrow)" : null,
"(params)" : null
};
@@ -9519,89 +21692,176 @@ var JSHINT = (function () {
_.extend(funct, overwrites);
if (funct["(context)"]) {
- funct["(blockscope)"] = funct["(context)"]["(blockscope)"];
+ funct["(scope)"] = funct["(context)"]["(scope)"];
funct["(comparray)"] = funct["(context)"]["(comparray)"];
}
return funct;
}
- function doTemplateLiteral() {
- while (state.tokens.next.type !== "(template tail)" && state.tokens.next.id !== "(end)") {
- advance();
- if (state.tokens.next.type === "(template tail)") {
- break;
- } else if (state.tokens.next.type !== "(template middle)" &&
- state.tokens.next.type !== "(end)") {
- expression(10); // should probably have different rbp?
+ function isFunctor(token) {
+ return "(scope)" in token;
+ }
+
+ /**
+ * Determine if the parser has begun parsing executable code.
+ *
+ * @param {Token} funct - The current "functor" token
+ *
+ * @returns {boolean}
+ */
+ function hasParsedCode(funct) {
+ return funct["(global)"] && !funct["(verb)"];
+ }
+
+ function doTemplateLiteral(left) {
+ // ASSERT: this.type === "(template)"
+ // jshint validthis: true
+ var ctx = this.context;
+ var noSubst = this.noSubst;
+ var depth = this.depth;
+
+ if (!noSubst) {
+ while (!end()) {
+ if (!state.tokens.next.template || state.tokens.next.depth > depth) {
+ expression(0); // should probably have different rbp?
+ } else {
+ // skip template start / middle
+ advance();
+ }
}
}
+
return {
id: "(template)",
- type: "(template)"
+ type: "(template)",
+ tag: left
};
+
+ function end() {
+ if (state.tokens.curr.template && state.tokens.curr.tail &&
+ state.tokens.curr.context === ctx) return true;
+ var complete = (state.tokens.next.template && state.tokens.next.tail &&
+ state.tokens.next.context === ctx);
+ if (complete) advance();
+ return complete || state.tokens.next.isUnclosed;
+ }
}
- function doFunction(name, statement, generator, fatarrowparams) {
- var f;
+ /**
+ * @param {Object} [options]
+ * @param {token} [options.name] The identifier belonging to the function (if
+ * any)
+ * @param {boolean} [options.statement] The statement that triggered creation
+ * of the current function.
+ * @param {string} [options.type] If specified, either "generator" or "arrow"
+ * @param {token} [options.loneArg] The argument to the function in cases
+ * where it was defined using the
+ * single-argument shorthand
+ * @param {bool} [options.parsedOpening] Whether the opening parenthesis has
+ * already been parsed
+ * @param {token} [options.classExprBinding] Define a function with this
+ * identifier in the new function's
+ * scope, mimicking the bahavior of
+ * class expression names within
+ * the body of member functions.
+ */
+ function doFunction(options) {
+ var f, token, name, statement, classExprBinding, isGenerator, isArrow, ignoreLoopFunc;
var oldOption = state.option;
var oldIgnored = state.ignored;
- var oldScope = scope;
+
+ if (options) {
+ name = options.name;
+ statement = options.statement;
+ classExprBinding = options.classExprBinding;
+ isGenerator = options.type === "generator";
+ isArrow = options.type === "arrow";
+ ignoreLoopFunc = options.ignoreLoopFunc;
+ }
state.option = Object.create(state.option);
state.ignored = Object.create(state.ignored);
- scope = Object.create(scope);
- funct = functor(name || state.nameStack.infer(), state.tokens.next, scope, {
+ state.funct = functor(name || state.nameStack.infer(), state.tokens.next, {
"(statement)": statement,
- "(context)": funct,
- "(generator)": generator ? true : null
+ "(context)": state.funct,
+ "(arrow)": isArrow,
+ "(generator)": isGenerator
});
- f = funct;
- state.tokens.curr.funct = funct;
+ f = state.funct;
+ token = state.tokens.curr;
+ token.funct = state.funct;
- functions.push(funct);
+ functions.push(state.funct);
- if (name) {
- addlabel(name, { type: "function" });
+ // So that the function is available to itself and referencing itself is not
+ // seen as a closure, add the function name to a new scope, but do not
+ // test for unused (unused: false)
+ // it is a new block scope so that params can override it, it can be block scoped
+ // but declarations inside the function don't cause already declared error
+ state.funct["(scope)"].stack("functionouter");
+ var internallyAccessibleName = name || classExprBinding;
+ if (internallyAccessibleName) {
+ state.funct["(scope)"].block.add(internallyAccessibleName,
+ classExprBinding ? "class" : "function", state.tokens.curr, false);
}
- funct["(params)"] = functionparams(fatarrowparams);
- funct["(metrics)"].verifyMaxParametersPerFunction(funct["(params)"]);
+ // create the param scope (params added in functionparams)
+ state.funct["(scope)"].stack("functionparams");
- // So we parse fat-arrow functions after we encounter =>. So basically
- // doFunction is called with the left side of => as its last argument.
- // This means that the parser, at that point, had already added its
- // arguments to the undefs array and here we undo that.
+ var paramsInfo = functionparams(options);
- JSHINT.undefs = _.filter(JSHINT.undefs, function (item) {
- return !_.contains(_.union(fatarrowparams), item[2]);
- });
+ if (paramsInfo) {
+ state.funct["(params)"] = paramsInfo.params;
+ state.funct["(metrics)"].arity = paramsInfo.arity;
+ state.funct["(metrics)"].verifyMaxParametersPerFunction();
+ } else {
+ state.funct["(metrics)"].arity = 0;
+ }
- block(false, true, true, fatarrowparams ? true : false);
+ if (isArrow) {
+ if (!state.inES6(true)) {
+ warning("W119", state.tokens.curr, "arrow function syntax (=>)", "6");
+ }
- if (!state.option.noyield && generator &&
- funct["(generator)"] !== "yielded") {
- warning("W124", state.tokens.curr);
+ if (!options.loneArg) {
+ advance("=>");
+ }
}
- funct["(metrics)"].verifyMaxStatementsPerFunction();
- funct["(metrics)"].verifyMaxComplexityPerFunction();
- funct["(unusedOption)"] = state.option.unused;
+ block(false, true, true, isArrow);
- scope = oldScope;
+ if (!state.option.noyield && isGenerator &&
+ state.funct["(generator)"] !== "yielded") {
+ warning("W124", state.tokens.curr);
+ }
+
+ state.funct["(metrics)"].verifyMaxStatementsPerFunction();
+ state.funct["(metrics)"].verifyMaxComplexityPerFunction();
+ state.funct["(unusedOption)"] = state.option.unused;
state.option = oldOption;
state.ignored = oldIgnored;
- funct["(last)"] = state.tokens.curr.line;
- funct["(lastcharacter)"] = state.tokens.curr.character;
+ state.funct["(last)"] = state.tokens.curr.line;
+ state.funct["(lastcharacter)"] = state.tokens.curr.character;
- _.map(Object.keys(funct), function (key) {
- if (key[0] === "(") return;
- funct["(blockscope)"].unshadow(key);
- });
+ // unstack the params scope
+ state.funct["(scope)"].unstack(); // also does usage and label checks
+
+ // unstack the function outer stack
+ state.funct["(scope)"].unstack();
- funct = funct["(context)"];
+ state.funct = state.funct["(context)"];
+
+ if (!ignoreLoopFunc && !state.option.loopfunc && state.funct["(loopage)"]) {
+ // If the function we just parsed accesses any non-local variables
+ // trigger a warning. Otherwise, the function is safe even within
+ // a loop.
+ if (f["(isCapturing)"]) {
+ warning("W083", token);
+ }
+ }
return f;
}
@@ -9611,23 +21871,23 @@ var JSHINT = (function () {
statementCount: 0,
nestedBlockDepth: -1,
ComplexityCount: 1,
+ arity: 0,
- verifyMaxStatementsPerFunction: function () {
+ verifyMaxStatementsPerFunction: function() {
if (state.option.maxstatements &&
this.statementCount > state.option.maxstatements) {
warning("W071", functionStartToken, this.statementCount);
}
},
- verifyMaxParametersPerFunction: function (params) {
- params = params || [];
-
- if (state.option.maxparams && params.length > state.option.maxparams) {
- warning("W072", functionStartToken, params.length);
+ verifyMaxParametersPerFunction: function() {
+ if (_.isNumber(state.option.maxparams) &&
+ this.arity > state.option.maxparams) {
+ warning("W072", functionStartToken, this.arity);
}
},
- verifyMaxNestedBlockDepthPerFunction: function () {
+ verifyMaxNestedBlockDepthPerFunction: function() {
if (state.option.maxdepth &&
this.nestedBlockDepth > 0 &&
this.nestedBlockDepth === state.option.maxdepth + 1) {
@@ -9635,7 +21895,7 @@ var JSHINT = (function () {
}
},
- verifyMaxComplexityPerFunction: function () {
+ verifyMaxComplexityPerFunction: function() {
var max = state.option.maxcomplexity;
var cc = this.ComplexityCount;
if (max && cc > max) {
@@ -9646,7 +21906,7 @@ var JSHINT = (function () {
}
function increaseComplexityCount() {
- funct["(metrics)"].ComplexityCount += 1;
+ state.funct["(metrics)"].ComplexityCount += 1;
}
// Parse assignments that were found instead of conditionals.
@@ -9684,21 +21944,36 @@ var JSHINT = (function () {
*/
function checkProperties(props) {
// Check for lonely setters if in the ES5 mode.
- if (state.option.inES5()) {
+ if (state.inES5()) {
for (var name in props) {
- if (_.has(props, name) && props[name].setterToken && !props[name].getterToken) {
+ if (props[name] && props[name].setterToken && !props[name].getterToken) {
warning("W078", props[name].setterToken);
}
}
}
}
- (function (x) {
- x.nud = function () {
- var b, f, i, p, t, g, nextVal;
- var props = {}; // All properties, including accessors
+ function metaProperty(name, c) {
+ if (checkPunctuator(state.tokens.next, ".")) {
+ var left = state.tokens.curr.id;
+ advance(".");
+ var id = identifier();
+ state.tokens.curr.isMetaProperty = true;
+ if (name !== id) {
+ error("E057", state.tokens.prev, left, id);
+ } else {
+ c();
+ }
+ return state.tokens.curr;
+ }
+ }
+
+ (function(x) {
+ x.nud = function() {
+ var b, f, i, p, t, isGeneratorMethod = false, nextVal;
+ var props = Object.create(null); // All properties, including accessors
- b = state.tokens.curr.line !== state.tokens.next.line;
+ b = state.tokens.curr.line !== startLine(state.tokens.next);
if (b) {
indent += state.option.indent;
if (state.tokens.next.from === indent + state.option.indent) {
@@ -9706,16 +21981,32 @@ var JSHINT = (function () {
}
}
+ var blocktype = lookupBlockType();
+ if (blocktype.isDestAssign) {
+ this.destructAssign = destructuringPattern({ openingParsed: true, assignment: true });
+ return this;
+ }
+
for (;;) {
if (state.tokens.next.id === "}") {
break;
}
nextVal = state.tokens.next.value;
- if (peek().id !== ":" && (nextVal === "get" || nextVal === "set")) {
+ if (state.tokens.next.identifier &&
+ (peekIgnoreEOL().id === "," || peekIgnoreEOL().id === "}")) {
+ if (!state.inES6()) {
+ warning("W104", state.tokens.next, "object short notation", "6");
+ }
+ i = propertyName(true);
+ saveProperty(props, i, state.tokens.next);
+
+ expression(10);
+
+ } else if (peek().id !== ":" && (nextVal === "get" || nextVal === "set")) {
advance(nextVal);
- if (!state.option.inES5()) {
+ if (!state.inES5()) {
error("E034");
}
@@ -9723,8 +22014,8 @@ var JSHINT = (function () {
// ES6 allows for get() {...} and set() {...} method
// definition shorthand syntax, so we don't produce an error
- // if the esnext option is enabled.
- if (!i && !state.option.inESNext()) {
+ // if linting ECMAScript 6 code.
+ if (!i && !state.inES6()) {
error("E035");
}
@@ -9741,60 +22032,51 @@ var JSHINT = (function () {
// Don't warn about getter/setter pairs if this is an ES6 concise method
if (nextVal === "get" && i && p) {
warning("W076", t, p[0], i);
- } else if (nextVal === "set" && i && (!p || p.length !== 1)) {
+ } else if (nextVal === "set" && i && f["(metrics)"].arity !== 1) {
warning("W077", t, i);
}
} else {
- g = false;
if (state.tokens.next.value === "*" && state.tokens.next.type === "(punctuator)") {
- if (!state.option.inESNext()) {
- warning("W104", state.tokens.next, "generator functions");
+ if (!state.inES6()) {
+ warning("W104", state.tokens.next, "generator functions", "6");
}
advance("*");
- g = true;
+ isGeneratorMethod = true;
+ } else {
+ isGeneratorMethod = false;
}
- if (state.tokens.next.identifier &&
- (peekIgnoreEOL().id === "," || peekIgnoreEOL().id === "}")) {
- if (!state.option.inESNext()) {
- warning("W104", state.tokens.next, "object short notation");
- }
- i = propertyName(true);
- saveProperty(props, i, state.tokens.next);
- expression(10);
+ if (state.tokens.next.id === "[") {
+ i = computedPropertyName();
+ state.nameStack.set(i);
} else {
- if (state.tokens.next.id === "[") {
- i = computedPropertyName();
- state.nameStack.set(i);
- } else {
- state.nameStack.set(state.tokens.next);
- i = propertyName();
- saveProperty(props, i, state.tokens.next);
+ state.nameStack.set(state.tokens.next);
+ i = propertyName();
+ saveProperty(props, i, state.tokens.next);
- if (typeof i !== "string") {
- break;
- }
+ if (typeof i !== "string") {
+ break;
}
+ }
- if (state.tokens.next.value === "(") {
- if (!state.option.inESNext()) {
- warning("W104", state.tokens.curr, "concise methods");
- }
- doFunction(null, undefined, g);
- } else {
- advance(":");
- expression(10);
+ if (state.tokens.next.value === "(") {
+ if (!state.inES6()) {
+ warning("W104", state.tokens.curr, "concise methods", "6");
}
+ doFunction({ type: isGeneratorMethod ? "generator" : null });
+ } else {
+ advance(":");
+ expression(10);
}
}
countMember(i);
if (state.tokens.next.id === ",") {
- comma({ allowTrailing: true, property: true });
+ parseComma({ allowTrailing: true, property: true });
if (state.tokens.next.id === ",") {
warning("W070", state.tokens.curr);
- } else if (state.tokens.next.id === "}" && !state.option.inES5(true)) {
+ } else if (state.tokens.next.id === "}" && !state.inES5()) {
warning("W070", state.tokens.curr);
}
} else {
@@ -9810,76 +22092,167 @@ var JSHINT = (function () {
return this;
};
- x.fud = function () {
+ x.fud = function() {
error("E036", state.tokens.curr);
};
}(delim("{")));
- function destructuringExpression() {
- var id, ids;
- var identifiers = [];
- if (!state.option.inESNext()) {
- warning("W104", state.tokens.curr, "destructuring expression");
+ function destructuringPattern(options) {
+ var isAssignment = options && options.assignment;
+
+ if (!state.inES6()) {
+ warning("W104", state.tokens.curr,
+ isAssignment ? "destructuring assignment" : "destructuring binding", "6");
}
- var nextInnerDE = function () {
+
+ return destructuringPatternRecursive(options);
+ }
+
+ function destructuringPatternRecursive(options) {
+ var ids;
+ var identifiers = [];
+ var openingParsed = options && options.openingParsed;
+ var isAssignment = options && options.assignment;
+ var recursiveOptions = isAssignment ? { assignment: isAssignment } : null;
+ var firstToken = openingParsed ? state.tokens.curr : state.tokens.next;
+
+ var nextInnerDE = function() {
var ident;
- if (_.contains(["[", "{"], state.tokens.next.value)) {
- ids = destructuringExpression();
+ if (checkPunctuators(state.tokens.next, ["[", "{"])) {
+ ids = destructuringPatternRecursive(recursiveOptions);
for (var id in ids) {
id = ids[id];
identifiers.push({ id: id.id, token: id.token });
}
- } else if (state.tokens.next.value === ",") {
+ } else if (checkPunctuator(state.tokens.next, ",")) {
identifiers.push({ id: null, token: state.tokens.curr });
- } else if (state.tokens.next.value === "(") {
+ } else if (checkPunctuator(state.tokens.next, "(")) {
advance("(");
nextInnerDE();
advance(")");
} else {
- ident = identifier();
- if (ident)
+ var is_rest = checkPunctuator(state.tokens.next, "...");
+
+ if (isAssignment) {
+ var assignTarget = expression(20);
+ if (assignTarget) {
+ checkLeftSideAssign(assignTarget);
+
+ // if the target was a simple identifier, add it to the list to return
+ if (assignTarget.identifier) {
+ ident = assignTarget.value;
+ }
+ }
+ } else {
+ ident = identifier();
+ }
+ if (ident) {
identifiers.push({ id: ident, token: state.tokens.curr });
+ }
+ return is_rest;
}
+ return false;
};
- if (state.tokens.next.value === "[") {
- advance("[");
- nextInnerDE();
- while (state.tokens.next.value !== "]") {
- advance(",");
+ var assignmentProperty = function() {
+ var id;
+ if (checkPunctuator(state.tokens.next, "[")) {
+ advance("[");
+ expression(10);
+ advance("]");
+ advance(":");
nextInnerDE();
- }
- advance("]");
- } else if (state.tokens.next.value === "{") {
- advance("{");
- id = identifier();
- if (state.tokens.next.value === ":") {
+ } else if (state.tokens.next.id === "(string)" ||
+ state.tokens.next.id === "(number)") {
+ advance();
advance(":");
nextInnerDE();
} else {
- identifiers.push({ id: id, token: state.tokens.curr });
- }
- while (state.tokens.next.value !== "}") {
- advance(",");
+ // this id will either be the property name or the property name and the assigning identifier
id = identifier();
- if (state.tokens.next.value === ":") {
+ if (checkPunctuator(state.tokens.next, ":")) {
advance(":");
nextInnerDE();
- } else {
+ } else if (id) {
+ // in this case we are assigning (not declaring), so check assignment
+ if (isAssignment) {
+ checkLeftSideAssign(state.tokens.curr);
+ }
identifiers.push({ id: id, token: state.tokens.curr });
}
}
+ };
+
+ var id, value;
+ if (checkPunctuator(firstToken, "[")) {
+ if (!openingParsed) {
+ advance("[");
+ }
+ if (checkPunctuator(state.tokens.next, "]")) {
+ warning("W137", state.tokens.curr);
+ }
+ var element_after_rest = false;
+ while (!checkPunctuator(state.tokens.next, "]")) {
+ if (nextInnerDE() && !element_after_rest &&
+ checkPunctuator(state.tokens.next, ",")) {
+ warning("W130", state.tokens.next);
+ element_after_rest = true;
+ }
+ if (checkPunctuator(state.tokens.next, "=")) {
+ if (checkPunctuator(state.tokens.prev, "...")) {
+ advance("]");
+ } else {
+ advance("=");
+ }
+ id = state.tokens.prev;
+ value = expression(10);
+ if (value && value.type === "undefined") {
+ warning("W080", id, id.value);
+ }
+ }
+ if (!checkPunctuator(state.tokens.next, "]")) {
+ advance(",");
+ }
+ }
+ advance("]");
+ } else if (checkPunctuator(firstToken, "{")) {
+
+ if (!openingParsed) {
+ advance("{");
+ }
+ if (checkPunctuator(state.tokens.next, "}")) {
+ warning("W137", state.tokens.curr);
+ }
+ while (!checkPunctuator(state.tokens.next, "}")) {
+ assignmentProperty();
+ if (checkPunctuator(state.tokens.next, "=")) {
+ advance("=");
+ id = state.tokens.prev;
+ value = expression(10);
+ if (value && value.type === "undefined") {
+ warning("W080", id, id.value);
+ }
+ }
+ if (!checkPunctuator(state.tokens.next, "}")) {
+ advance(",");
+ if (checkPunctuator(state.tokens.next, "}")) {
+ // Trailing comma
+ // ObjectBindingPattern: { BindingPropertyList , }
+ break;
+ }
+ }
+ }
advance("}");
}
return identifiers;
}
- function destructuringExpressionMatch(tokens, value) {
+ function destructuringPatternMatch(tokens, value) {
var first = value.first;
if (!first)
return;
- _.zip(tokens, Array.isArray(first) ? first : [ first ]).forEach(function (val) {
+ _.zip(tokens, Array.isArray(first) ? first : [ first ]).forEach(function(val) {
var token = val[0];
var value = val[1];
@@ -9890,235 +22263,226 @@ var JSHINT = (function () {
});
}
- var conststatement = stmt("const", function (prefix) {
- var tokens;
- var value;
- var lone; // State variable to know if it is a lone identifier, or a destructuring statement.
+ function blockVariableStatement(type, statement, context) {
+ // used for both let and const statements
- if (!state.option.inESNext())
- warning("W104", state.tokens.curr, "const");
+ var prefix = context && context.prefix;
+ var inexport = context && context.inexport;
+ var isLet = type === "let";
+ var isConst = type === "const";
+ var tokens, lone, value, letblock;
- this.first = [];
+ if (!state.inES6()) {
+ warning("W104", state.tokens.curr, type, "6");
+ }
+
+ if (isLet && state.tokens.next.value === "(") {
+ if (!state.inMoz()) {
+ warning("W118", state.tokens.next, "let block");
+ }
+ advance("(");
+ state.funct["(scope)"].stack();
+ letblock = true;
+ } else if (state.funct["(noblockscopedvar)"]) {
+ error("E048", state.tokens.curr, isConst ? "Const" : "Let");
+ }
+
+ statement.first = [];
for (;;) {
var names = [];
if (_.contains(["{", "["], state.tokens.next.value)) {
- tokens = destructuringExpression();
+ tokens = destructuringPattern();
lone = false;
} else {
tokens = [ { id: identifier(), token: state.tokens.curr } ];
lone = true;
}
+
+ if (!prefix && isConst && state.tokens.next.id !== "=") {
+ warning("E012", state.tokens.curr, state.tokens.curr.value);
+ }
+
for (var t in tokens) {
if (tokens.hasOwnProperty(t)) {
t = tokens[t];
- if (funct[t.id] === "const") {
- warning("E011", null, t.id);
- }
- if (funct["(global)"] && predefined[t.id] === false) {
- warning("W079", t.token, t.id);
+ if (state.funct["(scope)"].block.isGlobal()) {
+ if (predefined[t.id] === false) {
+ warning("W079", t.token, t.id);
+ }
}
- if (t.id) {
- addlabel(t.id, { token: t.token, type: "const", unused: true });
+ if (t.id && !state.funct["(noblockscopedvar)"]) {
+ state.funct["(scope)"].addlabel(t.id, {
+ type: type,
+ token: t.token });
names.push(t.token);
+
+ if (lone && inexport) {
+ state.funct["(scope)"].setExported(t.token.value, t.token);
+ }
}
}
}
- if (prefix) {
- break;
- }
-
- this.first = this.first.concat(names);
-
- if (state.tokens.next.id !== "=") {
- warning("E012", state.tokens.curr, state.tokens.curr.value);
- }
if (state.tokens.next.id === "=") {
advance("=");
- if (state.tokens.next.id === "undefined") {
- warning("W080", state.tokens.prev, state.tokens.prev.value);
- }
- if (peek(0).id === "=" && state.tokens.next.identifier) {
+ if (!prefix && peek(0).id === "=" && state.tokens.next.identifier) {
warning("W120", state.tokens.next, state.tokens.next.value);
}
- value = expression(10);
+ var id = state.tokens.prev;
+ // don't accept `in` in expression if prefix is used for ForIn/Of loop.
+ value = expression(prefix ? 120 : 10);
+ if (!prefix && value && value.type === "undefined") {
+ warning("W080", id, id.value);
+ }
if (lone) {
tokens[0].first = value;
} else {
- destructuringExpressionMatch(names, value);
+ destructuringPatternMatch(names, value);
}
}
+ statement.first = statement.first.concat(names);
+
if (state.tokens.next.id !== ",") {
break;
}
- comma();
+ parseComma();
}
- return this;
- });
+ if (letblock) {
+ advance(")");
+ block(true, true);
+ statement.block = true;
+ state.funct["(scope)"].unstack();
+ }
+
+ return statement;
+ }
+ var conststatement = stmt("const", function(context) {
+ return blockVariableStatement("const", this, context);
+ });
conststatement.exps = true;
- var varstatement = stmt("var", function (prefix) {
- // JavaScript does not have block scope. It only has function scope. So,
- // declaring a variable in a block can have unexpected consequences.
+
+ var letstatement = stmt("let", function(context) {
+ return blockVariableStatement("let", this, context);
+ });
+ letstatement.exps = true;
+
+ var varstatement = stmt("var", function(context) {
+ var prefix = context && context.prefix;
+ var inexport = context && context.inexport;
var tokens, lone, value;
+ // If the `implied` option is set, bindings are set differently.
+ var implied = context && context.implied;
+ var report = !(context && context.ignore);
+
this.first = [];
for (;;) {
var names = [];
if (_.contains(["{", "["], state.tokens.next.value)) {
- tokens = destructuringExpression();
+ tokens = destructuringPattern();
lone = false;
} else {
tokens = [ { id: identifier(), token: state.tokens.curr } ];
lone = true;
}
+
+ if (!(prefix && implied) && report && state.option.varstmt) {
+ warning("W132", this);
+ }
+
+ this.first = this.first.concat(names);
+
for (var t in tokens) {
if (tokens.hasOwnProperty(t)) {
t = tokens[t];
- if (state.option.inESNext() && funct[t.id] === "const") {
- warning("E011", null, t.id);
- }
- if (funct["(global)"] && predefined[t.id] === false) {
- warning("W079", t.token, t.id);
+ if (!implied && state.funct["(global)"] && !state.impliedClosure()) {
+ if (predefined[t.id] === false) {
+ warning("W079", t.token, t.id);
+ } else if (state.option.futurehostile === false) {
+ if ((!state.inES5() && vars.ecmaIdentifiers[5][t.id] === false) ||
+ (!state.inES6() && vars.ecmaIdentifiers[6][t.id] === false)) {
+ warning("W129", t.token, t.id);
+ }
+ }
}
if (t.id) {
- addlabel(t.id, { type: "unused", token: t.token });
+ if (implied === "for") {
+
+ if (!state.funct["(scope)"].has(t.id)) {
+ if (report) warning("W088", t.token, t.id);
+ }
+ state.funct["(scope)"].block.use(t.id, t.token);
+ } else {
+ state.funct["(scope)"].addlabel(t.id, {
+ type: "var",
+ token: t.token });
+
+ if (lone && inexport) {
+ state.funct["(scope)"].setExported(t.id, t.token);
+ }
+ }
names.push(t.token);
}
}
}
- if (prefix) {
- break;
- }
-
- this.first = this.first.concat(names);
if (state.tokens.next.id === "=") {
state.nameStack.set(state.tokens.curr);
+
advance("=");
- if (state.tokens.next.id === "undefined") {
- warning("W080", state.tokens.prev, state.tokens.prev.value);
- }
if (peek(0).id === "=" && state.tokens.next.identifier) {
- if (!funct["(params)"] || funct["(params)"].indexOf(state.tokens.next.value) === -1) {
+ if (!prefix && report &&
+ !state.funct["(params)"] ||
+ state.funct["(params)"].indexOf(state.tokens.next.value) === -1) {
warning("W120", state.tokens.next, state.tokens.next.value);
}
}
- value = expression(10);
- if (lone) {
- tokens[0].first = value;
- } else {
- destructuringExpressionMatch(names, value);
- }
- }
-
- if (state.tokens.next.id !== ",") {
- break;
- }
- comma();
- }
- return this;
- });
- varstatement.exps = true;
-
- var letstatement = stmt("let", function (prefix) {
- var tokens, lone, value, letblock;
-
- if (!state.option.inESNext()) {
- warning("W104", state.tokens.curr, "let");
- }
-
- if (state.tokens.next.value === "(") {
- if (!state.option.inMoz(true)) {
- warning("W118", state.tokens.next, "let block");
- }
- advance("(");
- funct["(blockscope)"].stack();
- letblock = true;
- } else if (funct["(nolet)"]) {
- error("E048", state.tokens.curr);
- }
-
- this.first = [];
- for (;;) {
- var names = [];
- if (_.contains(["{", "["], state.tokens.next.value)) {
- tokens = destructuringExpression();
- lone = false;
- } else {
- tokens = [ { id: identifier(), token: state.tokens.curr.value } ];
- lone = true;
- }
- for (var t in tokens) {
- if (tokens.hasOwnProperty(t)) {
- t = tokens[t];
- if (state.option.inESNext() && funct[t.id] === "const") {
- warning("E011", null, t.id);
- }
- if (funct["(global)"] && predefined[t.id] === false) {
- warning("W079", t.token, t.id);
- }
- if (t.id && !funct["(nolet)"]) {
- addlabel(t.id, { type: "unused", token: t.token, islet: true });
- names.push(t.token);
- }
- }
- }
- if (prefix) {
- break;
- }
-
- this.first = this.first.concat(names);
-
- if (state.tokens.next.id === "=") {
- advance("=");
- if (state.tokens.next.id === "undefined") {
- warning("W080", state.tokens.prev, state.tokens.prev.value);
- }
- if (peek(0).id === "=" && state.tokens.next.identifier) {
- warning("W120", state.tokens.next, state.tokens.next.value);
+ var id = state.tokens.prev;
+ // don't accept `in` in expression if prefix is used for ForIn/Of loop.
+ value = expression(prefix ? 120 : 10);
+ if (value && !prefix && report && !state.funct["(loopage)"] && value.type === "undefined") {
+ warning("W080", id, id.value);
}
- value = expression(10);
if (lone) {
tokens[0].first = value;
} else {
- destructuringExpressionMatch(names, value);
+ destructuringPatternMatch(names, value);
}
}
if (state.tokens.next.id !== ",") {
break;
}
- comma();
- }
- if (letblock) {
- advance(")");
- block(true, true);
- this.block = true;
- funct["(blockscope)"].unstack();
+ parseComma();
}
return this;
});
- letstatement.exps = true;
+ varstatement.exps = true;
- blockstmt("class", function () {
+ blockstmt("class", function() {
return classdef.call(this, true);
});
- function classdef(stmt) {
+ function classdef(isStatement) {
+
/*jshint validthis:true */
- if (!state.option.inESNext()) {
- warning("W104", state.tokens.curr, "class");
+ if (!state.inES6()) {
+ warning("W104", state.tokens.curr, "class", "6");
}
- if (stmt) {
+ if (isStatement) {
// BindingIdentifier
this.name = identifier();
- addlabel(this.name, { type: "unused", token: state.tokens.curr });
+
+ state.funct["(scope)"].addlabel(this.name, {
+ type: "class",
+ token: state.tokens.curr });
} else if (state.tokens.next.identifier && state.tokens.next.value !== "extends") {
// BindingIdentifier(opt)
this.name = identifier();
+ this.namedExpr = true;
} else {
this.name = state.nameStack.infer();
}
@@ -10127,41 +22491,61 @@ var JSHINT = (function () {
}
function classtail(c) {
- var strictness = state.directive["use strict"];
-
+ var wasInClassBody = state.inClassBody;
// ClassHeritage(opt)
if (state.tokens.next.value === "extends") {
advance("extends");
c.heritage = expression(10);
}
- // A ClassBody is always strict code.
- state.directive["use strict"] = true;
+ state.inClassBody = true;
advance("{");
// ClassBody(opt)
c.body = classbody(c);
advance("}");
- state.directive["use strict"] = strictness;
+ state.inClassBody = wasInClassBody;
}
function classbody(c) {
var name;
var isStatic;
+ var isGenerator;
var getset;
- var props = {};
- var staticProps = {};
+ var props = Object.create(null);
+ var staticProps = Object.create(null);
var computed;
for (var i = 0; state.tokens.next.id !== "}"; ++i) {
name = state.tokens.next;
isStatic = false;
+ isGenerator = false;
getset = null;
+
+ // The ES6 grammar for ClassElement includes the `;` token, but it is
+ // defined only as a placeholder to facilitate future language
+ // extensions. In ES6 code, it serves no purpose.
+ if (name.id === ";") {
+ warning("W032");
+ advance(";");
+ continue;
+ }
+
+ if (name.id === "*") {
+ isGenerator = true;
+ advance("*");
+ name = state.tokens.next;
+ }
if (name.id === "[") {
name = computedPropertyName();
+ computed = true;
} else if (isPropertyName(name)) {
// Non-Computed PropertyName
advance();
computed = false;
if (name.identifier && name.value === "static") {
+ if (checkPunctuator(state.tokens.next, "*")) {
+ isGenerator = true;
+ advance("*");
+ }
if (isPropertyName(state.tokens.next) || state.tokens.next.id === "[") {
computed = state.tokens.next.id === "[";
isStatic = true;
@@ -10188,15 +22572,15 @@ var JSHINT = (function () {
continue;
}
- if (!checkPunctuators(state.tokens.next, ["("])) {
+ if (!checkPunctuator(state.tokens.next, "(")) {
// error --- class properties must be methods
error("E054", state.tokens.next, state.tokens.next.value);
while (state.tokens.next.id !== "}" &&
- !checkPunctuators(state.tokens.next, ["("])) {
+ !checkPunctuator(state.tokens.next, "(")) {
advance();
}
if (state.tokens.next.value !== "(") {
- doFunction(undefined, c, false, null);
+ doFunction({ statement: c });
}
}
@@ -10224,73 +22608,71 @@ var JSHINT = (function () {
propertyName(name);
- doFunction(null, c, false, null);
+ doFunction({
+ statement: c,
+ type: isGenerator ? "generator" : null,
+ classExprBinding: c.namedExpr ? c.name : null
+ });
}
checkProperties(props);
}
- blockstmt("function", function () {
+ blockstmt("function", function(context) {
+ var inexport = context && context.inexport;
var generator = false;
if (state.tokens.next.value === "*") {
advance("*");
- if (state.option.inESNext(true)) {
+ if (state.inES6(true)) {
generator = true;
} else {
- warning("W119", state.tokens.curr, "function*");
+ warning("W119", state.tokens.curr, "function*", "6");
}
}
if (inblock) {
warning("W082", state.tokens.curr);
-
}
var i = optionalidentifier();
+ state.funct["(scope)"].addlabel(i, {
+ type: "function",
+ token: state.tokens.curr });
+
if (i === undefined) {
warning("W025");
+ } else if (inexport) {
+ state.funct["(scope)"].setExported(i, state.tokens.prev);
}
- if (funct[i] === "const") {
- warning("E011", null, i);
- }
- addlabel(i, { type: "unction", token: state.tokens.curr });
-
- doFunction(i, { statement: true }, generator);
+ doFunction({
+ name: i,
+ statement: this,
+ type: generator ? "generator" : null,
+ ignoreLoopFunc: inblock // a declaration may already have warned
+ });
if (state.tokens.next.id === "(" && state.tokens.next.line === state.tokens.curr.line) {
error("E039");
}
return this;
});
- prefix("function", function () {
+ prefix("function", function() {
var generator = false;
if (state.tokens.next.value === "*") {
- if (!state.option.inESNext()) {
- warning("W119", state.tokens.curr, "function*");
+ if (!state.inES6()) {
+ warning("W119", state.tokens.curr, "function*", "6");
}
advance("*");
generator = true;
}
var i = optionalidentifier();
- var fn = doFunction(i, undefined, generator);
-
- function isVariable(name) { return name[0] !== "("; }
- function isLocal(name) { return fn[name] === "var"; }
-
- if (!state.option.loopfunc && funct["(loopage)"]) {
- // If the function we just parsed accesses any non-local variables
- // trigger a warning. Otherwise, the function is safe even within
- // a loop.
- if (_.some(fn, function (val, name) { return isVariable(name) && !isLocal(name); })) {
- warning("W083");
- }
- }
+ doFunction({ name: i, type: generator ? "generator" : null });
return this;
});
- blockstmt("if", function () {
+ blockstmt("if", function() {
var t = state.tokens.next;
increaseComplexityCount();
state.condition = true;
@@ -10318,7 +22700,7 @@ var JSHINT = (function () {
// When the if is within a for-in loop and the condition has a negative form,
// check if the body contains nothing but a continue statement
if (forinifcheck && forinifcheck.type === "(negative)") {
- if (s && s.length === 1 && s[0].type === "(identifier)" && s[0].value === "continue") {
+ if (s && s[0] && s[0].type === "(identifier)" && s[0].value === "continue") {
forinifcheck.type = "(negative-with-continue)";
}
}
@@ -10334,40 +22716,31 @@ var JSHINT = (function () {
return this;
});
- blockstmt("try", function () {
+ blockstmt("try", function() {
var b;
function doCatch() {
- var oldScope = scope;
- var e;
-
advance("catch");
advance("(");
- scope = Object.create(oldScope);
+ state.funct["(scope)"].stack("catchparams");
- e = state.tokens.next.value;
- if (state.tokens.next.type !== "(identifier)") {
- e = null;
- warning("E030", state.tokens.next, e);
- }
-
- advance();
-
- funct = functor("(catch)", state.tokens.next, scope, {
- "(context)" : funct,
- "(breakage)" : funct["(breakage)"],
- "(loopage)" : funct["(loopage)"],
- "(statement)": false,
- "(catch)" : true
- });
-
- if (e) {
- addlabel(e, { type: "exception" });
+ if (checkPunctuators(state.tokens.next, ["[", "{"])) {
+ var tokens = destructuringPattern();
+ _.each(tokens, function(token) {
+ if (token.id) {
+ state.funct["(scope)"].addParam(token.id, token, "exception");
+ }
+ });
+ } else if (state.tokens.next.type !== "(identifier)") {
+ warning("E030", state.tokens.next, state.tokens.next.value);
+ } else {
+ // only advance if we have an identifier so we can continue parsing in the most common error - that
no param is given.
+ state.funct["(scope)"].addParam(identifier(), state.tokens.curr, "exception");
}
if (state.tokens.next.value === "if") {
- if (!state.option.inMoz(true)) {
+ if (!state.inMoz()) {
warning("W118", state.tokens.curr, "catch filter");
}
advance("if");
@@ -10376,23 +22749,16 @@ var JSHINT = (function () {
advance(")");
- state.tokens.curr.funct = funct;
- functions.push(funct);
-
block(false);
- scope = oldScope;
-
- funct["(last)"] = state.tokens.curr.line;
- funct["(lastcharacter)"] = state.tokens.curr.character;
- funct = funct["(context)"];
+ state.funct["(scope)"].unstack();
}
block(true);
while (state.tokens.next.id === "catch") {
increaseComplexityCount();
- if (b && (!state.option.inMoz(true))) {
+ if (b && (!state.inMoz())) {
warning("W118", state.tokens.next, "multiple catch blocks");
}
doCatch();
@@ -10412,23 +22778,23 @@ var JSHINT = (function () {
return this;
});
- blockstmt("while", function () {
+ blockstmt("while", function() {
var t = state.tokens.next;
- funct["(breakage)"] += 1;
- funct["(loopage)"] += 1;
+ state.funct["(breakage)"] += 1;
+ state.funct["(loopage)"] += 1;
increaseComplexityCount();
advance("(");
checkCondAssignment(expression(0));
advance(")", t);
block(true, true);
- funct["(breakage)"] -= 1;
- funct["(loopage)"] -= 1;
+ state.funct["(breakage)"] -= 1;
+ state.funct["(loopage)"] -= 1;
return this;
}).labelled = true;
- blockstmt("with", function () {
+ blockstmt("with", function() {
var t = state.tokens.next;
- if (state.directive["use strict"]) {
+ if (state.isStrict()) {
error("E010", state.tokens.curr);
} else if (!state.option.withstmt) {
warning("W085", state.tokens.curr);
@@ -10442,12 +22808,12 @@ var JSHINT = (function () {
return this;
});
- blockstmt("switch", function () {
+ blockstmt("switch", function() {
var t = state.tokens.next;
var g = false;
var noindent = false;
- funct["(breakage)"] += 1;
+ state.funct["(breakage)"] += 1;
advance("(");
checkCondAssignment(expression(0));
advance(")", t);
@@ -10465,7 +22831,7 @@ var JSHINT = (function () {
for (;;) {
switch (state.tokens.next.id) {
case "case":
- switch (funct["(verb)"]) {
+ switch (state.funct["(verb)"]) {
case "yield":
case "break":
case "case":
@@ -10478,7 +22844,7 @@ var JSHINT = (function () {
// You can tell JSHint that you don't use break intentionally by
// adding a comment /* falls through */ on a line just before
// the next `case`.
- if (!reg.fallsThrough.test(state.lines[state.tokens.next.line - 2])) {
+ if (!state.tokens.curr.caseFallsThrough) {
warning("W086", state.tokens.curr, "case");
}
}
@@ -10488,10 +22854,10 @@ var JSHINT = (function () {
increaseComplexityCount();
g = true;
advance(":");
- funct["(verb)"] = "case";
+ state.funct["(verb)"] = "case";
break;
case "default":
- switch (funct["(verb)"]) {
+ switch (state.funct["(verb)"]) {
case "yield":
case "break":
case "continue":
@@ -10502,7 +22868,7 @@ var JSHINT = (function () {
// Do not display a warning if 'default' is the first statement or if
// there is a special /* falls through */ comment.
if (this.cases.length) {
- if (!reg.fallsThrough.test(state.lines[state.tokens.next.line - 2])) {
+ if (!state.tokens.curr.caseFallsThrough) {
warning("W086", state.tokens.curr, "default");
}
}
@@ -10517,8 +22883,8 @@ var JSHINT = (function () {
indent -= state.option.indent;
advance("}", t);
- funct["(breakage)"] -= 1;
- funct["(verb)"] = undefined;
+ state.funct["(breakage)"] -= 1;
+ state.funct["(verb)"] = undefined;
return;
case "(end)":
error("E023", state.tokens.next, "}");
@@ -10551,19 +22917,20 @@ var JSHINT = (function () {
indent -= state.option.indent;
}
}
+ return this;
}).labelled = true;
- stmt("debugger", function () {
+ stmt("debugger", function() {
if (!state.option.debug) {
warning("W087", this);
}
return this;
}).exps = true;
- (function () {
- var x = stmt("do", function () {
- funct["(breakage)"] += 1;
- funct["(loopage)"] += 1;
+ (function() {
+ var x = stmt("do", function() {
+ state.funct["(breakage)"] += 1;
+ state.funct["(loopage)"] += 1;
increaseComplexityCount();
this.first = block(true, true);
@@ -10572,15 +22939,15 @@ var JSHINT = (function () {
advance("(");
checkCondAssignment(expression(0));
advance(")", t);
- funct["(breakage)"] -= 1;
- funct["(loopage)"] -= 1;
+ state.funct["(breakage)"] -= 1;
+ state.funct["(loopage)"] -= 1;
return this;
});
x.labelled = true;
x.exps = true;
}());
- blockstmt("for", function () {
+ blockstmt("for", function() {
var s, t = state.tokens.next;
var letscope = false;
var foreachtok = null;
@@ -10588,13 +22955,11 @@ var JSHINT = (function () {
if (t.value === "each") {
foreachtok = t;
advance("each");
- if (!state.option.inMoz(true)) {
+ if (!state.inMoz()) {
warning("W118", state.tokens.curr, "for each");
}
}
- funct["(breakage)"] += 1;
- funct["(loopage)"] += 1;
increaseComplexityCount();
advance("(");
@@ -10602,44 +22967,53 @@ var JSHINT = (function () {
var nextop; // contains the token of the "in" or "of" operator
var i = 0;
var inof = ["in", "of"];
+ var level = 0; // BindingPattern "level" --- level 0 === no BindingPattern
+ var comma; // First comma punctuator at level 0
+ var initializer; // First initializer at level 0
+
+ // If initial token is a BindingPattern, count it as such.
+ if (checkPunctuators(state.tokens.next, ["{", "["])) ++level;
do {
nextop = peek(i);
++i;
- } while (!_.contains(inof, nextop.value) && nextop.value !== ";" &&
- nextop.type !== "(end)");
+ if (checkPunctuators(nextop, ["{", "["])) ++level;
+ else if (checkPunctuators(nextop, ["}", "]"])) --level;
+ if (level < 0) break;
+ if (level === 0) {
+ if (!comma && checkPunctuator(nextop, ",")) comma = nextop;
+ else if (!initializer && checkPunctuator(nextop, "=")) initializer = nextop;
+ }
+ } while (level > 0 || !_.contains(inof, nextop.value) && nextop.value !== ";" &&
+ nextop.type !== "(end)"); // Is this a JSCS bug? This looks really weird.
// if we're in a for (… in|of …) statement
if (_.contains(inof, nextop.value)) {
- if (!state.option.inESNext() && nextop.value === "of") {
- error("W104", nextop, "for of");
+ if (!state.inES6() && nextop.value === "of") {
+ warning("W104", nextop, "for of", "6");
+ }
+
+ var ok = !(initializer || comma);
+ if (initializer) {
+ error("W133", comma, nextop.value, "initializer is forbidden");
+ }
+
+ if (comma) {
+ error("W133", comma, nextop.value, "more than one ForBinding");
}
if (state.tokens.next.id === "var") {
advance("var");
- state.syntax["var"].fud.call(state.syntax["var"].fud, true);
- } else if (state.tokens.next.id === "let") {
- advance("let");
+ state.tokens.curr.fud({ prefix: true });
+ } else if (state.tokens.next.id === "let" || state.tokens.next.id === "const") {
+ advance(state.tokens.next.id);
// create a new block scope
letscope = true;
- funct["(blockscope)"].stack();
- state.syntax["let"].fud.call(state.syntax["let"].fud, true);
- } else if (!state.tokens.next.identifier) {
- error("E030", state.tokens.next, state.tokens.next.type);
- advance();
+ state.funct["(scope)"].stack();
+ state.tokens.curr.fud({ prefix: true });
} else {
- switch (funct[state.tokens.next.value]) {
- case "unused":
- funct[state.tokens.next.value] = "var";
- break;
- case "var":
- break;
- default:
- var ident = state.tokens.next.value;
- if (!funct["(blockscope)"].getlabel(ident) &&
- !(scope[ident] || {})[ident])
- warning("W088", state.tokens.next, state.tokens.next.value);
- }
- advance();
+ // Parse as a var statement, with implied bindings. Ignore errors if an error
+ // was already reported
+ Object.create(varstatement).fud({ prefix: true, implied: "for", ignore: !ok });
}
advance(nextop.value);
expression(20);
@@ -10659,6 +23033,9 @@ var JSHINT = (function () {
});
}
+ state.funct["(breakage)"] += 1;
+ state.funct["(loopage)"] += 1;
+
s = block(true, true);
if (nextop.value === "in" && state.option.forin) {
@@ -10679,8 +23056,8 @@ var JSHINT = (function () {
state.forinifcheckneeded = false;
}
- funct["(breakage)"] -= 1;
- funct["(loopage)"] -= 1;
+ state.funct["(breakage)"] -= 1;
+ state.funct["(loopage)"] -= 1;
} else {
if (foreachtok) {
error("E045", foreachtok);
@@ -10688,25 +23065,29 @@ var JSHINT = (function () {
if (state.tokens.next.id !== ";") {
if (state.tokens.next.id === "var") {
advance("var");
- state.syntax["var"].fud.call(state.syntax["var"].fud);
+ state.tokens.curr.fud();
} else if (state.tokens.next.id === "let") {
advance("let");
// create a new block scope
letscope = true;
- funct["(blockscope)"].stack();
- state.syntax["let"].fud.call(state.syntax["let"].fud);
+ state.funct["(scope)"].stack();
+ state.tokens.curr.fud();
} else {
for (;;) {
expression(0, "for");
if (state.tokens.next.id !== ",") {
break;
}
- comma();
+ parseComma();
}
}
}
nolinebreak(state.tokens.curr);
advance(";");
+
+ // start loopage after the first ; as the next two expressions are executed
+ // on every loop
+ state.funct["(loopage)"] += 1;
if (state.tokens.next.id !== ";") {
checkCondAssignment(expression(0));
}
@@ -10721,42 +23102,40 @@ var JSHINT = (function () {
if (state.tokens.next.id !== ",") {
break;
}
- comma();
+ parseComma();
}
}
advance(")", t);
+ state.funct["(breakage)"] += 1;
block(true, true);
- funct["(breakage)"] -= 1;
- funct["(loopage)"] -= 1;
+ state.funct["(breakage)"] -= 1;
+ state.funct["(loopage)"] -= 1;
}
// unstack loop blockscope
if (letscope) {
- funct["(blockscope)"].unstack();
+ state.funct["(scope)"].unstack();
}
return this;
}).labelled = true;
- stmt("break", function () {
+ stmt("break", function() {
var v = state.tokens.next.value;
- if (funct["(breakage)"] === 0)
- warning("W052", state.tokens.next, this.value);
-
if (!state.option.asi)
nolinebreak(this);
- if (state.tokens.next.id !== ";" && !state.tokens.next.reach) {
- if (state.tokens.curr.line === state.tokens.next.line) {
- if (funct[v] !== "label") {
- warning("W090", state.tokens.next, v);
- } else if (scope[v] !== funct) {
- warning("W091", state.tokens.next, v);
- }
- this.first = state.tokens.next;
- advance();
+ if (state.tokens.next.id !== ";" && !state.tokens.next.reach &&
+ state.tokens.curr.line === startLine(state.tokens.next)) {
+ if (!state.funct["(scope)"].funct.hasBreakLabel(v)) {
+ warning("W090", state.tokens.next, v);
}
+ this.first = state.tokens.next;
+ advance();
+ } else {
+ if (state.funct["(breakage)"] === 0)
+ warning("W052", state.tokens.next, this.value);
}
reachable(this);
@@ -10765,27 +23144,25 @@ var JSHINT = (function () {
}).exps = true;
- stmt("continue", function () {
+ stmt("continue", function() {
var v = state.tokens.next.value;
- if (funct["(breakage)"] === 0)
+ if (state.funct["(breakage)"] === 0)
+ warning("W052", state.tokens.next, this.value);
+ if (!state.funct["(loopage)"])
warning("W052", state.tokens.next, this.value);
if (!state.option.asi)
nolinebreak(this);
if (state.tokens.next.id !== ";" && !state.tokens.next.reach) {
- if (state.tokens.curr.line === state.tokens.next.line) {
- if (funct[v] !== "label") {
+ if (state.tokens.curr.line === startLine(state.tokens.next)) {
+ if (!state.funct["(scope)"].funct.hasBreakLabel(v)) {
warning("W090", state.tokens.next, v);
- } else if (scope[v] !== funct) {
- warning("W091", state.tokens.next, v);
}
this.first = state.tokens.next;
advance();
}
- } else if (!funct["(loopage)"]) {
- warning("W052", state.tokens.next, this.value);
}
reachable(this);
@@ -10794,8 +23171,8 @@ var JSHINT = (function () {
}).exps = true;
- stmt("return", function () {
- if (this.line === state.tokens.next.line) {
+ stmt("return", function() {
+ if (this.line === startLine(state.tokens.next)) {
if (state.tokens.next.id !== ";" && !state.tokens.next.reach) {
this.first = expression(0);
@@ -10817,20 +23194,20 @@ var JSHINT = (function () {
return this;
}).exps = true;
- (function (x) {
+ (function(x) {
x.exps = true;
x.lbp = 25;
- }(prefix("yield", function () {
+ }(prefix("yield", function() {
var prev = state.tokens.prev;
- if (state.option.inESNext(true) && !funct["(generator)"]) {
+ if (state.inES6(true) && !state.funct["(generator)"]) {
// If it's a yield within a catch clause inside a generator then that's ok
- if (!("(catch)" === funct["(name)"] && funct["(context)"]["(generator)"])) {
+ if (!("(catch)" === state.funct["(name)"] && state.funct["(context)"]["(generator)"])) {
error("E046", state.tokens.curr, "yield");
}
- } else if (!state.option.inESNext()) {
- warning("W104", state.tokens.curr, "yield");
+ } else if (!state.inES6()) {
+ warning("W104", state.tokens.curr, "yield", "6");
}
- funct["(generator)"] = "yielded";
+ state.funct["(generator)"] = "yielded";
var delegatingYield = false;
if (state.tokens.next.value === "*") {
@@ -10838,9 +23215,10 @@ var JSHINT = (function () {
advance("*");
}
- if (this.line === state.tokens.next.line || !state.option.inMoz(true)) {
+ if (this.line === startLine(state.tokens.next) || !state.inMoz()) {
if (delegatingYield ||
- (state.tokens.next.id !== ";" && !state.tokens.next.reach && state.tokens.next.nud)) {
+ (state.tokens.next.id !== ";" && !state.option.asi &&
+ !state.tokens.next.reach && state.tokens.next.nud)) {
nobreaknonadjacent(state.tokens.curr, state.tokens.next);
this.first = expression(10);
@@ -10851,7 +23229,7 @@ var JSHINT = (function () {
}
}
- if (state.option.inMoz(true) && state.tokens.next.id !== ")" &&
+ if (state.inMoz() && state.tokens.next.id !== ")" &&
(prev.lbp > 30 || (!prev.assign && !isEndOfExpr()) || prev.id === "yield")) {
error("E050", this);
}
@@ -10862,7 +23240,7 @@ var JSHINT = (function () {
})));
- stmt("throw", function () {
+ stmt("throw", function() {
nolinebreak(this);
this.first = expression(20);
@@ -10871,9 +23249,9 @@ var JSHINT = (function () {
return this;
}).exps = true;
- stmt("import", function () {
- if (!state.option.inESNext()) {
- warning("W119", state.tokens.curr, "import");
+ stmt("import", function() {
+ if (!state.inES6()) {
+ warning("W119", state.tokens.curr, "import", "6");
}
if (state.tokens.next.type === "(string)") {
@@ -10885,16 +23263,39 @@ var JSHINT = (function () {
if (state.tokens.next.identifier) {
// ImportClause :: ImportedDefaultBinding
this.name = identifier();
- addlabel(this.name, { type: "unused", token: state.tokens.curr });
- } else if (state.tokens.next.id === "*") {
+ // Import bindings are immutable (see ES6 8.1.1.5.5)
+ state.funct["(scope)"].addlabel(this.name, {
+ type: "const",
+ token: state.tokens.curr });
+
+ if (state.tokens.next.value === ",") {
+ // ImportClause :: ImportedDefaultBinding , NameSpaceImport
+ // ImportClause :: ImportedDefaultBinding , NamedImports
+ advance(",");
+ // At this point, we intentionally fall through to continue matching
+ // either NameSpaceImport or NamedImports.
+ // Discussion:
+ // https://github.com/jshint/jshint/pull/2144#discussion_r23978406
+ } else {
+ advance("from");
+ advance("(string)");
+ return this;
+ }
+ }
+
+ if (state.tokens.next.id === "*") {
// ImportClause :: NameSpaceImport
advance("*");
advance("as");
if (state.tokens.next.identifier) {
this.name = identifier();
- addlabel(this.name, { type: "unused", token: state.tokens.curr });
+ // Import bindings are immutable (see ES6 8.1.1.5.5)
+ state.funct["(scope)"].addlabel(this.name, {
+ type: "const",
+ token: state.tokens.curr });
}
} else {
+ // ImportClause :: NamedImports
advance("{");
for (;;) {
if (state.tokens.next.value === "}") {
@@ -10912,7 +23313,11 @@ var JSHINT = (function () {
advance("as");
importName = identifier();
}
- addlabel(importName, { type: "unused", token: state.tokens.curr });
+
+ // Import bindings are immutable (see ES6 8.1.1.5.5)
+ state.funct["(scope)"].addlabel(importName, {
+ type: "const",
+ token: state.tokens.curr });
if (state.tokens.next.value === ",") {
advance(",");
@@ -10932,19 +23337,23 @@ var JSHINT = (function () {
return this;
}).exps = true;
- stmt("export", function () {
+ stmt("export", function() {
var ok = true;
- if (!state.option.inESNext()) {
- warning("W119", state.tokens.curr, "export");
+ var token;
+ var identifier;
+
+ if (!state.inES6()) {
+ warning("W119", state.tokens.curr, "export", "6");
ok = false;
}
- if (!funct["(global)"] || !funct["(blockscope)"].atTop()) {
+ if (!state.funct["(scope)"].block.isGlobal()) {
error("E053", state.tokens.curr);
ok = false;
}
if (state.tokens.next.value === "*") {
+ // ExportDeclaration :: export * FromClause
advance("*");
advance("from");
advance("(string)");
@@ -10952,23 +23361,52 @@ var JSHINT = (function () {
}
if (state.tokens.next.type === "default") {
+ // ExportDeclaration ::
+ // export default [lookahead { function, class }] AssignmentExpression[In] ;
+ // export default HoistableDeclaration
+ // export default ClassDeclaration
state.nameStack.set(state.tokens.next);
advance("default");
- if (state.tokens.next.id === "function" || state.tokens.next.id === "class") {
+ var exportType = state.tokens.next.id;
+ if (exportType === "function" || exportType === "class") {
this.block = true;
}
- this.exportee = expression(10);
+
+ token = peek();
+
+ expression(10);
+
+ identifier = token.value;
+
+ if (this.block) {
+ state.funct["(scope)"].addlabel(identifier, {
+ type: exportType,
+ token: token });
+
+ state.funct["(scope)"].setExported(identifier, token);
+ }
return this;
}
if (state.tokens.next.value === "{") {
+ // ExportDeclaration :: export ExportClause
advance("{");
+ var exportedTokens = [];
for (;;) {
- var id;
- exported[id = identifier(false, false, ok)] = ok;
- if (ok) {
- funct["(blockscope)"].setExported(id);
+ if (!state.tokens.next.identifier) {
+ error("E030", state.tokens.next, state.tokens.next.value);
+ }
+ advance();
+
+ exportedTokens.push(state.tokens.curr);
+
+ if (state.tokens.next.value === "as") {
+ advance("as");
+ if (!state.tokens.next.identifier) {
+ error("E030", state.tokens.next, state.tokens.next.value);
+ }
+ advance();
}
if (state.tokens.next.value === ",") {
@@ -10981,36 +23419,42 @@ var JSHINT = (function () {
break;
}
}
+ if (state.tokens.next.value === "from") {
+ // ExportDeclaration :: export ExportClause FromClause
+ advance("from");
+ advance("(string)");
+ } else if (ok) {
+ exportedTokens.forEach(function(token) {
+ state.funct["(scope)"].setExported(token.value, token);
+ });
+ }
return this;
}
if (state.tokens.next.id === "var") {
+ // ExportDeclaration :: export VariableStatement
advance("var");
- exported[state.tokens.next.value] = ok;
- state.tokens.next.exported = true;
- state.syntax["var"].fud.call(state.syntax["var"].fud);
+ state.tokens.curr.fud({ inexport:true });
} else if (state.tokens.next.id === "let") {
+ // ExportDeclaration :: export VariableStatement
advance("let");
- exported[state.tokens.next.value] = ok;
- state.tokens.next.exported = true;
- state.syntax["let"].fud.call(state.syntax["let"].fud);
+ state.tokens.curr.fud({ inexport:true });
} else if (state.tokens.next.id === "const") {
+ // ExportDeclaration :: export VariableStatement
advance("const");
- exported[state.tokens.next.value] = ok;
- state.tokens.next.exported = true;
- state.syntax["const"].fud.call(state.syntax["const"].fud);
+ state.tokens.curr.fud({ inexport:true });
} else if (state.tokens.next.id === "function") {
+ // ExportDeclaration :: export Declaration
this.block = true;
advance("function");
- exported[state.tokens.next.value] = ok;
- state.tokens.next.exported = true;
- state.syntax["function"].fud();
+ state.syntax["function"].fud({ inexport:true });
} else if (state.tokens.next.id === "class") {
+ // ExportDeclaration :: export Declaration
this.block = true;
advance("class");
- exported[state.tokens.next.value] = ok;
- state.tokens.next.exported = true;
+ var classNameToken = state.tokens.next;
state.syntax["class"].fud();
+ state.funct["(scope)"].setExported(classNameToken.value, classNameToken);
} else {
error("E024", state.tokens.next, state.tokens.next.value);
}
@@ -11021,6 +23465,7 @@ var JSHINT = (function () {
// Future Reserved Words
FutureReservedWord("abstract");
+ FutureReservedWord("await", { es5: true, moduleOnly: true });
FutureReservedWord("boolean");
FutureReservedWord("byte");
FutureReservedWord("char");
@@ -11052,15 +23497,17 @@ var JSHINT = (function () {
// this function is used to determine whether a squarebracket or a curlybracket
// expression is a comprehension array, destructuring assignment or a json value.
- var lookupBlockType = function () {
- var pn, pn1;
+ var lookupBlockType = function() {
+ var pn, pn1, prev;
var i = -1;
var bracketStack = 0;
var ret = {};
- if (checkPunctuators(state.tokens.curr, ["[", "{"]))
+ if (checkPunctuators(state.tokens.curr, ["[", "{"])) {
bracketStack += 1;
+ }
do {
- pn = (i === -1) ? state.tokens.next : peek(i);
+ prev = i === -1 ? state.tokens.curr : pn;
+ pn = i === -1 ? state.tokens.next : peek(i);
pn1 = peek(i + 1);
i = i + 1;
if (checkPunctuators(pn, ["[", "{"])) {
@@ -11068,12 +23515,13 @@ var JSHINT = (function () {
} else if (checkPunctuators(pn, ["]", "}"])) {
bracketStack -= 1;
}
- if (pn.identifier && pn.value === "for" && bracketStack === 1) {
+ if (bracketStack === 1 && pn.identifier && pn.value === "for" &&
+ !checkPunctuator(prev, ".")) {
ret.isCompArray = true;
ret.notJson = true;
break;
}
- if (checkPunctuators(pn, ["}", "]"]) && bracketStack === 0) {
+ if (bracketStack === 0 && checkPunctuators(pn, ["}", "]"])) {
if (pn1.value === "=") {
ret.isDestAssign = true;
ret.notJson = true;
@@ -11083,11 +23531,11 @@ var JSHINT = (function () {
break;
}
}
- if (pn.value === ";") {
+ if (checkPunctuator(pn, ";")) {
ret.isBlock = true;
ret.notJson = true;
}
- } while (bracketStack > 0 && pn.id !== "(end)" && i < 15);
+ } while (bracketStack > 0 && pn.id !== "(end)");
return ret;
};
@@ -11098,10 +23546,10 @@ var JSHINT = (function () {
name = tkn.value;
}
- if (props[name] && _.has(props, name)) {
+ if (props[name] && name !== "__proto__") {
warning("W075", state.tokens.next, msg, name);
} else {
- props[name] = {};
+ props[name] = Object.create(null);
}
props[name].basic = true;
@@ -11133,12 +23581,12 @@ var JSHINT = (function () {
state.tokens.curr.accessorType = accessorType;
state.nameStack.set(tkn);
- if (props[name] && _.has(props, name)) {
- if (props[name].basic || props[name][flagName]) {
+ if (props[name]) {
+ if ((props[name].basic || props[name][flagName]) && name !== "__proto__") {
warning("W075", state.tokens.next, msg, name);
}
} else {
- props[name] = {};
+ props[name] = Object.create(null);
}
props[name][flagName] = tkn;
@@ -11146,29 +23594,47 @@ var JSHINT = (function () {
function computedPropertyName() {
advance("[");
- if (!state.option.esnext) {
- warning("W119", state.tokens.curr, "computed property names");
+ if (!state.inES6()) {
+ warning("W119", state.tokens.curr, "computed property names", "6");
}
var value = expression(10);
advance("]");
return value;
}
- // Test whether a given token is a punctuator matching one of the specified values
+ /**
+ * Test whether a given token is a punctuator matching one of the specified values
+ * @param {Token} token
+ * @param {Array.<string>} values
+ * @returns {boolean}
+ */
function checkPunctuators(token, values) {
- return token.type === "(punctuator)" && _.contains(values, token.value);
+ if (token.type === "(punctuator)") {
+ return _.contains(values, token.value);
+ }
+ return false;
+ }
+
+ /**
+ * Test whether a given token is a punctuator matching the specified value
+ * @param {Token} token
+ * @param {string} value
+ * @returns {boolean}
+ */
+ function checkPunctuator(token, value) {
+ return token.type === "(punctuator)" && token.value === value;
}
// Check whether this function has been reached for a destructuring assign with undeclared values
function destructuringAssignOrJsonValue() {
- // lookup for the assignment (esnext only)
+ // lookup for the assignment (ECMAScript 6 only)
// if it has semicolons, it is a block, so go parse it as a block
// or it's not a block, but there are assignments, check for undeclared variables
var block = lookupBlockType();
if (block.notJson) {
- if (!state.option.inESNext() && block.isDestAssign) {
- warning("W104", state.tokens.curr, "destructuring assignment");
+ if (!state.inES6() && block.isDestAssign) {
+ warning("W104", state.tokens.curr, "destructuring assignment", "6");
}
statements();
// otherwise parse json value
@@ -11187,15 +23653,15 @@ var JSHINT = (function () {
// * "define" which will define the variables local to the list comprehension
// * "filter" which will help filter out values
- var arrayComprehension = function () {
- var CompArray = function () {
+ var arrayComprehension = function() {
+ var CompArray = function() {
this.mode = "use";
this.variables = [];
};
var _carrays = [];
var _current;
function declare(v) {
- var l = _current.variables.filter(function (elt) {
+ var l = _current.variables.filter(function(elt) {
// if it has, change its undef state
if (elt.value === v) {
elt.undef = false;
@@ -11205,7 +23671,7 @@ var JSHINT = (function () {
return l !== 0;
}
function use(v) {
- var l = _current.variables.filter(function (elt) {
+ var l = _current.variables.filter(function(elt) {
// and if it has been defined
if (elt.value === v && !elt.undef) {
if (elt.unused === true) {
@@ -11217,25 +23683,25 @@ var JSHINT = (function () {
// otherwise we warn about it
return (l === 0);
}
- return {stack: function () {
+ return { stack: function() {
_current = new CompArray();
_carrays.push(_current);
},
- unstack: function () {
- _current.variables.filter(function (v) {
+ unstack: function() {
+ _current.variables.filter(function(v) {
if (v.unused)
warning("W098", v.token, v.raw_text || v.value);
if (v.undef)
- isundef(v.funct, "W117", v.token, v.value);
+ state.funct["(scope)"].block.use(v.value, v.token);
});
_carrays.splice(-1, 1);
_current = _carrays[_carrays.length - 1];
},
- setState: function (s) {
+ setState: function(s) {
if (_.contains(["use", "define", "generate", "filter"], s))
_current.mode = s;
},
- check: function (v) {
+ check: function(v) {
if (!_current) {
return;
}
@@ -11243,7 +23709,7 @@ var JSHINT = (function () {
if (_current && _current.mode === "use") {
if (use(v)) {
_current.variables.push({
- funct: funct,
+ funct: state.funct,
token: state.tokens.curr,
value: v,
undef: true,
@@ -11256,7 +23722,7 @@ var JSHINT = (function () {
// check if the variable has been used previously
if (!declare(v)) {
_current.variables.push({
- funct: funct,
+ funct: state.funct,
token: state.tokens.curr,
value: v,
undef: false,
@@ -11266,14 +23732,14 @@ var JSHINT = (function () {
return true;
// When we are in the "generate" state of the list comp,
} else if (_current && _current.mode === "generate") {
- isundef(funct, "W117", state.tokens.curr, v);
+ state.funct["(scope)"].block.use(v, state.tokens.curr);
return true;
// When we are in "filter" state,
} else if (_current && _current.mode === "filter") {
// we check whether current variable has been declared
if (use(v)) {
// if not we warn about it
- isundef(funct, "W117", state.tokens.curr, v);
+ state.funct["(scope)"].block.use(v, state.tokens.curr);
}
return true;
}
@@ -11302,7 +23768,7 @@ var JSHINT = (function () {
warning("W095", state.tokens.next, state.tokens.next.value);
}
if (o[state.tokens.next.value] === true) {
- warning("W075", state.tokens.next, state.tokens.next.value);
+ warning("W075", state.tokens.next, "key", state.tokens.next.value);
} else if ((state.tokens.next.value === "__proto__" &&
!state.option.proto) || (state.tokens.next.value === "__iterator__" &&
!state.option.iterator)) {
@@ -11368,94 +23834,12 @@ var JSHINT = (function () {
}
}
- var blockScope = function () {
- var _current = {};
- var _variables = [_current];
-
- function _checkBlockLabels() {
- for (var t in _current) {
- if (_current[t]["(type)"] === "unused") {
- if (state.option.unused) {
- var tkn = _current[t]["(token)"];
- // Don't report exported labels as unused
- if (tkn.exported) {
- continue;
- }
- var line = tkn.line;
- var chr = tkn.character;
- warningAt("W098", line, chr, t);
- }
- }
- }
- }
-
- return {
- stack: function () {
- _current = {};
- _variables.push(_current);
- },
-
- unstack: function () {
- _checkBlockLabels();
- _variables.splice(_variables.length - 1, 1);
- _current = _.last(_variables);
- },
-
- getlabel: function (l) {
- for (var i = _variables.length - 1 ; i >= 0; --i) {
- if (_.has(_variables[i], l) && !_variables[i][l]["(shadowed)"]) {
- return _variables[i];
- }
- }
- },
-
- shadow: function (name) {
- for (var i = _variables.length - 1; i >= 0; i--) {
- if (_.has(_variables[i], name)) {
- _variables[i][name]["(shadowed)"] = true;
- }
- }
- },
-
- unshadow: function (name) {
- for (var i = _variables.length - 1; i >= 0; i--) {
- if (_.has(_variables[i], name)) {
- _variables[i][name]["(shadowed)"] = false;
- }
- }
- },
-
- atTop: function () {
- return _variables.length === 1;
- },
-
- setExported: function (id) {
- if (funct["(blockscope)"].atTop()) {
- var item = _current[id];
- if (item && item["(token)"]) {
- item["(token)"].exported = true;
- }
- }
- },
-
- current: {
- has: function (t) {
- return _.has(_current, t);
- },
-
- add: function (t, type, tok) {
- _current[t] = { "(type)" : type, "(token)": tok, "(shadowed)": false };
- }
- }
- };
- };
-
var escapeRegex = function(str) {
return str.replace(/[-\/\\^$*+?.()|[\]{}]/g, "\\$&");
};
// The actual JSHINT function itself.
- var itself = function (s, o, g) {
+ var itself = function(s, o, g) {
var i, k, x, reIgnoreStr, reIgnore;
var optionKeys;
var newOptionObj = {};
@@ -11475,13 +23859,13 @@ var JSHINT = (function () {
}
predefined = Object.create(null);
- combine(predefined, vars.ecmaIdentifiers);
+ combine(predefined, vars.ecmaIdentifiers[3]);
combine(predefined, vars.reservedVars);
combine(predefined, g || {});
declared = Object.create(null);
- exported = Object.create(null);
+ var exported = Object.create(null); // Variables that live outside the current file
function each(obj, cb) {
if (!obj)
@@ -11494,7 +23878,7 @@ var JSHINT = (function () {
}
if (o) {
- each(o.predef || null, function (item) {
+ each(o.predef || null, function(item) {
var slice, prop;
if (item[0] === "-") {
@@ -11508,7 +23892,7 @@ var JSHINT = (function () {
}
});
- each(o.exported || null, function (item) {
+ each(o.exported || null, function(item) {
exported[item] = true;
});
@@ -11520,10 +23904,8 @@ var JSHINT = (function () {
if (/^-W\d{3}$/g.test(optionKeys[x])) {
newIgnoredObj[optionKeys[x].slice(1)] = true;
} else {
- newOptionObj[optionKeys[x]] = o[optionKeys[x]];
-
- if (optionKeys[x] === "newcap" && o[optionKeys[x]] === false)
- newOptionObj["(explicitNewcap)"] = true;
+ var optionKey = optionKeys[x];
+ newOptionObj[optionKey] = o[optionKey];
}
}
}
@@ -11535,25 +23917,30 @@ var JSHINT = (function () {
state.option.maxerr = state.option.maxerr || 50;
indent = 1;
- global = Object.create(predefined);
- scope = global;
- funct = functor("(global)", null, scope, {
+ var scopeManagerInst = scopeManager(state, predefined, exported, declared);
+ scopeManagerInst.on("warning", function(ev) {
+ warning.apply(null, [ ev.code, ev.token].concat(ev.data));
+ });
+
+ scopeManagerInst.on("error", function(ev) {
+ error.apply(null, [ ev.code, ev.token ].concat(ev.data));
+ });
+
+ state.funct = functor("(global)", null, {
"(global)" : true,
- "(blockscope)": blockScope(),
+ "(scope)" : scopeManagerInst,
"(comparray)" : arrayComprehension(),
"(metrics)" : createMetrics(state.tokens.next)
});
- functions = [funct];
+ functions = [state.funct];
urls = [];
stack = null;
member = {};
membersOnly = null;
- implied = {};
inblock = false;
lookahead = [];
- unuseds = [];
if (!isString(s) && !Array.isArray(s)) {
errorAt("E004", 0);
@@ -11565,31 +23952,31 @@ var JSHINT = (function () {
return state.jsonMode;
},
- getOption: function (name) {
+ getOption: function(name) {
return state.option[name] || null;
},
- getCache: function (name) {
+ getCache: function(name) {
return state.cache[name];
},
- setCache: function (name, value) {
+ setCache: function(name, value) {
state.cache[name] = value;
},
- warn: function (code, data) {
+ warn: function(code, data) {
warningAt.apply(null, [ code, data.line, data.char ].concat(data.data));
},
- on: function (names, listener) {
- names.split(" ").forEach(function (name) {
+ on: function(names, listener) {
+ names.split(" ").forEach(function(name) {
emitter.on(name, listener);
}.bind(this));
}
};
emitter.removeAllListeners();
- (extraModules || []).forEach(function (func) {
+ (extraModules || []).forEach(function(func) {
func(api);
});
@@ -11601,7 +23988,7 @@ var JSHINT = (function () {
o.ignoreDelimiters = [o.ignoreDelimiters];
}
- o.ignoreDelimiters.forEach(function (delimiterPair) {
+ o.ignoreDelimiters.forEach(function(delimiterPair) {
if (!delimiterPair.start || !delimiterPair.end)
return;
@@ -11619,27 +24006,27 @@ var JSHINT = (function () {
lex = new Lexer(s);
- lex.on("warning", function (ev) {
+ lex.on("warning", function(ev) {
warningAt.apply(null, [ ev.code, ev.line, ev.character].concat(ev.data));
});
- lex.on("error", function (ev) {
+ lex.on("error", function(ev) {
errorAt.apply(null, [ ev.code, ev.line, ev.character ].concat(ev.data));
});
- lex.on("fatal", function (ev) {
- quit("E041", ev.line, ev.from);
+ lex.on("fatal", function(ev) {
+ quit("E041", ev);
});
- lex.on("Identifier", function (ev) {
+ lex.on("Identifier", function(ev) {
emitter.emit("Identifier", ev);
});
- lex.on("String", function (ev) {
+ lex.on("String", function(ev) {
emitter.emit("String", ev);
});
- lex.on("Number", function (ev) {
+ lex.on("Number", function(ev) {
emitter.emit("Number", ev);
});
@@ -11652,15 +24039,15 @@ var JSHINT = (function () {
}
}
- assume();
+ try {
+ assume();
- // combine the passed globals after we've assumed all our options
- combine(predefined, g || {});
+ // combine the passed globals after we've assumed all our options
+ combine(predefined, g || {});
- //reset values
- comma.first = true;
+ //reset values
+ parseComma.first = true;
- try {
advance();
switch (state.tokens.next.id) {
case "{":
@@ -11671,171 +24058,19 @@ var JSHINT = (function () {
directives();
if (state.directive["use strict"]) {
- if (!state.option.globalstrict) {
- if (!(state.option.node || state.option.phantom || state.option.browserify)) {
- warning("W097", state.tokens.prev);
- }
+ if (!state.allowsGlobalUsd()) {
+ warning("W097", state.tokens.prev);
}
}
statements();
}
- advance((state.tokens.next && state.tokens.next.value !== ".") ? "(end)" : undefined);
- funct["(blockscope)"].unstack();
-
- var markDefined = function (name, context) {
- do {
- if (typeof context[name] === "string") {
- // JSHINT marks unused variables as 'unused' and
- // unused function declaration as 'unction'. This
- // code changes such instances back 'var' and
- // 'closure' so that the code in JSHINT.data()
- // doesn't think they're unused.
-
- if (context[name] === "unused")
- context[name] = "var";
- else if (context[name] === "unction")
- context[name] = "closure";
-
- return true;
- }
-
- context = context["(context)"];
- } while (context);
-
- return false;
- };
-
- var clearImplied = function (name, line) {
- if (!implied[name])
- return;
-
- var newImplied = [];
- for (var i = 0; i < implied[name].length; i += 1) {
- if (implied[name][i] !== line)
- newImplied.push(implied[name][i]);
- }
-
- if (newImplied.length === 0)
- delete implied[name];
- else
- implied[name] = newImplied;
- };
-
- var warnUnused = function (name, tkn, type, unused_opt) {
- var line = tkn.line;
- var chr = tkn.from;
- var raw_name = tkn.raw_text || name;
-
- if (unused_opt === undefined) {
- unused_opt = state.option.unused;
- }
-
- if (unused_opt === true) {
- unused_opt = "last-param";
- }
-
- var warnable_types = {
- "vars": ["var"],
- "last-param": ["var", "param"],
- "strict": ["var", "param", "last-param"]
- };
- if (unused_opt) {
- if (warnable_types[unused_opt] && warnable_types[unused_opt].indexOf(type) !== -1) {
- if (!tkn.exported) {
- warningAt("W098", line, chr, raw_name);
- }
- }
- }
-
- unuseds.push({
- name: name,
- line: line,
- character: chr
- });
- };
-
- var checkUnused = function (func, key) {
- var type = func[key];
- var tkn = func["(tokens)"][key];
-
- if (key.charAt(0) === "(")
- return;
-
- if (type !== "unused" && type !== "unction" && type !== "const")
- return;
-
- // Params are checked separately from other variables.
- if (func["(params)"] && func["(params)"].indexOf(key) !== -1)
- return;
-
- // Variable is in global scope and defined as exported.
- if (func["(global)"] && _.has(exported, key))
- return;
-
- // Is this constant unused?
- if (type === "const" && !getprop(func, key, "unused"))
- return;
-
- warnUnused(key, tkn, "var");
- };
-
- // Check queued 'x is not defined' instances to see if they're still undefined.
- for (i = 0; i < JSHINT.undefs.length; i += 1) {
- k = JSHINT.undefs[i].slice(0);
-
- if (markDefined(k[2].value, k[0]) || k[2].forgiveUndef) {
- clearImplied(k[2].value, k[2].line);
- } else if (state.option.undef) {
- warning.apply(warning, k.slice(1));
- }
+ if (state.tokens.next.id !== "(end)") {
+ quit("E041", state.tokens.curr);
}
- functions.forEach(function (func) {
- if (func["(unusedOption)"] === false) {
- return;
- }
-
- for (var key in func) {
- if (_.has(func, key)) {
- checkUnused(func, key);
- }
- }
-
- if (!func["(params)"])
- return;
-
- var params = func["(params)"].slice();
- var param = params.pop();
- var type, unused_opt;
-
- while (param) {
- type = func[param];
- unused_opt = func["(unusedOption)"] || state.option.unused;
- unused_opt = unused_opt === true ? "last-param" : unused_opt;
-
- // 'undefined' is a special case for (function (window, undefined) { ... })();
- // patterns.
-
- if (param === "undefined")
- return;
-
- if (type === "unused" || type === "unction") {
- warnUnused(param, func["(tokens)"][param], "param", func["(unusedOption)"]);
- } else if (unused_opt === "last-param") {
- return;
- }
-
- param = params.pop();
- }
- });
-
- for (var key in declared) {
- if (_.has(declared, key) && !_.has(global, key) && !_.has(exported, key)) {
- warnUnused(key, declared[key], "var");
- }
- }
+ state.funct["(scope)"].unstack();
} catch (err) {
if (err && err.name === "JSHintError") {
@@ -11844,7 +24079,7 @@ var JSHINT = (function () {
scope : "(main)",
raw : err.raw,
code : err.code,
- reason : err.message,
+ reason : err.reason,
line : err.line || nt.line,
character : err.character || nt.from
}, null);
@@ -11869,21 +24104,19 @@ var JSHINT = (function () {
};
// Modules.
- itself.addModule = function (func) {
+ itself.addModule = function(func) {
extraModules.push(func);
};
itself.addModule(style.register);
// Data summary.
- itself.data = function () {
+ itself.data = function() {
var data = {
functions: [],
options: state.option
};
- var implieds = [];
- var members = [];
var fu, f, i, j, n, globals;
if (itself.errors.length) {
@@ -11894,24 +24127,16 @@ var JSHINT = (function () {
data.json = true;
}
- for (n in implied) {
- if (_.has(implied, n)) {
- implieds.push({
- name: n,
- line: implied[n]
- });
- }
- }
-
- if (implieds.length > 0) {
- data.implieds = implieds;
+ var impliedGlobals = state.funct["(scope)"].getImpliedGlobals();
+ if (impliedGlobals.length > 0) {
+ data.implieds = impliedGlobals;
}
if (urls.length > 0) {
data.urls = urls;
}
- globals = Object.keys(scope);
+ globals = state.funct["(scope)"].getUsedOrDefinedGlobals();
if (globals.length > 0) {
data.globals = globals;
}
@@ -11939,18 +24164,18 @@ var JSHINT = (function () {
fu.metrics = {
complexity: f["(metrics)"].ComplexityCount,
- parameters: (f["(params)"] || []).length,
+ parameters: f["(metrics)"].arity,
statements: f["(metrics)"].statementCount
};
data.functions.push(fu);
}
+ var unuseds = state.funct["(scope)"].getUnuseds();
if (unuseds.length > 0) {
data.unused = unuseds;
}
- members = [];
for (n in member) {
if (typeof member[n] === "number") {
data.member = member;
@@ -11971,8 +24196,8 @@ if (typeof exports === "object" && exports) {
exports.JSHINT = JSHINT;
}
-},{"./lex.js":13,"./messages.js":14,"./options.js":16,"./reg.js":17,"./state.js":18,"./style.js":19,"./vars.js":20,"console-browserify":10,"events":5,"underscore":12}]},{},[]);
+},{"./lex.js":13,"./messages.js":14,"./options.js":16,"./reg.js":17,"./scope-manager.js":18,"./state.js":19,"./style.js":20,"./vars.js":21,"console-browserify":10,"events":5,"lodash":12}]},{},[]);
JSHINT = require('jshint').JSHINT;
if (typeof exports === 'object' && exports) exports.JSHINT = JSHINT;
-}());
\ No newline at end of file
+}());
[
Date Prev][
Date Next] [
Thread Prev][
Thread Next]
[
Thread Index]
[
Date Index]
[
Author Index]
