Created
September 12, 2016 04:51
-
-
Save t3h2mas/157bea9b7d325c902ccf2dc70708ed98 to your computer and use it in GitHub Desktop.
This file has been truncated, but you can view the full file.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/******/ (function(modules) { // webpackBootstrap | |
/******/ // The module cache | |
/******/ var installedModules = {}; | |
/******/ // The require function | |
/******/ function __webpack_require__(moduleId) { | |
/******/ // Check if module is in cache | |
/******/ if(installedModules[moduleId]) | |
/******/ return installedModules[moduleId].exports; | |
/******/ // Create a new module (and put it into the cache) | |
/******/ var module = installedModules[moduleId] = { | |
/******/ exports: {}, | |
/******/ id: moduleId, | |
/******/ loaded: false | |
/******/ }; | |
/******/ // Execute the module function | |
/******/ modules[moduleId].call(module.exports, module, module.exports, __webpack_require__); | |
/******/ // Flag the module as loaded | |
/******/ module.loaded = true; | |
/******/ // Return the exports of the module | |
/******/ return module.exports; | |
/******/ } | |
/******/ // expose the modules object (__webpack_modules__) | |
/******/ __webpack_require__.m = modules; | |
/******/ // expose the module cache | |
/******/ __webpack_require__.c = installedModules; | |
/******/ // __webpack_public_path__ | |
/******/ __webpack_require__.p = ""; | |
/******/ // Load entry module and return exports | |
/******/ return __webpack_require__(0); | |
/******/ }) | |
/************************************************************************/ | |
/******/ ([ | |
/* 0 */ | |
/***/ function(module, exports, __webpack_require__) { | |
window.enzyme = __webpack_require__(1); | |
/***/ }, | |
/* 1 */ | |
/***/ function(module, exports, __webpack_require__) { | |
Object.defineProperty(exports, "__esModule", { | |
value: true | |
}); | |
exports.ReactWrapper = exports.ShallowWrapper = exports.mount = exports.shallow = exports.render = undefined; | |
var _ReactWrapper = __webpack_require__(2); | |
var _ReactWrapper2 = _interopRequireDefault(_ReactWrapper); | |
var _ShallowWrapper = __webpack_require__(255); | |
var _ShallowWrapper2 = _interopRequireDefault(_ShallowWrapper); | |
var _mount = __webpack_require__(256); | |
var _mount2 = _interopRequireDefault(_mount); | |
var _shallow = __webpack_require__(257); | |
var _shallow2 = _interopRequireDefault(_shallow); | |
var _render = __webpack_require__(258); | |
var _render2 = _interopRequireDefault(_render); | |
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; } | |
exports.render = _render2['default']; | |
exports.shallow = _shallow2['default']; | |
exports.mount = _mount2['default']; | |
exports.ShallowWrapper = _ShallowWrapper2['default']; | |
exports.ReactWrapper = _ReactWrapper2['default']; | |
/***/ }, | |
/* 2 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* WEBPACK VAR INJECTION */(function(global) {Object.defineProperty(exports, "__esModule", { | |
value: true | |
}); | |
var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); | |
var _react = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"react\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())); | |
var _react2 = _interopRequireDefault(_react); | |
var _ComplexSelector = __webpack_require__(3); | |
var _ComplexSelector2 = _interopRequireDefault(_ComplexSelector); | |
var _cheerio = __webpack_require__(30); | |
var _cheerio2 = _interopRequireDefault(_cheerio); | |
var _flatten = __webpack_require__(115); | |
var _flatten2 = _interopRequireDefault(_flatten); | |
var _uniq = __webpack_require__(122); | |
var _uniq2 = _interopRequireDefault(_uniq); | |
var _compact = __webpack_require__(167); | |
var _compact2 = _interopRequireDefault(_compact); | |
var _ReactWrapperComponent = __webpack_require__(168); | |
var _ReactWrapperComponent2 = _interopRequireDefault(_ReactWrapperComponent); | |
var _MountedTraversal = __webpack_require__(180); | |
var _reactCompat = __webpack_require__(216); | |
var _Utils = __webpack_require__(193); | |
var _Debug = __webpack_require__(224); | |
var _version = __webpack_require__(217); | |
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; } | |
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } | |
/** | |
* Finds all nodes in the current wrapper nodes' render trees that match the provided predicate | |
* function. | |
* | |
* @param {ReactWrapper} wrapper | |
* @param {Function} predicate | |
* @param {Function} filter | |
* @returns {ReactWrapper} | |
*/ | |
function findWhereUnwrapped(wrapper, predicate) { | |
var filter = arguments.length <= 2 || arguments[2] === undefined ? _MountedTraversal.treeFilter : arguments[2]; | |
return wrapper.flatMap(function (n) { | |
return filter(n.node, predicate); | |
}); | |
} | |
/** | |
* Returns a new wrapper instance with only the nodes of the current wrapper instance that match | |
* the provided predicate function. | |
* | |
* @param {ReactWrapper} wrapper | |
* @param {Function} predicate | |
* @returns {ReactWrapper} | |
*/ | |
function filterWhereUnwrapped(wrapper, predicate) { | |
return wrapper.wrap((0, _compact2['default'])(wrapper.nodes.filter(predicate))); | |
} | |
/** | |
* @class ReactWrapper | |
*/ | |
var ReactWrapper = function () { | |
function ReactWrapper(nodes, root) { | |
var options = arguments.length <= 2 || arguments[2] === undefined ? {} : arguments[2]; | |
_classCallCheck(this, ReactWrapper); | |
if (!global.window && !global.document) { | |
throw new Error('It looks like you called `mount()` without a global document being loaded.'); | |
} | |
if (!root) { | |
var ReactWrapperComponent = (0, _ReactWrapperComponent2['default'])(nodes, options); | |
this.component = (0, _reactCompat.renderWithOptions)(_react2['default'].createElement(ReactWrapperComponent, { | |
Component: nodes.type, | |
props: nodes.props, | |
context: options.context | |
}), options); | |
this.root = this; | |
this.node = this.component.getWrappedComponent(); | |
this.nodes = [this.node]; | |
this.length = 1; | |
} else { | |
this.component = null; | |
this.root = root; | |
if (!Array.isArray(nodes)) { | |
this.node = nodes; | |
this.nodes = [nodes]; | |
} else { | |
this.node = nodes[0]; | |
this.nodes = nodes; | |
} | |
this.length = this.nodes.length; | |
} | |
this.options = options; | |
this.complexSelector = new _ComplexSelector2['default'](_MountedTraversal.buildInstPredicate, findWhereUnwrapped, _MountedTraversal.childrenOfInst); | |
} | |
/** | |
* If the root component contained a ref, you can access it here | |
* and get a wrapper around it. | |
* | |
* NOTE: can only be called on a wrapper instance that is also the root instance. | |
* | |
* @param {String} refname | |
* @returns {ReactWrapper} | |
*/ | |
_createClass(ReactWrapper, [{ | |
key: 'ref', | |
value: function () { | |
function ref(refname) { | |
if (this.root !== this) { | |
throw new Error('ReactWrapper::ref(refname) can only be called on the root'); | |
} | |
return this.wrap(this.instance().refs[refname]); | |
} | |
return ref; | |
}() | |
/** | |
* Gets the instance of the component being rendered as the root node passed into `mount()`. | |
* | |
* NOTE: can only be called on a wrapper instance that is also the root instance. | |
* | |
* Example: | |
* ``` | |
* const wrapper = mount(<MyComponent />); | |
* const inst = wrapper.instance(); | |
* expect(inst).to.be.instanceOf(MyComponent); | |
* ``` | |
* @returns {ReactComponent} | |
*/ | |
}, { | |
key: 'instance', | |
value: function () { | |
function instance() { | |
if (this.root !== this) { | |
throw new Error('ReactWrapper::instance() can only be called on the root'); | |
} | |
return this.component.getInstance(); | |
} | |
return instance; | |
}() | |
/** | |
* Forces a re-render. Useful to run before checking the render output if something external | |
* may be updating the state of the component somewhere. | |
* | |
* NOTE: can only be called on a wrapper instance that is also the root instance. | |
* | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'update', | |
value: function () { | |
function update() { | |
var _this = this; | |
if (this.root !== this) { | |
// TODO(lmr): this requirement may not be necessary for the ReactWrapper | |
throw new Error('ReactWrapper::update() can only be called on the root'); | |
} | |
this.single(function () { | |
_this.component.forceUpdate(); | |
}); | |
return this; | |
} | |
return update; | |
}() | |
/** | |
* A method that unmounts the component. This can be used to simulate a component going through | |
* and unmount/mount lifecycle. | |
* | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'unmount', | |
value: function () { | |
function unmount() { | |
var _this2 = this; | |
if (this.root !== this) { | |
throw new Error('ReactWrapper::unmount() can only be called on the root'); | |
} | |
this.single(function () { | |
_this2.component.setState({ mount: false }); | |
}); | |
return this; | |
} | |
return unmount; | |
}() | |
/** | |
* A method that re-mounts the component. This can be used to simulate a component going through | |
* an unmount/mount lifecycle. | |
* | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'mount', | |
value: function () { | |
function mount() { | |
var _this3 = this; | |
if (this.root !== this) { | |
throw new Error('ReactWrapper::mount() can only be called on the root'); | |
} | |
this.single(function () { | |
_this3.component.setState({ mount: true }); | |
}); | |
return this; | |
} | |
return mount; | |
}() | |
/** | |
* A method that sets the props of the root component, and re-renders. Useful for when you are | |
* wanting to test how the component behaves over time with changing props. Calling this, for | |
* instance, will call the `componentWillReceiveProps` lifecycle method. | |
* | |
* Similar to `setState`, this method accepts a props object and will merge it in with the already | |
* existing props. | |
* | |
* NOTE: can only be called on a wrapper instance that is also the root instance. | |
* | |
* @param {Object} props object | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'setProps', | |
value: function () { | |
function setProps(props) { | |
if (this.root !== this) { | |
throw new Error('ReactWrapper::setProps() can only be called on the root'); | |
} | |
this.component.setChildProps(props); | |
return this; | |
} | |
return setProps; | |
}() | |
/** | |
* A method to invoke `setState` on the root component instance similar to how you might in the | |
* definition of the component, and re-renders. This method is useful for testing your component | |
* in hard to achieve states, however should be used sparingly. If possible, you should utilize | |
* your component's external API in order to get it into whatever state you want to test, in order | |
* to be as accurate of a test as possible. This is not always practical, however. | |
* | |
* NOTE: can only be called on a wrapper instance that is also the root instance. | |
* | |
* @param {Object} state to merge | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'setState', | |
value: function () { | |
function setState(state) { | |
if (this.root !== this) { | |
throw new Error('ReactWrapper::setState() can only be called on the root'); | |
} | |
this.instance().setState(state); | |
return this; | |
} | |
return setState; | |
}() | |
/** | |
* A method that sets the context of the root component, and re-renders. Useful for when you are | |
* wanting to test how the component behaves over time with changing contexts. | |
* | |
* NOTE: can only be called on a wrapper instance that is also the root instance. | |
* | |
* @param {Object} context object | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'setContext', | |
value: function () { | |
function setContext(context) { | |
if (this.root !== this) { | |
throw new Error('ReactWrapper::setContext() can only be called on the root'); | |
} | |
if (!this.options.context) { | |
throw new Error('ShallowWrapper::setContext() can only be called on a wrapper that was originally passed ' + 'a context option'); | |
} | |
this.component.setChildContext(context); | |
return this; | |
} | |
return setContext; | |
}() | |
/** | |
* Whether or not a given react element matches the current render tree. | |
* It will determine if the wrapper root node "looks like" the expected | |
* element by checking if all props of the expected element are present | |
* on the wrapper root node and equals to each other. | |
* | |
* Example: | |
* ``` | |
* // MyComponent outputs <div class="foo">Hello</div> | |
* const wrapper = mount(<MyComponent />); | |
* expect(wrapper.matchesElement(<div>Hello</div>)).to.equal(true); | |
* ``` | |
* | |
* @param {ReactElement} node | |
* @returns {Boolean} | |
*/ | |
}, { | |
key: 'matchesElement', | |
value: function () { | |
function matchesElement(node) { | |
var _this4 = this; | |
return this.single(function () { | |
return (0, _MountedTraversal.instEqual)(node, _this4.node, function (a, b) { | |
return a <= b; | |
}); | |
}); | |
} | |
return matchesElement; | |
}() | |
/** | |
* Whether or not a given react element exists in the mount render tree. | |
* | |
* Example: | |
* ``` | |
* const wrapper = mount(<MyComponent />); | |
* expect(wrapper.contains(<div className="foo bar" />)).to.equal(true); | |
* ``` | |
* | |
* @param {ReactElement|Array<ReactElement>} nodeOrNodes | |
* @returns {Boolean} | |
*/ | |
}, { | |
key: 'contains', | |
value: function () { | |
function contains(nodeOrNodes) { | |
var predicate = Array.isArray(nodeOrNodes) ? function (other) { | |
return (0, _Utils.containsChildrenSubArray)(_MountedTraversal.instEqual, other, nodeOrNodes); | |
} : function (other) { | |
return (0, _MountedTraversal.instEqual)(nodeOrNodes, other); | |
}; | |
return findWhereUnwrapped(this, predicate).length > 0; | |
} | |
return contains; | |
}() | |
/** | |
* Whether or not a given react element exists in the current render tree. | |
* It will determine if one of the wrappers element "looks like" the expected | |
* element by checking if all props of the expected element are present | |
* on the wrappers element and equals to each other. | |
* | |
* Example: | |
* ``` | |
* // MyComponent outputs <div><div class="foo">Hello</div></div> | |
* const wrapper = mount(<MyComponent />); | |
* expect(wrapper.containsMatchingElement(<div>Hello</div>)).to.equal(true); | |
* ``` | |
* | |
* @param {ReactElement} node | |
* @returns {Boolean} | |
*/ | |
}, { | |
key: 'containsMatchingElement', | |
value: function () { | |
function containsMatchingElement(node) { | |
var predicate = function () { | |
function predicate(other) { | |
return (0, _MountedTraversal.instEqual)(node, other, function (a, b) { | |
return a <= b; | |
}); | |
} | |
return predicate; | |
}(); | |
return findWhereUnwrapped(this, predicate).length > 0; | |
} | |
return containsMatchingElement; | |
}() | |
/** | |
* Whether or not all the given react elements exists in the current render tree. | |
* It will determine if one of the wrappers element "looks like" the expected | |
* element by checking if all props of the expected element are present | |
* on the wrappers element and equals to each other. | |
* | |
* Example: | |
* ``` | |
* const wrapper = mount(<MyComponent />); | |
* expect(wrapper.containsAllMatchingElements([ | |
* <div>Hello</div>, | |
* <div>Goodbye</div>, | |
* ])).to.equal(true); | |
* ``` | |
* | |
* @param {Array<ReactElement>} nodes | |
* @returns {Boolean} | |
*/ | |
}, { | |
key: 'containsAllMatchingElements', | |
value: function () { | |
function containsAllMatchingElements(nodes) { | |
var invertedEquals = function () { | |
function invertedEquals(n1, n2) { | |
return (0, _MountedTraversal.instEqual)(n2, n1, function (a, b) { | |
return a <= b; | |
}); | |
} | |
return invertedEquals; | |
}(); | |
var predicate = function () { | |
function predicate(other) { | |
return (0, _Utils.containsChildrenSubArray)(invertedEquals, other, nodes); | |
} | |
return predicate; | |
}(); | |
return findWhereUnwrapped(this, predicate).length > 0; | |
} | |
return containsAllMatchingElements; | |
}() | |
/** | |
* Whether or not one of the given react elements exists in the current render tree. | |
* It will determine if one of the wrappers element "looks like" the expected | |
* element by checking if all props of the expected element are present | |
* on the wrappers element and equals to each other. | |
* | |
* Example: | |
* ``` | |
* const wrapper = mount(<MyComponent />); | |
* expect(wrapper.containsAnyMatchingElements([ | |
* <div>Hello</div>, | |
* <div>Goodbye</div>, | |
* ])).to.equal(true); | |
* ``` | |
* | |
* @param {Array<ReactElement>} nodes | |
* @returns {Boolean} | |
*/ | |
}, { | |
key: 'containsAnyMatchingElements', | |
value: function () { | |
function containsAnyMatchingElements(nodes) { | |
if (!Array.isArray(nodes)) return false; | |
if (nodes.length <= 0) return false; | |
for (var i = 0; i < nodes.length; i++) { | |
if (this.containsMatchingElement(nodes[i])) { | |
return true; | |
} | |
} | |
return false; | |
} | |
return containsAnyMatchingElements; | |
}() | |
/** | |
* Finds every node in the render tree of the current wrapper that matches the provided selector. | |
* | |
* @param {String|Function} selector | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'find', | |
value: function () { | |
function find(selector) { | |
return this.complexSelector.find(selector, this); | |
} | |
return find; | |
}() | |
/** | |
* Returns whether or not current node matches a provided selector. | |
* | |
* NOTE: can only be called on a wrapper of a single node. | |
* | |
* @param {String|Function} selector | |
* @returns {boolean} | |
*/ | |
}, { | |
key: 'is', | |
value: function () { | |
function is(selector) { | |
var predicate = (0, _MountedTraversal.buildInstPredicate)(selector); | |
return this.single(function (n) { | |
return predicate(n); | |
}); | |
} | |
return is; | |
}() | |
/** | |
* Returns true if the component rendered nothing, i.e., null or false. | |
* | |
* @returns {boolean} | |
*/ | |
}, { | |
key: 'isEmptyRender', | |
value: function () { | |
function isEmptyRender() { | |
return this.single(function (n) { | |
// Stateful components and stateless function components have different internal structures, | |
// so we need to find the correct internal instance, and validate the rendered node type | |
// equals 2, which is the `ReactNodeTypes.EMPTY` value. | |
if (_version.REACT15) { | |
return (0, _MountedTraversal.internalInstanceOrComponent)(n)._renderedNodeType === 2; | |
} | |
return (0, _reactCompat.findDOMNode)(n) === null; | |
}); | |
} | |
return isEmptyRender; | |
}() | |
/** | |
* Returns a new wrapper instance with only the nodes of the current wrapper instance that match | |
* the provided predicate function. | |
* | |
* @param {Function} predicate | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'filterWhere', | |
value: function () { | |
function filterWhere(predicate) { | |
var _this5 = this; | |
return filterWhereUnwrapped(this, function (n) { | |
return predicate(_this5.wrap(n)); | |
}); | |
} | |
return filterWhere; | |
}() | |
/** | |
* Returns a new wrapper instance with only the nodes of the current wrapper instance that match | |
* the provided selector. | |
* | |
* @param {String|Function} selector | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'filter', | |
value: function () { | |
function filter(selector) { | |
var predicate = (0, _MountedTraversal.buildInstPredicate)(selector); | |
return filterWhereUnwrapped(this, predicate); | |
} | |
return filter; | |
}() | |
/** | |
* Returns a new wrapper instance with only the nodes of the current wrapper that did not match | |
* the provided selector. Essentially the inverse of `filter`. | |
* | |
* @param {String|Function} selector | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'not', | |
value: function () { | |
function not(selector) { | |
var predicate = (0, _MountedTraversal.buildInstPredicate)(selector); | |
return filterWhereUnwrapped(this, function (n) { | |
return !predicate(n); | |
}); | |
} | |
return not; | |
}() | |
/** | |
* Returns a string of the rendered text of the current render tree. This function should be | |
* looked at with skepticism if being used to test what the actual HTML output of the component | |
* will be. If that is what you would like to test, use enzyme's `render` function instead. | |
* | |
* NOTE: can only be called on a wrapper of a single node. | |
* | |
* @returns {String} | |
*/ | |
}, { | |
key: 'text', | |
value: function () { | |
function text() { | |
return this.single(function (n) { | |
return (0, _reactCompat.findDOMNode)(n).textContent; | |
}); | |
} | |
return text; | |
}() | |
/** | |
* Returns the HTML of the node. | |
* | |
* NOTE: can only be called on a wrapper of a single node. | |
* | |
* @returns {String} | |
*/ | |
}, { | |
key: 'html', | |
value: function () { | |
function html() { | |
return this.single(function (n) { | |
var node = (0, _reactCompat.findDOMNode)(n); | |
return node === null ? null : node.outerHTML.replace(/\sdata-(reactid|reactroot)+="([^"]*)+"/g, ''); | |
}); | |
} | |
return html; | |
}() | |
/** | |
* Returns the current node rendered to HTML and wrapped in a CheerioWrapper. | |
* | |
* NOTE: can only be called on a wrapper of a single node. | |
* | |
* @returns {CheerioWrapper} | |
*/ | |
}, { | |
key: 'render', | |
value: function () { | |
function render() { | |
var html = this.html(); | |
return html === null ? (0, _cheerio2['default'])() : _cheerio2['default'].load(html).root(); | |
} | |
return render; | |
}() | |
/** | |
* Used to simulate events. Pass an eventname and (optionally) event arguments. This method of | |
* testing events should be met with some skepticism. | |
* | |
* @param {String} event | |
* @param {Object} mock (optional) | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'simulate', | |
value: function () { | |
function simulate(event) { | |
var mock = arguments.length <= 1 || arguments[1] === undefined ? {} : arguments[1]; | |
this.single(function (n) { | |
var mappedEvent = (0, _Utils.mapNativeEventNames)(event); | |
var eventFn = _reactCompat.Simulate[mappedEvent]; | |
if (!eventFn) { | |
throw new TypeError('ReactWrapper::simulate() event \'' + String(event) + '\' does not exist'); | |
} | |
eventFn((0, _reactCompat.findDOMNode)(n), mock); | |
}); | |
return this; | |
} | |
return simulate; | |
}() | |
/** | |
* Returns the props hash for the root node of the wrapper. | |
* | |
* NOTE: can only be called on a wrapper of a single node. | |
* | |
* @returns {Object} | |
*/ | |
}, { | |
key: 'props', | |
value: function () { | |
function props() { | |
return this.single(_Utils.propsOfNode); | |
} | |
return props; | |
}() | |
/** | |
* Returns the state hash for the root node of the wrapper. Optionally pass in a prop name and it | |
* will return just that value. | |
* | |
* NOTE: can only be called on a wrapper of a single node. | |
* | |
* @param {String} name (optional) | |
* @returns {*} | |
*/ | |
}, { | |
key: 'state', | |
value: function () { | |
function state(name) { | |
var _this6 = this; | |
if (this.root !== this) { | |
throw new Error('ReactWrapper::state() can only be called on the root'); | |
} | |
var _state = this.single(function () { | |
return _this6.instance().state; | |
}); | |
if (name !== undefined) { | |
return _state[name]; | |
} | |
return _state; | |
} | |
return state; | |
}() | |
/** | |
* Returns the context hash for the root node of the wrapper. | |
* Optionally pass in a prop name and it will return just that value. | |
* | |
* NOTE: can only be called on a wrapper of a single node. | |
* | |
* @param {String} name (optional) | |
* @returns {*} | |
*/ | |
}, { | |
key: 'context', | |
value: function () { | |
function context(name) { | |
var _this7 = this; | |
if (this.root !== this) { | |
throw new Error('ReactWrapper::context() can only be called on the root'); | |
} | |
var _context = this.single(function () { | |
return _this7.instance().context; | |
}); | |
if (name !== undefined) { | |
return _context[name]; | |
} | |
return _context; | |
} | |
return context; | |
}() | |
/** | |
* Returns a new wrapper with all of the children of the current wrapper. | |
* | |
* @param {String|Function} [selector] | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'children', | |
value: function () { | |
function children(selector) { | |
var allChildren = this.flatMap(function (n) { | |
return (0, _MountedTraversal.childrenOfInst)(n.node); | |
}); | |
return selector ? allChildren.filter(selector) : allChildren; | |
} | |
return children; | |
}() | |
/** | |
* Returns a new wrapper with a specific child | |
* | |
* @param {Number} [index] | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'childAt', | |
value: function () { | |
function childAt(index) { | |
var _this8 = this; | |
return this.single(function () { | |
return _this8.children().at(index); | |
}); | |
} | |
return childAt; | |
}() | |
/** | |
* Returns a wrapper around all of the parents/ancestors of the wrapper. Does not include the node | |
* in the current wrapper. | |
* | |
* NOTE: can only be called on a wrapper of a single node. | |
* | |
* @param {String|Function} [selector] | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'parents', | |
value: function () { | |
function parents(selector) { | |
var _this9 = this; | |
var allParents = this.wrap(this.single(function (n) { | |
return (0, _MountedTraversal.parentsOfInst)(n, _this9.root.node); | |
})); | |
return selector ? allParents.filter(selector) : allParents; | |
} | |
return parents; | |
}() | |
/** | |
* Returns a wrapper around the immediate parent of the current node. | |
* | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'parent', | |
value: function () { | |
function parent() { | |
return this.flatMap(function (n) { | |
return [n.parents().get(0)]; | |
}); | |
} | |
return parent; | |
}() | |
/** | |
* | |
* @param {String|Function} selector | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'closest', | |
value: function () { | |
function closest(selector) { | |
return this.is(selector) ? this : this.parents().filter(selector).first(); | |
} | |
return closest; | |
}() | |
/** | |
* Returns the value of prop with the given name of the root node. | |
* | |
* @param {String} propName | |
* @returns {*} | |
*/ | |
}, { | |
key: 'prop', | |
value: function () { | |
function prop(propName) { | |
return this.props()[propName]; | |
} | |
return prop; | |
}() | |
/** | |
* Returns the key assigned to the current node. | |
* | |
* @returns {String} | |
*/ | |
}, { | |
key: 'key', | |
value: function () { | |
function key() { | |
return this.single(function (n) { | |
return (0, _MountedTraversal.getNode)(n).key; | |
}); | |
} | |
return key; | |
}() | |
/** | |
* Returns the type of the root node of this wrapper. If it's a composite component, this will be | |
* the component constructor. If it's native DOM node, it will be a string. | |
* | |
* @returns {String|Function} | |
*/ | |
}, { | |
key: 'type', | |
value: function () { | |
function type() { | |
return this.single(function (n) { | |
return (0, _Utils.typeOfNode)((0, _MountedTraversal.getNode)(n)); | |
}); | |
} | |
return type; | |
}() | |
/** | |
* Returns the name of the root node of this wrapper. | |
* | |
* In order of precedence => type.displayName -> type.name -> type. | |
* | |
* @returns {String} | |
*/ | |
}, { | |
key: 'name', | |
value: function () { | |
function name() { | |
return this.single(function (n) { | |
return (0, _Utils.displayNameOfNode)((0, _MountedTraversal.getNode)(n)); | |
}); | |
} | |
return name; | |
}() | |
/** | |
* Returns whether or not the current root node has the given class name or not. | |
* | |
* NOTE: can only be called on a wrapper of a single node. | |
* | |
* @param {String} className | |
* @returns {Boolean} | |
*/ | |
}, { | |
key: 'hasClass', | |
value: function () { | |
function hasClass(className) { | |
if (className && className.indexOf('.') !== -1) { | |
// eslint-disable-next-line no-console | |
console.warn('It looks like you\'re calling `ReactWrapper::hasClass()` with a CSS selector. ' + 'hasClass() expects a class name, not a CSS selector.'); | |
} | |
return this.single(function (n) { | |
return (0, _MountedTraversal.instHasClassName)(n, className); | |
}); | |
} | |
return hasClass; | |
}() | |
/** | |
* Iterates through each node of the current wrapper and executes the provided function with a | |
* wrapper around the corresponding node passed in as the first argument. | |
* | |
* @param {Function} fn | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'forEach', | |
value: function () { | |
function forEach(fn) { | |
var _this10 = this; | |
this.nodes.forEach(function (n, i) { | |
return fn.call(_this10, _this10.wrap(n), i); | |
}); | |
return this; | |
} | |
return forEach; | |
}() | |
/** | |
* Maps the current array of nodes to another array. Each node is passed in as a `ReactWrapper` | |
* to the map function. | |
* | |
* @param {Function} fn | |
* @returns {Array} | |
*/ | |
}, { | |
key: 'map', | |
value: function () { | |
function map(fn) { | |
var _this11 = this; | |
return this.nodes.map(function (n, i) { | |
return fn.call(_this11, _this11.wrap(n), i); | |
}); | |
} | |
return map; | |
}() | |
/** | |
* Reduces the current array of nodes to another array. | |
* Each node is passed in as a `ShallowWrapper` to the reducer function. | |
* | |
* @param {Function} fn - the reducer function | |
* @param {*} initialValue - the initial value | |
* @returns {*} | |
*/ | |
}, { | |
key: 'reduce', | |
value: function () { | |
function reduce(fn, initialValue) { | |
var _this12 = this; | |
return this.nodes.reduce(function (accum, n, i) { | |
return fn.call(_this12, accum, _this12.wrap(n), i); | |
}, initialValue); | |
} | |
return reduce; | |
}() | |
/** | |
* Reduces the current array of nodes to another array, from right to left. Each node is passed | |
* in as a `ShallowWrapper` to the reducer function. | |
* | |
* @param {Function} fn - the reducer function | |
* @param {*} initialValue - the initial value | |
* @returns {*} | |
*/ | |
}, { | |
key: 'reduceRight', | |
value: function () { | |
function reduceRight(fn, initialValue) { | |
var _this13 = this; | |
return this.nodes.reduceRight(function (accum, n, i) { | |
return fn.call(_this13, accum, _this13.wrap(n), i); | |
}, initialValue); | |
} | |
return reduceRight; | |
}() | |
/** | |
* Returns whether or not any of the nodes in the wrapper match the provided selector. | |
* | |
* @param {Function|String} selector | |
* @returns {Boolean} | |
*/ | |
}, { | |
key: 'some', | |
value: function () { | |
function some(selector) { | |
var predicate = (0, _MountedTraversal.buildInstPredicate)(selector); | |
return this.nodes.some(predicate); | |
} | |
return some; | |
}() | |
/** | |
* Returns whether or not any of the nodes in the wrapper pass the provided predicate function. | |
* | |
* @param {Function} predicate | |
* @returns {Boolean} | |
*/ | |
}, { | |
key: 'someWhere', | |
value: function () { | |
function someWhere(predicate) { | |
var _this14 = this; | |
return this.nodes.some(function (n, i) { | |
return predicate.call(_this14, _this14.wrap(n), i); | |
}); | |
} | |
return someWhere; | |
}() | |
/** | |
* Returns whether or not all of the nodes in the wrapper match the provided selector. | |
* | |
* @param {Function|String} selector | |
* @returns {Boolean} | |
*/ | |
}, { | |
key: 'every', | |
value: function () { | |
function every(selector) { | |
var predicate = (0, _MountedTraversal.buildInstPredicate)(selector); | |
return this.nodes.every(predicate); | |
} | |
return every; | |
}() | |
/** | |
* Returns whether or not any of the nodes in the wrapper pass the provided predicate function. | |
* | |
* @param {Function} predicate | |
* @returns {Boolean} | |
*/ | |
}, { | |
key: 'everyWhere', | |
value: function () { | |
function everyWhere(predicate) { | |
var _this15 = this; | |
return this.nodes.every(function (n, i) { | |
return predicate.call(_this15, _this15.wrap(n), i); | |
}); | |
} | |
return everyWhere; | |
}() | |
/** | |
* Utility method used to create new wrappers with a mapping function that returns an array of | |
* nodes in response to a single node wrapper. The returned wrapper is a single wrapper around | |
* all of the mapped nodes flattened (and de-duplicated). | |
* | |
* @param {Function} fn | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'flatMap', | |
value: function () { | |
function flatMap(fn) { | |
var _this16 = this; | |
var nodes = this.nodes.map(function (n, i) { | |
return fn.call(_this16, _this16.wrap(n), i); | |
}); | |
var flattened = (0, _flatten2['default'])(nodes, true); | |
var uniques = (0, _uniq2['default'])(flattened); | |
var compacted = (0, _compact2['default'])(uniques); | |
return this.wrap(compacted); | |
} | |
return flatMap; | |
}() | |
/** | |
* Finds all nodes in the current wrapper nodes' render trees that match the provided predicate | |
* function. | |
* | |
* @param {Function} predicate | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'findWhere', | |
value: function () { | |
function findWhere(predicate) { | |
var _this17 = this; | |
return findWhereUnwrapped(this, function (n) { | |
return predicate(_this17.wrap(n)); | |
}); | |
} | |
return findWhere; | |
}() | |
/** | |
* Returns the node at a given index of the current wrapper. | |
* | |
* @param {Number} index | |
* @returns {ReactElement} | |
*/ | |
}, { | |
key: 'get', | |
value: function () { | |
function get(index) { | |
return this.nodes[index]; | |
} | |
return get; | |
}() | |
/** | |
* Returns a wrapper around the node at a given index of the current wrapper. | |
* | |
* @param {Number} index | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'at', | |
value: function () { | |
function at(index) { | |
return this.wrap(this.nodes[index]); | |
} | |
return at; | |
}() | |
/** | |
* Returns a wrapper around the first node of the current wrapper. | |
* | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'first', | |
value: function () { | |
function first() { | |
return this.at(0); | |
} | |
return first; | |
}() | |
/** | |
* Returns a wrapper around the last node of the current wrapper. | |
* | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'last', | |
value: function () { | |
function last() { | |
return this.at(this.length - 1); | |
} | |
return last; | |
}() | |
/** | |
* Returns true if the current wrapper has no nodes. False otherwise. | |
* | |
* @returns {boolean} | |
*/ | |
}, { | |
key: 'isEmpty', | |
value: function () { | |
function isEmpty() { | |
return this.length === 0; | |
} | |
return isEmpty; | |
}() | |
/** | |
* Utility method that throws an error if the current instance has a length other than one. | |
* This is primarily used to enforce that certain methods are only run on a wrapper when it is | |
* wrapping a single node. | |
* | |
* @param {Function} fn | |
* @returns {*} | |
*/ | |
}, { | |
key: 'single', | |
value: function () { | |
function single(fn) { | |
if (this.length !== 1) { | |
throw new Error('This method is only meant to be run on single node. ' + String(this.length) + ' found instead.'); | |
} | |
return fn.call(this, this.node); | |
} | |
return single; | |
}() | |
/** | |
* Helpful utility method to create a new wrapper with the same root as the current wrapper, with | |
* any nodes passed in as the first parameter automatically wrapped. | |
* | |
* @param {ReactWrapper|ReactElement|Array<ReactElement>} node | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'wrap', | |
value: function () { | |
function wrap(node) { | |
if (node instanceof ReactWrapper) { | |
return node; | |
} | |
return new ReactWrapper(node, this.root); | |
} | |
return wrap; | |
}() | |
/** | |
* Returns an HTML-like string of the shallow render for debugging purposes. | |
* | |
* @returns {String} | |
*/ | |
}, { | |
key: 'debug', | |
value: function () { | |
function debug() { | |
return (0, _Debug.debugInsts)(this.nodes); | |
} | |
return debug; | |
}() | |
/** | |
* Invokes intercepter and returns itself. intercepter is called with itself. | |
* This is helpful when debugging nodes in method chains. | |
* @param fn | |
* @returns {ReactWrapper} | |
*/ | |
}, { | |
key: 'tap', | |
value: function () { | |
function tap(intercepter) { | |
intercepter(this); | |
return this; | |
} | |
return tap; | |
}() | |
/** | |
* Detaches the react tree from the DOM. Runs `ReactDOM.unmountComponentAtNode()` under the hood. | |
* | |
* This method will most commonly be used as a "cleanup" method if you decide to use the | |
* `attachTo` option in `mount(node, options)`. | |
* | |
* The method is intentionally not "fluent" (in that it doesn't return `this`) because you should | |
* not be doing anything with this wrapper after this method is called. | |
*/ | |
}, { | |
key: 'detach', | |
value: function () { | |
function detach() { | |
if (this.root !== this) { | |
throw new Error('ReactWrapper::detach() can only be called on the root'); | |
} | |
if (!this.options.attachTo) { | |
throw new Error('ReactWrapper::detach() can only be called on when the `attachTo` option was passed into ' + '`mount()`.'); | |
} | |
(0, _reactCompat.unmountComponentAtNode)(this.options.attachTo); | |
} | |
return detach; | |
}() | |
}]); | |
return ReactWrapper; | |
}(); | |
exports['default'] = ReactWrapper; | |
/* WEBPACK VAR INJECTION */}.call(exports, (function() { return this; }()))) | |
/***/ }, | |
/* 3 */ | |
/***/ function(module, exports, __webpack_require__) { | |
Object.defineProperty(exports, "__esModule", { | |
value: true | |
}); | |
var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); | |
var _split = __webpack_require__(4); | |
var _split2 = _interopRequireDefault(_split); | |
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; } | |
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } | |
var ComplexSelector = function () { | |
function ComplexSelector(buildPredicate, findWhereUnwrapped, childrenOfNode) { | |
_classCallCheck(this, ComplexSelector); | |
this.buildPredicate = buildPredicate; | |
this.findWhereUnwrapped = findWhereUnwrapped; | |
this.childrenOfNode = childrenOfNode; | |
} | |
_createClass(ComplexSelector, [{ | |
key: 'getSelectors', | |
value: function () { | |
function getSelectors(selector) { | |
var selectors = (0, _split2['default'])(selector, / (?=(?:(?:[^"]*"){2})*[^"]*$)/); | |
return selectors.reduce(function (list, sel) { | |
if (sel === '+' || sel === '~') { | |
var temp = list.pop(); | |
list.push(sel, temp); | |
return list; | |
} | |
list.push(sel); | |
return list; | |
}, []); | |
} | |
return getSelectors; | |
}() | |
}, { | |
key: 'handleSelectors', | |
value: function () { | |
function handleSelectors(selectors, wrapper) { | |
var _this = this; | |
var recurseSelector = function () { | |
function recurseSelector(offset, fn, pre) { | |
var predicate = pre || _this.buildPredicate(selectors[offset]); | |
var nextWrapper = _this.findWhereUnwrapped(wrapper, predicate, fn); | |
var nextSelectors = selectors.slice(offset + 1); | |
return _this.handleSelectors(nextSelectors, nextWrapper); | |
} | |
return recurseSelector; | |
}(); | |
var buildSiblingPredicate = function () { | |
function buildSiblingPredicate(first, second) { | |
var firstPredicate = _this.buildPredicate(first); | |
var secondPredicate = _this.buildPredicate(second); | |
return function (child) { | |
if (firstPredicate(child)) { | |
return function (sibling) { | |
return secondPredicate(sibling); | |
}; | |
} | |
return false; | |
}; | |
} | |
return buildSiblingPredicate; | |
}(); | |
var predicate = void 0; | |
var selectSiblings = void 0; | |
if (selectors.length) { | |
switch (selectors[0]) { | |
case '>': | |
return recurseSelector(1, this.treeFilterDirect()); | |
case '+': | |
predicate = buildSiblingPredicate(selectors[1], selectors[2]); | |
selectSiblings = function () { | |
function selectSiblings(children, pre, results, idx) { | |
var adjacent = children[idx + 1]; | |
if (pre(adjacent)) { | |
results.push(adjacent); | |
} | |
} | |
return selectSiblings; | |
}(); | |
return recurseSelector(2, this.treeFindSiblings(selectSiblings), predicate); | |
case '~': | |
predicate = buildSiblingPredicate(selectors[1], selectors[2]); | |
selectSiblings = function () { | |
function selectSiblings(children, pre, results, idx) { | |
return children.slice(idx + 1).map(function (child) { | |
return pre(child) ? results.push(child) : null; | |
}); | |
} | |
return selectSiblings; | |
}(); | |
return recurseSelector(2, this.treeFindSiblings(selectSiblings), predicate); | |
default: | |
return recurseSelector(0); | |
} | |
} | |
return wrapper; | |
} | |
return handleSelectors; | |
}() | |
}, { | |
key: 'find', | |
value: function () { | |
function find(selector, wrapper) { | |
if (typeof selector === 'string') { | |
var selectors = this.getSelectors(selector); | |
return this.handleSelectors(selectors, wrapper); | |
} | |
var predicate = this.buildPredicate(selector); | |
return this.findWhereUnwrapped(wrapper, predicate); | |
} | |
return find; | |
}() | |
}, { | |
key: 'treeFilterDirect', | |
value: function () { | |
function treeFilterDirect() { | |
var _this2 = this; | |
return function (tree, fn) { | |
var results = []; | |
_this2.childrenOfNode(tree).forEach(function (child) { | |
if (fn(child)) { | |
results.push(child); | |
} | |
}); | |
return results; | |
}; | |
} | |
return treeFilterDirect; | |
}() | |
}, { | |
key: 'treeFindSiblings', | |
value: function () { | |
function treeFindSiblings(selectSiblings) { | |
var _this3 = this; | |
return function (tree, fn) { | |
var results = []; | |
var list = [_this3.childrenOfNode(tree)]; | |
var traverseChildren = function () { | |
function traverseChildren(children) { | |
return children.forEach(function (child, i) { | |
var secondPredicate = fn(child); | |
list.push(_this3.childrenOfNode(child)); | |
if (secondPredicate) { | |
selectSiblings(children, secondPredicate, results, i); | |
} | |
}); | |
} | |
return traverseChildren; | |
}(); | |
while (list.length) { | |
traverseChildren(list.shift()); | |
} | |
return results; | |
}; | |
} | |
return treeFindSiblings; | |
}() | |
}]); | |
return ComplexSelector; | |
}(); | |
exports['default'] = ComplexSelector; | |
/***/ }, | |
/* 4 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var baseToString = __webpack_require__(5), | |
castSlice = __webpack_require__(11), | |
hasUnicode = __webpack_require__(13), | |
isIterateeCall = __webpack_require__(14), | |
isRegExp = __webpack_require__(21), | |
stringToArray = __webpack_require__(26), | |
toString = __webpack_require__(29); | |
/** Used as references for the maximum length and index of an array. */ | |
var MAX_ARRAY_LENGTH = 4294967295; | |
/** | |
* Splits `string` by `separator`. | |
* | |
* **Note:** This method is based on | |
* [`String#split`](https://mdn.io/String/split). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to split. | |
* @param {RegExp|string} separator The separator pattern to split by. | |
* @param {number} [limit] The length to truncate results to. | |
* @returns {Array} Returns the string segments. | |
* @example | |
* | |
* _.split('a-b-c', '-', 2); | |
* // => ['a', 'b'] | |
*/ | |
function split(string, separator, limit) { | |
if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) { | |
separator = limit = undefined; | |
} | |
limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0; | |
if (!limit) { | |
return []; | |
} | |
string = toString(string); | |
if (string && ( | |
typeof separator == 'string' || | |
(separator != null && !isRegExp(separator)) | |
)) { | |
separator = baseToString(separator); | |
if (!separator && hasUnicode(string)) { | |
return castSlice(stringToArray(string), 0, limit); | |
} | |
} | |
return string.split(separator, limit); | |
} | |
module.exports = split; | |
/***/ }, | |
/* 5 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var Symbol = __webpack_require__(6), | |
isSymbol = __webpack_require__(9); | |
/** Used as references for various `Number` constants. */ | |
var INFINITY = 1 / 0; | |
/** Used to convert symbols to primitives and strings. */ | |
var symbolProto = Symbol ? Symbol.prototype : undefined, | |
symbolToString = symbolProto ? symbolProto.toString : undefined; | |
/** | |
* The base implementation of `_.toString` which doesn't convert nullish | |
* values to empty strings. | |
* | |
* @private | |
* @param {*} value The value to process. | |
* @returns {string} Returns the string. | |
*/ | |
function baseToString(value) { | |
// Exit early for strings to avoid a performance hit in some environments. | |
if (typeof value == 'string') { | |
return value; | |
} | |
if (isSymbol(value)) { | |
return symbolToString ? symbolToString.call(value) : ''; | |
} | |
var result = (value + ''); | |
return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result; | |
} | |
module.exports = baseToString; | |
/***/ }, | |
/* 6 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var root = __webpack_require__(7); | |
/** Built-in value references. */ | |
var Symbol = root.Symbol; | |
module.exports = Symbol; | |
/***/ }, | |
/* 7 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var freeGlobal = __webpack_require__(8); | |
/** Detect free variable `self`. */ | |
var freeSelf = typeof self == 'object' && self && self.Object === Object && self; | |
/** Used as a reference to the global object. */ | |
var root = freeGlobal || freeSelf || Function('return this')(); | |
module.exports = root; | |
/***/ }, | |
/* 8 */ | |
/***/ function(module, exports) { | |
/* WEBPACK VAR INJECTION */(function(global) {/** Detect free variable `global` from Node.js. */ | |
var freeGlobal = typeof global == 'object' && global && global.Object === Object && global; | |
module.exports = freeGlobal; | |
/* WEBPACK VAR INJECTION */}.call(exports, (function() { return this; }()))) | |
/***/ }, | |
/* 9 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var isObjectLike = __webpack_require__(10); | |
/** `Object#toString` result references. */ | |
var symbolTag = '[object Symbol]'; | |
/** Used for built-in method references. */ | |
var objectProto = Object.prototype; | |
/** | |
* Used to resolve the | |
* [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring) | |
* of values. | |
*/ | |
var objectToString = objectProto.toString; | |
/** | |
* Checks if `value` is classified as a `Symbol` primitive or object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a symbol, else `false`. | |
* @example | |
* | |
* _.isSymbol(Symbol.iterator); | |
* // => true | |
* | |
* _.isSymbol('abc'); | |
* // => false | |
*/ | |
function isSymbol(value) { | |
return typeof value == 'symbol' || | |
(isObjectLike(value) && objectToString.call(value) == symbolTag); | |
} | |
module.exports = isSymbol; | |
/***/ }, | |
/* 10 */ | |
/***/ function(module, exports) { | |
/** | |
* Checks if `value` is object-like. A value is object-like if it's not `null` | |
* and has a `typeof` result of "object". | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is object-like, else `false`. | |
* @example | |
* | |
* _.isObjectLike({}); | |
* // => true | |
* | |
* _.isObjectLike([1, 2, 3]); | |
* // => true | |
* | |
* _.isObjectLike(_.noop); | |
* // => false | |
* | |
* _.isObjectLike(null); | |
* // => false | |
*/ | |
function isObjectLike(value) { | |
return !!value && typeof value == 'object'; | |
} | |
module.exports = isObjectLike; | |
/***/ }, | |
/* 11 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var baseSlice = __webpack_require__(12); | |
/** | |
* Casts `array` to a slice if it's needed. | |
* | |
* @private | |
* @param {Array} array The array to inspect. | |
* @param {number} start The start position. | |
* @param {number} [end=array.length] The end position. | |
* @returns {Array} Returns the cast slice. | |
*/ | |
function castSlice(array, start, end) { | |
var length = array.length; | |
end = end === undefined ? length : end; | |
return (!start && end >= length) ? array : baseSlice(array, start, end); | |
} | |
module.exports = castSlice; | |
/***/ }, | |
/* 12 */ | |
/***/ function(module, exports) { | |
/** | |
* 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; | |
if (start < 0) { | |
start = -start > length ? 0 : (length + start); | |
} | |
end = end > length ? length : end; | |
if (end < 0) { | |
end += length; | |
} | |
length = start > end ? 0 : ((end - start) >>> 0); | |
start >>>= 0; | |
var result = Array(length); | |
while (++index < length) { | |
result[index] = array[index + start]; | |
} | |
return result; | |
} | |
module.exports = baseSlice; | |
/***/ }, | |
/* 13 */ | |
/***/ function(module, exports) { | |
/** Used to compose unicode character classes. */ | |
var rsAstralRange = '\\ud800-\\udfff', | |
rsComboMarksRange = '\\u0300-\\u036f\\ufe20-\\ufe23', | |
rsComboSymbolsRange = '\\u20d0-\\u20f0', | |
rsVarRange = '\\ufe0e\\ufe0f'; | |
/** Used to compose unicode capture groups. */ | |
var rsZWJ = '\\u200d'; | |
/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */ | |
var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboMarksRange + rsComboSymbolsRange + rsVarRange + ']'); | |
/** | |
* Checks if `string` contains Unicode symbols. | |
* | |
* @private | |
* @param {string} string The string to inspect. | |
* @returns {boolean} Returns `true` if a symbol is found, else `false`. | |
*/ | |
function hasUnicode(string) { | |
return reHasUnicode.test(string); | |
} | |
module.exports = hasUnicode; | |
/***/ }, | |
/* 14 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var eq = __webpack_require__(15), | |
isArrayLike = __webpack_require__(16), | |
isIndex = __webpack_require__(20), | |
isObject = __webpack_require__(18); | |
/** | |
* Checks if the given 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' | |
? (isArrayLike(object) && isIndex(index, object.length)) | |
: (type == 'string' && index in object) | |
) { | |
return eq(object[index], value); | |
} | |
return false; | |
} | |
module.exports = isIterateeCall; | |
/***/ }, | |
/* 15 */ | |
/***/ function(module, exports) { | |
/** | |
* Performs a | |
* [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) | |
* comparison between two values to determine if they are equivalent. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @returns {boolean} Returns `true` if the values are equivalent, else `false`. | |
* @example | |
* | |
* var object = { 'a': 1 }; | |
* var other = { 'a': 1 }; | |
* | |
* _.eq(object, object); | |
* // => true | |
* | |
* _.eq(object, other); | |
* // => false | |
* | |
* _.eq('a', 'a'); | |
* // => true | |
* | |
* _.eq('a', Object('a')); | |
* // => false | |
* | |
* _.eq(NaN, NaN); | |
* // => true | |
*/ | |
function eq(value, other) { | |
return value === other || (value !== value && other !== other); | |
} | |
module.exports = eq; | |
/***/ }, | |
/* 16 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var isFunction = __webpack_require__(17), | |
isLength = __webpack_require__(19); | |
/** | |
* Checks if `value` is array-like. A value is considered array-like if it's | |
* not a function and has a `value.length` that's an integer greater than or | |
* equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is array-like, else `false`. | |
* @example | |
* | |
* _.isArrayLike([1, 2, 3]); | |
* // => true | |
* | |
* _.isArrayLike(document.body.children); | |
* // => true | |
* | |
* _.isArrayLike('abc'); | |
* // => true | |
* | |
* _.isArrayLike(_.noop); | |
* // => false | |
*/ | |
function isArrayLike(value) { | |
return value != null && isLength(value.length) && !isFunction(value); | |
} | |
module.exports = isArrayLike; | |
/***/ }, | |
/* 17 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var isObject = __webpack_require__(18); | |
/** `Object#toString` result references. */ | |
var funcTag = '[object Function]', | |
genTag = '[object GeneratorFunction]'; | |
/** Used for built-in method references. */ | |
var objectProto = Object.prototype; | |
/** | |
* Used to resolve the | |
* [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring) | |
* of values. | |
*/ | |
var objectToString = objectProto.toString; | |
/** | |
* Checks if `value` is classified as a `Function` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a function, else `false`. | |
* @example | |
* | |
* _.isFunction(_); | |
* // => true | |
* | |
* _.isFunction(/abc/); | |
* // => false | |
*/ | |
function isFunction(value) { | |
// The use of `Object#toString` avoids issues with the `typeof` operator | |
// in Safari 8-9 which returns 'object' for typed array and other constructors. | |
var tag = isObject(value) ? objectToString.call(value) : ''; | |
return tag == funcTag || tag == genTag; | |
} | |
module.exports = isFunction; | |
/***/ }, | |
/* 18 */ | |
/***/ function(module, exports) { | |
/** | |
* Checks if `value` is the | |
* [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types) | |
* of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`) | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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(_.noop); | |
* // => true | |
* | |
* _.isObject(null); | |
* // => false | |
*/ | |
function isObject(value) { | |
var type = typeof value; | |
return !!value && (type == 'object' || type == 'function'); | |
} | |
module.exports = isObject; | |
/***/ }, | |
/* 19 */ | |
/***/ function(module, exports) { | |
/** Used as references for various `Number` constants. */ | |
var MAX_SAFE_INTEGER = 9007199254740991; | |
/** | |
* Checks if `value` is a valid array-like length. | |
* | |
* **Note:** This method is loosely based on | |
* [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a valid length, else `false`. | |
* @example | |
* | |
* _.isLength(3); | |
* // => true | |
* | |
* _.isLength(Number.MIN_VALUE); | |
* // => false | |
* | |
* _.isLength(Infinity); | |
* // => false | |
* | |
* _.isLength('3'); | |
* // => false | |
*/ | |
function isLength(value) { | |
return typeof value == 'number' && | |
value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER; | |
} | |
module.exports = isLength; | |
/***/ }, | |
/* 20 */ | |
/***/ function(module, exports) { | |
/** Used as references for various `Number` constants. */ | |
var MAX_SAFE_INTEGER = 9007199254740991; | |
/** Used to detect unsigned integer values. */ | |
var reIsUint = /^(?:0|[1-9]\d*)$/; | |
/** | |
* 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) { | |
length = length == null ? MAX_SAFE_INTEGER : length; | |
return !!length && | |
(typeof value == 'number' || reIsUint.test(value)) && | |
(value > -1 && value % 1 == 0 && value < length); | |
} | |
module.exports = isIndex; | |
/***/ }, | |
/* 21 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var baseIsRegExp = __webpack_require__(22), | |
baseUnary = __webpack_require__(23), | |
nodeUtil = __webpack_require__(24); | |
/* Node.js helper references. */ | |
var nodeIsRegExp = nodeUtil && nodeUtil.isRegExp; | |
/** | |
* Checks if `value` is classified as a `RegExp` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a regexp, else `false`. | |
* @example | |
* | |
* _.isRegExp(/abc/); | |
* // => true | |
* | |
* _.isRegExp('/abc/'); | |
* // => false | |
*/ | |
var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp; | |
module.exports = isRegExp; | |
/***/ }, | |
/* 22 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var isObject = __webpack_require__(18); | |
/** `Object#toString` result references. */ | |
var regexpTag = '[object RegExp]'; | |
/** Used for built-in method references. */ | |
var objectProto = Object.prototype; | |
/** | |
* Used to resolve the | |
* [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring) | |
* of values. | |
*/ | |
var objectToString = objectProto.toString; | |
/** | |
* The base implementation of `_.isRegExp` without Node.js optimizations. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a regexp, else `false`. | |
*/ | |
function baseIsRegExp(value) { | |
return isObject(value) && objectToString.call(value) == regexpTag; | |
} | |
module.exports = baseIsRegExp; | |
/***/ }, | |
/* 23 */ | |
/***/ function(module, exports) { | |
/** | |
* The base implementation of `_.unary` without support for storing metadata. | |
* | |
* @private | |
* @param {Function} func The function to cap arguments for. | |
* @returns {Function} Returns the new capped function. | |
*/ | |
function baseUnary(func) { | |
return function(value) { | |
return func(value); | |
}; | |
} | |
module.exports = baseUnary; | |
/***/ }, | |
/* 24 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* WEBPACK VAR INJECTION */(function(module) {var freeGlobal = __webpack_require__(8); | |
/** Detect free variable `exports`. */ | |
var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports; | |
/** Detect free variable `module`. */ | |
var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module; | |
/** Detect the popular CommonJS extension `module.exports`. */ | |
var moduleExports = freeModule && freeModule.exports === freeExports; | |
/** Detect free variable `process` from Node.js. */ | |
var freeProcess = moduleExports && freeGlobal.process; | |
/** Used to access faster Node.js helpers. */ | |
var nodeUtil = (function() { | |
try { | |
return freeProcess && freeProcess.binding('util'); | |
} catch (e) {} | |
}()); | |
module.exports = nodeUtil; | |
/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(25)(module))) | |
/***/ }, | |
/* 25 */ | |
/***/ function(module, exports) { | |
module.exports = function(module) { | |
if(!module.webpackPolyfill) { | |
module.deprecate = function() {}; | |
module.paths = []; | |
// module.parent = undefined by default | |
module.children = []; | |
module.webpackPolyfill = 1; | |
} | |
return module; | |
} | |
/***/ }, | |
/* 26 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var asciiToArray = __webpack_require__(27), | |
hasUnicode = __webpack_require__(13), | |
unicodeToArray = __webpack_require__(28); | |
/** | |
* Converts `string` to an array. | |
* | |
* @private | |
* @param {string} string The string to convert. | |
* @returns {Array} Returns the converted array. | |
*/ | |
function stringToArray(string) { | |
return hasUnicode(string) | |
? unicodeToArray(string) | |
: asciiToArray(string); | |
} | |
module.exports = stringToArray; | |
/***/ }, | |
/* 27 */ | |
/***/ function(module, exports) { | |
/** | |
* Converts an ASCII `string` to an array. | |
* | |
* @private | |
* @param {string} string The string to convert. | |
* @returns {Array} Returns the converted array. | |
*/ | |
function asciiToArray(string) { | |
return string.split(''); | |
} | |
module.exports = asciiToArray; | |
/***/ }, | |
/* 28 */ | |
/***/ function(module, exports) { | |
/** Used to compose unicode character classes. */ | |
var rsAstralRange = '\\ud800-\\udfff', | |
rsComboMarksRange = '\\u0300-\\u036f\\ufe20-\\ufe23', | |
rsComboSymbolsRange = '\\u20d0-\\u20f0', | |
rsVarRange = '\\ufe0e\\ufe0f'; | |
/** Used to compose unicode capture groups. */ | |
var rsAstral = '[' + rsAstralRange + ']', | |
rsCombo = '[' + rsComboMarksRange + rsComboSymbolsRange + ']', | |
rsFitz = '\\ud83c[\\udffb-\\udfff]', | |
rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')', | |
rsNonAstral = '[^' + rsAstralRange + ']', | |
rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}', | |
rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]', | |
rsZWJ = '\\u200d'; | |
/** Used to compose unicode regexes. */ | |
var reOptMod = rsModifier + '?', | |
rsOptVar = '[' + rsVarRange + ']?', | |
rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*', | |
rsSeq = rsOptVar + reOptMod + rsOptJoin, | |
rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')'; | |
/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */ | |
var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g'); | |
/** | |
* Converts a Unicode `string` to an array. | |
* | |
* @private | |
* @param {string} string The string to convert. | |
* @returns {Array} Returns the converted array. | |
*/ | |
function unicodeToArray(string) { | |
return string.match(reUnicode) || []; | |
} | |
module.exports = unicodeToArray; | |
/***/ }, | |
/* 29 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var baseToString = __webpack_require__(5); | |
/** | |
* Converts `value` to a string. An empty string is returned for `null` | |
* and `undefined` values. The sign of `-0` is preserved. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to process. | |
* @returns {string} Returns the string. | |
* @example | |
* | |
* _.toString(null); | |
* // => '' | |
* | |
* _.toString(-0); | |
* // => '-0' | |
* | |
* _.toString([1, 2, 3]); | |
* // => '1,2,3' | |
*/ | |
function toString(value) { | |
return value == null ? '' : baseToString(value); | |
} | |
module.exports = toString; | |
/***/ }, | |
/* 30 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/** | |
* Export cheerio (with ) | |
*/ | |
exports = module.exports = __webpack_require__(31); | |
/* | |
Export the version | |
*/ | |
exports.version = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"./package\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())).version; | |
/***/ }, | |
/* 31 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* | |
Module dependencies | |
*/ | |
var parse = __webpack_require__(32), | |
isHtml = __webpack_require__(94).isHtml, | |
_ = __webpack_require__(95); | |
/* | |
* The API | |
*/ | |
var api = [ | |
__webpack_require__(96), | |
__webpack_require__(110), | |
__webpack_require__(111), | |
__webpack_require__(112), | |
__webpack_require__(113) | |
]; | |
/* | |
* Instance of cheerio | |
*/ | |
var Cheerio = module.exports = function(selector, context, root, options) { | |
if (!(this instanceof Cheerio)) return new Cheerio(selector, context, root, options); | |
this.options = _.defaults(options || {}, this.options); | |
// $(), $(null), $(undefined), $(false) | |
if (!selector) return this; | |
if (root) { | |
if (typeof root === 'string') root = parse(root, this.options); | |
this._root = Cheerio.call(this, root); | |
} | |
// $($) | |
if (selector.cheerio) return selector; | |
// $(dom) | |
if (isNode(selector)) | |
selector = [selector]; | |
// $([dom]) | |
if (Array.isArray(selector)) { | |
_.forEach(selector, _.bind(function(elem, idx) { | |
this[idx] = elem; | |
}, this)); | |
this.length = selector.length; | |
return this; | |
} | |
// $(<html>) | |
if (typeof selector === 'string' && isHtml(selector)) { | |
return Cheerio.call(this, parse(selector, this.options).children); | |
} | |
// If we don't have a context, maybe we have a root, from loading | |
if (!context) { | |
context = this._root; | |
} else if (typeof context === 'string') { | |
if (isHtml(context)) { | |
// $('li', '<ul>...</ul>') | |
context = parse(context, this.options); | |
context = Cheerio.call(this, context); | |
} else { | |
// $('li', 'ul') | |
selector = [context, selector].join(' '); | |
context = this._root; | |
} | |
// $('li', node), $('li', [nodes]) | |
} else if (!context.cheerio) { | |
context = Cheerio.call(this, context); | |
} | |
// If we still don't have a context, return | |
if (!context) return this; | |
// #id, .class, tag | |
return context.find(selector); | |
}; | |
/** | |
* Mix in `static` | |
*/ | |
_.extend(Cheerio, __webpack_require__(97)); | |
/* | |
* Set a signature of the object | |
*/ | |
Cheerio.prototype.cheerio = '[cheerio object]'; | |
/* | |
* Cheerio default options | |
*/ | |
Cheerio.prototype.options = { | |
withDomLvl1: true, | |
normalizeWhitespace: false, | |
xmlMode: false, | |
decodeEntities: true | |
}; | |
/* | |
* Make cheerio an array-like object | |
*/ | |
Cheerio.prototype.length = 0; | |
Cheerio.prototype.splice = Array.prototype.splice; | |
/* | |
* Make a cheerio object | |
* | |
* @api private | |
*/ | |
Cheerio.prototype._make = function(dom, context) { | |
var cheerio = new this.constructor(dom, context, this._root, this.options); | |
cheerio.prevObject = this; | |
return cheerio; | |
}; | |
/** | |
* Turn a cheerio object into an array | |
*/ | |
Cheerio.prototype.toArray = function() { | |
return this.get(); | |
}; | |
/** | |
* Plug in the API | |
*/ | |
api.forEach(function(mod) { | |
_.extend(Cheerio.prototype, mod); | |
}); | |
var isNode = function(obj) { | |
return obj.name || obj.type === 'text' || obj.type === 'comment'; | |
}; | |
/***/ }, | |
/* 32 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* WEBPACK VAR INJECTION */(function(Buffer) {/* | |
Module Dependencies | |
*/ | |
var htmlparser = __webpack_require__(37); | |
/* | |
Parser | |
*/ | |
exports = module.exports = function(content, options) { | |
var dom = exports.evaluate(content, options), | |
// Generic root element | |
root = exports.evaluate('<root></root>', options)[0]; | |
root.type = 'root'; | |
// Update the dom using the root | |
exports.update(dom, root); | |
return root; | |
}; | |
exports.evaluate = function(content, options) { | |
// options = options || $.fn.options; | |
var dom; | |
if (typeof content === 'string' || Buffer.isBuffer(content)) { | |
dom = htmlparser.parseDOM(content, options); | |
} else { | |
dom = content; | |
} | |
return dom; | |
}; | |
/* | |
Update the dom structure, for one changed layer | |
*/ | |
exports.update = function(arr, parent) { | |
// normalize | |
if (!Array.isArray(arr)) arr = [arr]; | |
// Update parent | |
if (parent) { | |
parent.children = arr; | |
} else { | |
parent = null; | |
} | |
// Update neighbors | |
for (var i = 0; i < arr.length; i++) { | |
var node = arr[i]; | |
// Cleanly remove existing nodes from their previous structures. | |
var oldParent = node.parent || node.root, | |
oldSiblings = oldParent && oldParent.children; | |
if (oldSiblings && oldSiblings !== arr) { | |
oldSiblings.splice(oldSiblings.indexOf(node), 1); | |
if (node.prev) { | |
node.prev.next = node.next; | |
} | |
if (node.next) { | |
node.next.prev = node.prev; | |
} | |
} | |
if (parent) { | |
node.prev = arr[i - 1] || null; | |
node.next = arr[i + 1] || null; | |
} else { | |
node.prev = node.next = null; | |
} | |
if (parent && parent.type === 'root') { | |
node.root = parent; | |
node.parent = null; | |
} else { | |
node.root = null; | |
node.parent = parent; | |
} | |
} | |
return parent; | |
}; | |
// module.exports = $.extend(exports); | |
/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(33).Buffer)) | |
/***/ }, | |
/* 33 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* WEBPACK VAR INJECTION */(function(Buffer, global) {/*! | |
* The buffer module from node.js, for the browser. | |
* | |
* @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org> | |
* @license MIT | |
*/ | |
/* eslint-disable no-proto */ | |
'use strict' | |
var base64 = __webpack_require__(34) | |
var ieee754 = __webpack_require__(35) | |
var isArray = __webpack_require__(36) | |
exports.Buffer = Buffer | |
exports.SlowBuffer = SlowBuffer | |
exports.INSPECT_MAX_BYTES = 50 | |
Buffer.poolSize = 8192 // not used by this implementation | |
var rootParent = {} | |
/** | |
* If `Buffer.TYPED_ARRAY_SUPPORT`: | |
* === true Use Uint8Array implementation (fastest) | |
* === false Use Object implementation (most compatible, even IE6) | |
* | |
* Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+, | |
* Opera 11.6+, iOS 4.2+. | |
* | |
* Due to various browser bugs, sometimes the Object implementation will be used even | |
* when the browser supports typed arrays. | |
* | |
* Note: | |
* | |
* - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances, | |
* See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438. | |
* | |
* - Safari 5-7 lacks support for changing the `Object.prototype.constructor` property | |
* on objects. | |
* | |
* - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function. | |
* | |
* - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of | |
* incorrect length in some situations. | |
* We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they | |
* get the Object implementation, which is slower but behaves correctly. | |
*/ | |
Buffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined | |
? global.TYPED_ARRAY_SUPPORT | |
: typedArraySupport() | |
function typedArraySupport () { | |
function Bar () {} | |
try { | |
var arr = new Uint8Array(1) | |
arr.foo = function () { return 42 } | |
arr.constructor = Bar | |
return arr.foo() === 42 && // typed array instances can be augmented | |
arr.constructor === Bar && // constructor can be set | |
typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray` | |
arr.subarray(1, 1).byteLength === 0 // ie10 has broken `subarray` | |
} catch (e) { | |
return false | |
} | |
} | |
function kMaxLength () { | |
return Buffer.TYPED_ARRAY_SUPPORT | |
? 0x7fffffff | |
: 0x3fffffff | |
} | |
/** | |
* Class: Buffer | |
* ============= | |
* | |
* The Buffer constructor returns instances of `Uint8Array` that are augmented | |
* with function properties for all the node `Buffer` API functions. We use | |
* `Uint8Array` so that square bracket notation works as expected -- it returns | |
* a single octet. | |
* | |
* By augmenting the instances, we can avoid modifying the `Uint8Array` | |
* prototype. | |
*/ | |
function Buffer (arg) { | |
if (!(this instanceof Buffer)) { | |
// Avoid going through an ArgumentsAdaptorTrampoline in the common case. | |
if (arguments.length > 1) return new Buffer(arg, arguments[1]) | |
return new Buffer(arg) | |
} | |
if (!Buffer.TYPED_ARRAY_SUPPORT) { | |
this.length = 0 | |
this.parent = undefined | |
} | |
// Common case. | |
if (typeof arg === 'number') { | |
return fromNumber(this, arg) | |
} | |
// Slightly less common case. | |
if (typeof arg === 'string') { | |
return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8') | |
} | |
// Unusual. | |
return fromObject(this, arg) | |
} | |
function fromNumber (that, length) { | |
that = allocate(that, length < 0 ? 0 : checked(length) | 0) | |
if (!Buffer.TYPED_ARRAY_SUPPORT) { | |
for (var i = 0; i < length; i++) { | |
that[i] = 0 | |
} | |
} | |
return that | |
} | |
function fromString (that, string, encoding) { | |
if (typeof encoding !== 'string' || encoding === '') encoding = 'utf8' | |
// Assumption: byteLength() return value is always < kMaxLength. | |
var length = byteLength(string, encoding) | 0 | |
that = allocate(that, length) | |
that.write(string, encoding) | |
return that | |
} | |
function fromObject (that, object) { | |
if (Buffer.isBuffer(object)) return fromBuffer(that, object) | |
if (isArray(object)) return fromArray(that, object) | |
if (object == null) { | |
throw new TypeError('must start with number, buffer, array or string') | |
} | |
if (typeof ArrayBuffer !== 'undefined') { | |
if (object.buffer instanceof ArrayBuffer) { | |
return fromTypedArray(that, object) | |
} | |
if (object instanceof ArrayBuffer) { | |
return fromArrayBuffer(that, object) | |
} | |
} | |
if (object.length) return fromArrayLike(that, object) | |
return fromJsonObject(that, object) | |
} | |
function fromBuffer (that, buffer) { | |
var length = checked(buffer.length) | 0 | |
that = allocate(that, length) | |
buffer.copy(that, 0, 0, length) | |
return that | |
} | |
function fromArray (that, array) { | |
var length = checked(array.length) | 0 | |
that = allocate(that, length) | |
for (var i = 0; i < length; i += 1) { | |
that[i] = array[i] & 255 | |
} | |
return that | |
} | |
// Duplicate of fromArray() to keep fromArray() monomorphic. | |
function fromTypedArray (that, array) { | |
var length = checked(array.length) | 0 | |
that = allocate(that, length) | |
// Truncating the elements is probably not what people expect from typed | |
// arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior | |
// of the old Buffer constructor. | |
for (var i = 0; i < length; i += 1) { | |
that[i] = array[i] & 255 | |
} | |
return that | |
} | |
function fromArrayBuffer (that, array) { | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
// Return an augmented `Uint8Array` instance, for best performance | |
array.byteLength | |
that = Buffer._augment(new Uint8Array(array)) | |
} else { | |
// Fallback: Return an object instance of the Buffer class | |
that = fromTypedArray(that, new Uint8Array(array)) | |
} | |
return that | |
} | |
function fromArrayLike (that, array) { | |
var length = checked(array.length) | 0 | |
that = allocate(that, length) | |
for (var i = 0; i < length; i += 1) { | |
that[i] = array[i] & 255 | |
} | |
return that | |
} | |
// Deserialize { type: 'Buffer', data: [1,2,3,...] } into a Buffer object. | |
// Returns a zero-length buffer for inputs that don't conform to the spec. | |
function fromJsonObject (that, object) { | |
var array | |
var length = 0 | |
if (object.type === 'Buffer' && isArray(object.data)) { | |
array = object.data | |
length = checked(array.length) | 0 | |
} | |
that = allocate(that, length) | |
for (var i = 0; i < length; i += 1) { | |
that[i] = array[i] & 255 | |
} | |
return that | |
} | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
Buffer.prototype.__proto__ = Uint8Array.prototype | |
Buffer.__proto__ = Uint8Array | |
} else { | |
// pre-set for values that may exist in the future | |
Buffer.prototype.length = undefined | |
Buffer.prototype.parent = undefined | |
} | |
function allocate (that, length) { | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
// Return an augmented `Uint8Array` instance, for best performance | |
that = Buffer._augment(new Uint8Array(length)) | |
that.__proto__ = Buffer.prototype | |
} else { | |
// Fallback: Return an object instance of the Buffer class | |
that.length = length | |
that._isBuffer = true | |
} | |
var fromPool = length !== 0 && length <= Buffer.poolSize >>> 1 | |
if (fromPool) that.parent = rootParent | |
return that | |
} | |
function checked (length) { | |
// Note: cannot use `length < kMaxLength` here because that fails when | |
// length is NaN (which is otherwise coerced to zero.) | |
if (length >= kMaxLength()) { | |
throw new RangeError('Attempt to allocate Buffer larger than maximum ' + | |
'size: 0x' + kMaxLength().toString(16) + ' bytes') | |
} | |
return length | 0 | |
} | |
function SlowBuffer (subject, encoding) { | |
if (!(this instanceof SlowBuffer)) return new SlowBuffer(subject, encoding) | |
var buf = new Buffer(subject, encoding) | |
delete buf.parent | |
return buf | |
} | |
Buffer.isBuffer = function isBuffer (b) { | |
return !!(b != null && b._isBuffer) | |
} | |
Buffer.compare = function compare (a, b) { | |
if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) { | |
throw new TypeError('Arguments must be Buffers') | |
} | |
if (a === b) return 0 | |
var x = a.length | |
var y = b.length | |
var i = 0 | |
var len = Math.min(x, y) | |
while (i < len) { | |
if (a[i] !== b[i]) break | |
++i | |
} | |
if (i !== len) { | |
x = a[i] | |
y = b[i] | |
} | |
if (x < y) return -1 | |
if (y < x) return 1 | |
return 0 | |
} | |
Buffer.isEncoding = function isEncoding (encoding) { | |
switch (String(encoding).toLowerCase()) { | |
case 'hex': | |
case 'utf8': | |
case 'utf-8': | |
case 'ascii': | |
case 'binary': | |
case 'base64': | |
case 'raw': | |
case 'ucs2': | |
case 'ucs-2': | |
case 'utf16le': | |
case 'utf-16le': | |
return true | |
default: | |
return false | |
} | |
} | |
Buffer.concat = function concat (list, length) { | |
if (!isArray(list)) throw new TypeError('list argument must be an Array of Buffers.') | |
if (list.length === 0) { | |
return new Buffer(0) | |
} | |
var i | |
if (length === undefined) { | |
length = 0 | |
for (i = 0; i < list.length; i++) { | |
length += list[i].length | |
} | |
} | |
var buf = new Buffer(length) | |
var pos = 0 | |
for (i = 0; i < list.length; i++) { | |
var item = list[i] | |
item.copy(buf, pos) | |
pos += item.length | |
} | |
return buf | |
} | |
function byteLength (string, encoding) { | |
if (typeof string !== 'string') string = '' + string | |
var len = string.length | |
if (len === 0) return 0 | |
// Use a for loop to avoid recursion | |
var loweredCase = false | |
for (;;) { | |
switch (encoding) { | |
case 'ascii': | |
case 'binary': | |
// Deprecated | |
case 'raw': | |
case 'raws': | |
return len | |
case 'utf8': | |
case 'utf-8': | |
return utf8ToBytes(string).length | |
case 'ucs2': | |
case 'ucs-2': | |
case 'utf16le': | |
case 'utf-16le': | |
return len * 2 | |
case 'hex': | |
return len >>> 1 | |
case 'base64': | |
return base64ToBytes(string).length | |
default: | |
if (loweredCase) return utf8ToBytes(string).length // assume utf8 | |
encoding = ('' + encoding).toLowerCase() | |
loweredCase = true | |
} | |
} | |
} | |
Buffer.byteLength = byteLength | |
function slowToString (encoding, start, end) { | |
var loweredCase = false | |
start = start | 0 | |
end = end === undefined || end === Infinity ? this.length : end | 0 | |
if (!encoding) encoding = 'utf8' | |
if (start < 0) start = 0 | |
if (end > this.length) end = this.length | |
if (end <= start) return '' | |
while (true) { | |
switch (encoding) { | |
case 'hex': | |
return hexSlice(this, start, end) | |
case 'utf8': | |
case 'utf-8': | |
return utf8Slice(this, start, end) | |
case 'ascii': | |
return asciiSlice(this, start, end) | |
case 'binary': | |
return binarySlice(this, start, end) | |
case 'base64': | |
return base64Slice(this, start, end) | |
case 'ucs2': | |
case 'ucs-2': | |
case 'utf16le': | |
case 'utf-16le': | |
return utf16leSlice(this, start, end) | |
default: | |
if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding) | |
encoding = (encoding + '').toLowerCase() | |
loweredCase = true | |
} | |
} | |
} | |
Buffer.prototype.toString = function toString () { | |
var length = this.length | 0 | |
if (length === 0) return '' | |
if (arguments.length === 0) return utf8Slice(this, 0, length) | |
return slowToString.apply(this, arguments) | |
} | |
Buffer.prototype.equals = function equals (b) { | |
if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer') | |
if (this === b) return true | |
return Buffer.compare(this, b) === 0 | |
} | |
Buffer.prototype.inspect = function inspect () { | |
var str = '' | |
var max = exports.INSPECT_MAX_BYTES | |
if (this.length > 0) { | |
str = this.toString('hex', 0, max).match(/.{2}/g).join(' ') | |
if (this.length > max) str += ' ... ' | |
} | |
return '<Buffer ' + str + '>' | |
} | |
Buffer.prototype.compare = function compare (b) { | |
if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer') | |
if (this === b) return 0 | |
return Buffer.compare(this, b) | |
} | |
Buffer.prototype.indexOf = function indexOf (val, byteOffset) { | |
if (byteOffset > 0x7fffffff) byteOffset = 0x7fffffff | |
else if (byteOffset < -0x80000000) byteOffset = -0x80000000 | |
byteOffset >>= 0 | |
if (this.length === 0) return -1 | |
if (byteOffset >= this.length) return -1 | |
// Negative offsets start from the end of the buffer | |
if (byteOffset < 0) byteOffset = Math.max(this.length + byteOffset, 0) | |
if (typeof val === 'string') { | |
if (val.length === 0) return -1 // special case: looking for empty string always fails | |
return String.prototype.indexOf.call(this, val, byteOffset) | |
} | |
if (Buffer.isBuffer(val)) { | |
return arrayIndexOf(this, val, byteOffset) | |
} | |
if (typeof val === 'number') { | |
if (Buffer.TYPED_ARRAY_SUPPORT && Uint8Array.prototype.indexOf === 'function') { | |
return Uint8Array.prototype.indexOf.call(this, val, byteOffset) | |
} | |
return arrayIndexOf(this, [ val ], byteOffset) | |
} | |
function arrayIndexOf (arr, val, byteOffset) { | |
var foundIndex = -1 | |
for (var i = 0; byteOffset + i < arr.length; i++) { | |
if (arr[byteOffset + i] === val[foundIndex === -1 ? 0 : i - foundIndex]) { | |
if (foundIndex === -1) foundIndex = i | |
if (i - foundIndex + 1 === val.length) return byteOffset + foundIndex | |
} else { | |
foundIndex = -1 | |
} | |
} | |
return -1 | |
} | |
throw new TypeError('val must be string, number or Buffer') | |
} | |
// `get` is deprecated | |
Buffer.prototype.get = function get (offset) { | |
console.log('.get() is deprecated. Access using array indexes instead.') | |
return this.readUInt8(offset) | |
} | |
// `set` is deprecated | |
Buffer.prototype.set = function set (v, offset) { | |
console.log('.set() is deprecated. Access using array indexes instead.') | |
return this.writeUInt8(v, offset) | |
} | |
function hexWrite (buf, string, offset, length) { | |
offset = Number(offset) || 0 | |
var remaining = buf.length - offset | |
if (!length) { | |
length = remaining | |
} else { | |
length = Number(length) | |
if (length > remaining) { | |
length = remaining | |
} | |
} | |
// must be an even number of digits | |
var strLen = string.length | |
if (strLen % 2 !== 0) throw new Error('Invalid hex string') | |
if (length > strLen / 2) { | |
length = strLen / 2 | |
} | |
for (var i = 0; i < length; i++) { | |
var parsed = parseInt(string.substr(i * 2, 2), 16) | |
if (isNaN(parsed)) throw new Error('Invalid hex string') | |
buf[offset + i] = parsed | |
} | |
return i | |
} | |
function utf8Write (buf, string, offset, length) { | |
return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length) | |
} | |
function asciiWrite (buf, string, offset, length) { | |
return blitBuffer(asciiToBytes(string), buf, offset, length) | |
} | |
function binaryWrite (buf, string, offset, length) { | |
return asciiWrite(buf, string, offset, length) | |
} | |
function base64Write (buf, string, offset, length) { | |
return blitBuffer(base64ToBytes(string), buf, offset, length) | |
} | |
function ucs2Write (buf, string, offset, length) { | |
return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length) | |
} | |
Buffer.prototype.write = function write (string, offset, length, encoding) { | |
// Buffer#write(string) | |
if (offset === undefined) { | |
encoding = 'utf8' | |
length = this.length | |
offset = 0 | |
// Buffer#write(string, encoding) | |
} else if (length === undefined && typeof offset === 'string') { | |
encoding = offset | |
length = this.length | |
offset = 0 | |
// Buffer#write(string, offset[, length][, encoding]) | |
} else if (isFinite(offset)) { | |
offset = offset | 0 | |
if (isFinite(length)) { | |
length = length | 0 | |
if (encoding === undefined) encoding = 'utf8' | |
} else { | |
encoding = length | |
length = undefined | |
} | |
// legacy write(string, encoding, offset, length) - remove in v0.13 | |
} else { | |
var swap = encoding | |
encoding = offset | |
offset = length | 0 | |
length = swap | |
} | |
var remaining = this.length - offset | |
if (length === undefined || length > remaining) length = remaining | |
if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) { | |
throw new RangeError('attempt to write outside buffer bounds') | |
} | |
if (!encoding) encoding = 'utf8' | |
var loweredCase = false | |
for (;;) { | |
switch (encoding) { | |
case 'hex': | |
return hexWrite(this, string, offset, length) | |
case 'utf8': | |
case 'utf-8': | |
return utf8Write(this, string, offset, length) | |
case 'ascii': | |
return asciiWrite(this, string, offset, length) | |
case 'binary': | |
return binaryWrite(this, string, offset, length) | |
case 'base64': | |
// Warning: maxLength not taken into account in base64Write | |
return base64Write(this, string, offset, length) | |
case 'ucs2': | |
case 'ucs-2': | |
case 'utf16le': | |
case 'utf-16le': | |
return ucs2Write(this, string, offset, length) | |
default: | |
if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding) | |
encoding = ('' + encoding).toLowerCase() | |
loweredCase = true | |
} | |
} | |
} | |
Buffer.prototype.toJSON = function toJSON () { | |
return { | |
type: 'Buffer', | |
data: Array.prototype.slice.call(this._arr || this, 0) | |
} | |
} | |
function base64Slice (buf, start, end) { | |
if (start === 0 && end === buf.length) { | |
return base64.fromByteArray(buf) | |
} else { | |
return base64.fromByteArray(buf.slice(start, end)) | |
} | |
} | |
function utf8Slice (buf, start, end) { | |
end = Math.min(buf.length, end) | |
var res = [] | |
var i = start | |
while (i < end) { | |
var firstByte = buf[i] | |
var codePoint = null | |
var bytesPerSequence = (firstByte > 0xEF) ? 4 | |
: (firstByte > 0xDF) ? 3 | |
: (firstByte > 0xBF) ? 2 | |
: 1 | |
if (i + bytesPerSequence <= end) { | |
var secondByte, thirdByte, fourthByte, tempCodePoint | |
switch (bytesPerSequence) { | |
case 1: | |
if (firstByte < 0x80) { | |
codePoint = firstByte | |
} | |
break | |
case 2: | |
secondByte = buf[i + 1] | |
if ((secondByte & 0xC0) === 0x80) { | |
tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F) | |
if (tempCodePoint > 0x7F) { | |
codePoint = tempCodePoint | |
} | |
} | |
break | |
case 3: | |
secondByte = buf[i + 1] | |
thirdByte = buf[i + 2] | |
if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) { | |
tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F) | |
if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) { | |
codePoint = tempCodePoint | |
} | |
} | |
break | |
case 4: | |
secondByte = buf[i + 1] | |
thirdByte = buf[i + 2] | |
fourthByte = buf[i + 3] | |
if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) { | |
tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F) | |
if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) { | |
codePoint = tempCodePoint | |
} | |
} | |
} | |
} | |
if (codePoint === null) { | |
// we did not generate a valid codePoint so insert a | |
// replacement char (U+FFFD) and advance only 1 byte | |
codePoint = 0xFFFD | |
bytesPerSequence = 1 | |
} else if (codePoint > 0xFFFF) { | |
// encode to utf16 (surrogate pair dance) | |
codePoint -= 0x10000 | |
res.push(codePoint >>> 10 & 0x3FF | 0xD800) | |
codePoint = 0xDC00 | codePoint & 0x3FF | |
} | |
res.push(codePoint) | |
i += bytesPerSequence | |
} | |
return decodeCodePointsArray(res) | |
} | |
// Based on http://stackoverflow.com/a/22747272/680742, the browser with | |
// the lowest limit is Chrome, with 0x10000 args. | |
// We go 1 magnitude less, for safety | |
var MAX_ARGUMENTS_LENGTH = 0x1000 | |
function decodeCodePointsArray (codePoints) { | |
var len = codePoints.length | |
if (len <= MAX_ARGUMENTS_LENGTH) { | |
return String.fromCharCode.apply(String, codePoints) // avoid extra slice() | |
} | |
// Decode in chunks to avoid "call stack size exceeded". | |
var res = '' | |
var i = 0 | |
while (i < len) { | |
res += String.fromCharCode.apply( | |
String, | |
codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH) | |
) | |
} | |
return res | |
} | |
function asciiSlice (buf, start, end) { | |
var ret = '' | |
end = Math.min(buf.length, end) | |
for (var i = start; i < end; i++) { | |
ret += String.fromCharCode(buf[i] & 0x7F) | |
} | |
return ret | |
} | |
function binarySlice (buf, start, end) { | |
var ret = '' | |
end = Math.min(buf.length, end) | |
for (var i = start; i < end; i++) { | |
ret += String.fromCharCode(buf[i]) | |
} | |
return ret | |
} | |
function hexSlice (buf, start, end) { | |
var len = buf.length | |
if (!start || start < 0) start = 0 | |
if (!end || end < 0 || end > len) end = len | |
var out = '' | |
for (var i = start; i < end; i++) { | |
out += toHex(buf[i]) | |
} | |
return out | |
} | |
function utf16leSlice (buf, start, end) { | |
var bytes = buf.slice(start, end) | |
var res = '' | |
for (var i = 0; i < bytes.length; i += 2) { | |
res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256) | |
} | |
return res | |
} | |
Buffer.prototype.slice = function slice (start, end) { | |
var len = this.length | |
start = ~~start | |
end = end === undefined ? len : ~~end | |
if (start < 0) { | |
start += len | |
if (start < 0) start = 0 | |
} else if (start > len) { | |
start = len | |
} | |
if (end < 0) { | |
end += len | |
if (end < 0) end = 0 | |
} else if (end > len) { | |
end = len | |
} | |
if (end < start) end = start | |
var newBuf | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
newBuf = Buffer._augment(this.subarray(start, end)) | |
} else { | |
var sliceLen = end - start | |
newBuf = new Buffer(sliceLen, undefined) | |
for (var i = 0; i < sliceLen; i++) { | |
newBuf[i] = this[i + start] | |
} | |
} | |
if (newBuf.length) newBuf.parent = this.parent || this | |
return newBuf | |
} | |
/* | |
* Need to make sure that buffer isn't trying to write out of bounds. | |
*/ | |
function checkOffset (offset, ext, length) { | |
if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint') | |
if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length') | |
} | |
Buffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) { | |
offset = offset | 0 | |
byteLength = byteLength | 0 | |
if (!noAssert) checkOffset(offset, byteLength, this.length) | |
var val = this[offset] | |
var mul = 1 | |
var i = 0 | |
while (++i < byteLength && (mul *= 0x100)) { | |
val += this[offset + i] * mul | |
} | |
return val | |
} | |
Buffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) { | |
offset = offset | 0 | |
byteLength = byteLength | 0 | |
if (!noAssert) { | |
checkOffset(offset, byteLength, this.length) | |
} | |
var val = this[offset + --byteLength] | |
var mul = 1 | |
while (byteLength > 0 && (mul *= 0x100)) { | |
val += this[offset + --byteLength] * mul | |
} | |
return val | |
} | |
Buffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 1, this.length) | |
return this[offset] | |
} | |
Buffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 2, this.length) | |
return this[offset] | (this[offset + 1] << 8) | |
} | |
Buffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 2, this.length) | |
return (this[offset] << 8) | this[offset + 1] | |
} | |
Buffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 4, this.length) | |
return ((this[offset]) | | |
(this[offset + 1] << 8) | | |
(this[offset + 2] << 16)) + | |
(this[offset + 3] * 0x1000000) | |
} | |
Buffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 4, this.length) | |
return (this[offset] * 0x1000000) + | |
((this[offset + 1] << 16) | | |
(this[offset + 2] << 8) | | |
this[offset + 3]) | |
} | |
Buffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) { | |
offset = offset | 0 | |
byteLength = byteLength | 0 | |
if (!noAssert) checkOffset(offset, byteLength, this.length) | |
var val = this[offset] | |
var mul = 1 | |
var i = 0 | |
while (++i < byteLength && (mul *= 0x100)) { | |
val += this[offset + i] * mul | |
} | |
mul *= 0x80 | |
if (val >= mul) val -= Math.pow(2, 8 * byteLength) | |
return val | |
} | |
Buffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) { | |
offset = offset | 0 | |
byteLength = byteLength | 0 | |
if (!noAssert) checkOffset(offset, byteLength, this.length) | |
var i = byteLength | |
var mul = 1 | |
var val = this[offset + --i] | |
while (i > 0 && (mul *= 0x100)) { | |
val += this[offset + --i] * mul | |
} | |
mul *= 0x80 | |
if (val >= mul) val -= Math.pow(2, 8 * byteLength) | |
return val | |
} | |
Buffer.prototype.readInt8 = function readInt8 (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 1, this.length) | |
if (!(this[offset] & 0x80)) return (this[offset]) | |
return ((0xff - this[offset] + 1) * -1) | |
} | |
Buffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 2, this.length) | |
var val = this[offset] | (this[offset + 1] << 8) | |
return (val & 0x8000) ? val | 0xFFFF0000 : val | |
} | |
Buffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 2, this.length) | |
var val = this[offset + 1] | (this[offset] << 8) | |
return (val & 0x8000) ? val | 0xFFFF0000 : val | |
} | |
Buffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 4, this.length) | |
return (this[offset]) | | |
(this[offset + 1] << 8) | | |
(this[offset + 2] << 16) | | |
(this[offset + 3] << 24) | |
} | |
Buffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 4, this.length) | |
return (this[offset] << 24) | | |
(this[offset + 1] << 16) | | |
(this[offset + 2] << 8) | | |
(this[offset + 3]) | |
} | |
Buffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 4, this.length) | |
return ieee754.read(this, offset, true, 23, 4) | |
} | |
Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 4, this.length) | |
return ieee754.read(this, offset, false, 23, 4) | |
} | |
Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 8, this.length) | |
return ieee754.read(this, offset, true, 52, 8) | |
} | |
Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 8, this.length) | |
return ieee754.read(this, offset, false, 52, 8) | |
} | |
function checkInt (buf, value, offset, ext, max, min) { | |
if (!Buffer.isBuffer(buf)) throw new TypeError('buffer must be a Buffer instance') | |
if (value > max || value < min) throw new RangeError('value is out of bounds') | |
if (offset + ext > buf.length) throw new RangeError('index out of range') | |
} | |
Buffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) { | |
value = +value | |
offset = offset | 0 | |
byteLength = byteLength | 0 | |
if (!noAssert) checkInt(this, value, offset, byteLength, Math.pow(2, 8 * byteLength), 0) | |
var mul = 1 | |
var i = 0 | |
this[offset] = value & 0xFF | |
while (++i < byteLength && (mul *= 0x100)) { | |
this[offset + i] = (value / mul) & 0xFF | |
} | |
return offset + byteLength | |
} | |
Buffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) { | |
value = +value | |
offset = offset | 0 | |
byteLength = byteLength | 0 | |
if (!noAssert) checkInt(this, value, offset, byteLength, Math.pow(2, 8 * byteLength), 0) | |
var i = byteLength - 1 | |
var mul = 1 | |
this[offset + i] = value & 0xFF | |
while (--i >= 0 && (mul *= 0x100)) { | |
this[offset + i] = (value / mul) & 0xFF | |
} | |
return offset + byteLength | |
} | |
Buffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0) | |
if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value) | |
this[offset] = (value & 0xff) | |
return offset + 1 | |
} | |
function objectWriteUInt16 (buf, value, offset, littleEndian) { | |
if (value < 0) value = 0xffff + value + 1 | |
for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; i++) { | |
buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>> | |
(littleEndian ? i : 1 - i) * 8 | |
} | |
} | |
Buffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0) | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
this[offset] = (value & 0xff) | |
this[offset + 1] = (value >>> 8) | |
} else { | |
objectWriteUInt16(this, value, offset, true) | |
} | |
return offset + 2 | |
} | |
Buffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0) | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
this[offset] = (value >>> 8) | |
this[offset + 1] = (value & 0xff) | |
} else { | |
objectWriteUInt16(this, value, offset, false) | |
} | |
return offset + 2 | |
} | |
function objectWriteUInt32 (buf, value, offset, littleEndian) { | |
if (value < 0) value = 0xffffffff + value + 1 | |
for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; i++) { | |
buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff | |
} | |
} | |
Buffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0) | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
this[offset + 3] = (value >>> 24) | |
this[offset + 2] = (value >>> 16) | |
this[offset + 1] = (value >>> 8) | |
this[offset] = (value & 0xff) | |
} else { | |
objectWriteUInt32(this, value, offset, true) | |
} | |
return offset + 4 | |
} | |
Buffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0) | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
this[offset] = (value >>> 24) | |
this[offset + 1] = (value >>> 16) | |
this[offset + 2] = (value >>> 8) | |
this[offset + 3] = (value & 0xff) | |
} else { | |
objectWriteUInt32(this, value, offset, false) | |
} | |
return offset + 4 | |
} | |
Buffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) { | |
var limit = Math.pow(2, 8 * byteLength - 1) | |
checkInt(this, value, offset, byteLength, limit - 1, -limit) | |
} | |
var i = 0 | |
var mul = 1 | |
var sub = value < 0 ? 1 : 0 | |
this[offset] = value & 0xFF | |
while (++i < byteLength && (mul *= 0x100)) { | |
this[offset + i] = ((value / mul) >> 0) - sub & 0xFF | |
} | |
return offset + byteLength | |
} | |
Buffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) { | |
var limit = Math.pow(2, 8 * byteLength - 1) | |
checkInt(this, value, offset, byteLength, limit - 1, -limit) | |
} | |
var i = byteLength - 1 | |
var mul = 1 | |
var sub = value < 0 ? 1 : 0 | |
this[offset + i] = value & 0xFF | |
while (--i >= 0 && (mul *= 0x100)) { | |
this[offset + i] = ((value / mul) >> 0) - sub & 0xFF | |
} | |
return offset + byteLength | |
} | |
Buffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80) | |
if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value) | |
if (value < 0) value = 0xff + value + 1 | |
this[offset] = (value & 0xff) | |
return offset + 1 | |
} | |
Buffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000) | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
this[offset] = (value & 0xff) | |
this[offset + 1] = (value >>> 8) | |
} else { | |
objectWriteUInt16(this, value, offset, true) | |
} | |
return offset + 2 | |
} | |
Buffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000) | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
this[offset] = (value >>> 8) | |
this[offset + 1] = (value & 0xff) | |
} else { | |
objectWriteUInt16(this, value, offset, false) | |
} | |
return offset + 2 | |
} | |
Buffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000) | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
this[offset] = (value & 0xff) | |
this[offset + 1] = (value >>> 8) | |
this[offset + 2] = (value >>> 16) | |
this[offset + 3] = (value >>> 24) | |
} else { | |
objectWriteUInt32(this, value, offset, true) | |
} | |
return offset + 4 | |
} | |
Buffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000) | |
if (value < 0) value = 0xffffffff + value + 1 | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
this[offset] = (value >>> 24) | |
this[offset + 1] = (value >>> 16) | |
this[offset + 2] = (value >>> 8) | |
this[offset + 3] = (value & 0xff) | |
} else { | |
objectWriteUInt32(this, value, offset, false) | |
} | |
return offset + 4 | |
} | |
function checkIEEE754 (buf, value, offset, ext, max, min) { | |
if (value > max || value < min) throw new RangeError('value is out of bounds') | |
if (offset + ext > buf.length) throw new RangeError('index out of range') | |
if (offset < 0) throw new RangeError('index out of range') | |
} | |
function writeFloat (buf, value, offset, littleEndian, noAssert) { | |
if (!noAssert) { | |
checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38) | |
} | |
ieee754.write(buf, value, offset, littleEndian, 23, 4) | |
return offset + 4 | |
} | |
Buffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) { | |
return writeFloat(this, value, offset, true, noAssert) | |
} | |
Buffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) { | |
return writeFloat(this, value, offset, false, noAssert) | |
} | |
function writeDouble (buf, value, offset, littleEndian, noAssert) { | |
if (!noAssert) { | |
checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308) | |
} | |
ieee754.write(buf, value, offset, littleEndian, 52, 8) | |
return offset + 8 | |
} | |
Buffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) { | |
return writeDouble(this, value, offset, true, noAssert) | |
} | |
Buffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) { | |
return writeDouble(this, value, offset, false, noAssert) | |
} | |
// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length) | |
Buffer.prototype.copy = function copy (target, targetStart, start, end) { | |
if (!start) start = 0 | |
if (!end && end !== 0) end = this.length | |
if (targetStart >= target.length) targetStart = target.length | |
if (!targetStart) targetStart = 0 | |
if (end > 0 && end < start) end = start | |
// Copy 0 bytes; we're done | |
if (end === start) return 0 | |
if (target.length === 0 || this.length === 0) return 0 | |
// Fatal error conditions | |
if (targetStart < 0) { | |
throw new RangeError('targetStart out of bounds') | |
} | |
if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds') | |
if (end < 0) throw new RangeError('sourceEnd out of bounds') | |
// Are we oob? | |
if (end > this.length) end = this.length | |
if (target.length - targetStart < end - start) { | |
end = target.length - targetStart + start | |
} | |
var len = end - start | |
var i | |
if (this === target && start < targetStart && targetStart < end) { | |
// descending copy from end | |
for (i = len - 1; i >= 0; i--) { | |
target[i + targetStart] = this[i + start] | |
} | |
} else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) { | |
// ascending copy from start | |
for (i = 0; i < len; i++) { | |
target[i + targetStart] = this[i + start] | |
} | |
} else { | |
target._set(this.subarray(start, start + len), targetStart) | |
} | |
return len | |
} | |
// fill(value, start=0, end=buffer.length) | |
Buffer.prototype.fill = function fill (value, start, end) { | |
if (!value) value = 0 | |
if (!start) start = 0 | |
if (!end) end = this.length | |
if (end < start) throw new RangeError('end < start') | |
// Fill 0 bytes; we're done | |
if (end === start) return | |
if (this.length === 0) return | |
if (start < 0 || start >= this.length) throw new RangeError('start out of bounds') | |
if (end < 0 || end > this.length) throw new RangeError('end out of bounds') | |
var i | |
if (typeof value === 'number') { | |
for (i = start; i < end; i++) { | |
this[i] = value | |
} | |
} else { | |
var bytes = utf8ToBytes(value.toString()) | |
var len = bytes.length | |
for (i = start; i < end; i++) { | |
this[i] = bytes[i % len] | |
} | |
} | |
return this | |
} | |
/** | |
* Creates a new `ArrayBuffer` with the *copied* memory of the buffer instance. | |
* Added in Node 0.12. Only available in browsers that support ArrayBuffer. | |
*/ | |
Buffer.prototype.toArrayBuffer = function toArrayBuffer () { | |
if (typeof Uint8Array !== 'undefined') { | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
return (new Buffer(this)).buffer | |
} else { | |
var buf = new Uint8Array(this.length) | |
for (var i = 0, len = buf.length; i < len; i += 1) { | |
buf[i] = this[i] | |
} | |
return buf.buffer | |
} | |
} else { | |
throw new TypeError('Buffer.toArrayBuffer not supported in this browser') | |
} | |
} | |
// HELPER FUNCTIONS | |
// ================ | |
var BP = Buffer.prototype | |
/** | |
* Augment a Uint8Array *instance* (not the Uint8Array class!) with Buffer methods | |
*/ | |
Buffer._augment = function _augment (arr) { | |
arr.constructor = Buffer | |
arr._isBuffer = true | |
// save reference to original Uint8Array set method before overwriting | |
arr._set = arr.set | |
// deprecated | |
arr.get = BP.get | |
arr.set = BP.set | |
arr.write = BP.write | |
arr.toString = BP.toString | |
arr.toLocaleString = BP.toString | |
arr.toJSON = BP.toJSON | |
arr.equals = BP.equals | |
arr.compare = BP.compare | |
arr.indexOf = BP.indexOf | |
arr.copy = BP.copy | |
arr.slice = BP.slice | |
arr.readUIntLE = BP.readUIntLE | |
arr.readUIntBE = BP.readUIntBE | |
arr.readUInt8 = BP.readUInt8 | |
arr.readUInt16LE = BP.readUInt16LE | |
arr.readUInt16BE = BP.readUInt16BE | |
arr.readUInt32LE = BP.readUInt32LE | |
arr.readUInt32BE = BP.readUInt32BE | |
arr.readIntLE = BP.readIntLE | |
arr.readIntBE = BP.readIntBE | |
arr.readInt8 = BP.readInt8 | |
arr.readInt16LE = BP.readInt16LE | |
arr.readInt16BE = BP.readInt16BE | |
arr.readInt32LE = BP.readInt32LE | |
arr.readInt32BE = BP.readInt32BE | |
arr.readFloatLE = BP.readFloatLE | |
arr.readFloatBE = BP.readFloatBE | |
arr.readDoubleLE = BP.readDoubleLE | |
arr.readDoubleBE = BP.readDoubleBE | |
arr.writeUInt8 = BP.writeUInt8 | |
arr.writeUIntLE = BP.writeUIntLE | |
arr.writeUIntBE = BP.writeUIntBE | |
arr.writeUInt16LE = BP.writeUInt16LE | |
arr.writeUInt16BE = BP.writeUInt16BE | |
arr.writeUInt32LE = BP.writeUInt32LE | |
arr.writeUInt32BE = BP.writeUInt32BE | |
arr.writeIntLE = BP.writeIntLE | |
arr.writeIntBE = BP.writeIntBE | |
arr.writeInt8 = BP.writeInt8 | |
arr.writeInt16LE = BP.writeInt16LE | |
arr.writeInt16BE = BP.writeInt16BE | |
arr.writeInt32LE = BP.writeInt32LE | |
arr.writeInt32BE = BP.writeInt32BE | |
arr.writeFloatLE = BP.writeFloatLE | |
arr.writeFloatBE = BP.writeFloatBE | |
arr.writeDoubleLE = BP.writeDoubleLE | |
arr.writeDoubleBE = BP.writeDoubleBE | |
arr.fill = BP.fill | |
arr.inspect = BP.inspect | |
arr.toArrayBuffer = BP.toArrayBuffer | |
return arr | |
} | |
var INVALID_BASE64_RE = /[^+\/0-9A-Za-z-_]/g | |
function base64clean (str) { | |
// Node strips out invalid characters like \n and \t from the string, base64-js does not | |
str = stringtrim(str).replace(INVALID_BASE64_RE, '') | |
// Node converts strings with length < 2 to '' | |
if (str.length < 2) return '' | |
// Node allows for non-padded base64 strings (missing trailing ===), base64-js does not | |
while (str.length % 4 !== 0) { | |
str = str + '=' | |
} | |
return str | |
} | |
function stringtrim (str) { | |
if (str.trim) return str.trim() | |
return str.replace(/^\s+|\s+$/g, '') | |
} | |
function toHex (n) { | |
if (n < 16) return '0' + n.toString(16) | |
return n.toString(16) | |
} | |
function utf8ToBytes (string, units) { | |
units = units || Infinity | |
var codePoint | |
var length = string.length | |
var leadSurrogate = null | |
var bytes = [] | |
for (var i = 0; i < length; i++) { | |
codePoint = string.charCodeAt(i) | |
// is surrogate component | |
if (codePoint > 0xD7FF && codePoint < 0xE000) { | |
// last char was a lead | |
if (!leadSurrogate) { | |
// no lead yet | |
if (codePoint > 0xDBFF) { | |
// unexpected trail | |
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) | |
continue | |
} else if (i + 1 === length) { | |
// unpaired lead | |
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) | |
continue | |
} | |
// valid lead | |
leadSurrogate = codePoint | |
continue | |
} | |
// 2 leads in a row | |
if (codePoint < 0xDC00) { | |
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) | |
leadSurrogate = codePoint | |
continue | |
} | |
// valid surrogate pair | |
codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000 | |
} else if (leadSurrogate) { | |
// valid bmp char, but last char was a lead | |
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) | |
} | |
leadSurrogate = null | |
// encode utf8 | |
if (codePoint < 0x80) { | |
if ((units -= 1) < 0) break | |
bytes.push(codePoint) | |
} else if (codePoint < 0x800) { | |
if ((units -= 2) < 0) break | |
bytes.push( | |
codePoint >> 0x6 | 0xC0, | |
codePoint & 0x3F | 0x80 | |
) | |
} else if (codePoint < 0x10000) { | |
if ((units -= 3) < 0) break | |
bytes.push( | |
codePoint >> 0xC | 0xE0, | |
codePoint >> 0x6 & 0x3F | 0x80, | |
codePoint & 0x3F | 0x80 | |
) | |
} else if (codePoint < 0x110000) { | |
if ((units -= 4) < 0) break | |
bytes.push( | |
codePoint >> 0x12 | 0xF0, | |
codePoint >> 0xC & 0x3F | 0x80, | |
codePoint >> 0x6 & 0x3F | 0x80, | |
codePoint & 0x3F | 0x80 | |
) | |
} else { | |
throw new Error('Invalid code point') | |
} | |
} | |
return bytes | |
} | |
function asciiToBytes (str) { | |
var byteArray = [] | |
for (var i = 0; i < str.length; i++) { | |
// Node's code seems to be doing this and not & 0x7F.. | |
byteArray.push(str.charCodeAt(i) & 0xFF) | |
} | |
return byteArray | |
} | |
function utf16leToBytes (str, units) { | |
var c, hi, lo | |
var byteArray = [] | |
for (var i = 0; i < str.length; i++) { | |
if ((units -= 2) < 0) break | |
c = str.charCodeAt(i) | |
hi = c >> 8 | |
lo = c % 256 | |
byteArray.push(lo) | |
byteArray.push(hi) | |
} | |
return byteArray | |
} | |
function base64ToBytes (str) { | |
return base64.toByteArray(base64clean(str)) | |
} | |
function blitBuffer (src, dst, offset, length) { | |
for (var i = 0; i < length; i++) { | |
if ((i + offset >= dst.length) || (i >= src.length)) break | |
dst[i + offset] = src[i] | |
} | |
return i | |
} | |
/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(33).Buffer, (function() { return this; }()))) | |
/***/ }, | |
/* 34 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var lookup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'; | |
;(function (exports) { | |
'use strict'; | |
var Arr = (typeof Uint8Array !== 'undefined') | |
? Uint8Array | |
: Array | |
var PLUS = '+'.charCodeAt(0) | |
var SLASH = '/'.charCodeAt(0) | |
var NUMBER = '0'.charCodeAt(0) | |
var LOWER = 'a'.charCodeAt(0) | |
var UPPER = 'A'.charCodeAt(0) | |
var PLUS_URL_SAFE = '-'.charCodeAt(0) | |
var SLASH_URL_SAFE = '_'.charCodeAt(0) | |
function decode (elt) { | |
var code = elt.charCodeAt(0) | |
if (code === PLUS || | |
code === PLUS_URL_SAFE) | |
return 62 // '+' | |
if (code === SLASH || | |
code === SLASH_URL_SAFE) | |
return 63 // '/' | |
if (code < NUMBER) | |
return -1 //no match | |
if (code < NUMBER + 10) | |
return code - NUMBER + 26 + 26 | |
if (code < UPPER + 26) | |
return code - UPPER | |
if (code < LOWER + 26) | |
return code - LOWER + 26 | |
} | |
function b64ToByteArray (b64) { | |
var i, j, l, tmp, placeHolders, arr | |
if (b64.length % 4 > 0) { | |
throw new Error('Invalid string. Length must be a multiple of 4') | |
} | |
// the number of equal signs (place holders) | |
// if there are two placeholders, than the two characters before it | |
// represent one byte | |
// if there is only one, then the three characters before it represent 2 bytes | |
// this is just a cheap hack to not do indexOf twice | |
var len = b64.length | |
placeHolders = '=' === b64.charAt(len - 2) ? 2 : '=' === b64.charAt(len - 1) ? 1 : 0 | |
// base64 is 4/3 + up to two characters of the original data | |
arr = new Arr(b64.length * 3 / 4 - placeHolders) | |
// if there are placeholders, only get up to the last complete 4 chars | |
l = placeHolders > 0 ? b64.length - 4 : b64.length | |
var L = 0 | |
function push (v) { | |
arr[L++] = v | |
} | |
for (i = 0, j = 0; i < l; i += 4, j += 3) { | |
tmp = (decode(b64.charAt(i)) << 18) | (decode(b64.charAt(i + 1)) << 12) | (decode(b64.charAt(i + 2)) << 6) | decode(b64.charAt(i + 3)) | |
push((tmp & 0xFF0000) >> 16) | |
push((tmp & 0xFF00) >> 8) | |
push(tmp & 0xFF) | |
} | |
if (placeHolders === 2) { | |
tmp = (decode(b64.charAt(i)) << 2) | (decode(b64.charAt(i + 1)) >> 4) | |
push(tmp & 0xFF) | |
} else if (placeHolders === 1) { | |
tmp = (decode(b64.charAt(i)) << 10) | (decode(b64.charAt(i + 1)) << 4) | (decode(b64.charAt(i + 2)) >> 2) | |
push((tmp >> 8) & 0xFF) | |
push(tmp & 0xFF) | |
} | |
return arr | |
} | |
function uint8ToBase64 (uint8) { | |
var i, | |
extraBytes = uint8.length % 3, // if we have 1 byte left, pad 2 bytes | |
output = "", | |
temp, length | |
function encode (num) { | |
return lookup.charAt(num) | |
} | |
function tripletToBase64 (num) { | |
return encode(num >> 18 & 0x3F) + encode(num >> 12 & 0x3F) + encode(num >> 6 & 0x3F) + encode(num & 0x3F) | |
} | |
// go through the array every three bytes, we'll deal with trailing stuff later | |
for (i = 0, length = uint8.length - extraBytes; i < length; i += 3) { | |
temp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]) | |
output += tripletToBase64(temp) | |
} | |
// pad the end with zeros, but make sure to not forget the extra bytes | |
switch (extraBytes) { | |
case 1: | |
temp = uint8[uint8.length - 1] | |
output += encode(temp >> 2) | |
output += encode((temp << 4) & 0x3F) | |
output += '==' | |
break | |
case 2: | |
temp = (uint8[uint8.length - 2] << 8) + (uint8[uint8.length - 1]) | |
output += encode(temp >> 10) | |
output += encode((temp >> 4) & 0x3F) | |
output += encode((temp << 2) & 0x3F) | |
output += '=' | |
break | |
} | |
return output | |
} | |
exports.toByteArray = b64ToByteArray | |
exports.fromByteArray = uint8ToBase64 | |
}( false ? (this.base64js = {}) : exports)) | |
/***/ }, | |
/* 35 */ | |
/***/ function(module, exports) { | |
exports.read = function (buffer, offset, isLE, mLen, nBytes) { | |
var e, m | |
var eLen = nBytes * 8 - mLen - 1 | |
var eMax = (1 << eLen) - 1 | |
var eBias = eMax >> 1 | |
var nBits = -7 | |
var i = isLE ? (nBytes - 1) : 0 | |
var d = isLE ? -1 : 1 | |
var s = buffer[offset + i] | |
i += d | |
e = s & ((1 << (-nBits)) - 1) | |
s >>= (-nBits) | |
nBits += eLen | |
for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8) {} | |
m = e & ((1 << (-nBits)) - 1) | |
e >>= (-nBits) | |
nBits += mLen | |
for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8) {} | |
if (e === 0) { | |
e = 1 - eBias | |
} else if (e === eMax) { | |
return m ? NaN : ((s ? -1 : 1) * Infinity) | |
} else { | |
m = m + Math.pow(2, mLen) | |
e = e - eBias | |
} | |
return (s ? -1 : 1) * m * Math.pow(2, e - mLen) | |
} | |
exports.write = function (buffer, value, offset, isLE, mLen, nBytes) { | |
var e, m, c | |
var eLen = nBytes * 8 - mLen - 1 | |
var eMax = (1 << eLen) - 1 | |
var eBias = eMax >> 1 | |
var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0) | |
var i = isLE ? 0 : (nBytes - 1) | |
var d = isLE ? 1 : -1 | |
var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0 | |
value = Math.abs(value) | |
if (isNaN(value) || value === Infinity) { | |
m = isNaN(value) ? 1 : 0 | |
e = eMax | |
} else { | |
e = Math.floor(Math.log(value) / Math.LN2) | |
if (value * (c = Math.pow(2, -e)) < 1) { | |
e-- | |
c *= 2 | |
} | |
if (e + eBias >= 1) { | |
value += rt / c | |
} else { | |
value += rt * Math.pow(2, 1 - eBias) | |
} | |
if (value * c >= 2) { | |
e++ | |
c /= 2 | |
} | |
if (e + eBias >= eMax) { | |
m = 0 | |
e = eMax | |
} else if (e + eBias >= 1) { | |
m = (value * c - 1) * Math.pow(2, mLen) | |
e = e + eBias | |
} else { | |
m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen) | |
e = 0 | |
} | |
} | |
for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {} | |
e = (e << mLen) | m | |
eLen += mLen | |
for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {} | |
buffer[offset + i - d] |= s * 128 | |
} | |
/***/ }, | |
/* 36 */ | |
/***/ function(module, exports) { | |
var toString = {}.toString; | |
module.exports = Array.isArray || function (arr) { | |
return toString.call(arr) == '[object Array]'; | |
}; | |
/***/ }, | |
/* 37 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var Parser = __webpack_require__(38), | |
DomHandler = __webpack_require__(50); | |
function defineProp(name, value){ | |
delete module.exports[name]; | |
module.exports[name] = value; | |
return value; | |
} | |
module.exports = { | |
Parser: Parser, | |
Tokenizer: __webpack_require__(39), | |
ElementType: __webpack_require__(51), | |
DomHandler: DomHandler, | |
get FeedHandler(){ | |
return defineProp("FeedHandler", __webpack_require__(54)); | |
}, | |
get Stream(){ | |
return defineProp("Stream", __webpack_require__(55)); | |
}, | |
get WritableStream(){ | |
return defineProp("WritableStream", __webpack_require__(56)); | |
}, | |
get ProxyHandler(){ | |
return defineProp("ProxyHandler", __webpack_require__(75)); | |
}, | |
get DomUtils(){ | |
return defineProp("DomUtils", __webpack_require__(76)); | |
}, | |
get CollectingHandler(){ | |
return defineProp("CollectingHandler", __webpack_require__(93)); | |
}, | |
// For legacy support | |
DefaultHandler: DomHandler, | |
get RssHandler(){ | |
return defineProp("RssHandler", this.FeedHandler); | |
}, | |
//helper methods | |
parseDOM: function(data, options){ | |
var handler = new DomHandler(options); | |
new Parser(handler, options).end(data); | |
return handler.dom; | |
}, | |
parseFeed: function(feed, options){ | |
var handler = new module.exports.FeedHandler(options); | |
new Parser(handler, options).end(feed); | |
return handler.dom; | |
}, | |
createDomStream: function(cb, options, elementCb){ | |
var handler = new DomHandler(cb, options, elementCb); | |
return new Parser(handler, options); | |
}, | |
// List of all events that the parser emits | |
EVENTS: { /* Format: eventname: number of arguments */ | |
attribute: 2, | |
cdatastart: 0, | |
cdataend: 0, | |
text: 1, | |
processinginstruction: 2, | |
comment: 1, | |
commentend: 0, | |
closetag: 1, | |
opentag: 2, | |
opentagname: 1, | |
error: 1, | |
end: 0 | |
} | |
}; | |
/***/ }, | |
/* 38 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var Tokenizer = __webpack_require__(39); | |
/* | |
Options: | |
xmlMode: Disables the special behavior for script/style tags (false by default) | |
lowerCaseAttributeNames: call .toLowerCase for each attribute name (true if xmlMode is `false`) | |
lowerCaseTags: call .toLowerCase for each tag name (true if xmlMode is `false`) | |
*/ | |
/* | |
Callbacks: | |
oncdataend, | |
oncdatastart, | |
onclosetag, | |
oncomment, | |
oncommentend, | |
onerror, | |
onopentag, | |
onprocessinginstruction, | |
onreset, | |
ontext | |
*/ | |
var formTags = { | |
input: true, | |
option: true, | |
optgroup: true, | |
select: true, | |
button: true, | |
datalist: true, | |
textarea: true | |
}; | |
var openImpliesClose = { | |
tr : { tr:true, th:true, td:true }, | |
th : { th:true }, | |
td : { thead:true, th:true, td:true }, | |
body : { head:true, link:true, script:true }, | |
li : { li:true }, | |
p : { p:true }, | |
h1 : { p:true }, | |
h2 : { p:true }, | |
h3 : { p:true }, | |
h4 : { p:true }, | |
h5 : { p:true }, | |
h6 : { p:true }, | |
select : formTags, | |
input : formTags, | |
output : formTags, | |
button : formTags, | |
datalist: formTags, | |
textarea: formTags, | |
option : { option:true }, | |
optgroup: { optgroup:true } | |
}; | |
var voidElements = { | |
__proto__: null, | |
area: true, | |
base: true, | |
basefont: true, | |
br: true, | |
col: true, | |
command: true, | |
embed: true, | |
frame: true, | |
hr: true, | |
img: true, | |
input: true, | |
isindex: true, | |
keygen: true, | |
link: true, | |
meta: true, | |
param: true, | |
source: true, | |
track: true, | |
wbr: true, | |
//common self closing svg elements | |
path: true, | |
circle: true, | |
ellipse: true, | |
line: true, | |
rect: true, | |
use: true, | |
stop: true, | |
polyline: true, | |
polygon: true | |
}; | |
var re_nameEnd = /\s|\//; | |
function Parser(cbs, options){ | |
this._options = options || {}; | |
this._cbs = cbs || {}; | |
this._tagname = ""; | |
this._attribname = ""; | |
this._attribvalue = ""; | |
this._attribs = null; | |
this._stack = []; | |
this.startIndex = 0; | |
this.endIndex = null; | |
this._lowerCaseTagNames = "lowerCaseTags" in this._options ? | |
!!this._options.lowerCaseTags : | |
!this._options.xmlMode; | |
this._lowerCaseAttributeNames = "lowerCaseAttributeNames" in this._options ? | |
!!this._options.lowerCaseAttributeNames : | |
!this._options.xmlMode; | |
this._tokenizer = new Tokenizer(this._options, this); | |
if(this._cbs.onparserinit) this._cbs.onparserinit(this); | |
} | |
__webpack_require__(45).inherits(Parser, __webpack_require__(49).EventEmitter); | |
Parser.prototype._updatePosition = function(initialOffset){ | |
if(this.endIndex === null){ | |
if(this._tokenizer._sectionStart <= initialOffset){ | |
this.startIndex = 0; | |
} else { | |
this.startIndex = this._tokenizer._sectionStart - initialOffset; | |
} | |
} | |
else this.startIndex = this.endIndex + 1; | |
this.endIndex = this._tokenizer.getAbsoluteIndex(); | |
}; | |
//Tokenizer event handlers | |
Parser.prototype.ontext = function(data){ | |
this._updatePosition(1); | |
this.endIndex--; | |
if(this._cbs.ontext) this._cbs.ontext(data); | |
}; | |
Parser.prototype.onopentagname = function(name){ | |
if(this._lowerCaseTagNames){ | |
name = name.toLowerCase(); | |
} | |
this._tagname = name; | |
if(!this._options.xmlMode && name in openImpliesClose) { | |
for( | |
var el; | |
(el = this._stack[this._stack.length - 1]) in openImpliesClose[name]; | |
this.onclosetag(el) | |
); | |
} | |
if(this._options.xmlMode || !(name in voidElements)){ | |
this._stack.push(name); | |
} | |
if(this._cbs.onopentagname) this._cbs.onopentagname(name); | |
if(this._cbs.onopentag) this._attribs = {}; | |
}; | |
Parser.prototype.onopentagend = function(){ | |
this._updatePosition(1); | |
if(this._attribs){ | |
if(this._cbs.onopentag) this._cbs.onopentag(this._tagname, this._attribs); | |
this._attribs = null; | |
} | |
if(!this._options.xmlMode && this._cbs.onclosetag && this._tagname in voidElements){ | |
this._cbs.onclosetag(this._tagname); | |
} | |
this._tagname = ""; | |
}; | |
Parser.prototype.onclosetag = function(name){ | |
this._updatePosition(1); | |
if(this._lowerCaseTagNames){ | |
name = name.toLowerCase(); | |
} | |
if(this._stack.length && (!(name in voidElements) || this._options.xmlMode)){ | |
var pos = this._stack.lastIndexOf(name); | |
if(pos !== -1){ | |
if(this._cbs.onclosetag){ | |
pos = this._stack.length - pos; | |
while(pos--) this._cbs.onclosetag(this._stack.pop()); | |
} | |
else this._stack.length = pos; | |
} else if(name === "p" && !this._options.xmlMode){ | |
this.onopentagname(name); | |
this._closeCurrentTag(); | |
} | |
} else if(!this._options.xmlMode && (name === "br" || name === "p")){ | |
this.onopentagname(name); | |
this._closeCurrentTag(); | |
} | |
}; | |
Parser.prototype.onselfclosingtag = function(){ | |
if(this._options.xmlMode || this._options.recognizeSelfClosing){ | |
this._closeCurrentTag(); | |
} else { | |
this.onopentagend(); | |
} | |
}; | |
Parser.prototype._closeCurrentTag = function(){ | |
var name = this._tagname; | |
this.onopentagend(); | |
//self-closing tags will be on the top of the stack | |
//(cheaper check than in onclosetag) | |
if(this._stack[this._stack.length - 1] === name){ | |
if(this._cbs.onclosetag){ | |
this._cbs.onclosetag(name); | |
} | |
this._stack.pop(); | |
} | |
}; | |
Parser.prototype.onattribname = function(name){ | |
if(this._lowerCaseAttributeNames){ | |
name = name.toLowerCase(); | |
} | |
this._attribname = name; | |
}; | |
Parser.prototype.onattribdata = function(value){ | |
this._attribvalue += value; | |
}; | |
Parser.prototype.onattribend = function(){ | |
if(this._cbs.onattribute) this._cbs.onattribute(this._attribname, this._attribvalue); | |
if( | |
this._attribs && | |
!Object.prototype.hasOwnProperty.call(this._attribs, this._attribname) | |
){ | |
this._attribs[this._attribname] = this._attribvalue; | |
} | |
this._attribname = ""; | |
this._attribvalue = ""; | |
}; | |
Parser.prototype._getInstructionName = function(value){ | |
var idx = value.search(re_nameEnd), | |
name = idx < 0 ? value : value.substr(0, idx); | |
if(this._lowerCaseTagNames){ | |
name = name.toLowerCase(); | |
} | |
return name; | |
}; | |
Parser.prototype.ondeclaration = function(value){ | |
if(this._cbs.onprocessinginstruction){ | |
var name = this._getInstructionName(value); | |
this._cbs.onprocessinginstruction("!" + name, "!" + value); | |
} | |
}; | |
Parser.prototype.onprocessinginstruction = function(value){ | |
if(this._cbs.onprocessinginstruction){ | |
var name = this._getInstructionName(value); | |
this._cbs.onprocessinginstruction("?" + name, "?" + value); | |
} | |
}; | |
Parser.prototype.oncomment = function(value){ | |
this._updatePosition(4); | |
if(this._cbs.oncomment) this._cbs.oncomment(value); | |
if(this._cbs.oncommentend) this._cbs.oncommentend(); | |
}; | |
Parser.prototype.oncdata = function(value){ | |
this._updatePosition(1); | |
if(this._options.xmlMode || this._options.recognizeCDATA){ | |
if(this._cbs.oncdatastart) this._cbs.oncdatastart(); | |
if(this._cbs.ontext) this._cbs.ontext(value); | |
if(this._cbs.oncdataend) this._cbs.oncdataend(); | |
} else { | |
this.oncomment("[CDATA[" + value + "]]"); | |
} | |
}; | |
Parser.prototype.onerror = function(err){ | |
if(this._cbs.onerror) this._cbs.onerror(err); | |
}; | |
Parser.prototype.onend = function(){ | |
if(this._cbs.onclosetag){ | |
for( | |
var i = this._stack.length; | |
i > 0; | |
this._cbs.onclosetag(this._stack[--i]) | |
); | |
} | |
if(this._cbs.onend) this._cbs.onend(); | |
}; | |
//Resets the parser to a blank state, ready to parse a new HTML document | |
Parser.prototype.reset = function(){ | |
if(this._cbs.onreset) this._cbs.onreset(); | |
this._tokenizer.reset(); | |
this._tagname = ""; | |
this._attribname = ""; | |
this._attribs = null; | |
this._stack = []; | |
if(this._cbs.onparserinit) this._cbs.onparserinit(this); | |
}; | |
//Parses a complete HTML document and pushes it to the handler | |
Parser.prototype.parseComplete = function(data){ | |
this.reset(); | |
this.end(data); | |
}; | |
Parser.prototype.write = function(chunk){ | |
this._tokenizer.write(chunk); | |
}; | |
Parser.prototype.end = function(chunk){ | |
this._tokenizer.end(chunk); | |
}; | |
Parser.prototype.pause = function(){ | |
this._tokenizer.pause(); | |
}; | |
Parser.prototype.resume = function(){ | |
this._tokenizer.resume(); | |
}; | |
//alias for backwards compat | |
Parser.prototype.parseChunk = Parser.prototype.write; | |
Parser.prototype.done = Parser.prototype.end; | |
module.exports = Parser; | |
/***/ }, | |
/* 39 */ | |
/***/ function(module, exports, __webpack_require__) { | |
module.exports = Tokenizer; | |
var decodeCodePoint = __webpack_require__(40), | |
entityMap = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"entities/maps/entities.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())), | |
legacyMap = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"entities/maps/legacy.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())), | |
xmlMap = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"entities/maps/xml.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())), | |
i = 0, | |
TEXT = i++, | |
BEFORE_TAG_NAME = i++, //after < | |
IN_TAG_NAME = i++, | |
IN_SELF_CLOSING_TAG = i++, | |
BEFORE_CLOSING_TAG_NAME = i++, | |
IN_CLOSING_TAG_NAME = i++, | |
AFTER_CLOSING_TAG_NAME = i++, | |
//attributes | |
BEFORE_ATTRIBUTE_NAME = i++, | |
IN_ATTRIBUTE_NAME = i++, | |
AFTER_ATTRIBUTE_NAME = i++, | |
BEFORE_ATTRIBUTE_VALUE = i++, | |
IN_ATTRIBUTE_VALUE_DQ = i++, // " | |
IN_ATTRIBUTE_VALUE_SQ = i++, // ' | |
IN_ATTRIBUTE_VALUE_NQ = i++, | |
//declarations | |
BEFORE_DECLARATION = i++, // ! | |
IN_DECLARATION = i++, | |
//processing instructions | |
IN_PROCESSING_INSTRUCTION = i++, // ? | |
//comments | |
BEFORE_COMMENT = i++, | |
IN_COMMENT = i++, | |
AFTER_COMMENT_1 = i++, | |
AFTER_COMMENT_2 = i++, | |
//cdata | |
BEFORE_CDATA_1 = i++, // [ | |
BEFORE_CDATA_2 = i++, // C | |
BEFORE_CDATA_3 = i++, // D | |
BEFORE_CDATA_4 = i++, // A | |
BEFORE_CDATA_5 = i++, // T | |
BEFORE_CDATA_6 = i++, // A | |
IN_CDATA = i++, // [ | |
AFTER_CDATA_1 = i++, // ] | |
AFTER_CDATA_2 = i++, // ] | |
//special tags | |
BEFORE_SPECIAL = i++, //S | |
BEFORE_SPECIAL_END = i++, //S | |
BEFORE_SCRIPT_1 = i++, //C | |
BEFORE_SCRIPT_2 = i++, //R | |
BEFORE_SCRIPT_3 = i++, //I | |
BEFORE_SCRIPT_4 = i++, //P | |
BEFORE_SCRIPT_5 = i++, //T | |
AFTER_SCRIPT_1 = i++, //C | |
AFTER_SCRIPT_2 = i++, //R | |
AFTER_SCRIPT_3 = i++, //I | |
AFTER_SCRIPT_4 = i++, //P | |
AFTER_SCRIPT_5 = i++, //T | |
BEFORE_STYLE_1 = i++, //T | |
BEFORE_STYLE_2 = i++, //Y | |
BEFORE_STYLE_3 = i++, //L | |
BEFORE_STYLE_4 = i++, //E | |
AFTER_STYLE_1 = i++, //T | |
AFTER_STYLE_2 = i++, //Y | |
AFTER_STYLE_3 = i++, //L | |
AFTER_STYLE_4 = i++, //E | |
BEFORE_ENTITY = i++, //& | |
BEFORE_NUMERIC_ENTITY = i++, //# | |
IN_NAMED_ENTITY = i++, | |
IN_NUMERIC_ENTITY = i++, | |
IN_HEX_ENTITY = i++, //X | |
j = 0, | |
SPECIAL_NONE = j++, | |
SPECIAL_SCRIPT = j++, | |
SPECIAL_STYLE = j++; | |
function whitespace(c){ | |
return c === " " || c === "\n" || c === "\t" || c === "\f" || c === "\r"; | |
} | |
function characterState(char, SUCCESS){ | |
return function(c){ | |
if(c === char) this._state = SUCCESS; | |
}; | |
} | |
function ifElseState(upper, SUCCESS, FAILURE){ | |
var lower = upper.toLowerCase(); | |
if(upper === lower){ | |
return function(c){ | |
if(c === lower){ | |
this._state = SUCCESS; | |
} else { | |
this._state = FAILURE; | |
this._index--; | |
} | |
}; | |
} else { | |
return function(c){ | |
if(c === lower || c === upper){ | |
this._state = SUCCESS; | |
} else { | |
this._state = FAILURE; | |
this._index--; | |
} | |
}; | |
} | |
} | |
function consumeSpecialNameChar(upper, NEXT_STATE){ | |
var lower = upper.toLowerCase(); | |
return function(c){ | |
if(c === lower || c === upper){ | |
this._state = NEXT_STATE; | |
} else { | |
this._state = IN_TAG_NAME; | |
this._index--; //consume the token again | |
} | |
}; | |
} | |
function Tokenizer(options, cbs){ | |
this._state = TEXT; | |
this._buffer = ""; | |
this._sectionStart = 0; | |
this._index = 0; | |
this._bufferOffset = 0; //chars removed from _buffer | |
this._baseState = TEXT; | |
this._special = SPECIAL_NONE; | |
this._cbs = cbs; | |
this._running = true; | |
this._ended = false; | |
this._xmlMode = !!(options && options.xmlMode); | |
this._decodeEntities = !!(options && options.decodeEntities); | |
} | |
Tokenizer.prototype._stateText = function(c){ | |
if(c === "<"){ | |
if(this._index > this._sectionStart){ | |
this._cbs.ontext(this._getSection()); | |
} | |
this._state = BEFORE_TAG_NAME; | |
this._sectionStart = this._index; | |
} else if(this._decodeEntities && this._special === SPECIAL_NONE && c === "&"){ | |
if(this._index > this._sectionStart){ | |
this._cbs.ontext(this._getSection()); | |
} | |
this._baseState = TEXT; | |
this._state = BEFORE_ENTITY; | |
this._sectionStart = this._index; | |
} | |
}; | |
Tokenizer.prototype._stateBeforeTagName = function(c){ | |
if(c === "/"){ | |
this._state = BEFORE_CLOSING_TAG_NAME; | |
} else if(c === ">" || this._special !== SPECIAL_NONE || whitespace(c)) { | |
this._state = TEXT; | |
} else if(c === "!"){ | |
this._state = BEFORE_DECLARATION; | |
this._sectionStart = this._index + 1; | |
} else if(c === "?"){ | |
this._state = IN_PROCESSING_INSTRUCTION; | |
this._sectionStart = this._index + 1; | |
} else if(c === "<"){ | |
this._cbs.ontext(this._getSection()); | |
this._sectionStart = this._index; | |
} else { | |
this._state = (!this._xmlMode && (c === "s" || c === "S")) ? | |
BEFORE_SPECIAL : IN_TAG_NAME; | |
this._sectionStart = this._index; | |
} | |
}; | |
Tokenizer.prototype._stateInTagName = function(c){ | |
if(c === "/" || c === ">" || whitespace(c)){ | |
this._emitToken("onopentagname"); | |
this._state = BEFORE_ATTRIBUTE_NAME; | |
this._index--; | |
} | |
}; | |
Tokenizer.prototype._stateBeforeCloseingTagName = function(c){ | |
if(whitespace(c)); | |
else if(c === ">"){ | |
this._state = TEXT; | |
} else if(this._special !== SPECIAL_NONE){ | |
if(c === "s" || c === "S"){ | |
this._state = BEFORE_SPECIAL_END; | |
} else { | |
this._state = TEXT; | |
this._index--; | |
} | |
} else { | |
this._state = IN_CLOSING_TAG_NAME; | |
this._sectionStart = this._index; | |
} | |
}; | |
Tokenizer.prototype._stateInCloseingTagName = function(c){ | |
if(c === ">" || whitespace(c)){ | |
this._emitToken("onclosetag"); | |
this._state = AFTER_CLOSING_TAG_NAME; | |
this._index--; | |
} | |
}; | |
Tokenizer.prototype._stateAfterCloseingTagName = function(c){ | |
//skip everything until ">" | |
if(c === ">"){ | |
this._state = TEXT; | |
this._sectionStart = this._index + 1; | |
} | |
}; | |
Tokenizer.prototype._stateBeforeAttributeName = function(c){ | |
if(c === ">"){ | |
this._cbs.onopentagend(); | |
this._state = TEXT; | |
this._sectionStart = this._index + 1; | |
} else if(c === "/"){ | |
this._state = IN_SELF_CLOSING_TAG; | |
} else if(!whitespace(c)){ | |
this._state = IN_ATTRIBUTE_NAME; | |
this._sectionStart = this._index; | |
} | |
}; | |
Tokenizer.prototype._stateInSelfClosingTag = function(c){ | |
if(c === ">"){ | |
this._cbs.onselfclosingtag(); | |
this._state = TEXT; | |
this._sectionStart = this._index + 1; | |
} else if(!whitespace(c)){ | |
this._state = BEFORE_ATTRIBUTE_NAME; | |
this._index--; | |
} | |
}; | |
Tokenizer.prototype._stateInAttributeName = function(c){ | |
if(c === "=" || c === "/" || c === ">" || whitespace(c)){ | |
this._cbs.onattribname(this._getSection()); | |
this._sectionStart = -1; | |
this._state = AFTER_ATTRIBUTE_NAME; | |
this._index--; | |
} | |
}; | |
Tokenizer.prototype._stateAfterAttributeName = function(c){ | |
if(c === "="){ | |
this._state = BEFORE_ATTRIBUTE_VALUE; | |
} else if(c === "/" || c === ">"){ | |
this._cbs.onattribend(); | |
this._state = BEFORE_ATTRIBUTE_NAME; | |
this._index--; | |
} else if(!whitespace(c)){ | |
this._cbs.onattribend(); | |
this._state = IN_ATTRIBUTE_NAME; | |
this._sectionStart = this._index; | |
} | |
}; | |
Tokenizer.prototype._stateBeforeAttributeValue = function(c){ | |
if(c === "\""){ | |
this._state = IN_ATTRIBUTE_VALUE_DQ; | |
this._sectionStart = this._index + 1; | |
} else if(c === "'"){ | |
this._state = IN_ATTRIBUTE_VALUE_SQ; | |
this._sectionStart = this._index + 1; | |
} else if(!whitespace(c)){ | |
this._state = IN_ATTRIBUTE_VALUE_NQ; | |
this._sectionStart = this._index; | |
this._index--; //reconsume token | |
} | |
}; | |
Tokenizer.prototype._stateInAttributeValueDoubleQuotes = function(c){ | |
if(c === "\""){ | |
this._emitToken("onattribdata"); | |
this._cbs.onattribend(); | |
this._state = BEFORE_ATTRIBUTE_NAME; | |
} else if(this._decodeEntities && c === "&"){ | |
this._emitToken("onattribdata"); | |
this._baseState = this._state; | |
this._state = BEFORE_ENTITY; | |
this._sectionStart = this._index; | |
} | |
}; | |
Tokenizer.prototype._stateInAttributeValueSingleQuotes = function(c){ | |
if(c === "'"){ | |
this._emitToken("onattribdata"); | |
this._cbs.onattribend(); | |
this._state = BEFORE_ATTRIBUTE_NAME; | |
} else if(this._decodeEntities && c === "&"){ | |
this._emitToken("onattribdata"); | |
this._baseState = this._state; | |
this._state = BEFORE_ENTITY; | |
this._sectionStart = this._index; | |
} | |
}; | |
Tokenizer.prototype._stateInAttributeValueNoQuotes = function(c){ | |
if(whitespace(c) || c === ">"){ | |
this._emitToken("onattribdata"); | |
this._cbs.onattribend(); | |
this._state = BEFORE_ATTRIBUTE_NAME; | |
this._index--; | |
} else if(this._decodeEntities && c === "&"){ | |
this._emitToken("onattribdata"); | |
this._baseState = this._state; | |
this._state = BEFORE_ENTITY; | |
this._sectionStart = this._index; | |
} | |
}; | |
Tokenizer.prototype._stateBeforeDeclaration = function(c){ | |
this._state = c === "[" ? BEFORE_CDATA_1 : | |
c === "-" ? BEFORE_COMMENT : | |
IN_DECLARATION; | |
}; | |
Tokenizer.prototype._stateInDeclaration = function(c){ | |
if(c === ">"){ | |
this._cbs.ondeclaration(this._getSection()); | |
this._state = TEXT; | |
this._sectionStart = this._index + 1; | |
} | |
}; | |
Tokenizer.prototype._stateInProcessingInstruction = function(c){ | |
if(c === ">"){ | |
this._cbs.onprocessinginstruction(this._getSection()); | |
this._state = TEXT; | |
this._sectionStart = this._index + 1; | |
} | |
}; | |
Tokenizer.prototype._stateBeforeComment = function(c){ | |
if(c === "-"){ | |
this._state = IN_COMMENT; | |
this._sectionStart = this._index + 1; | |
} else { | |
this._state = IN_DECLARATION; | |
} | |
}; | |
Tokenizer.prototype._stateInComment = function(c){ | |
if(c === "-") this._state = AFTER_COMMENT_1; | |
}; | |
Tokenizer.prototype._stateAfterComment1 = function(c){ | |
if(c === "-"){ | |
this._state = AFTER_COMMENT_2; | |
} else { | |
this._state = IN_COMMENT; | |
} | |
}; | |
Tokenizer.prototype._stateAfterComment2 = function(c){ | |
if(c === ">"){ | |
//remove 2 trailing chars | |
this._cbs.oncomment(this._buffer.substring(this._sectionStart, this._index - 2)); | |
this._state = TEXT; | |
this._sectionStart = this._index + 1; | |
} else if(c !== "-"){ | |
this._state = IN_COMMENT; | |
} | |
// else: stay in AFTER_COMMENT_2 (`--->`) | |
}; | |
Tokenizer.prototype._stateBeforeCdata1 = ifElseState("C", BEFORE_CDATA_2, IN_DECLARATION); | |
Tokenizer.prototype._stateBeforeCdata2 = ifElseState("D", BEFORE_CDATA_3, IN_DECLARATION); | |
Tokenizer.prototype._stateBeforeCdata3 = ifElseState("A", BEFORE_CDATA_4, IN_DECLARATION); | |
Tokenizer.prototype._stateBeforeCdata4 = ifElseState("T", BEFORE_CDATA_5, IN_DECLARATION); | |
Tokenizer.prototype._stateBeforeCdata5 = ifElseState("A", BEFORE_CDATA_6, IN_DECLARATION); | |
Tokenizer.prototype._stateBeforeCdata6 = function(c){ | |
if(c === "["){ | |
this._state = IN_CDATA; | |
this._sectionStart = this._index + 1; | |
} else { | |
this._state = IN_DECLARATION; | |
this._index--; | |
} | |
}; | |
Tokenizer.prototype._stateInCdata = function(c){ | |
if(c === "]") this._state = AFTER_CDATA_1; | |
}; | |
Tokenizer.prototype._stateAfterCdata1 = characterState("]", AFTER_CDATA_2); | |
Tokenizer.prototype._stateAfterCdata2 = function(c){ | |
if(c === ">"){ | |
//remove 2 trailing chars | |
this._cbs.oncdata(this._buffer.substring(this._sectionStart, this._index - 2)); | |
this._state = TEXT; | |
this._sectionStart = this._index + 1; | |
} else if(c !== "]") { | |
this._state = IN_CDATA; | |
} | |
//else: stay in AFTER_CDATA_2 (`]]]>`) | |
}; | |
Tokenizer.prototype._stateBeforeSpecial = function(c){ | |
if(c === "c" || c === "C"){ | |
this._state = BEFORE_SCRIPT_1; | |
} else if(c === "t" || c === "T"){ | |
this._state = BEFORE_STYLE_1; | |
} else { | |
this._state = IN_TAG_NAME; | |
this._index--; //consume the token again | |
} | |
}; | |
Tokenizer.prototype._stateBeforeSpecialEnd = function(c){ | |
if(this._special === SPECIAL_SCRIPT && (c === "c" || c === "C")){ | |
this._state = AFTER_SCRIPT_1; | |
} else if(this._special === SPECIAL_STYLE && (c === "t" || c === "T")){ | |
this._state = AFTER_STYLE_1; | |
} | |
else this._state = TEXT; | |
}; | |
Tokenizer.prototype._stateBeforeScript1 = consumeSpecialNameChar("R", BEFORE_SCRIPT_2); | |
Tokenizer.prototype._stateBeforeScript2 = consumeSpecialNameChar("I", BEFORE_SCRIPT_3); | |
Tokenizer.prototype._stateBeforeScript3 = consumeSpecialNameChar("P", BEFORE_SCRIPT_4); | |
Tokenizer.prototype._stateBeforeScript4 = consumeSpecialNameChar("T", BEFORE_SCRIPT_5); | |
Tokenizer.prototype._stateBeforeScript5 = function(c){ | |
if(c === "/" || c === ">" || whitespace(c)){ | |
this._special = SPECIAL_SCRIPT; | |
} | |
this._state = IN_TAG_NAME; | |
this._index--; //consume the token again | |
}; | |
Tokenizer.prototype._stateAfterScript1 = ifElseState("R", AFTER_SCRIPT_2, TEXT); | |
Tokenizer.prototype._stateAfterScript2 = ifElseState("I", AFTER_SCRIPT_3, TEXT); | |
Tokenizer.prototype._stateAfterScript3 = ifElseState("P", AFTER_SCRIPT_4, TEXT); | |
Tokenizer.prototype._stateAfterScript4 = ifElseState("T", AFTER_SCRIPT_5, TEXT); | |
Tokenizer.prototype._stateAfterScript5 = function(c){ | |
if(c === ">" || whitespace(c)){ | |
this._special = SPECIAL_NONE; | |
this._state = IN_CLOSING_TAG_NAME; | |
this._sectionStart = this._index - 6; | |
this._index--; //reconsume the token | |
} | |
else this._state = TEXT; | |
}; | |
Tokenizer.prototype._stateBeforeStyle1 = consumeSpecialNameChar("Y", BEFORE_STYLE_2); | |
Tokenizer.prototype._stateBeforeStyle2 = consumeSpecialNameChar("L", BEFORE_STYLE_3); | |
Tokenizer.prototype._stateBeforeStyle3 = consumeSpecialNameChar("E", BEFORE_STYLE_4); | |
Tokenizer.prototype._stateBeforeStyle4 = function(c){ | |
if(c === "/" || c === ">" || whitespace(c)){ | |
this._special = SPECIAL_STYLE; | |
} | |
this._state = IN_TAG_NAME; | |
this._index--; //consume the token again | |
}; | |
Tokenizer.prototype._stateAfterStyle1 = ifElseState("Y", AFTER_STYLE_2, TEXT); | |
Tokenizer.prototype._stateAfterStyle2 = ifElseState("L", AFTER_STYLE_3, TEXT); | |
Tokenizer.prototype._stateAfterStyle3 = ifElseState("E", AFTER_STYLE_4, TEXT); | |
Tokenizer.prototype._stateAfterStyle4 = function(c){ | |
if(c === ">" || whitespace(c)){ | |
this._special = SPECIAL_NONE; | |
this._state = IN_CLOSING_TAG_NAME; | |
this._sectionStart = this._index - 5; | |
this._index--; //reconsume the token | |
} | |
else this._state = TEXT; | |
}; | |
Tokenizer.prototype._stateBeforeEntity = ifElseState("#", BEFORE_NUMERIC_ENTITY, IN_NAMED_ENTITY); | |
Tokenizer.prototype._stateBeforeNumericEntity = ifElseState("X", IN_HEX_ENTITY, IN_NUMERIC_ENTITY); | |
//for entities terminated with a semicolon | |
Tokenizer.prototype._parseNamedEntityStrict = function(){ | |
//offset = 1 | |
if(this._sectionStart + 1 < this._index){ | |
var entity = this._buffer.substring(this._sectionStart + 1, this._index), | |
map = this._xmlMode ? xmlMap : entityMap; | |
if(map.hasOwnProperty(entity)){ | |
this._emitPartial(map[entity]); | |
this._sectionStart = this._index + 1; | |
} | |
} | |
}; | |
//parses legacy entities (without trailing semicolon) | |
Tokenizer.prototype._parseLegacyEntity = function(){ | |
var start = this._sectionStart + 1, | |
limit = this._index - start; | |
if(limit > 6) limit = 6; //the max length of legacy entities is 6 | |
while(limit >= 2){ //the min length of legacy entities is 2 | |
var entity = this._buffer.substr(start, limit); | |
if(legacyMap.hasOwnProperty(entity)){ | |
this._emitPartial(legacyMap[entity]); | |
this._sectionStart += limit + 1; | |
return; | |
} else { | |
limit--; | |
} | |
} | |
}; | |
Tokenizer.prototype._stateInNamedEntity = function(c){ | |
if(c === ";"){ | |
this._parseNamedEntityStrict(); | |
if(this._sectionStart + 1 < this._index && !this._xmlMode){ | |
this._parseLegacyEntity(); | |
} | |
this._state = this._baseState; | |
} else if((c < "a" || c > "z") && (c < "A" || c > "Z") && (c < "0" || c > "9")){ | |
if(this._xmlMode); | |
else if(this._sectionStart + 1 === this._index); | |
else if(this._baseState !== TEXT){ | |
if(c !== "="){ | |
this._parseNamedEntityStrict(); | |
} | |
} else { | |
this._parseLegacyEntity(); | |
} | |
this._state = this._baseState; | |
this._index--; | |
} | |
}; | |
Tokenizer.prototype._decodeNumericEntity = function(offset, base){ | |
var sectionStart = this._sectionStart + offset; | |
if(sectionStart !== this._index){ | |
//parse entity | |
var entity = this._buffer.substring(sectionStart, this._index); | |
var parsed = parseInt(entity, base); | |
this._emitPartial(decodeCodePoint(parsed)); | |
this._sectionStart = this._index; | |
} else { | |
this._sectionStart--; | |
} | |
this._state = this._baseState; | |
}; | |
Tokenizer.prototype._stateInNumericEntity = function(c){ | |
if(c === ";"){ | |
this._decodeNumericEntity(2, 10); | |
this._sectionStart++; | |
} else if(c < "0" || c > "9"){ | |
if(!this._xmlMode){ | |
this._decodeNumericEntity(2, 10); | |
} else { | |
this._state = this._baseState; | |
} | |
this._index--; | |
} | |
}; | |
Tokenizer.prototype._stateInHexEntity = function(c){ | |
if(c === ";"){ | |
this._decodeNumericEntity(3, 16); | |
this._sectionStart++; | |
} else if((c < "a" || c > "f") && (c < "A" || c > "F") && (c < "0" || c > "9")){ | |
if(!this._xmlMode){ | |
this._decodeNumericEntity(3, 16); | |
} else { | |
this._state = this._baseState; | |
} | |
this._index--; | |
} | |
}; | |
Tokenizer.prototype._cleanup = function (){ | |
if(this._sectionStart < 0){ | |
this._buffer = ""; | |
this._index = 0; | |
this._bufferOffset += this._index; | |
} else if(this._running){ | |
if(this._state === TEXT){ | |
if(this._sectionStart !== this._index){ | |
this._cbs.ontext(this._buffer.substr(this._sectionStart)); | |
} | |
this._buffer = ""; | |
this._index = 0; | |
this._bufferOffset += this._index; | |
} else if(this._sectionStart === this._index){ | |
//the section just started | |
this._buffer = ""; | |
this._index = 0; | |
this._bufferOffset += this._index; | |
} else { | |
//remove everything unnecessary | |
this._buffer = this._buffer.substr(this._sectionStart); | |
this._index -= this._sectionStart; | |
this._bufferOffset += this._sectionStart; | |
} | |
this._sectionStart = 0; | |
} | |
}; | |
//TODO make events conditional | |
Tokenizer.prototype.write = function(chunk){ | |
if(this._ended) this._cbs.onerror(Error(".write() after done!")); | |
this._buffer += chunk; | |
this._parse(); | |
}; | |
Tokenizer.prototype._parse = function(){ | |
while(this._index < this._buffer.length && this._running){ | |
var c = this._buffer.charAt(this._index); | |
if(this._state === TEXT) { | |
this._stateText(c); | |
} else if(this._state === BEFORE_TAG_NAME){ | |
this._stateBeforeTagName(c); | |
} else if(this._state === IN_TAG_NAME) { | |
this._stateInTagName(c); | |
} else if(this._state === BEFORE_CLOSING_TAG_NAME){ | |
this._stateBeforeCloseingTagName(c); | |
} else if(this._state === IN_CLOSING_TAG_NAME){ | |
this._stateInCloseingTagName(c); | |
} else if(this._state === AFTER_CLOSING_TAG_NAME){ | |
this._stateAfterCloseingTagName(c); | |
} else if(this._state === IN_SELF_CLOSING_TAG){ | |
this._stateInSelfClosingTag(c); | |
} | |
/* | |
* attributes | |
*/ | |
else if(this._state === BEFORE_ATTRIBUTE_NAME){ | |
this._stateBeforeAttributeName(c); | |
} else if(this._state === IN_ATTRIBUTE_NAME){ | |
this._stateInAttributeName(c); | |
} else if(this._state === AFTER_ATTRIBUTE_NAME){ | |
this._stateAfterAttributeName(c); | |
} else if(this._state === BEFORE_ATTRIBUTE_VALUE){ | |
this._stateBeforeAttributeValue(c); | |
} else if(this._state === IN_ATTRIBUTE_VALUE_DQ){ | |
this._stateInAttributeValueDoubleQuotes(c); | |
} else if(this._state === IN_ATTRIBUTE_VALUE_SQ){ | |
this._stateInAttributeValueSingleQuotes(c); | |
} else if(this._state === IN_ATTRIBUTE_VALUE_NQ){ | |
this._stateInAttributeValueNoQuotes(c); | |
} | |
/* | |
* declarations | |
*/ | |
else if(this._state === BEFORE_DECLARATION){ | |
this._stateBeforeDeclaration(c); | |
} else if(this._state === IN_DECLARATION){ | |
this._stateInDeclaration(c); | |
} | |
/* | |
* processing instructions | |
*/ | |
else if(this._state === IN_PROCESSING_INSTRUCTION){ | |
this._stateInProcessingInstruction(c); | |
} | |
/* | |
* comments | |
*/ | |
else if(this._state === BEFORE_COMMENT){ | |
this._stateBeforeComment(c); | |
} else if(this._state === IN_COMMENT){ | |
this._stateInComment(c); | |
} else if(this._state === AFTER_COMMENT_1){ | |
this._stateAfterComment1(c); | |
} else if(this._state === AFTER_COMMENT_2){ | |
this._stateAfterComment2(c); | |
} | |
/* | |
* cdata | |
*/ | |
else if(this._state === BEFORE_CDATA_1){ | |
this._stateBeforeCdata1(c); | |
} else if(this._state === BEFORE_CDATA_2){ | |
this._stateBeforeCdata2(c); | |
} else if(this._state === BEFORE_CDATA_3){ | |
this._stateBeforeCdata3(c); | |
} else if(this._state === BEFORE_CDATA_4){ | |
this._stateBeforeCdata4(c); | |
} else if(this._state === BEFORE_CDATA_5){ | |
this._stateBeforeCdata5(c); | |
} else if(this._state === BEFORE_CDATA_6){ | |
this._stateBeforeCdata6(c); | |
} else if(this._state === IN_CDATA){ | |
this._stateInCdata(c); | |
} else if(this._state === AFTER_CDATA_1){ | |
this._stateAfterCdata1(c); | |
} else if(this._state === AFTER_CDATA_2){ | |
this._stateAfterCdata2(c); | |
} | |
/* | |
* special tags | |
*/ | |
else if(this._state === BEFORE_SPECIAL){ | |
this._stateBeforeSpecial(c); | |
} else if(this._state === BEFORE_SPECIAL_END){ | |
this._stateBeforeSpecialEnd(c); | |
} | |
/* | |
* script | |
*/ | |
else if(this._state === BEFORE_SCRIPT_1){ | |
this._stateBeforeScript1(c); | |
} else if(this._state === BEFORE_SCRIPT_2){ | |
this._stateBeforeScript2(c); | |
} else if(this._state === BEFORE_SCRIPT_3){ | |
this._stateBeforeScript3(c); | |
} else if(this._state === BEFORE_SCRIPT_4){ | |
this._stateBeforeScript4(c); | |
} else if(this._state === BEFORE_SCRIPT_5){ | |
this._stateBeforeScript5(c); | |
} | |
else if(this._state === AFTER_SCRIPT_1){ | |
this._stateAfterScript1(c); | |
} else if(this._state === AFTER_SCRIPT_2){ | |
this._stateAfterScript2(c); | |
} else if(this._state === AFTER_SCRIPT_3){ | |
this._stateAfterScript3(c); | |
} else if(this._state === AFTER_SCRIPT_4){ | |
this._stateAfterScript4(c); | |
} else if(this._state === AFTER_SCRIPT_5){ | |
this._stateAfterScript5(c); | |
} | |
/* | |
* style | |
*/ | |
else if(this._state === BEFORE_STYLE_1){ | |
this._stateBeforeStyle1(c); | |
} else if(this._state === BEFORE_STYLE_2){ | |
this._stateBeforeStyle2(c); | |
} else if(this._state === BEFORE_STYLE_3){ | |
this._stateBeforeStyle3(c); | |
} else if(this._state === BEFORE_STYLE_4){ | |
this._stateBeforeStyle4(c); | |
} | |
else if(this._state === AFTER_STYLE_1){ | |
this._stateAfterStyle1(c); | |
} else if(this._state === AFTER_STYLE_2){ | |
this._stateAfterStyle2(c); | |
} else if(this._state === AFTER_STYLE_3){ | |
this._stateAfterStyle3(c); | |
} else if(this._state === AFTER_STYLE_4){ | |
this._stateAfterStyle4(c); | |
} | |
/* | |
* entities | |
*/ | |
else if(this._state === BEFORE_ENTITY){ | |
this._stateBeforeEntity(c); | |
} else if(this._state === BEFORE_NUMERIC_ENTITY){ | |
this._stateBeforeNumericEntity(c); | |
} else if(this._state === IN_NAMED_ENTITY){ | |
this._stateInNamedEntity(c); | |
} else if(this._state === IN_NUMERIC_ENTITY){ | |
this._stateInNumericEntity(c); | |
} else if(this._state === IN_HEX_ENTITY){ | |
this._stateInHexEntity(c); | |
} | |
else { | |
this._cbs.onerror(Error("unknown _state"), this._state); | |
} | |
this._index++; | |
} | |
this._cleanup(); | |
}; | |
Tokenizer.prototype.pause = function(){ | |
this._running = false; | |
}; | |
Tokenizer.prototype.resume = function(){ | |
this._running = true; | |
if(this._index < this._buffer.length){ | |
this._parse(); | |
} | |
if(this._ended){ | |
this._finish(); | |
} | |
}; | |
Tokenizer.prototype.end = function(chunk){ | |
if(this._ended) this._cbs.onerror(Error(".end() after done!")); | |
if(chunk) this.write(chunk); | |
this._ended = true; | |
if(this._running) this._finish(); | |
}; | |
Tokenizer.prototype._finish = function(){ | |
//if there is remaining data, emit it in a reasonable way | |
if(this._sectionStart < this._index){ | |
this._handleTrailingData(); | |
} | |
this._cbs.onend(); | |
}; | |
Tokenizer.prototype._handleTrailingData = function(){ | |
var data = this._buffer.substr(this._sectionStart); | |
if(this._state === IN_CDATA || this._state === AFTER_CDATA_1 || this._state === AFTER_CDATA_2){ | |
this._cbs.oncdata(data); | |
} else if(this._state === IN_COMMENT || this._state === AFTER_COMMENT_1 || this._state === AFTER_COMMENT_2){ | |
this._cbs.oncomment(data); | |
} else if(this._state === IN_NAMED_ENTITY && !this._xmlMode){ | |
this._parseLegacyEntity(); | |
if(this._sectionStart < this._index){ | |
this._state = this._baseState; | |
this._handleTrailingData(); | |
} | |
} else if(this._state === IN_NUMERIC_ENTITY && !this._xmlMode){ | |
this._decodeNumericEntity(2, 10); | |
if(this._sectionStart < this._index){ | |
this._state = this._baseState; | |
this._handleTrailingData(); | |
} | |
} else if(this._state === IN_HEX_ENTITY && !this._xmlMode){ | |
this._decodeNumericEntity(3, 16); | |
if(this._sectionStart < this._index){ | |
this._state = this._baseState; | |
this._handleTrailingData(); | |
} | |
} else if( | |
this._state !== IN_TAG_NAME && | |
this._state !== BEFORE_ATTRIBUTE_NAME && | |
this._state !== BEFORE_ATTRIBUTE_VALUE && | |
this._state !== AFTER_ATTRIBUTE_NAME && | |
this._state !== IN_ATTRIBUTE_NAME && | |
this._state !== IN_ATTRIBUTE_VALUE_SQ && | |
this._state !== IN_ATTRIBUTE_VALUE_DQ && | |
this._state !== IN_ATTRIBUTE_VALUE_NQ && | |
this._state !== IN_CLOSING_TAG_NAME | |
){ | |
this._cbs.ontext(data); | |
} | |
//else, ignore remaining data | |
//TODO add a way to remove current tag | |
}; | |
Tokenizer.prototype.reset = function(){ | |
Tokenizer.call(this, {xmlMode: this._xmlMode, decodeEntities: this._decodeEntities}, this._cbs); | |
}; | |
Tokenizer.prototype.getAbsoluteIndex = function(){ | |
return this._bufferOffset + this._index; | |
}; | |
Tokenizer.prototype._getSection = function(){ | |
return this._buffer.substring(this._sectionStart, this._index); | |
}; | |
Tokenizer.prototype._emitToken = function(name){ | |
this._cbs[name](this._getSection()); | |
this._sectionStart = -1; | |
}; | |
Tokenizer.prototype._emitPartial = function(value){ | |
if(this._baseState !== TEXT){ | |
this._cbs.onattribdata(value); //TODO implement the new event | |
} else { | |
this._cbs.ontext(value); | |
} | |
}; | |
/***/ }, | |
/* 40 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var decodeMap = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"../maps/decode.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())); | |
module.exports = decodeCodePoint; | |
// modified version of https://github.com/mathiasbynens/he/blob/master/src/he.js#L94-L119 | |
function decodeCodePoint(codePoint){ | |
if((codePoint >= 0xD800 && codePoint <= 0xDFFF) || codePoint > 0x10FFFF){ | |
return "\uFFFD"; | |
} | |
if(codePoint in decodeMap){ | |
codePoint = decodeMap[codePoint]; | |
} | |
var output = ""; | |
if(codePoint > 0xFFFF){ | |
codePoint -= 0x10000; | |
output += String.fromCharCode(codePoint >>> 10 & 0x3FF | 0xD800); | |
codePoint = 0xDC00 | codePoint & 0x3FF; | |
} | |
output += String.fromCharCode(codePoint); | |
return output; | |
} | |
/***/ }, | |
/* 41 */, | |
/* 42 */, | |
/* 43 */, | |
/* 44 */, | |
/* 45 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* WEBPACK VAR INJECTION */(function(global, process) {// Copyright Joyent, Inc. and other Node contributors. | |
// | |
// Permission is hereby granted, free of charge, to any person obtaining a | |
// copy of this software and associated documentation files (the | |
// "Software"), to deal in the Software without restriction, including | |
// without limitation the rights to use, copy, modify, merge, publish, | |
// distribute, sublicense, and/or sell copies of the Software, and to permit | |
// persons to whom the Software is furnished to do so, subject to the | |
// following conditions: | |
// | |
// The above copyright notice and this permission notice shall be included | |
// in all copies or substantial portions of the Software. | |
// | |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | |
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN | |
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, | |
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | |
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE | |
// USE OR OTHER DEALINGS IN THE SOFTWARE. | |
var formatRegExp = /%[sdj%]/g; | |
exports.format = function(f) { | |
if (!isString(f)) { | |
var objects = []; | |
for (var i = 0; i < arguments.length; i++) { | |
objects.push(inspect(arguments[i])); | |
} | |
return objects.join(' '); | |
} | |
var i = 1; | |
var args = arguments; | |
var len = args.length; | |
var str = String(f).replace(formatRegExp, function(x) { | |
if (x === '%%') return '%'; | |
if (i >= len) return x; | |
switch (x) { | |
case '%s': return String(args[i++]); | |
case '%d': return Number(args[i++]); | |
case '%j': | |
try { | |
return JSON.stringify(args[i++]); | |
} catch (_) { | |
return '[Circular]'; | |
} | |
default: | |
return x; | |
} | |
}); | |
for (var x = args[i]; i < len; x = args[++i]) { | |
if (isNull(x) || !isObject(x)) { | |
str += ' ' + x; | |
} else { | |
str += ' ' + inspect(x); | |
} | |
} | |
return str; | |
}; | |
// Mark that a method should not be used. | |
// Returns a modified function which warns once by default. | |
// If --no-deprecation is set, then it is a no-op. | |
exports.deprecate = function(fn, msg) { | |
// Allow for deprecating things in the process of starting up. | |
if (isUndefined(global.process)) { | |
return function() { | |
return exports.deprecate(fn, msg).apply(this, arguments); | |
}; | |
} | |
if (process.noDeprecation === true) { | |
return fn; | |
} | |
var warned = false; | |
function deprecated() { | |
if (!warned) { | |
if (process.throwDeprecation) { | |
throw new Error(msg); | |
} else if (process.traceDeprecation) { | |
console.trace(msg); | |
} else { | |
console.error(msg); | |
} | |
warned = true; | |
} | |
return fn.apply(this, arguments); | |
} | |
return deprecated; | |
}; | |
var debugs = {}; | |
var debugEnviron; | |
exports.debuglog = function(set) { | |
if (isUndefined(debugEnviron)) | |
debugEnviron = process.env.NODE_DEBUG || ''; | |
set = set.toUpperCase(); | |
if (!debugs[set]) { | |
if (new RegExp('\\b' + set + '\\b', 'i').test(debugEnviron)) { | |
var pid = process.pid; | |
debugs[set] = function() { | |
var msg = exports.format.apply(exports, arguments); | |
console.error('%s %d: %s', set, pid, msg); | |
}; | |
} else { | |
debugs[set] = function() {}; | |
} | |
} | |
return debugs[set]; | |
}; | |
/** | |
* Echos the value of a value. Trys to print the value out | |
* in the best way possible given the different types. | |
* | |
* @param {Object} obj The object to print out. | |
* @param {Object} opts Optional options object that alters the output. | |
*/ | |
/* legacy: obj, showHidden, depth, colors*/ | |
function inspect(obj, opts) { | |
// default options | |
var ctx = { | |
seen: [], | |
stylize: stylizeNoColor | |
}; | |
// legacy... | |
if (arguments.length >= 3) ctx.depth = arguments[2]; | |
if (arguments.length >= 4) ctx.colors = arguments[3]; | |
if (isBoolean(opts)) { | |
// legacy... | |
ctx.showHidden = opts; | |
} else if (opts) { | |
// got an "options" object | |
exports._extend(ctx, opts); | |
} | |
// set default options | |
if (isUndefined(ctx.showHidden)) ctx.showHidden = false; | |
if (isUndefined(ctx.depth)) ctx.depth = 2; | |
if (isUndefined(ctx.colors)) ctx.colors = false; | |
if (isUndefined(ctx.customInspect)) ctx.customInspect = true; | |
if (ctx.colors) ctx.stylize = stylizeWithColor; | |
return formatValue(ctx, obj, ctx.depth); | |
} | |
exports.inspect = inspect; | |
// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics | |
inspect.colors = { | |
'bold' : [1, 22], | |
'italic' : [3, 23], | |
'underline' : [4, 24], | |
'inverse' : [7, 27], | |
'white' : [37, 39], | |
'grey' : [90, 39], | |
'black' : [30, 39], | |
'blue' : [34, 39], | |
'cyan' : [36, 39], | |
'green' : [32, 39], | |
'magenta' : [35, 39], | |
'red' : [31, 39], | |
'yellow' : [33, 39] | |
}; | |
// Don't use 'blue' not visible on cmd.exe | |
inspect.styles = { | |
'special': 'cyan', | |
'number': 'yellow', | |
'boolean': 'yellow', | |
'undefined': 'grey', | |
'null': 'bold', | |
'string': 'green', | |
'date': 'magenta', | |
// "name": intentionally not styling | |
'regexp': 'red' | |
}; | |
function stylizeWithColor(str, styleType) { | |
var style = inspect.styles[styleType]; | |
if (style) { | |
return '\u001b[' + inspect.colors[style][0] + 'm' + str + | |
'\u001b[' + inspect.colors[style][1] + 'm'; | |
} else { | |
return str; | |
} | |
} | |
function stylizeNoColor(str, styleType) { | |
return str; | |
} | |
function arrayToHash(array) { | |
var hash = {}; | |
array.forEach(function(val, idx) { | |
hash[val] = true; | |
}); | |
return hash; | |
} | |
function formatValue(ctx, value, recurseTimes) { | |
// Provide a hook for user-specified inspect functions. | |
// Check that value is an object with an inspect function on it | |
if (ctx.customInspect && | |
value && | |
isFunction(value.inspect) && | |
// Filter out the util module, it's inspect function is special | |
value.inspect !== exports.inspect && | |
// Also filter out any prototype objects using the circular check. | |
!(value.constructor && value.constructor.prototype === value)) { | |
var ret = value.inspect(recurseTimes, ctx); | |
if (!isString(ret)) { | |
ret = formatValue(ctx, ret, recurseTimes); | |
} | |
return ret; | |
} | |
// Primitive types cannot have properties | |
var primitive = formatPrimitive(ctx, value); | |
if (primitive) { | |
return primitive; | |
} | |
// Look up the keys of the object. | |
var keys = Object.keys(value); | |
var visibleKeys = arrayToHash(keys); | |
if (ctx.showHidden) { | |
keys = Object.getOwnPropertyNames(value); | |
} | |
// IE doesn't make error fields non-enumerable | |
// http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx | |
if (isError(value) | |
&& (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) { | |
return formatError(value); | |
} | |
// Some type of object without properties can be shortcutted. | |
if (keys.length === 0) { | |
if (isFunction(value)) { | |
var name = value.name ? ': ' + value.name : ''; | |
return ctx.stylize('[Function' + name + ']', 'special'); | |
} | |
if (isRegExp(value)) { | |
return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp'); | |
} | |
if (isDate(value)) { | |
return ctx.stylize(Date.prototype.toString.call(value), 'date'); | |
} | |
if (isError(value)) { | |
return formatError(value); | |
} | |
} | |
var base = '', array = false, braces = ['{', '}']; | |
// Make Array say that they are Array | |
if (isArray(value)) { | |
array = true; | |
braces = ['[', ']']; | |
} | |
// Make functions say that they are functions | |
if (isFunction(value)) { | |
var n = value.name ? ': ' + value.name : ''; | |
base = ' [Function' + n + ']'; | |
} | |
// Make RegExps say that they are RegExps | |
if (isRegExp(value)) { | |
base = ' ' + RegExp.prototype.toString.call(value); | |
} | |
// Make dates with properties first say the date | |
if (isDate(value)) { | |
base = ' ' + Date.prototype.toUTCString.call(value); | |
} | |
// Make error with message first say the error | |
if (isError(value)) { | |
base = ' ' + formatError(value); | |
} | |
if (keys.length === 0 && (!array || value.length == 0)) { | |
return braces[0] + base + braces[1]; | |
} | |
if (recurseTimes < 0) { | |
if (isRegExp(value)) { | |
return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp'); | |
} else { | |
return ctx.stylize('[Object]', 'special'); | |
} | |
} | |
ctx.seen.push(value); | |
var output; | |
if (array) { | |
output = formatArray(ctx, value, recurseTimes, visibleKeys, keys); | |
} else { | |
output = keys.map(function(key) { | |
return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array); | |
}); | |
} | |
ctx.seen.pop(); | |
return reduceToSingleString(output, base, braces); | |
} | |
function formatPrimitive(ctx, value) { | |
if (isUndefined(value)) | |
return ctx.stylize('undefined', 'undefined'); | |
if (isString(value)) { | |
var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '') | |
.replace(/'/g, "\\'") | |
.replace(/\\"/g, '"') + '\''; | |
return ctx.stylize(simple, 'string'); | |
} | |
if (isNumber(value)) | |
return ctx.stylize('' + value, 'number'); | |
if (isBoolean(value)) | |
return ctx.stylize('' + value, 'boolean'); | |
// For some reason typeof null is "object", so special case here. | |
if (isNull(value)) | |
return ctx.stylize('null', 'null'); | |
} | |
function formatError(value) { | |
return '[' + Error.prototype.toString.call(value) + ']'; | |
} | |
function formatArray(ctx, value, recurseTimes, visibleKeys, keys) { | |
var output = []; | |
for (var i = 0, l = value.length; i < l; ++i) { | |
if (hasOwnProperty(value, String(i))) { | |
output.push(formatProperty(ctx, value, recurseTimes, visibleKeys, | |
String(i), true)); | |
} else { | |
output.push(''); | |
} | |
} | |
keys.forEach(function(key) { | |
if (!key.match(/^\d+$/)) { | |
output.push(formatProperty(ctx, value, recurseTimes, visibleKeys, | |
key, true)); | |
} | |
}); | |
return output; | |
} | |
function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) { | |
var name, str, desc; | |
desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] }; | |
if (desc.get) { | |
if (desc.set) { | |
str = ctx.stylize('[Getter/Setter]', 'special'); | |
} else { | |
str = ctx.stylize('[Getter]', 'special'); | |
} | |
} else { | |
if (desc.set) { | |
str = ctx.stylize('[Setter]', 'special'); | |
} | |
} | |
if (!hasOwnProperty(visibleKeys, key)) { | |
name = '[' + key + ']'; | |
} | |
if (!str) { | |
if (ctx.seen.indexOf(desc.value) < 0) { | |
if (isNull(recurseTimes)) { | |
str = formatValue(ctx, desc.value, null); | |
} else { | |
str = formatValue(ctx, desc.value, recurseTimes - 1); | |
} | |
if (str.indexOf('\n') > -1) { | |
if (array) { | |
str = str.split('\n').map(function(line) { | |
return ' ' + line; | |
}).join('\n').substr(2); | |
} else { | |
str = '\n' + str.split('\n').map(function(line) { | |
return ' ' + line; | |
}).join('\n'); | |
} | |
} | |
} else { | |
str = ctx.stylize('[Circular]', 'special'); | |
} | |
} | |
if (isUndefined(name)) { | |
if (array && key.match(/^\d+$/)) { | |
return str; | |
} | |
name = JSON.stringify('' + key); | |
if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) { | |
name = name.substr(1, name.length - 2); | |
name = ctx.stylize(name, 'name'); | |
} else { | |
name = name.replace(/'/g, "\\'") | |
.replace(/\\"/g, '"') | |
.replace(/(^"|"$)/g, "'"); | |
name = ctx.stylize(name, 'string'); | |
} | |
} | |
return name + ': ' + str; | |
} | |
function reduceToSingleString(output, base, braces) { | |
var numLinesEst = 0; | |
var length = output.reduce(function(prev, cur) { | |
numLinesEst++; | |
if (cur.indexOf('\n') >= 0) numLinesEst++; | |
return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1; | |
}, 0); | |
if (length > 60) { | |
return braces[0] + | |
(base === '' ? '' : base + '\n ') + | |
' ' + | |
output.join(',\n ') + | |
' ' + | |
braces[1]; | |
} | |
return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1]; | |
} | |
// NOTE: These type checking functions intentionally don't use `instanceof` | |
// because it is fragile and can be easily faked with `Object.create()`. | |
function isArray(ar) { | |
return Array.isArray(ar); | |
} | |
exports.isArray = isArray; | |
function isBoolean(arg) { | |
return typeof arg === 'boolean'; | |
} | |
exports.isBoolean = isBoolean; | |
function isNull(arg) { | |
return arg === null; | |
} | |
exports.isNull = isNull; | |
function isNullOrUndefined(arg) { | |
return arg == null; | |
} | |
exports.isNullOrUndefined = isNullOrUndefined; | |
function isNumber(arg) { | |
return typeof arg === 'number'; | |
} | |
exports.isNumber = isNumber; | |
function isString(arg) { | |
return typeof arg === 'string'; | |
} | |
exports.isString = isString; | |
function isSymbol(arg) { | |
return typeof arg === 'symbol'; | |
} | |
exports.isSymbol = isSymbol; | |
function isUndefined(arg) { | |
return arg === void 0; | |
} | |
exports.isUndefined = isUndefined; | |
function isRegExp(re) { | |
return isObject(re) && objectToString(re) === '[object RegExp]'; | |
} | |
exports.isRegExp = isRegExp; | |
function isObject(arg) { | |
return typeof arg === 'object' && arg !== null; | |
} | |
exports.isObject = isObject; | |
function isDate(d) { | |
return isObject(d) && objectToString(d) === '[object Date]'; | |
} | |
exports.isDate = isDate; | |
function isError(e) { | |
return isObject(e) && | |
(objectToString(e) === '[object Error]' || e instanceof Error); | |
} | |
exports.isError = isError; | |
function isFunction(arg) { | |
return typeof arg === 'function'; | |
} | |
exports.isFunction = isFunction; | |
function isPrimitive(arg) { | |
return arg === null || | |
typeof arg === 'boolean' || | |
typeof arg === 'number' || | |
typeof arg === 'string' || | |
typeof arg === 'symbol' || // ES6 symbol | |
typeof arg === 'undefined'; | |
} | |
exports.isPrimitive = isPrimitive; | |
exports.isBuffer = __webpack_require__(47); | |
function objectToString(o) { | |
return Object.prototype.toString.call(o); | |
} | |
function pad(n) { | |
return n < 10 ? '0' + n.toString(10) : n.toString(10); | |
} | |
var months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', | |
'Oct', 'Nov', 'Dec']; | |
// 26 Feb 16:19:34 | |
function timestamp() { | |
var d = new Date(); | |
var time = [pad(d.getHours()), | |
pad(d.getMinutes()), | |
pad(d.getSeconds())].join(':'); | |
return [d.getDate(), months[d.getMonth()], time].join(' '); | |
} | |
// log is just a thin wrapper to console.log that prepends a timestamp | |
exports.log = function() { | |
console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments)); | |
}; | |
/** | |
* Inherit the prototype methods from one constructor into another. | |
* | |
* The Function.prototype.inherits from lang.js rewritten as a standalone | |
* function (not on Function.prototype). NOTE: If this file is to be loaded | |
* during bootstrapping this function needs to be rewritten using some native | |
* functions as prototype setup using normal JavaScript does not work as | |
* expected during bootstrapping (see mirror.js in r114903). | |
* | |
* @param {function} ctor Constructor function which needs to inherit the | |
* prototype. | |
* @param {function} superCtor Constructor function to inherit prototype from. | |
*/ | |
exports.inherits = __webpack_require__(48); | |
exports._extend = function(origin, add) { | |
// Don't do anything if add isn't an object | |
if (!add || !isObject(add)) return origin; | |
var keys = Object.keys(add); | |
var i = keys.length; | |
while (i--) { | |
origin[keys[i]] = add[keys[i]]; | |
} | |
return origin; | |
}; | |
function hasOwnProperty(obj, prop) { | |
return Object.prototype.hasOwnProperty.call(obj, prop); | |
} | |
/* WEBPACK VAR INJECTION */}.call(exports, (function() { return this; }()), __webpack_require__(46))) | |
/***/ }, | |
/* 46 */ | |
/***/ function(module, exports) { | |
// shim for using process in browser | |
var process = module.exports = {}; | |
var queue = []; | |
var draining = false; | |
var currentQueue; | |
var queueIndex = -1; | |
function cleanUpNextTick() { | |
draining = false; | |
if (currentQueue.length) { | |
queue = currentQueue.concat(queue); | |
} else { | |
queueIndex = -1; | |
} | |
if (queue.length) { | |
drainQueue(); | |
} | |
} | |
function drainQueue() { | |
if (draining) { | |
return; | |
} | |
var timeout = setTimeout(cleanUpNextTick); | |
draining = true; | |
var len = queue.length; | |
while(len) { | |
currentQueue = queue; | |
queue = []; | |
while (++queueIndex < len) { | |
if (currentQueue) { | |
currentQueue[queueIndex].run(); | |
} | |
} | |
queueIndex = -1; | |
len = queue.length; | |
} | |
currentQueue = null; | |
draining = false; | |
clearTimeout(timeout); | |
} | |
process.nextTick = function (fun) { | |
var args = new Array(arguments.length - 1); | |
if (arguments.length > 1) { | |
for (var i = 1; i < arguments.length; i++) { | |
args[i - 1] = arguments[i]; | |
} | |
} | |
queue.push(new Item(fun, args)); | |
if (queue.length === 1 && !draining) { | |
setTimeout(drainQueue, 0); | |
} | |
}; | |
// v8 likes predictible objects | |
function Item(fun, array) { | |
this.fun = fun; | |
this.array = array; | |
} | |
Item.prototype.run = function () { | |
this.fun.apply(null, this.array); | |
}; | |
process.title = 'browser'; | |
process.browser = true; | |
process.env = {}; | |
process.argv = []; | |
process.version = ''; // empty string to avoid regexp issues | |
process.versions = {}; | |
function noop() {} | |
process.on = noop; | |
process.addListener = noop; | |
process.once = noop; | |
process.off = noop; | |
process.removeListener = noop; | |
process.removeAllListeners = noop; | |
process.emit = noop; | |
process.binding = function (name) { | |
throw new Error('process.binding is not supported'); | |
}; | |
process.cwd = function () { return '/' }; | |
process.chdir = function (dir) { | |
throw new Error('process.chdir is not supported'); | |
}; | |
process.umask = function() { return 0; }; | |
/***/ }, | |
/* 47 */ | |
/***/ function(module, exports) { | |
module.exports = function isBuffer(arg) { | |
return arg && typeof arg === 'object' | |
&& typeof arg.copy === 'function' | |
&& typeof arg.fill === 'function' | |
&& typeof arg.readUInt8 === 'function'; | |
} | |
/***/ }, | |
/* 48 */ | |
/***/ function(module, exports) { | |
if (typeof Object.create === 'function') { | |
// implementation from standard node.js 'util' module | |
module.exports = function inherits(ctor, superCtor) { | |
ctor.super_ = superCtor | |
ctor.prototype = Object.create(superCtor.prototype, { | |
constructor: { | |
value: ctor, | |
enumerable: false, | |
writable: true, | |
configurable: true | |
} | |
}); | |
}; | |
} else { | |
// old school shim for old browsers | |
module.exports = function inherits(ctor, superCtor) { | |
ctor.super_ = superCtor | |
var TempCtor = function () {} | |
TempCtor.prototype = superCtor.prototype | |
ctor.prototype = new TempCtor() | |
ctor.prototype.constructor = ctor | |
} | |
} | |
/***/ }, | |
/* 49 */ | |
/***/ function(module, exports) { | |
// Copyright Joyent, Inc. and other Node contributors. | |
// | |
// Permission is hereby granted, free of charge, to any person obtaining a | |
// copy of this software and associated documentation files (the | |
// "Software"), to deal in the Software without restriction, including | |
// without limitation the rights to use, copy, modify, merge, publish, | |
// distribute, sublicense, and/or sell copies of the Software, and to permit | |
// persons to whom the Software is furnished to do so, subject to the | |
// following conditions: | |
// | |
// The above copyright notice and this permission notice shall be included | |
// in all copies or substantial portions of the Software. | |
// | |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | |
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN | |
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, | |
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | |
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE | |
// USE OR OTHER DEALINGS IN THE SOFTWARE. | |
function EventEmitter() { | |
this._events = this._events || {}; | |
this._maxListeners = this._maxListeners || undefined; | |
} | |
module.exports = EventEmitter; | |
// Backwards-compat with node 0.10.x | |
EventEmitter.EventEmitter = EventEmitter; | |
EventEmitter.prototype._events = undefined; | |
EventEmitter.prototype._maxListeners = undefined; | |
// By default EventEmitters will print a warning if more than 10 listeners are | |
// added to it. This is a useful default which helps finding memory leaks. | |
EventEmitter.defaultMaxListeners = 10; | |
// Obviously not all Emitters should be limited to 10. This function allows | |
// that to be increased. Set to zero for unlimited. | |
EventEmitter.prototype.setMaxListeners = function(n) { | |
if (!isNumber(n) || n < 0 || isNaN(n)) | |
throw TypeError('n must be a positive number'); | |
this._maxListeners = n; | |
return this; | |
}; | |
EventEmitter.prototype.emit = function(type) { | |
var er, handler, len, args, i, listeners; | |
if (!this._events) | |
this._events = {}; | |
// If there is no 'error' event listener then throw. | |
if (type === 'error') { | |
if (!this._events.error || | |
(isObject(this._events.error) && !this._events.error.length)) { | |
er = arguments[1]; | |
if (er instanceof Error) { | |
throw er; // Unhandled 'error' event | |
} | |
throw TypeError('Uncaught, unspecified "error" event.'); | |
} | |
} | |
handler = this._events[type]; | |
if (isUndefined(handler)) | |
return false; | |
if (isFunction(handler)) { | |
switch (arguments.length) { | |
// fast cases | |
case 1: | |
handler.call(this); | |
break; | |
case 2: | |
handler.call(this, arguments[1]); | |
break; | |
case 3: | |
handler.call(this, arguments[1], arguments[2]); | |
break; | |
// slower | |
default: | |
args = Array.prototype.slice.call(arguments, 1); | |
handler.apply(this, args); | |
} | |
} else if (isObject(handler)) { | |
args = Array.prototype.slice.call(arguments, 1); | |
listeners = handler.slice(); | |
len = listeners.length; | |
for (i = 0; i < len; i++) | |
listeners[i].apply(this, args); | |
} | |
return true; | |
}; | |
EventEmitter.prototype.addListener = function(type, listener) { | |
var m; | |
if (!isFunction(listener)) | |
throw TypeError('listener must be a function'); | |
if (!this._events) | |
this._events = {}; | |
// To avoid recursion in the case that type === "newListener"! Before | |
// adding it to the listeners, first emit "newListener". | |
if (this._events.newListener) | |
this.emit('newListener', type, | |
isFunction(listener.listener) ? | |
listener.listener : listener); | |
if (!this._events[type]) | |
// Optimize the case of one listener. Don't need the extra array object. | |
this._events[type] = listener; | |
else if (isObject(this._events[type])) | |
// If we've already got an array, just append. | |
this._events[type].push(listener); | |
else | |
// Adding the second element, need to change to array. | |
this._events[type] = [this._events[type], listener]; | |
// Check for listener leak | |
if (isObject(this._events[type]) && !this._events[type].warned) { | |
if (!isUndefined(this._maxListeners)) { | |
m = this._maxListeners; | |
} else { | |
m = EventEmitter.defaultMaxListeners; | |
} | |
if (m && m > 0 && this._events[type].length > m) { | |
this._events[type].warned = true; | |
console.error('(node) warning: possible EventEmitter memory ' + | |
'leak detected. %d listeners added. ' + | |
'Use emitter.setMaxListeners() to increase limit.', | |
this._events[type].length); | |
if (typeof console.trace === 'function') { | |
// not supported in IE 10 | |
console.trace(); | |
} | |
} | |
} | |
return this; | |
}; | |
EventEmitter.prototype.on = EventEmitter.prototype.addListener; | |
EventEmitter.prototype.once = function(type, listener) { | |
if (!isFunction(listener)) | |
throw TypeError('listener must be a function'); | |
var fired = false; | |
function g() { | |
this.removeListener(type, g); | |
if (!fired) { | |
fired = true; | |
listener.apply(this, arguments); | |
} | |
} | |
g.listener = listener; | |
this.on(type, g); | |
return this; | |
}; | |
// emits a 'removeListener' event iff the listener was removed | |
EventEmitter.prototype.removeListener = function(type, listener) { | |
var list, position, length, i; | |
if (!isFunction(listener)) | |
throw TypeError('listener must be a function'); | |
if (!this._events || !this._events[type]) | |
return this; | |
list = this._events[type]; | |
length = list.length; | |
position = -1; | |
if (list === listener || | |
(isFunction(list.listener) && list.listener === listener)) { | |
delete this._events[type]; | |
if (this._events.removeListener) | |
this.emit('removeListener', type, listener); | |
} else if (isObject(list)) { | |
for (i = length; i-- > 0;) { | |
if (list[i] === listener || | |
(list[i].listener && list[i].listener === listener)) { | |
position = i; | |
break; | |
} | |
} | |
if (position < 0) | |
return this; | |
if (list.length === 1) { | |
list.length = 0; | |
delete this._events[type]; | |
} else { | |
list.splice(position, 1); | |
} | |
if (this._events.removeListener) | |
this.emit('removeListener', type, listener); | |
} | |
return this; | |
}; | |
EventEmitter.prototype.removeAllListeners = function(type) { | |
var key, listeners; | |
if (!this._events) | |
return this; | |
// not listening for removeListener, no need to emit | |
if (!this._events.removeListener) { | |
if (arguments.length === 0) | |
this._events = {}; | |
else if (this._events[type]) | |
delete this._events[type]; | |
return this; | |
} | |
// emit removeListener for all listeners on all events | |
if (arguments.length === 0) { | |
for (key in this._events) { | |
if (key === 'removeListener') continue; | |
this.removeAllListeners(key); | |
} | |
this.removeAllListeners('removeListener'); | |
this._events = {}; | |
return this; | |
} | |
listeners = this._events[type]; | |
if (isFunction(listeners)) { | |
this.removeListener(type, listeners); | |
} else if (listeners) { | |
// LIFO order | |
while (listeners.length) | |
this.removeListener(type, listeners[listeners.length - 1]); | |
} | |
delete this._events[type]; | |
return this; | |
}; | |
EventEmitter.prototype.listeners = function(type) { | |
var ret; | |
if (!this._events || !this._events[type]) | |
ret = []; | |
else if (isFunction(this._events[type])) | |
ret = [this._events[type]]; | |
else | |
ret = this._events[type].slice(); | |
return ret; | |
}; | |
EventEmitter.prototype.listenerCount = function(type) { | |
if (this._events) { | |
var evlistener = this._events[type]; | |
if (isFunction(evlistener)) | |
return 1; | |
else if (evlistener) | |
return evlistener.length; | |
} | |
return 0; | |
}; | |
EventEmitter.listenerCount = function(emitter, type) { | |
return emitter.listenerCount(type); | |
}; | |
function isFunction(arg) { | |
return typeof arg === 'function'; | |
} | |
function isNumber(arg) { | |
return typeof arg === 'number'; | |
} | |
function isObject(arg) { | |
return typeof arg === 'object' && arg !== null; | |
} | |
function isUndefined(arg) { | |
return arg === void 0; | |
} | |
/***/ }, | |
/* 50 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var ElementType = __webpack_require__(51); | |
var re_whitespace = /\s+/g; | |
var NodePrototype = __webpack_require__(52); | |
var ElementPrototype = __webpack_require__(53); | |
function DomHandler(callback, options, elementCB){ | |
if(typeof callback === "object"){ | |
elementCB = options; | |
options = callback; | |
callback = null; | |
} else if(typeof options === "function"){ | |
elementCB = options; | |
options = defaultOpts; | |
} | |
this._callback = callback; | |
this._options = options || defaultOpts; | |
this._elementCB = elementCB; | |
this.dom = []; | |
this._done = false; | |
this._tagStack = []; | |
this._parser = this._parser || null; | |
} | |
//default options | |
var defaultOpts = { | |
normalizeWhitespace: false, //Replace all whitespace with single spaces | |
withStartIndices: false, //Add startIndex properties to nodes | |
}; | |
DomHandler.prototype.onparserinit = function(parser){ | |
this._parser = parser; | |
}; | |
//Resets the handler back to starting state | |
DomHandler.prototype.onreset = function(){ | |
DomHandler.call(this, this._callback, this._options, this._elementCB); | |
}; | |
//Signals the handler that parsing is done | |
DomHandler.prototype.onend = function(){ | |
if(this._done) return; | |
this._done = true; | |
this._parser = null; | |
this._handleCallback(null); | |
}; | |
DomHandler.prototype._handleCallback = | |
DomHandler.prototype.onerror = function(error){ | |
if(typeof this._callback === "function"){ | |
this._callback(error, this.dom); | |
} else { | |
if(error) throw error; | |
} | |
}; | |
DomHandler.prototype.onclosetag = function(){ | |
//if(this._tagStack.pop().name !== name) this._handleCallback(Error("Tagname didn't match!")); | |
var elem = this._tagStack.pop(); | |
if(this._elementCB) this._elementCB(elem); | |
}; | |
DomHandler.prototype._addDomElement = function(element){ | |
var parent = this._tagStack[this._tagStack.length - 1]; | |
var siblings = parent ? parent.children : this.dom; | |
var previousSibling = siblings[siblings.length - 1]; | |
element.next = null; | |
if(this._options.withStartIndices){ | |
element.startIndex = this._parser.startIndex; | |
} | |
if (this._options.withDomLvl1) { | |
element.__proto__ = element.type === "tag" ? ElementPrototype : NodePrototype; | |
} | |
if(previousSibling){ | |
element.prev = previousSibling; | |
previousSibling.next = element; | |
} else { | |
element.prev = null; | |
} | |
siblings.push(element); | |
element.parent = parent || null; | |
}; | |
DomHandler.prototype.onopentag = function(name, attribs){ | |
var element = { | |
type: name === "script" ? ElementType.Script : name === "style" ? ElementType.Style : ElementType.Tag, | |
name: name, | |
attribs: attribs, | |
children: [] | |
}; | |
this._addDomElement(element); | |
this._tagStack.push(element); | |
}; | |
DomHandler.prototype.ontext = function(data){ | |
//the ignoreWhitespace is officially dropped, but for now, | |
//it's an alias for normalizeWhitespace | |
var normalize = this._options.normalizeWhitespace || this._options.ignoreWhitespace; | |
var lastTag; | |
if(!this._tagStack.length && this.dom.length && (lastTag = this.dom[this.dom.length-1]).type === ElementType.Text){ | |
if(normalize){ | |
lastTag.data = (lastTag.data + data).replace(re_whitespace, " "); | |
} else { | |
lastTag.data += data; | |
} | |
} else { | |
if( | |
this._tagStack.length && | |
(lastTag = this._tagStack[this._tagStack.length - 1]) && | |
(lastTag = lastTag.children[lastTag.children.length - 1]) && | |
lastTag.type === ElementType.Text | |
){ | |
if(normalize){ | |
lastTag.data = (lastTag.data + data).replace(re_whitespace, " "); | |
} else { | |
lastTag.data += data; | |
} | |
} else { | |
if(normalize){ | |
data = data.replace(re_whitespace, " "); | |
} | |
this._addDomElement({ | |
data: data, | |
type: ElementType.Text | |
}); | |
} | |
} | |
}; | |
DomHandler.prototype.oncomment = function(data){ | |
var lastTag = this._tagStack[this._tagStack.length - 1]; | |
if(lastTag && lastTag.type === ElementType.Comment){ | |
lastTag.data += data; | |
return; | |
} | |
var element = { | |
data: data, | |
type: ElementType.Comment | |
}; | |
this._addDomElement(element); | |
this._tagStack.push(element); | |
}; | |
DomHandler.prototype.oncdatastart = function(){ | |
var element = { | |
children: [{ | |
data: "", | |
type: ElementType.Text | |
}], | |
type: ElementType.CDATA | |
}; | |
this._addDomElement(element); | |
this._tagStack.push(element); | |
}; | |
DomHandler.prototype.oncommentend = DomHandler.prototype.oncdataend = function(){ | |
this._tagStack.pop(); | |
}; | |
DomHandler.prototype.onprocessinginstruction = function(name, data){ | |
this._addDomElement({ | |
name: name, | |
data: data, | |
type: ElementType.Directive | |
}); | |
}; | |
module.exports = DomHandler; | |
/***/ }, | |
/* 51 */ | |
/***/ function(module, exports) { | |
//Types of elements found in the DOM | |
module.exports = { | |
Text: "text", //Text | |
Directive: "directive", //<? ... ?> | |
Comment: "comment", //<!-- ... --> | |
Script: "script", //<script> tags | |
Style: "style", //<style> tags | |
Tag: "tag", //Any tag | |
CDATA: "cdata", //<![CDATA[ ... ]]> | |
Doctype: "doctype", | |
isTag: function(elem){ | |
return elem.type === "tag" || elem.type === "script" || elem.type === "style"; | |
} | |
}; | |
/***/ }, | |
/* 52 */ | |
/***/ function(module, exports) { | |
// This object will be used as the prototype for Nodes when creating a | |
// DOM-Level-1-compliant structure. | |
var NodePrototype = module.exports = { | |
get firstChild() { | |
var children = this.children; | |
return children && children[0] || null; | |
}, | |
get lastChild() { | |
var children = this.children; | |
return children && children[children.length - 1] || null; | |
}, | |
get nodeType() { | |
return nodeTypes[this.type] || nodeTypes.element; | |
} | |
}; | |
var domLvl1 = { | |
tagName: "name", | |
childNodes: "children", | |
parentNode: "parent", | |
previousSibling: "prev", | |
nextSibling: "next", | |
nodeValue: "data" | |
}; | |
var nodeTypes = { | |
element: 1, | |
text: 3, | |
cdata: 4, | |
comment: 8 | |
}; | |
Object.keys(domLvl1).forEach(function(key) { | |
var shorthand = domLvl1[key]; | |
Object.defineProperty(NodePrototype, key, { | |
get: function() { | |
return this[shorthand] || null; | |
}, | |
set: function(val) { | |
this[shorthand] = val; | |
return val; | |
} | |
}); | |
}); | |
/***/ }, | |
/* 53 */ | |
/***/ function(module, exports, __webpack_require__) { | |
// DOM-Level-1-compliant structure | |
var NodePrototype = __webpack_require__(52); | |
var ElementPrototype = module.exports = Object.create(NodePrototype); | |
var domLvl1 = { | |
tagName: "name" | |
}; | |
Object.keys(domLvl1).forEach(function(key) { | |
var shorthand = domLvl1[key]; | |
Object.defineProperty(ElementPrototype, key, { | |
get: function() { | |
return this[shorthand] || null; | |
}, | |
set: function(val) { | |
this[shorthand] = val; | |
return val; | |
} | |
}); | |
}); | |
/***/ }, | |
/* 54 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var index = __webpack_require__(37), | |
DomHandler = index.DomHandler, | |
DomUtils = index.DomUtils; | |
//TODO: make this a streamable handler | |
function FeedHandler(callback, options){ | |
this.init(callback, options); | |
} | |
__webpack_require__(45).inherits(FeedHandler, DomHandler); | |
FeedHandler.prototype.init = DomHandler; | |
function getElements(what, where){ | |
return DomUtils.getElementsByTagName(what, where, true); | |
} | |
function getOneElement(what, where){ | |
return DomUtils.getElementsByTagName(what, where, true, 1)[0]; | |
} | |
function fetch(what, where, recurse){ | |
return DomUtils.getText( | |
DomUtils.getElementsByTagName(what, where, recurse, 1) | |
).trim(); | |
} | |
function addConditionally(obj, prop, what, where, recurse){ | |
var tmp = fetch(what, where, recurse); | |
if(tmp) obj[prop] = tmp; | |
} | |
var isValidFeed = function(value){ | |
return value === "rss" || value === "feed" || value === "rdf:RDF"; | |
}; | |
FeedHandler.prototype.onend = function(){ | |
var feed = {}, | |
feedRoot = getOneElement(isValidFeed, this.dom), | |
tmp, childs; | |
if(feedRoot){ | |
if(feedRoot.name === "feed"){ | |
childs = feedRoot.children; | |
feed.type = "atom"; | |
addConditionally(feed, "id", "id", childs); | |
addConditionally(feed, "title", "title", childs); | |
if((tmp = getOneElement("link", childs)) && (tmp = tmp.attribs) && (tmp = tmp.href)) feed.link = tmp; | |
addConditionally(feed, "description", "subtitle", childs); | |
if((tmp = fetch("updated", childs))) feed.updated = new Date(tmp); | |
addConditionally(feed, "author", "email", childs, true); | |
feed.items = getElements("entry", childs).map(function(item){ | |
var entry = {}, tmp; | |
item = item.children; | |
addConditionally(entry, "id", "id", item); | |
addConditionally(entry, "title", "title", item); | |
if((tmp = getOneElement("link", item)) && (tmp = tmp.attribs) && (tmp = tmp.href)) entry.link = tmp; | |
if((tmp = fetch("summary", item) || fetch("content", item))) entry.description = tmp; | |
if((tmp = fetch("updated", item))) entry.pubDate = new Date(tmp); | |
return entry; | |
}); | |
} else { | |
childs = getOneElement("channel", feedRoot.children).children; | |
feed.type = feedRoot.name.substr(0, 3); | |
feed.id = ""; | |
addConditionally(feed, "title", "title", childs); | |
addConditionally(feed, "link", "link", childs); | |
addConditionally(feed, "description", "description", childs); | |
if((tmp = fetch("lastBuildDate", childs))) feed.updated = new Date(tmp); | |
addConditionally(feed, "author", "managingEditor", childs, true); | |
feed.items = getElements("item", feedRoot.children).map(function(item){ | |
var entry = {}, tmp; | |
item = item.children; | |
addConditionally(entry, "id", "guid", item); | |
addConditionally(entry, "title", "title", item); | |
addConditionally(entry, "link", "link", item); | |
addConditionally(entry, "description", "description", item); | |
if((tmp = fetch("pubDate", item))) entry.pubDate = new Date(tmp); | |
return entry; | |
}); | |
} | |
} | |
this.dom = feed; | |
DomHandler.prototype._handleCallback.call( | |
this, feedRoot ? null : Error("couldn't find root of feed") | |
); | |
}; | |
module.exports = FeedHandler; | |
/***/ }, | |
/* 55 */ | |
/***/ function(module, exports, __webpack_require__) { | |
module.exports = Stream; | |
var Parser = __webpack_require__(56); | |
function Stream(options){ | |
Parser.call(this, new Cbs(this), options); | |
} | |
__webpack_require__(45).inherits(Stream, Parser); | |
Stream.prototype.readable = true; | |
function Cbs(scope){ | |
this.scope = scope; | |
} | |
var EVENTS = __webpack_require__(37).EVENTS; | |
Object.keys(EVENTS).forEach(function(name){ | |
if(EVENTS[name] === 0){ | |
Cbs.prototype["on" + name] = function(){ | |
this.scope.emit(name); | |
}; | |
} else if(EVENTS[name] === 1){ | |
Cbs.prototype["on" + name] = function(a){ | |
this.scope.emit(name, a); | |
}; | |
} else if(EVENTS[name] === 2){ | |
Cbs.prototype["on" + name] = function(a, b){ | |
this.scope.emit(name, a, b); | |
}; | |
} else { | |
throw Error("wrong number of arguments!"); | |
} | |
}); | |
/***/ }, | |
/* 56 */ | |
/***/ function(module, exports, __webpack_require__) { | |
module.exports = Stream; | |
var Parser = __webpack_require__(38), | |
WritableStream = __webpack_require__(57).Writable || __webpack_require__(74).Writable; | |
function Stream(cbs, options){ | |
var parser = this._parser = new Parser(cbs, options); | |
WritableStream.call(this, {decodeStrings: false}); | |
this.once("finish", function(){ | |
parser.end(); | |
}); | |
} | |
__webpack_require__(45).inherits(Stream, WritableStream); | |
WritableStream.prototype._write = function(chunk, encoding, cb){ | |
this._parser.write(chunk); | |
cb(); | |
}; | |
/***/ }, | |
/* 57 */ | |
/***/ function(module, exports, __webpack_require__) { | |
// Copyright Joyent, Inc. and other Node contributors. | |
// | |
// Permission is hereby granted, free of charge, to any person obtaining a | |
// copy of this software and associated documentation files (the | |
// "Software"), to deal in the Software without restriction, including | |
// without limitation the rights to use, copy, modify, merge, publish, | |
// distribute, sublicense, and/or sell copies of the Software, and to permit | |
// persons to whom the Software is furnished to do so, subject to the | |
// following conditions: | |
// | |
// The above copyright notice and this permission notice shall be included | |
// in all copies or substantial portions of the Software. | |
// | |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | |
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN | |
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, | |
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | |
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE | |
// USE OR OTHER DEALINGS IN THE SOFTWARE. | |
module.exports = Stream; | |
var EE = __webpack_require__(49).EventEmitter; | |
var inherits = __webpack_require__(58); | |
inherits(Stream, EE); | |
Stream.Readable = __webpack_require__(59); | |
Stream.Writable = __webpack_require__(70); | |
Stream.Duplex = __webpack_require__(71); | |
Stream.Transform = __webpack_require__(72); | |
Stream.PassThrough = __webpack_require__(73); | |
// Backwards-compat with node 0.4.x | |
Stream.Stream = Stream; | |
// old-style streams. Note that the pipe method (the only relevant | |
// part of this class) is overridden in the Readable class. | |
function Stream() { | |
EE.call(this); | |
} | |
Stream.prototype.pipe = function(dest, options) { | |
var source = this; | |
function ondata(chunk) { | |
if (dest.writable) { | |
if (false === dest.write(chunk) && source.pause) { | |
source.pause(); | |
} | |
} | |
} | |
source.on('data', ondata); | |
function ondrain() { | |
if (source.readable && source.resume) { | |
source.resume(); | |
} | |
} | |
dest.on('drain', ondrain); | |
// If the 'end' option is not supplied, dest.end() will be called when | |
// source gets the 'end' or 'close' events. Only dest.end() once. | |
if (!dest._isStdio && (!options || options.end !== false)) { | |
source.on('end', onend); | |
source.on('close', onclose); | |
} | |
var didOnEnd = false; | |
function onend() { | |
if (didOnEnd) return; | |
didOnEnd = true; | |
dest.end(); | |
} | |
function onclose() { | |
if (didOnEnd) return; | |
didOnEnd = true; | |
if (typeof dest.destroy === 'function') dest.destroy(); | |
} | |
// don't leave dangling pipes when there are errors. | |
function onerror(er) { | |
cleanup(); | |
if (EE.listenerCount(this, 'error') === 0) { | |
throw er; // Unhandled stream error in pipe. | |
} | |
} | |
source.on('error', onerror); | |
dest.on('error', onerror); | |
// remove all the event listeners that were added. | |
function cleanup() { | |
source.removeListener('data', ondata); | |
dest.removeListener('drain', ondrain); | |
source.removeListener('end', onend); | |
source.removeListener('close', onclose); | |
source.removeListener('error', onerror); | |
dest.removeListener('error', onerror); | |
source.removeListener('end', cleanup); | |
source.removeListener('close', cleanup); | |
dest.removeListener('close', cleanup); | |
} | |
source.on('end', cleanup); | |
source.on('close', cleanup); | |
dest.on('close', cleanup); | |
dest.emit('pipe', source); | |
// Allow for unix-like usage: A.pipe(B).pipe(C) | |
return dest; | |
}; | |
/***/ }, | |
/* 58 */ | |
/***/ function(module, exports) { | |
if (typeof Object.create === 'function') { | |
// implementation from standard node.js 'util' module | |
module.exports = function inherits(ctor, superCtor) { | |
ctor.super_ = superCtor | |
ctor.prototype = Object.create(superCtor.prototype, { | |
constructor: { | |
value: ctor, | |
enumerable: false, | |
writable: true, | |
configurable: true | |
} | |
}); | |
}; | |
} else { | |
// old school shim for old browsers | |
module.exports = function inherits(ctor, superCtor) { | |
ctor.super_ = superCtor | |
var TempCtor = function () {} | |
TempCtor.prototype = superCtor.prototype | |
ctor.prototype = new TempCtor() | |
ctor.prototype.constructor = ctor | |
} | |
} | |
/***/ }, | |
/* 59 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* WEBPACK VAR INJECTION */(function(process) {exports = module.exports = __webpack_require__(60); | |
exports.Stream = __webpack_require__(57); | |
exports.Readable = exports; | |
exports.Writable = __webpack_require__(66); | |
exports.Duplex = __webpack_require__(65); | |
exports.Transform = __webpack_require__(68); | |
exports.PassThrough = __webpack_require__(69); | |
if (!process.browser && process.env.READABLE_STREAM === 'disable') { | |
module.exports = __webpack_require__(57); | |
} | |
/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(46))) | |
/***/ }, | |
/* 60 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* WEBPACK VAR INJECTION */(function(process) {// Copyright Joyent, Inc. and other Node contributors. | |
// | |
// Permission is hereby granted, free of charge, to any person obtaining a | |
// copy of this software and associated documentation files (the | |
// "Software"), to deal in the Software without restriction, including | |
// without limitation the rights to use, copy, modify, merge, publish, | |
// distribute, sublicense, and/or sell copies of the Software, and to permit | |
// persons to whom the Software is furnished to do so, subject to the | |
// following conditions: | |
// | |
// The above copyright notice and this permission notice shall be included | |
// in all copies or substantial portions of the Software. | |
// | |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | |
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN | |
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, | |
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | |
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE | |
// USE OR OTHER DEALINGS IN THE SOFTWARE. | |
module.exports = Readable; | |
/*<replacement>*/ | |
var isArray = __webpack_require__(61); | |
/*</replacement>*/ | |
/*<replacement>*/ | |
var Buffer = __webpack_require__(33).Buffer; | |
/*</replacement>*/ | |
Readable.ReadableState = ReadableState; | |
var EE = __webpack_require__(49).EventEmitter; | |
/*<replacement>*/ | |
if (!EE.listenerCount) EE.listenerCount = function(emitter, type) { | |
return emitter.listeners(type).length; | |
}; | |
/*</replacement>*/ | |
var Stream = __webpack_require__(57); | |
/*<replacement>*/ | |
var util = __webpack_require__(62); | |
util.inherits = __webpack_require__(63); | |
/*</replacement>*/ | |
var StringDecoder; | |
/*<replacement>*/ | |
var debug = __webpack_require__(64); | |
if (debug && debug.debuglog) { | |
debug = debug.debuglog('stream'); | |
} else { | |
debug = function () {}; | |
} | |
/*</replacement>*/ | |
util.inherits(Readable, Stream); | |
function ReadableState(options, stream) { | |
var Duplex = __webpack_require__(65); | |
options = options || {}; | |
// the point at which it stops calling _read() to fill the buffer | |
// Note: 0 is a valid value, means "don't call _read preemptively ever" | |
var hwm = options.highWaterMark; | |
var defaultHwm = options.objectMode ? 16 : 16 * 1024; | |
this.highWaterMark = (hwm || hwm === 0) ? hwm : defaultHwm; | |
// cast to ints. | |
this.highWaterMark = ~~this.highWaterMark; | |
this.buffer = []; | |
this.length = 0; | |
this.pipes = null; | |
this.pipesCount = 0; | |
this.flowing = null; | |
this.ended = false; | |
this.endEmitted = false; | |
this.reading = false; | |
// a flag to be able to tell if the onwrite cb is called immediately, | |
// or on a later tick. We set this to true at first, because any | |
// actions that shouldn't happen until "later" should generally also | |
// not happen before the first write call. | |
this.sync = true; | |
// whenever we return null, then we set a flag to say | |
// that we're awaiting a 'readable' event emission. | |
this.needReadable = false; | |
this.emittedReadable = false; | |
this.readableListening = false; | |
// object stream flag. Used to make read(n) ignore n and to | |
// make all the buffer merging and length checks go away | |
this.objectMode = !!options.objectMode; | |
if (stream instanceof Duplex) | |
this.objectMode = this.objectMode || !!options.readableObjectMode; | |
// Crypto is kind of old and crusty. Historically, its default string | |
// encoding is 'binary' so we have to make this configurable. | |
// Everything else in the universe uses 'utf8', though. | |
this.defaultEncoding = options.defaultEncoding || 'utf8'; | |
// when piping, we only care about 'readable' events that happen | |
// after read()ing all the bytes and not getting any pushback. | |
this.ranOut = false; | |
// the number of writers that are awaiting a drain event in .pipe()s | |
this.awaitDrain = 0; | |
// if true, a maybeReadMore has been scheduled | |
this.readingMore = false; | |
this.decoder = null; | |
this.encoding = null; | |
if (options.encoding) { | |
if (!StringDecoder) | |
StringDecoder = __webpack_require__(67).StringDecoder; | |
this.decoder = new StringDecoder(options.encoding); | |
this.encoding = options.encoding; | |
} | |
} | |
function Readable(options) { | |
var Duplex = __webpack_require__(65); | |
if (!(this instanceof Readable)) | |
return new Readable(options); | |
this._readableState = new ReadableState(options, this); | |
// legacy | |
this.readable = true; | |
Stream.call(this); | |
} | |
// Manually shove something into the read() buffer. | |
// This returns true if the highWaterMark has not been hit yet, | |
// similar to how Writable.write() returns true if you should | |
// write() some more. | |
Readable.prototype.push = function(chunk, encoding) { | |
var state = this._readableState; | |
if (util.isString(chunk) && !state.objectMode) { | |
encoding = encoding || state.defaultEncoding; | |
if (encoding !== state.encoding) { | |
chunk = new Buffer(chunk, encoding); | |
encoding = ''; | |
} | |
} | |
return readableAddChunk(this, state, chunk, encoding, false); | |
}; | |
// Unshift should *always* be something directly out of read() | |
Readable.prototype.unshift = function(chunk) { | |
var state = this._readableState; | |
return readableAddChunk(this, state, chunk, '', true); | |
}; | |
function readableAddChunk(stream, state, chunk, encoding, addToFront) { | |
var er = chunkInvalid(state, chunk); | |
if (er) { | |
stream.emit('error', er); | |
} else if (util.isNullOrUndefined(chunk)) { | |
state.reading = false; | |
if (!state.ended) | |
onEofChunk(stream, state); | |
} else if (state.objectMode || chunk && chunk.length > 0) { | |
if (state.ended && !addToFront) { | |
var e = new Error('stream.push() after EOF'); | |
stream.emit('error', e); | |
} else if (state.endEmitted && addToFront) { | |
var e = new Error('stream.unshift() after end event'); | |
stream.emit('error', e); | |
} else { | |
if (state.decoder && !addToFront && !encoding) | |
chunk = state.decoder.write(chunk); | |
if (!addToFront) | |
state.reading = false; | |
// if we want the data now, just emit it. | |
if (state.flowing && state.length === 0 && !state.sync) { | |
stream.emit('data', chunk); | |
stream.read(0); | |
} else { | |
// update the buffer info. | |
state.length += state.objectMode ? 1 : chunk.length; | |
if (addToFront) | |
state.buffer.unshift(chunk); | |
else | |
state.buffer.push(chunk); | |
if (state.needReadable) | |
emitReadable(stream); | |
} | |
maybeReadMore(stream, state); | |
} | |
} else if (!addToFront) { | |
state.reading = false; | |
} | |
return needMoreData(state); | |
} | |
// if it's past the high water mark, we can push in some more. | |
// Also, if we have no data yet, we can stand some | |
// more bytes. This is to work around cases where hwm=0, | |
// such as the repl. Also, if the push() triggered a | |
// readable event, and the user called read(largeNumber) such that | |
// needReadable was set, then we ought to push more, so that another | |
// 'readable' event will be triggered. | |
function needMoreData(state) { | |
return !state.ended && | |
(state.needReadable || | |
state.length < state.highWaterMark || | |
state.length === 0); | |
} | |
// backwards compatibility. | |
Readable.prototype.setEncoding = function(enc) { | |
if (!StringDecoder) | |
StringDecoder = __webpack_require__(67).StringDecoder; | |
this._readableState.decoder = new StringDecoder(enc); | |
this._readableState.encoding = enc; | |
return this; | |
}; | |
// Don't raise the hwm > 128MB | |
var MAX_HWM = 0x800000; | |
function roundUpToNextPowerOf2(n) { | |
if (n >= MAX_HWM) { | |
n = MAX_HWM; | |
} else { | |
// Get the next highest power of 2 | |
n--; | |
for (var p = 1; p < 32; p <<= 1) n |= n >> p; | |
n++; | |
} | |
return n; | |
} | |
function howMuchToRead(n, state) { | |
if (state.length === 0 && state.ended) | |
return 0; | |
if (state.objectMode) | |
return n === 0 ? 0 : 1; | |
if (isNaN(n) || util.isNull(n)) { | |
// only flow one buffer at a time | |
if (state.flowing && state.buffer.length) | |
return state.buffer[0].length; | |
else | |
return state.length; | |
} | |
if (n <= 0) | |
return 0; | |
// If we're asking for more than the target buffer level, | |
// then raise the water mark. Bump up to the next highest | |
// power of 2, to prevent increasing it excessively in tiny | |
// amounts. | |
if (n > state.highWaterMark) | |
state.highWaterMark = roundUpToNextPowerOf2(n); | |
// don't have that much. return null, unless we've ended. | |
if (n > state.length) { | |
if (!state.ended) { | |
state.needReadable = true; | |
return 0; | |
} else | |
return state.length; | |
} | |
return n; | |
} | |
// you can override either this method, or the async _read(n) below. | |
Readable.prototype.read = function(n) { | |
debug('read', n); | |
var state = this._readableState; | |
var nOrig = n; | |
if (!util.isNumber(n) || n > 0) | |
state.emittedReadable = false; | |
// if we're doing read(0) to trigger a readable event, but we | |
// already have a bunch of data in the buffer, then just trigger | |
// the 'readable' event and move on. | |
if (n === 0 && | |
state.needReadable && | |
(state.length >= state.highWaterMark || state.ended)) { | |
debug('read: emitReadable', state.length, state.ended); | |
if (state.length === 0 && state.ended) | |
endReadable(this); | |
else | |
emitReadable(this); | |
return null; | |
} | |
n = howMuchToRead(n, state); | |
// if we've ended, and we're now clear, then finish it up. | |
if (n === 0 && state.ended) { | |
if (state.length === 0) | |
endReadable(this); | |
return null; | |
} | |
// All the actual chunk generation logic needs to be | |
// *below* the call to _read. The reason is that in certain | |
// synthetic stream cases, such as passthrough streams, _read | |
// may be a completely synchronous operation which may change | |
// the state of the read buffer, providing enough data when | |
// before there was *not* enough. | |
// | |
// So, the steps are: | |
// 1. Figure out what the state of things will be after we do | |
// a read from the buffer. | |
// | |
// 2. If that resulting state will trigger a _read, then call _read. | |
// Note that this may be asynchronous, or synchronous. Yes, it is | |
// deeply ugly to write APIs this way, but that still doesn't mean | |
// that the Readable class should behave improperly, as streams are | |
// designed to be sync/async agnostic. | |
// Take note if the _read call is sync or async (ie, if the read call | |
// has returned yet), so that we know whether or not it's safe to emit | |
// 'readable' etc. | |
// | |
// 3. Actually pull the requested chunks out of the buffer and return. | |
// if we need a readable event, then we need to do some reading. | |
var doRead = state.needReadable; | |
debug('need readable', doRead); | |
// if we currently have less than the highWaterMark, then also read some | |
if (state.length === 0 || state.length - n < state.highWaterMark) { | |
doRead = true; | |
debug('length less than watermark', doRead); | |
} | |
// however, if we've ended, then there's no point, and if we're already | |
// reading, then it's unnecessary. | |
if (state.ended || state.reading) { | |
doRead = false; | |
debug('reading or ended', doRead); | |
} | |
if (doRead) { | |
debug('do read'); | |
state.reading = true; | |
state.sync = true; | |
// if the length is currently zero, then we *need* a readable event. | |
if (state.length === 0) | |
state.needReadable = true; | |
// call internal read method | |
this._read(state.highWaterMark); | |
state.sync = false; | |
} | |
// If _read pushed data synchronously, then `reading` will be false, | |
// and we need to re-evaluate how much data we can return to the user. | |
if (doRead && !state.reading) | |
n = howMuchToRead(nOrig, state); | |
var ret; | |
if (n > 0) | |
ret = fromList(n, state); | |
else | |
ret = null; | |
if (util.isNull(ret)) { | |
state.needReadable = true; | |
n = 0; | |
} | |
state.length -= n; | |
// If we have nothing in the buffer, then we want to know | |
// as soon as we *do* get something into the buffer. | |
if (state.length === 0 && !state.ended) | |
state.needReadable = true; | |
// If we tried to read() past the EOF, then emit end on the next tick. | |
if (nOrig !== n && state.ended && state.length === 0) | |
endReadable(this); | |
if (!util.isNull(ret)) | |
this.emit('data', ret); | |
return ret; | |
}; | |
function chunkInvalid(state, chunk) { | |
var er = null; | |
if (!util.isBuffer(chunk) && | |
!util.isString(chunk) && | |
!util.isNullOrUndefined(chunk) && | |
!state.objectMode) { | |
er = new TypeError('Invalid non-string/buffer chunk'); | |
} | |
return er; | |
} | |
function onEofChunk(stream, state) { | |
if (state.decoder && !state.ended) { | |
var chunk = state.decoder.end(); | |
if (chunk && chunk.length) { | |
state.buffer.push(chunk); | |
state.length += state.objectMode ? 1 : chunk.length; | |
} | |
} | |
state.ended = true; | |
// emit 'readable' now to make sure it gets picked up. | |
emitReadable(stream); | |
} | |
// Don't emit readable right away in sync mode, because this can trigger | |
// another read() call => stack overflow. This way, it might trigger | |
// a nextTick recursion warning, but that's not so bad. | |
function emitReadable(stream) { | |
var state = stream._readableState; | |
state.needReadable = false; | |
if (!state.emittedReadable) { | |
debug('emitReadable', state.flowing); | |
state.emittedReadable = true; | |
if (state.sync) | |
process.nextTick(function() { | |
emitReadable_(stream); | |
}); | |
else | |
emitReadable_(stream); | |
} | |
} | |
function emitReadable_(stream) { | |
debug('emit readable'); | |
stream.emit('readable'); | |
flow(stream); | |
} | |
// at this point, the user has presumably seen the 'readable' event, | |
// and called read() to consume some data. that may have triggered | |
// in turn another _read(n) call, in which case reading = true if | |
// it's in progress. | |
// However, if we're not ended, or reading, and the length < hwm, | |
// then go ahead and try to read some more preemptively. | |
function maybeReadMore(stream, state) { | |
if (!state.readingMore) { | |
state.readingMore = true; | |
process.nextTick(function() { | |
maybeReadMore_(stream, state); | |
}); | |
} | |
} | |
function maybeReadMore_(stream, state) { | |
var len = state.length; | |
while (!state.reading && !state.flowing && !state.ended && | |
state.length < state.highWaterMark) { | |
debug('maybeReadMore read 0'); | |
stream.read(0); | |
if (len === state.length) | |
// didn't get any data, stop spinning. | |
break; | |
else | |
len = state.length; | |
} | |
state.readingMore = false; | |
} | |
// abstract method. to be overridden in specific implementation classes. | |
// call cb(er, data) where data is <= n in length. | |
// for virtual (non-string, non-buffer) streams, "length" is somewhat | |
// arbitrary, and perhaps not very meaningful. | |
Readable.prototype._read = function(n) { | |
this.emit('error', new Error('not implemented')); | |
}; | |
Readable.prototype.pipe = function(dest, pipeOpts) { | |
var src = this; | |
var state = this._readableState; | |
switch (state.pipesCount) { | |
case 0: | |
state.pipes = dest; | |
break; | |
case 1: | |
state.pipes = [state.pipes, dest]; | |
break; | |
default: | |
state.pipes.push(dest); | |
break; | |
} | |
state.pipesCount += 1; | |
debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts); | |
var doEnd = (!pipeOpts || pipeOpts.end !== false) && | |
dest !== process.stdout && | |
dest !== process.stderr; | |
var endFn = doEnd ? onend : cleanup; | |
if (state.endEmitted) | |
process.nextTick(endFn); | |
else | |
src.once('end', endFn); | |
dest.on('unpipe', onunpipe); | |
function onunpipe(readable) { | |
debug('onunpipe'); | |
if (readable === src) { | |
cleanup(); | |
} | |
} | |
function onend() { | |
debug('onend'); | |
dest.end(); | |
} | |
// when the dest drains, it reduces the awaitDrain counter | |
// on the source. This would be more elegant with a .once() | |
// handler in flow(), but adding and removing repeatedly is | |
// too slow. | |
var ondrain = pipeOnDrain(src); | |
dest.on('drain', ondrain); | |
function cleanup() { | |
debug('cleanup'); | |
// cleanup event handlers once the pipe is broken | |
dest.removeListener('close', onclose); | |
dest.removeListener('finish', onfinish); | |
dest.removeListener('drain', ondrain); | |
dest.removeListener('error', onerror); | |
dest.removeListener('unpipe', onunpipe); | |
src.removeListener('end', onend); | |
src.removeListener('end', cleanup); | |
src.removeListener('data', ondata); | |
// if the reader is waiting for a drain event from this | |
// specific writer, then it would cause it to never start | |
// flowing again. | |
// So, if this is awaiting a drain, then we just call it now. | |
// If we don't know, then assume that we are waiting for one. | |
if (state.awaitDrain && | |
(!dest._writableState || dest._writableState.needDrain)) | |
ondrain(); | |
} | |
src.on('data', ondata); | |
function ondata(chunk) { | |
debug('ondata'); | |
var ret = dest.write(chunk); | |
if (false === ret) { | |
debug('false write response, pause', | |
src._readableState.awaitDrain); | |
src._readableState.awaitDrain++; | |
src.pause(); | |
} | |
} | |
// if the dest has an error, then stop piping into it. | |
// however, don't suppress the throwing behavior for this. | |
function onerror(er) { | |
debug('onerror', er); | |
unpipe(); | |
dest.removeListener('error', onerror); | |
if (EE.listenerCount(dest, 'error') === 0) | |
dest.emit('error', er); | |
} | |
// This is a brutally ugly hack to make sure that our error handler | |
// is attached before any userland ones. NEVER DO THIS. | |
if (!dest._events || !dest._events.error) | |
dest.on('error', onerror); | |
else if (isArray(dest._events.error)) | |
dest._events.error.unshift(onerror); | |
else | |
dest._events.error = [onerror, dest._events.error]; | |
// Both close and finish should trigger unpipe, but only once. | |
function onclose() { | |
dest.removeListener('finish', onfinish); | |
unpipe(); | |
} | |
dest.once('close', onclose); | |
function onfinish() { | |
debug('onfinish'); | |
dest.removeListener('close', onclose); | |
unpipe(); | |
} | |
dest.once('finish', onfinish); | |
function unpipe() { | |
debug('unpipe'); | |
src.unpipe(dest); | |
} | |
// tell the dest that it's being piped to | |
dest.emit('pipe', src); | |
// start the flow if it hasn't been started already. | |
if (!state.flowing) { | |
debug('pipe resume'); | |
src.resume(); | |
} | |
return dest; | |
}; | |
function pipeOnDrain(src) { | |
return function() { | |
var state = src._readableState; | |
debug('pipeOnDrain', state.awaitDrain); | |
if (state.awaitDrain) | |
state.awaitDrain--; | |
if (state.awaitDrain === 0 && EE.listenerCount(src, 'data')) { | |
state.flowing = true; | |
flow(src); | |
} | |
}; | |
} | |
Readable.prototype.unpipe = function(dest) { | |
var state = this._readableState; | |
// if we're not piping anywhere, then do nothing. | |
if (state.pipesCount === 0) | |
return this; | |
// just one destination. most common case. | |
if (state.pipesCount === 1) { | |
// passed in one, but it's not the right one. | |
if (dest && dest !== state.pipes) | |
return this; | |
if (!dest) | |
dest = state.pipes; | |
// got a match. | |
state.pipes = null; | |
state.pipesCount = 0; | |
state.flowing = false; | |
if (dest) | |
dest.emit('unpipe', this); | |
return this; | |
} | |
// slow case. multiple pipe destinations. | |
if (!dest) { | |
// remove all. | |
var dests = state.pipes; | |
var len = state.pipesCount; | |
state.pipes = null; | |
state.pipesCount = 0; | |
state.flowing = false; | |
for (var i = 0; i < len; i++) | |
dests[i].emit('unpipe', this); | |
return this; | |
} | |
// try to find the right one. | |
var i = indexOf(state.pipes, dest); | |
if (i === -1) | |
return this; | |
state.pipes.splice(i, 1); | |
state.pipesCount -= 1; | |
if (state.pipesCount === 1) | |
state.pipes = state.pipes[0]; | |
dest.emit('unpipe', this); | |
return this; | |
}; | |
// set up data events if they are asked for | |
// Ensure readable listeners eventually get something | |
Readable.prototype.on = function(ev, fn) { | |
var res = Stream.prototype.on.call(this, ev, fn); | |
// If listening to data, and it has not explicitly been paused, | |
// then call resume to start the flow of data on the next tick. | |
if (ev === 'data' && false !== this._readableState.flowing) { | |
this.resume(); | |
} | |
if (ev === 'readable' && this.readable) { | |
var state = this._readableState; | |
if (!state.readableListening) { | |
state.readableListening = true; | |
state.emittedReadable = false; | |
state.needReadable = true; | |
if (!state.reading) { | |
var self = this; | |
process.nextTick(function() { | |
debug('readable nexttick read 0'); | |
self.read(0); | |
}); | |
} else if (state.length) { | |
emitReadable(this, state); | |
} | |
} | |
} | |
return res; | |
}; | |
Readable.prototype.addListener = Readable.prototype.on; | |
// pause() and resume() are remnants of the legacy readable stream API | |
// If the user uses them, then switch into old mode. | |
Readable.prototype.resume = function() { | |
var state = this._readableState; | |
if (!state.flowing) { | |
debug('resume'); | |
state.flowing = true; | |
if (!state.reading) { | |
debug('resume read 0'); | |
this.read(0); | |
} | |
resume(this, state); | |
} | |
return this; | |
}; | |
function resume(stream, state) { | |
if (!state.resumeScheduled) { | |
state.resumeScheduled = true; | |
process.nextTick(function() { | |
resume_(stream, state); | |
}); | |
} | |
} | |
function resume_(stream, state) { | |
state.resumeScheduled = false; | |
stream.emit('resume'); | |
flow(stream); | |
if (state.flowing && !state.reading) | |
stream.read(0); | |
} | |
Readable.prototype.pause = function() { | |
debug('call pause flowing=%j', this._readableState.flowing); | |
if (false !== this._readableState.flowing) { | |
debug('pause'); | |
this._readableState.flowing = false; | |
this.emit('pause'); | |
} | |
return this; | |
}; | |
function flow(stream) { | |
var state = stream._readableState; | |
debug('flow', state.flowing); | |
if (state.flowing) { | |
do { | |
var chunk = stream.read(); | |
} while (null !== chunk && state.flowing); | |
} | |
} | |
// wrap an old-style stream as the async data source. | |
// This is *not* part of the readable stream interface. | |
// It is an ugly unfortunate mess of history. | |
Readable.prototype.wrap = function(stream) { | |
var state = this._readableState; | |
var paused = false; | |
var self = this; | |
stream.on('end', function() { | |
debug('wrapped end'); | |
if (state.decoder && !state.ended) { | |
var chunk = state.decoder.end(); | |
if (chunk && chunk.length) | |
self.push(chunk); | |
} | |
self.push(null); | |
}); | |
stream.on('data', function(chunk) { | |
debug('wrapped data'); | |
if (state.decoder) | |
chunk = state.decoder.write(chunk); | |
if (!chunk || !state.objectMode && !chunk.length) | |
return; | |
var ret = self.push(chunk); | |
if (!ret) { | |
paused = true; | |
stream.pause(); | |
} | |
}); | |
// proxy all the other methods. | |
// important when wrapping filters and duplexes. | |
for (var i in stream) { | |
if (util.isFunction(stream[i]) && util.isUndefined(this[i])) { | |
this[i] = function(method) { return function() { | |
return stream[method].apply(stream, arguments); | |
}}(i); | |
} | |
} | |
// proxy certain important events. | |
var events = ['error', 'close', 'destroy', 'pause', 'resume']; | |
forEach(events, function(ev) { | |
stream.on(ev, self.emit.bind(self, ev)); | |
}); | |
// when we try to consume some more bytes, simply unpause the | |
// underlying stream. | |
self._read = function(n) { | |
debug('wrapped _read', n); | |
if (paused) { | |
paused = false; | |
stream.resume(); | |
} | |
}; | |
return self; | |
}; | |
// exposed for testing purposes only. | |
Readable._fromList = fromList; | |
// Pluck off n bytes from an array of buffers. | |
// Length is the combined lengths of all the buffers in the list. | |
function fromList(n, state) { | |
var list = state.buffer; | |
var length = state.length; | |
var stringMode = !!state.decoder; | |
var objectMode = !!state.objectMode; | |
var ret; | |
// nothing in the list, definitely empty. | |
if (list.length === 0) | |
return null; | |
if (length === 0) | |
ret = null; | |
else if (objectMode) | |
ret = list.shift(); | |
else if (!n || n >= length) { | |
// read it all, truncate the array. | |
if (stringMode) | |
ret = list.join(''); | |
else | |
ret = Buffer.concat(list, length); | |
list.length = 0; | |
} else { | |
// read just some of it. | |
if (n < list[0].length) { | |
// just take a part of the first list item. | |
// slice is the same for buffers and strings. | |
var buf = list[0]; | |
ret = buf.slice(0, n); | |
list[0] = buf.slice(n); | |
} else if (n === list[0].length) { | |
// first list is a perfect match | |
ret = list.shift(); | |
} else { | |
// complex case. | |
// we have enough to cover it, but it spans past the first buffer. | |
if (stringMode) | |
ret = ''; | |
else | |
ret = new Buffer(n); | |
var c = 0; | |
for (var i = 0, l = list.length; i < l && c < n; i++) { | |
var buf = list[0]; | |
var cpy = Math.min(n - c, buf.length); | |
if (stringMode) | |
ret += buf.slice(0, cpy); | |
else | |
buf.copy(ret, c, 0, cpy); | |
if (cpy < buf.length) | |
list[0] = buf.slice(cpy); | |
else | |
list.shift(); | |
c += cpy; | |
} | |
} | |
} | |
return ret; | |
} | |
function endReadable(stream) { | |
var state = stream._readableState; | |
// If we get here before consuming all the bytes, then that is a | |
// bug in node. Should never happen. | |
if (state.length > 0) | |
throw new Error('endReadable called on non-empty stream'); | |
if (!state.endEmitted) { | |
state.ended = true; | |
process.nextTick(function() { | |
// Check that we didn't get one last unshift. | |
if (!state.endEmitted && state.length === 0) { | |
state.endEmitted = true; | |
stream.readable = false; | |
stream.emit('end'); | |
} | |
}); | |
} | |
} | |
function forEach (xs, f) { | |
for (var i = 0, l = xs.length; i < l; i++) { | |
f(xs[i], i); | |
} | |
} | |
function indexOf (xs, x) { | |
for (var i = 0, l = xs.length; i < l; i++) { | |
if (xs[i] === x) return i; | |
} | |
return -1; | |
} | |
/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(46))) | |
/***/ }, | |
/* 61 */ | |
/***/ function(module, exports) { | |
module.exports = Array.isArray || function (arr) { | |
return Object.prototype.toString.call(arr) == '[object Array]'; | |
}; | |
/***/ }, | |
/* 62 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* WEBPACK VAR INJECTION */(function(Buffer) {// Copyright Joyent, Inc. and other Node contributors. | |
// | |
// Permission is hereby granted, free of charge, to any person obtaining a | |
// copy of this software and associated documentation files (the | |
// "Software"), to deal in the Software without restriction, including | |
// without limitation the rights to use, copy, modify, merge, publish, | |
// distribute, sublicense, and/or sell copies of the Software, and to permit | |
// persons to whom the Software is furnished to do so, subject to the | |
// following conditions: | |
// | |
// The above copyright notice and this permission notice shall be included | |
// in all copies or substantial portions of the Software. | |
// | |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | |
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN | |
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, | |
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | |
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE | |
// USE OR OTHER DEALINGS IN THE SOFTWARE. | |
// NOTE: These type checking functions intentionally don't use `instanceof` | |
// because it is fragile and can be easily faked with `Object.create()`. | |
function isArray(arg) { | |
if (Array.isArray) { | |
return Array.isArray(arg); | |
} | |
return objectToString(arg) === '[object Array]'; | |
} | |
exports.isArray = isArray; | |
function isBoolean(arg) { | |
return typeof arg === 'boolean'; | |
} | |
exports.isBoolean = isBoolean; | |
function isNull(arg) { | |
return arg === null; | |
} | |
exports.isNull = isNull; | |
function isNullOrUndefined(arg) { | |
return arg == null; | |
} | |
exports.isNullOrUndefined = isNullOrUndefined; | |
function isNumber(arg) { | |
return typeof arg === 'number'; | |
} | |
exports.isNumber = isNumber; | |
function isString(arg) { | |
return typeof arg === 'string'; | |
} | |
exports.isString = isString; | |
function isSymbol(arg) { | |
return typeof arg === 'symbol'; | |
} | |
exports.isSymbol = isSymbol; | |
function isUndefined(arg) { | |
return arg === void 0; | |
} | |
exports.isUndefined = isUndefined; | |
function isRegExp(re) { | |
return objectToString(re) === '[object RegExp]'; | |
} | |
exports.isRegExp = isRegExp; | |
function isObject(arg) { | |
return typeof arg === 'object' && arg !== null; | |
} | |
exports.isObject = isObject; | |
function isDate(d) { | |
return objectToString(d) === '[object Date]'; | |
} | |
exports.isDate = isDate; | |
function isError(e) { | |
return (objectToString(e) === '[object Error]' || e instanceof Error); | |
} | |
exports.isError = isError; | |
function isFunction(arg) { | |
return typeof arg === 'function'; | |
} | |
exports.isFunction = isFunction; | |
function isPrimitive(arg) { | |
return arg === null || | |
typeof arg === 'boolean' || | |
typeof arg === 'number' || | |
typeof arg === 'string' || | |
typeof arg === 'symbol' || // ES6 symbol | |
typeof arg === 'undefined'; | |
} | |
exports.isPrimitive = isPrimitive; | |
exports.isBuffer = Buffer.isBuffer; | |
function objectToString(o) { | |
return Object.prototype.toString.call(o); | |
} | |
/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(33).Buffer)) | |
/***/ }, | |
/* 63 */ | |
/***/ function(module, exports) { | |
if (typeof Object.create === 'function') { | |
// implementation from standard node.js 'util' module | |
module.exports = function inherits(ctor, superCtor) { | |
ctor.super_ = superCtor | |
ctor.prototype = Object.create(superCtor.prototype, { | |
constructor: { | |
value: ctor, | |
enumerable: false, | |
writable: true, | |
configurable: true | |
} | |
}); | |
}; | |
} else { | |
// old school shim for old browsers | |
module.exports = function inherits(ctor, superCtor) { | |
ctor.super_ = superCtor | |
var TempCtor = function () {} | |
TempCtor.prototype = superCtor.prototype | |
ctor.prototype = new TempCtor() | |
ctor.prototype.constructor = ctor | |
} | |
} | |
/***/ }, | |
/* 64 */ | |
/***/ function(module, exports) { | |
/* (ignored) */ | |
/***/ }, | |
/* 65 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* WEBPACK VAR INJECTION */(function(process) {// Copyright Joyent, Inc. and other Node contributors. | |
// | |
// Permission is hereby granted, free of charge, to any person obtaining a | |
// copy of this software and associated documentation files (the | |
// "Software"), to deal in the Software without restriction, including | |
// without limitation the rights to use, copy, modify, merge, publish, | |
// distribute, sublicense, and/or sell copies of the Software, and to permit | |
// persons to whom the Software is furnished to do so, subject to the | |
// following conditions: | |
// | |
// The above copyright notice and this permission notice shall be included | |
// in all copies or substantial portions of the Software. | |
// | |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | |
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN | |
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, | |
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | |
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE | |
// USE OR OTHER DEALINGS IN THE SOFTWARE. | |
// a duplex stream is just a stream that is both readable and writable. | |
// Since JS doesn't have multiple prototypal inheritance, this class | |
// prototypally inherits from Readable, and then parasitically from | |
// Writable. | |
module.exports = Duplex; | |
/*<replacement>*/ | |
var objectKeys = Object.keys || function (obj) { | |
var keys = []; | |
for (var key in obj) keys.push(key); | |
return keys; | |
} | |
/*</replacement>*/ | |
/*<replacement>*/ | |
var util = __webpack_require__(62); | |
util.inherits = __webpack_require__(63); | |
/*</replacement>*/ | |
var Readable = __webpack_require__(60); | |
var Writable = __webpack_require__(66); | |
util.inherits(Duplex, Readable); | |
forEach(objectKeys(Writable.prototype), function(method) { | |
if (!Duplex.prototype[method]) | |
Duplex.prototype[method] = Writable.prototype[method]; | |
}); | |
function Duplex(options) { | |
if (!(this instanceof Duplex)) | |
return new Duplex(options); | |
Readable.call(this, options); | |
Writable.call(this, options); | |
if (options && options.readable === false) | |
this.readable = false; | |
if (options && options.writable === false) | |
this.writable = false; | |
this.allowHalfOpen = true; | |
if (options && options.allowHalfOpen === false) | |
this.allowHalfOpen = false; | |
this.once('end', onend); | |
} | |
// the no-half-open enforcer | |
function onend() { | |
// if we allow half-open state, or if the writable side ended, | |
// then we're ok. | |
if (this.allowHalfOpen || this._writableState.ended) | |
return; | |
// no more data can be written. | |
// But allow more writes to happen in this tick. | |
process.nextTick(this.end.bind(this)); | |
} | |
function forEach (xs, f) { | |
for (var i = 0, l = xs.length; i < l; i++) { | |
f(xs[i], i); | |
} | |
} | |
/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(46))) | |
/***/ }, | |
/* 66 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* WEBPACK VAR INJECTION */(function(process) {// Copyright Joyent, Inc. and other Node contributors. | |
// | |
// Permission is hereby granted, free of charge, to any person obtaining a | |
// copy of this software and associated documentation files (the | |
// "Software"), to deal in the Software without restriction, including | |
// without limitation the rights to use, copy, modify, merge, publish, | |
// distribute, sublicense, and/or sell copies of the Software, and to permit | |
// persons to whom the Software is furnished to do so, subject to the | |
// following conditions: | |
// | |
// The above copyright notice and this permission notice shall be included | |
// in all copies or substantial portions of the Software. | |
// | |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | |
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN | |
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, | |
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | |
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE | |
// USE OR OTHER DEALINGS IN THE SOFTWARE. | |
// A bit simpler than readable streams. | |
// Implement an async ._write(chunk, cb), and it'll handle all | |
// the drain event emission and buffering. | |
module.exports = Writable; | |
/*<replacement>*/ | |
var Buffer = __webpack_require__(33).Buffer; | |
/*</replacement>*/ | |
Writable.WritableState = WritableState; | |
/*<replacement>*/ | |
var util = __webpack_require__(62); | |
util.inherits = __webpack_require__(63); | |
/*</replacement>*/ | |
var Stream = __webpack_require__(57); | |
util.inherits(Writable, Stream); | |
function WriteReq(chunk, encoding, cb) { | |
this.chunk = chunk; | |
this.encoding = encoding; | |
this.callback = cb; | |
} | |
function WritableState(options, stream) { | |
var Duplex = __webpack_require__(65); | |
options = options || {}; | |
// the point at which write() starts returning false | |
// Note: 0 is a valid value, means that we always return false if | |
// the entire buffer is not flushed immediately on write() | |
var hwm = options.highWaterMark; | |
var defaultHwm = options.objectMode ? 16 : 16 * 1024; | |
this.highWaterMark = (hwm || hwm === 0) ? hwm : defaultHwm; | |
// object stream flag to indicate whether or not this stream | |
// contains buffers or objects. | |
this.objectMode = !!options.objectMode; | |
if (stream instanceof Duplex) | |
this.objectMode = this.objectMode || !!options.writableObjectMode; | |
// cast to ints. | |
this.highWaterMark = ~~this.highWaterMark; | |
this.needDrain = false; | |
// at the start of calling end() | |
this.ending = false; | |
// when end() has been called, and returned | |
this.ended = false; | |
// when 'finish' is emitted | |
this.finished = false; | |
// should we decode strings into buffers before passing to _write? | |
// this is here so that some node-core streams can optimize string | |
// handling at a lower level. | |
var noDecode = options.decodeStrings === false; | |
this.decodeStrings = !noDecode; | |
// Crypto is kind of old and crusty. Historically, its default string | |
// encoding is 'binary' so we have to make this configurable. | |
// Everything else in the universe uses 'utf8', though. | |
this.defaultEncoding = options.defaultEncoding || 'utf8'; | |
// not an actual buffer we keep track of, but a measurement | |
// of how much we're waiting to get pushed to some underlying | |
// socket or file. | |
this.length = 0; | |
// a flag to see when we're in the middle of a write. | |
this.writing = false; | |
// when true all writes will be buffered until .uncork() call | |
this.corked = 0; | |
// a flag to be able to tell if the onwrite cb is called immediately, | |
// or on a later tick. We set this to true at first, because any | |
// actions that shouldn't happen until "later" should generally also | |
// not happen before the first write call. | |
this.sync = true; | |
// a flag to know if we're processing previously buffered items, which | |
// may call the _write() callback in the same tick, so that we don't | |
// end up in an overlapped onwrite situation. | |
this.bufferProcessing = false; | |
// the callback that's passed to _write(chunk,cb) | |
this.onwrite = function(er) { | |
onwrite(stream, er); | |
}; | |
// the callback that the user supplies to write(chunk,encoding,cb) | |
this.writecb = null; | |
// the amount that is being written when _write is called. | |
this.writelen = 0; | |
this.buffer = []; | |
// number of pending user-supplied write callbacks | |
// this must be 0 before 'finish' can be emitted | |
this.pendingcb = 0; | |
// emit prefinish if the only thing we're waiting for is _write cbs | |
// This is relevant for synchronous Transform streams | |
this.prefinished = false; | |
// True if the error was already emitted and should not be thrown again | |
this.errorEmitted = false; | |
} | |
function Writable(options) { | |
var Duplex = __webpack_require__(65); | |
// Writable ctor is applied to Duplexes, though they're not | |
// instanceof Writable, they're instanceof Readable. | |
if (!(this instanceof Writable) && !(this instanceof Duplex)) | |
return new Writable(options); | |
this._writableState = new WritableState(options, this); | |
// legacy. | |
this.writable = true; | |
Stream.call(this); | |
} | |
// Otherwise people can pipe Writable streams, which is just wrong. | |
Writable.prototype.pipe = function() { | |
this.emit('error', new Error('Cannot pipe. Not readable.')); | |
}; | |
function writeAfterEnd(stream, state, cb) { | |
var er = new Error('write after end'); | |
// TODO: defer error events consistently everywhere, not just the cb | |
stream.emit('error', er); | |
process.nextTick(function() { | |
cb(er); | |
}); | |
} | |
// If we get something that is not a buffer, string, null, or undefined, | |
// and we're not in objectMode, then that's an error. | |
// Otherwise stream chunks are all considered to be of length=1, and the | |
// watermarks determine how many objects to keep in the buffer, rather than | |
// how many bytes or characters. | |
function validChunk(stream, state, chunk, cb) { | |
var valid = true; | |
if (!util.isBuffer(chunk) && | |
!util.isString(chunk) && | |
!util.isNullOrUndefined(chunk) && | |
!state.objectMode) { | |
var er = new TypeError('Invalid non-string/buffer chunk'); | |
stream.emit('error', er); | |
process.nextTick(function() { | |
cb(er); | |
}); | |
valid = false; | |
} | |
return valid; | |
} | |
Writable.prototype.write = function(chunk, encoding, cb) { | |
var state = this._writableState; | |
var ret = false; | |
if (util.isFunction(encoding)) { | |
cb = encoding; | |
encoding = null; | |
} | |
if (util.isBuffer(chunk)) | |
encoding = 'buffer'; | |
else if (!encoding) | |
encoding = state.defaultEncoding; | |
if (!util.isFunction(cb)) | |
cb = function() {}; | |
if (state.ended) | |
writeAfterEnd(this, state, cb); | |
else if (validChunk(this, state, chunk, cb)) { | |
state.pendingcb++; | |
ret = writeOrBuffer(this, state, chunk, encoding, cb); | |
} | |
return ret; | |
}; | |
Writable.prototype.cork = function() { | |
var state = this._writableState; | |
state.corked++; | |
}; | |
Writable.prototype.uncork = function() { | |
var state = this._writableState; | |
if (state.corked) { | |
state.corked--; | |
if (!state.writing && | |
!state.corked && | |
!state.finished && | |
!state.bufferProcessing && | |
state.buffer.length) | |
clearBuffer(this, state); | |
} | |
}; | |
function decodeChunk(state, chunk, encoding) { | |
if (!state.objectMode && | |
state.decodeStrings !== false && | |
util.isString(chunk)) { | |
chunk = new Buffer(chunk, encoding); | |
} | |
return chunk; | |
} | |
// if we're already writing something, then just put this | |
// in the queue, and wait our turn. Otherwise, call _write | |
// If we return false, then we need a drain event, so set that flag. | |
function writeOrBuffer(stream, state, chunk, encoding, cb) { | |
chunk = decodeChunk(state, chunk, encoding); | |
if (util.isBuffer(chunk)) | |
encoding = 'buffer'; | |
var len = state.objectMode ? 1 : chunk.length; | |
state.length += len; | |
var ret = state.length < state.highWaterMark; | |
// we must ensure that previous needDrain will not be reset to false. | |
if (!ret) | |
state.needDrain = true; | |
if (state.writing || state.corked) | |
state.buffer.push(new WriteReq(chunk, encoding, cb)); | |
else | |
doWrite(stream, state, false, len, chunk, encoding, cb); | |
return ret; | |
} | |
function doWrite(stream, state, writev, len, chunk, encoding, cb) { | |
state.writelen = len; | |
state.writecb = cb; | |
state.writing = true; | |
state.sync = true; | |
if (writev) | |
stream._writev(chunk, state.onwrite); | |
else | |
stream._write(chunk, encoding, state.onwrite); | |
state.sync = false; | |
} | |
function onwriteError(stream, state, sync, er, cb) { | |
if (sync) | |
process.nextTick(function() { | |
state.pendingcb--; | |
cb(er); | |
}); | |
else { | |
state.pendingcb--; | |
cb(er); | |
} | |
stream._writableState.errorEmitted = true; | |
stream.emit('error', er); | |
} | |
function onwriteStateUpdate(state) { | |
state.writing = false; | |
state.writecb = null; | |
state.length -= state.writelen; | |
state.writelen = 0; | |
} | |
function onwrite(stream, er) { | |
var state = stream._writableState; | |
var sync = state.sync; | |
var cb = state.writecb; | |
onwriteStateUpdate(state); | |
if (er) | |
onwriteError(stream, state, sync, er, cb); | |
else { | |
// Check if we're actually ready to finish, but don't emit yet | |
var finished = needFinish(stream, state); | |
if (!finished && | |
!state.corked && | |
!state.bufferProcessing && | |
state.buffer.length) { | |
clearBuffer(stream, state); | |
} | |
if (sync) { | |
process.nextTick(function() { | |
afterWrite(stream, state, finished, cb); | |
}); | |
} else { | |
afterWrite(stream, state, finished, cb); | |
} | |
} | |
} | |
function afterWrite(stream, state, finished, cb) { | |
if (!finished) | |
onwriteDrain(stream, state); | |
state.pendingcb--; | |
cb(); | |
finishMaybe(stream, state); | |
} | |
// Must force callback to be called on nextTick, so that we don't | |
// emit 'drain' before the write() consumer gets the 'false' return | |
// value, and has a chance to attach a 'drain' listener. | |
function onwriteDrain(stream, state) { | |
if (state.length === 0 && state.needDrain) { | |
state.needDrain = false; | |
stream.emit('drain'); | |
} | |
} | |
// if there's something in the buffer waiting, then process it | |
function clearBuffer(stream, state) { | |
state.bufferProcessing = true; | |
if (stream._writev && state.buffer.length > 1) { | |
// Fast case, write everything using _writev() | |
var cbs = []; | |
for (var c = 0; c < state.buffer.length; c++) | |
cbs.push(state.buffer[c].callback); | |
// count the one we are adding, as well. | |
// TODO(isaacs) clean this up | |
state.pendingcb++; | |
doWrite(stream, state, true, state.length, state.buffer, '', function(err) { | |
for (var i = 0; i < cbs.length; i++) { | |
state.pendingcb--; | |
cbs[i](err); | |
} | |
}); | |
// Clear buffer | |
state.buffer = []; | |
} else { | |
// Slow case, write chunks one-by-one | |
for (var c = 0; c < state.buffer.length; c++) { | |
var entry = state.buffer[c]; | |
var chunk = entry.chunk; | |
var encoding = entry.encoding; | |
var cb = entry.callback; | |
var len = state.objectMode ? 1 : chunk.length; | |
doWrite(stream, state, false, len, chunk, encoding, cb); | |
// if we didn't call the onwrite immediately, then | |
// it means that we need to wait until it does. | |
// also, that means that the chunk and cb are currently | |
// being processed, so move the buffer counter past them. | |
if (state.writing) { | |
c++; | |
break; | |
} | |
} | |
if (c < state.buffer.length) | |
state.buffer = state.buffer.slice(c); | |
else | |
state.buffer.length = 0; | |
} | |
state.bufferProcessing = false; | |
} | |
Writable.prototype._write = function(chunk, encoding, cb) { | |
cb(new Error('not implemented')); | |
}; | |
Writable.prototype._writev = null; | |
Writable.prototype.end = function(chunk, encoding, cb) { | |
var state = this._writableState; | |
if (util.isFunction(chunk)) { | |
cb = chunk; | |
chunk = null; | |
encoding = null; | |
} else if (util.isFunction(encoding)) { | |
cb = encoding; | |
encoding = null; | |
} | |
if (!util.isNullOrUndefined(chunk)) | |
this.write(chunk, encoding); | |
// .end() fully uncorks | |
if (state.corked) { | |
state.corked = 1; | |
this.uncork(); | |
} | |
// ignore unnecessary end() calls. | |
if (!state.ending && !state.finished) | |
endWritable(this, state, cb); | |
}; | |
function needFinish(stream, state) { | |
return (state.ending && | |
state.length === 0 && | |
!state.finished && | |
!state.writing); | |
} | |
function prefinish(stream, state) { | |
if (!state.prefinished) { | |
state.prefinished = true; | |
stream.emit('prefinish'); | |
} | |
} | |
function finishMaybe(stream, state) { | |
var need = needFinish(stream, state); | |
if (need) { | |
if (state.pendingcb === 0) { | |
prefinish(stream, state); | |
state.finished = true; | |
stream.emit('finish'); | |
} else | |
prefinish(stream, state); | |
} | |
return need; | |
} | |
function endWritable(stream, state, cb) { | |
state.ending = true; | |
finishMaybe(stream, state); | |
if (cb) { | |
if (state.finished) | |
process.nextTick(cb); | |
else | |
stream.once('finish', cb); | |
} | |
state.ended = true; | |
} | |
/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(46))) | |
/***/ }, | |
/* 67 */ | |
/***/ function(module, exports, __webpack_require__) { | |
// Copyright Joyent, Inc. and other Node contributors. | |
// | |
// Permission is hereby granted, free of charge, to any person obtaining a | |
// copy of this software and associated documentation files (the | |
// "Software"), to deal in the Software without restriction, including | |
// without limitation the rights to use, copy, modify, merge, publish, | |
// distribute, sublicense, and/or sell copies of the Software, and to permit | |
// persons to whom the Software is furnished to do so, subject to the | |
// following conditions: | |
// | |
// The above copyright notice and this permission notice shall be included | |
// in all copies or substantial portions of the Software. | |
// | |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | |
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN | |
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, | |
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | |
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE | |
// USE OR OTHER DEALINGS IN THE SOFTWARE. | |
var Buffer = __webpack_require__(33).Buffer; | |
var isBufferEncoding = Buffer.isEncoding | |
|| function(encoding) { | |
switch (encoding && encoding.toLowerCase()) { | |
case 'hex': case 'utf8': case 'utf-8': case 'ascii': case 'binary': case 'base64': case 'ucs2': case 'ucs-2': case 'utf16le': case 'utf-16le': case 'raw': return true; | |
default: return false; | |
} | |
} | |
function assertEncoding(encoding) { | |
if (encoding && !isBufferEncoding(encoding)) { | |
throw new Error('Unknown encoding: ' + encoding); | |
} | |
} | |
// StringDecoder provides an interface for efficiently splitting a series of | |
// buffers into a series of JS strings without breaking apart multi-byte | |
// characters. CESU-8 is handled as part of the UTF-8 encoding. | |
// | |
// @TODO Handling all encodings inside a single object makes it very difficult | |
// to reason about this code, so it should be split up in the future. | |
// @TODO There should be a utf8-strict encoding that rejects invalid UTF-8 code | |
// points as used by CESU-8. | |
var StringDecoder = exports.StringDecoder = function(encoding) { | |
this.encoding = (encoding || 'utf8').toLowerCase().replace(/[-_]/, ''); | |
assertEncoding(encoding); | |
switch (this.encoding) { | |
case 'utf8': | |
// CESU-8 represents each of Surrogate Pair by 3-bytes | |
this.surrogateSize = 3; | |
break; | |
case 'ucs2': | |
case 'utf16le': | |
// UTF-16 represents each of Surrogate Pair by 2-bytes | |
this.surrogateSize = 2; | |
this.detectIncompleteChar = utf16DetectIncompleteChar; | |
break; | |
case 'base64': | |
// Base-64 stores 3 bytes in 4 chars, and pads the remainder. | |
this.surrogateSize = 3; | |
this.detectIncompleteChar = base64DetectIncompleteChar; | |
break; | |
default: | |
this.write = passThroughWrite; | |
return; | |
} | |
// Enough space to store all bytes of a single character. UTF-8 needs 4 | |
// bytes, but CESU-8 may require up to 6 (3 bytes per surrogate). | |
this.charBuffer = new Buffer(6); | |
// Number of bytes received for the current incomplete multi-byte character. | |
this.charReceived = 0; | |
// Number of bytes expected for the current incomplete multi-byte character. | |
this.charLength = 0; | |
}; | |
// write decodes the given buffer and returns it as JS string that is | |
// guaranteed to not contain any partial multi-byte characters. Any partial | |
// character found at the end of the buffer is buffered up, and will be | |
// returned when calling write again with the remaining bytes. | |
// | |
// Note: Converting a Buffer containing an orphan surrogate to a String | |
// currently works, but converting a String to a Buffer (via `new Buffer`, or | |
// Buffer#write) will replace incomplete surrogates with the unicode | |
// replacement character. See https://codereview.chromium.org/121173009/ . | |
StringDecoder.prototype.write = function(buffer) { | |
var charStr = ''; | |
// if our last write ended with an incomplete multibyte character | |
while (this.charLength) { | |
// determine how many remaining bytes this buffer has to offer for this char | |
var available = (buffer.length >= this.charLength - this.charReceived) ? | |
this.charLength - this.charReceived : | |
buffer.length; | |
// add the new bytes to the char buffer | |
buffer.copy(this.charBuffer, this.charReceived, 0, available); | |
this.charReceived += available; | |
if (this.charReceived < this.charLength) { | |
// still not enough chars in this buffer? wait for more ... | |
return ''; | |
} | |
// remove bytes belonging to the current character from the buffer | |
buffer = buffer.slice(available, buffer.length); | |
// get the character that was split | |
charStr = this.charBuffer.slice(0, this.charLength).toString(this.encoding); | |
// CESU-8: lead surrogate (D800-DBFF) is also the incomplete character | |
var charCode = charStr.charCodeAt(charStr.length - 1); | |
if (charCode >= 0xD800 && charCode <= 0xDBFF) { | |
this.charLength += this.surrogateSize; | |
charStr = ''; | |
continue; | |
} | |
this.charReceived = this.charLength = 0; | |
// if there are no more bytes in this buffer, just emit our char | |
if (buffer.length === 0) { | |
return charStr; | |
} | |
break; | |
} | |
// determine and set charLength / charReceived | |
this.detectIncompleteChar(buffer); | |
var end = buffer.length; | |
if (this.charLength) { | |
// buffer the incomplete character bytes we got | |
buffer.copy(this.charBuffer, 0, buffer.length - this.charReceived, end); | |
end -= this.charReceived; | |
} | |
charStr += buffer.toString(this.encoding, 0, end); | |
var end = charStr.length - 1; | |
var charCode = charStr.charCodeAt(end); | |
// CESU-8: lead surrogate (D800-DBFF) is also the incomplete character | |
if (charCode >= 0xD800 && charCode <= 0xDBFF) { | |
var size = this.surrogateSize; | |
this.charLength += size; | |
this.charReceived += size; | |
this.charBuffer.copy(this.charBuffer, size, 0, size); | |
buffer.copy(this.charBuffer, 0, 0, size); | |
return charStr.substring(0, end); | |
} | |
// or just emit the charStr | |
return charStr; | |
}; | |
// detectIncompleteChar determines if there is an incomplete UTF-8 character at | |
// the end of the given buffer. If so, it sets this.charLength to the byte | |
// length that character, and sets this.charReceived to the number of bytes | |
// that are available for this character. | |
StringDecoder.prototype.detectIncompleteChar = function(buffer) { | |
// determine how many bytes we have to check at the end of this buffer | |
var i = (buffer.length >= 3) ? 3 : buffer.length; | |
// Figure out if one of the last i bytes of our buffer announces an | |
// incomplete char. | |
for (; i > 0; i--) { | |
var c = buffer[buffer.length - i]; | |
// See http://en.wikipedia.org/wiki/UTF-8#Description | |
// 110XXXXX | |
if (i == 1 && c >> 5 == 0x06) { | |
this.charLength = 2; | |
break; | |
} | |
// 1110XXXX | |
if (i <= 2 && c >> 4 == 0x0E) { | |
this.charLength = 3; | |
break; | |
} | |
// 11110XXX | |
if (i <= 3 && c >> 3 == 0x1E) { | |
this.charLength = 4; | |
break; | |
} | |
} | |
this.charReceived = i; | |
}; | |
StringDecoder.prototype.end = function(buffer) { | |
var res = ''; | |
if (buffer && buffer.length) | |
res = this.write(buffer); | |
if (this.charReceived) { | |
var cr = this.charReceived; | |
var buf = this.charBuffer; | |
var enc = this.encoding; | |
res += buf.slice(0, cr).toString(enc); | |
} | |
return res; | |
}; | |
function passThroughWrite(buffer) { | |
return buffer.toString(this.encoding); | |
} | |
function utf16DetectIncompleteChar(buffer) { | |
this.charReceived = buffer.length % 2; | |
this.charLength = this.charReceived ? 2 : 0; | |
} | |
function base64DetectIncompleteChar(buffer) { | |
this.charReceived = buffer.length % 3; | |
this.charLength = this.charReceived ? 3 : 0; | |
} | |
/***/ }, | |
/* 68 */ | |
/***/ function(module, exports, __webpack_require__) { | |
// Copyright Joyent, Inc. and other Node contributors. | |
// | |
// Permission is hereby granted, free of charge, to any person obtaining a | |
// copy of this software and associated documentation files (the | |
// "Software"), to deal in the Software without restriction, including | |
// without limitation the rights to use, copy, modify, merge, publish, | |
// distribute, sublicense, and/or sell copies of the Software, and to permit | |
// persons to whom the Software is furnished to do so, subject to the | |
// following conditions: | |
// | |
// The above copyright notice and this permission notice shall be included | |
// in all copies or substantial portions of the Software. | |
// | |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | |
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN | |
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, | |
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | |
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE | |
// USE OR OTHER DEALINGS IN THE SOFTWARE. | |
// a transform stream is a readable/writable stream where you do | |
// something with the data. Sometimes it's called a "filter", | |
// but that's not a great name for it, since that implies a thing where | |
// some bits pass through, and others are simply ignored. (That would | |
// be a valid example of a transform, of course.) | |
// | |
// While the output is causally related to the input, it's not a | |
// necessarily symmetric or synchronous transformation. For example, | |
// a zlib stream might take multiple plain-text writes(), and then | |
// emit a single compressed chunk some time in the future. | |
// | |
// Here's how this works: | |
// | |
// The Transform stream has all the aspects of the readable and writable | |
// stream classes. When you write(chunk), that calls _write(chunk,cb) | |
// internally, and returns false if there's a lot of pending writes | |
// buffered up. When you call read(), that calls _read(n) until | |
// there's enough pending readable data buffered up. | |
// | |
// In a transform stream, the written data is placed in a buffer. When | |
// _read(n) is called, it transforms the queued up data, calling the | |
// buffered _write cb's as it consumes chunks. If consuming a single | |
// written chunk would result in multiple output chunks, then the first | |
// outputted bit calls the readcb, and subsequent chunks just go into | |
// the read buffer, and will cause it to emit 'readable' if necessary. | |
// | |
// This way, back-pressure is actually determined by the reading side, | |
// since _read has to be called to start processing a new chunk. However, | |
// a pathological inflate type of transform can cause excessive buffering | |
// here. For example, imagine a stream where every byte of input is | |
// interpreted as an integer from 0-255, and then results in that many | |
// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in | |
// 1kb of data being output. In this case, you could write a very small | |
// amount of input, and end up with a very large amount of output. In | |
// such a pathological inflating mechanism, there'd be no way to tell | |
// the system to stop doing the transform. A single 4MB write could | |
// cause the system to run out of memory. | |
// | |
// However, even in such a pathological case, only a single written chunk | |
// would be consumed, and then the rest would wait (un-transformed) until | |
// the results of the previous transformed chunk were consumed. | |
module.exports = Transform; | |
var Duplex = __webpack_require__(65); | |
/*<replacement>*/ | |
var util = __webpack_require__(62); | |
util.inherits = __webpack_require__(63); | |
/*</replacement>*/ | |
util.inherits(Transform, Duplex); | |
function TransformState(options, stream) { | |
this.afterTransform = function(er, data) { | |
return afterTransform(stream, er, data); | |
}; | |
this.needTransform = false; | |
this.transforming = false; | |
this.writecb = null; | |
this.writechunk = null; | |
} | |
function afterTransform(stream, er, data) { | |
var ts = stream._transformState; | |
ts.transforming = false; | |
var cb = ts.writecb; | |
if (!cb) | |
return stream.emit('error', new Error('no writecb in Transform class')); | |
ts.writechunk = null; | |
ts.writecb = null; | |
if (!util.isNullOrUndefined(data)) | |
stream.push(data); | |
if (cb) | |
cb(er); | |
var rs = stream._readableState; | |
rs.reading = false; | |
if (rs.needReadable || rs.length < rs.highWaterMark) { | |
stream._read(rs.highWaterMark); | |
} | |
} | |
function Transform(options) { | |
if (!(this instanceof Transform)) | |
return new Transform(options); | |
Duplex.call(this, options); | |
this._transformState = new TransformState(options, this); | |
// when the writable side finishes, then flush out anything remaining. | |
var stream = this; | |
// start out asking for a readable event once data is transformed. | |
this._readableState.needReadable = true; | |
// we have implemented the _read method, and done the other things | |
// that Readable wants before the first _read call, so unset the | |
// sync guard flag. | |
this._readableState.sync = false; | |
this.once('prefinish', function() { | |
if (util.isFunction(this._flush)) | |
this._flush(function(er) { | |
done(stream, er); | |
}); | |
else | |
done(stream); | |
}); | |
} | |
Transform.prototype.push = function(chunk, encoding) { | |
this._transformState.needTransform = false; | |
return Duplex.prototype.push.call(this, chunk, encoding); | |
}; | |
// This is the part where you do stuff! | |
// override this function in implementation classes. | |
// 'chunk' is an input chunk. | |
// | |
// Call `push(newChunk)` to pass along transformed output | |
// to the readable side. You may call 'push' zero or more times. | |
// | |
// Call `cb(err)` when you are done with this chunk. If you pass | |
// an error, then that'll put the hurt on the whole operation. If you | |
// never call cb(), then you'll never get another chunk. | |
Transform.prototype._transform = function(chunk, encoding, cb) { | |
throw new Error('not implemented'); | |
}; | |
Transform.prototype._write = function(chunk, encoding, cb) { | |
var ts = this._transformState; | |
ts.writecb = cb; | |
ts.writechunk = chunk; | |
ts.writeencoding = encoding; | |
if (!ts.transforming) { | |
var rs = this._readableState; | |
if (ts.needTransform || | |
rs.needReadable || | |
rs.length < rs.highWaterMark) | |
this._read(rs.highWaterMark); | |
} | |
}; | |
// Doesn't matter what the args are here. | |
// _transform does all the work. | |
// That we got here means that the readable side wants more data. | |
Transform.prototype._read = function(n) { | |
var ts = this._transformState; | |
if (!util.isNull(ts.writechunk) && ts.writecb && !ts.transforming) { | |
ts.transforming = true; | |
this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform); | |
} else { | |
// mark that we need a transform, so that any data that comes in | |
// will get processed, now that we've asked for it. | |
ts.needTransform = true; | |
} | |
}; | |
function done(stream, er) { | |
if (er) | |
return stream.emit('error', er); | |
// if there's nothing in the write buffer, then that means | |
// that nothing more will ever be provided | |
var ws = stream._writableState; | |
var ts = stream._transformState; | |
if (ws.length) | |
throw new Error('calling transform done when ws.length != 0'); | |
if (ts.transforming) | |
throw new Error('calling transform done when still transforming'); | |
return stream.push(null); | |
} | |
/***/ }, | |
/* 69 */ | |
/***/ function(module, exports, __webpack_require__) { | |
// Copyright Joyent, Inc. and other Node contributors. | |
// | |
// Permission is hereby granted, free of charge, to any person obtaining a | |
// copy of this software and associated documentation files (the | |
// "Software"), to deal in the Software without restriction, including | |
// without limitation the rights to use, copy, modify, merge, publish, | |
// distribute, sublicense, and/or sell copies of the Software, and to permit | |
// persons to whom the Software is furnished to do so, subject to the | |
// following conditions: | |
// | |
// The above copyright notice and this permission notice shall be included | |
// in all copies or substantial portions of the Software. | |
// | |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | |
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN | |
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, | |
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | |
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE | |
// USE OR OTHER DEALINGS IN THE SOFTWARE. | |
// a passthrough stream. | |
// basically just the most minimal sort of Transform stream. | |
// Every written chunk gets output as-is. | |
module.exports = PassThrough; | |
var Transform = __webpack_require__(68); | |
/*<replacement>*/ | |
var util = __webpack_require__(62); | |
util.inherits = __webpack_require__(63); | |
/*</replacement>*/ | |
util.inherits(PassThrough, Transform); | |
function PassThrough(options) { | |
if (!(this instanceof PassThrough)) | |
return new PassThrough(options); | |
Transform.call(this, options); | |
} | |
PassThrough.prototype._transform = function(chunk, encoding, cb) { | |
cb(null, chunk); | |
}; | |
/***/ }, | |
/* 70 */ | |
/***/ function(module, exports, __webpack_require__) { | |
module.exports = __webpack_require__(66) | |
/***/ }, | |
/* 71 */ | |
/***/ function(module, exports, __webpack_require__) { | |
module.exports = __webpack_require__(65) | |
/***/ }, | |
/* 72 */ | |
/***/ function(module, exports, __webpack_require__) { | |
module.exports = __webpack_require__(68) | |
/***/ }, | |
/* 73 */ | |
/***/ function(module, exports, __webpack_require__) { | |
module.exports = __webpack_require__(69) | |
/***/ }, | |
/* 74 */ | |
/***/ function(module, exports) { | |
/* (ignored) */ | |
/***/ }, | |
/* 75 */ | |
/***/ function(module, exports, __webpack_require__) { | |
module.exports = ProxyHandler; | |
function ProxyHandler(cbs){ | |
this._cbs = cbs || {}; | |
} | |
var EVENTS = __webpack_require__(37).EVENTS; | |
Object.keys(EVENTS).forEach(function(name){ | |
if(EVENTS[name] === 0){ | |
name = "on" + name; | |
ProxyHandler.prototype[name] = function(){ | |
if(this._cbs[name]) this._cbs[name](); | |
}; | |
} else if(EVENTS[name] === 1){ | |
name = "on" + name; | |
ProxyHandler.prototype[name] = function(a){ | |
if(this._cbs[name]) this._cbs[name](a); | |
}; | |
} else if(EVENTS[name] === 2){ | |
name = "on" + name; | |
ProxyHandler.prototype[name] = function(a, b){ | |
if(this._cbs[name]) this._cbs[name](a, b); | |
}; | |
} else { | |
throw Error("wrong number of arguments"); | |
} | |
}); | |
/***/ }, | |
/* 76 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var DomUtils = module.exports; | |
[ | |
__webpack_require__(77), | |
__webpack_require__(88), | |
__webpack_require__(89), | |
__webpack_require__(90), | |
__webpack_require__(91), | |
__webpack_require__(92) | |
].forEach(function(ext){ | |
Object.keys(ext).forEach(function(key){ | |
DomUtils[key] = ext[key].bind(DomUtils); | |
}); | |
}); | |
/***/ }, | |
/* 77 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var ElementType = __webpack_require__(51), | |
getOuterHTML = __webpack_require__(78), | |
isTag = ElementType.isTag; | |
module.exports = { | |
getInnerHTML: getInnerHTML, | |
getOuterHTML: getOuterHTML, | |
getText: getText | |
}; | |
function getInnerHTML(elem, opts){ | |
return elem.children ? elem.children.map(function(elem){ | |
return getOuterHTML(elem, opts); | |
}).join("") : ""; | |
} | |
function getText(elem){ | |
if(Array.isArray(elem)) return elem.map(getText).join(""); | |
if(isTag(elem) || elem.type === ElementType.CDATA) return getText(elem.children); | |
if(elem.type === ElementType.Text) return elem.data; | |
return ""; | |
} | |
/***/ }, | |
/* 78 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* | |
Module dependencies | |
*/ | |
var ElementType = __webpack_require__(79); | |
var entities = __webpack_require__(80); | |
/* | |
Boolean Attributes | |
*/ | |
var booleanAttributes = { | |
__proto__: null, | |
allowfullscreen: true, | |
async: true, | |
autofocus: true, | |
autoplay: true, | |
checked: true, | |
controls: true, | |
default: true, | |
defer: true, | |
disabled: true, | |
hidden: true, | |
ismap: true, | |
loop: true, | |
multiple: true, | |
muted: true, | |
open: true, | |
readonly: true, | |
required: true, | |
reversed: true, | |
scoped: true, | |
seamless: true, | |
selected: true, | |
typemustmatch: true | |
}; | |
var unencodedElements = { | |
__proto__: null, | |
style: true, | |
script: true, | |
xmp: true, | |
iframe: true, | |
noembed: true, | |
noframes: true, | |
plaintext: true, | |
noscript: true | |
}; | |
/* | |
Format attributes | |
*/ | |
function formatAttrs(attributes, opts) { | |
if (!attributes) return; | |
var output = '', | |
value; | |
// Loop through the attributes | |
for (var key in attributes) { | |
value = attributes[key]; | |
if (output) { | |
output += ' '; | |
} | |
if (!value && booleanAttributes[key]) { | |
output += key; | |
} else { | |
output += key + '="' + (opts.decodeEntities ? entities.encodeXML(value) : value) + '"'; | |
} | |
} | |
return output; | |
} | |
/* | |
Self-enclosing tags (stolen from node-htmlparser) | |
*/ | |
var singleTag = { | |
__proto__: null, | |
area: true, | |
base: true, | |
basefont: true, | |
br: true, | |
col: true, | |
command: true, | |
embed: true, | |
frame: true, | |
hr: true, | |
img: true, | |
input: true, | |
isindex: true, | |
keygen: true, | |
link: true, | |
meta: true, | |
param: true, | |
source: true, | |
track: true, | |
wbr: true, | |
}; | |
var render = module.exports = function(dom, opts) { | |
if (!Array.isArray(dom) && !dom.cheerio) dom = [dom]; | |
opts = opts || {}; | |
var output = ''; | |
for(var i = 0; i < dom.length; i++){ | |
var elem = dom[i]; | |
if (elem.type === 'root') | |
output += render(elem.children, opts); | |
else if (ElementType.isTag(elem)) | |
output += renderTag(elem, opts); | |
else if (elem.type === ElementType.Directive) | |
output += renderDirective(elem); | |
else if (elem.type === ElementType.Comment) | |
output += renderComment(elem); | |
else if (elem.type === ElementType.CDATA) | |
output += renderCdata(elem); | |
else | |
output += renderText(elem, opts); | |
} | |
return output; | |
}; | |
function renderTag(elem, opts) { | |
// Handle SVG | |
if (elem.name === "svg") opts = {decodeEntities: opts.decodeEntities, xmlMode: true}; | |
var tag = '<' + elem.name, | |
attribs = formatAttrs(elem.attribs, opts); | |
if (attribs) { | |
tag += ' ' + attribs; | |
} | |
if ( | |
opts.xmlMode | |
&& (!elem.children || elem.children.length === 0) | |
) { | |
tag += '/>'; | |
} else { | |
tag += '>'; | |
if (elem.children) { | |
tag += render(elem.children, opts); | |
} | |
if (!singleTag[elem.name] || opts.xmlMode) { | |
tag += '</' + elem.name + '>'; | |
} | |
} | |
return tag; | |
} | |
function renderDirective(elem) { | |
return '<' + elem.data + '>'; | |
} | |
function renderText(elem, opts) { | |
var data = elem.data || ''; | |
// if entities weren't decoded, no need to encode them back | |
if (opts.decodeEntities && !(elem.parent && elem.parent.name in unencodedElements)) { | |
data = entities.encodeXML(data); | |
} | |
return data; | |
} | |
function renderCdata(elem) { | |
return '<![CDATA[' + elem.children[0].data + ']]>'; | |
} | |
function renderComment(elem) { | |
return '<!--' + elem.data + '-->'; | |
} | |
/***/ }, | |
/* 79 */ | |
/***/ function(module, exports) { | |
//Types of elements found in the DOM | |
module.exports = { | |
Text: "text", //Text | |
Directive: "directive", //<? ... ?> | |
Comment: "comment", //<!-- ... --> | |
Script: "script", //<script> tags | |
Style: "style", //<style> tags | |
Tag: "tag", //Any tag | |
CDATA: "cdata", //<![CDATA[ ... ]]> | |
isTag: function(elem){ | |
return elem.type === "tag" || elem.type === "script" || elem.type === "style"; | |
} | |
}; | |
/***/ }, | |
/* 80 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var encode = __webpack_require__(81), | |
decode = __webpack_require__(84); | |
exports.decode = function(data, level){ | |
return (!level || level <= 0 ? decode.XML : decode.HTML)(data); | |
}; | |
exports.decodeStrict = function(data, level){ | |
return (!level || level <= 0 ? decode.XML : decode.HTMLStrict)(data); | |
}; | |
exports.encode = function(data, level){ | |
return (!level || level <= 0 ? encode.XML : encode.HTML)(data); | |
}; | |
exports.encodeXML = encode.XML; | |
exports.encodeHTML4 = | |
exports.encodeHTML5 = | |
exports.encodeHTML = encode.HTML; | |
exports.decodeXML = | |
exports.decodeXMLStrict = decode.XML; | |
exports.decodeHTML4 = | |
exports.decodeHTML5 = | |
exports.decodeHTML = decode.HTML; | |
exports.decodeHTML4Strict = | |
exports.decodeHTML5Strict = | |
exports.decodeHTMLStrict = decode.HTMLStrict; | |
exports.escape = encode.escape; | |
/***/ }, | |
/* 81 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var inverseXML = getInverseObj(__webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"../maps/xml.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }()))), | |
xmlReplacer = getInverseReplacer(inverseXML); | |
exports.XML = getInverse(inverseXML, xmlReplacer); | |
var inverseHTML = getInverseObj(__webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"../maps/entities.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }()))), | |
htmlReplacer = getInverseReplacer(inverseHTML); | |
exports.HTML = getInverse(inverseHTML, htmlReplacer); | |
function getInverseObj(obj){ | |
return Object.keys(obj).sort().reduce(function(inverse, name){ | |
inverse[obj[name]] = "&" + name + ";"; | |
return inverse; | |
}, {}); | |
} | |
function getInverseReplacer(inverse){ | |
var single = [], | |
multiple = []; | |
Object.keys(inverse).forEach(function(k){ | |
if(k.length === 1){ | |
single.push("\\" + k); | |
} else { | |
multiple.push(k); | |
} | |
}); | |
//TODO add ranges | |
multiple.unshift("[" + single.join("") + "]"); | |
return new RegExp(multiple.join("|"), "g"); | |
} | |
var re_nonASCII = /[^\0-\x7F]/g, | |
re_astralSymbols = /[\uD800-\uDBFF][\uDC00-\uDFFF]/g; | |
function singleCharReplacer(c){ | |
return "&#x" + c.charCodeAt(0).toString(16).toUpperCase() + ";"; | |
} | |
function astralReplacer(c){ | |
// http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae | |
var high = c.charCodeAt(0); | |
var low = c.charCodeAt(1); | |
var codePoint = (high - 0xD800) * 0x400 + low - 0xDC00 + 0x10000; | |
return "&#x" + codePoint.toString(16).toUpperCase() + ";"; | |
} | |
function getInverse(inverse, re){ | |
function func(name){ | |
return inverse[name]; | |
} | |
return function(data){ | |
return data | |
.replace(re, func) | |
.replace(re_astralSymbols, astralReplacer) | |
.replace(re_nonASCII, singleCharReplacer); | |
}; | |
} | |
var re_xmlChars = getInverseReplacer(inverseXML); | |
function escapeXML(data){ | |
return data | |
.replace(re_xmlChars, singleCharReplacer) | |
.replace(re_astralSymbols, astralReplacer) | |
.replace(re_nonASCII, singleCharReplacer); | |
} | |
exports.escape = escapeXML; | |
/***/ }, | |
/* 82 */, | |
/* 83 */, | |
/* 84 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var entityMap = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"../maps/entities.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())), | |
legacyMap = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"../maps/legacy.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())), | |
xmlMap = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"../maps/xml.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())), | |
decodeCodePoint = __webpack_require__(86); | |
var decodeXMLStrict = getStrictDecoder(xmlMap), | |
decodeHTMLStrict = getStrictDecoder(entityMap); | |
function getStrictDecoder(map){ | |
var keys = Object.keys(map).join("|"), | |
replace = getReplacer(map); | |
keys += "|#[xX][\\da-fA-F]+|#\\d+"; | |
var re = new RegExp("&(?:" + keys + ");", "g"); | |
return function(str){ | |
return String(str).replace(re, replace); | |
}; | |
} | |
var decodeHTML = (function(){ | |
var legacy = Object.keys(legacyMap) | |
.sort(sorter); | |
var keys = Object.keys(entityMap) | |
.sort(sorter); | |
for(var i = 0, j = 0; i < keys.length; i++){ | |
if(legacy[j] === keys[i]){ | |
keys[i] += ";?"; | |
j++; | |
} else { | |
keys[i] += ";"; | |
} | |
} | |
var re = new RegExp("&(?:" + keys.join("|") + "|#[xX][\\da-fA-F]+;?|#\\d+;?)", "g"), | |
replace = getReplacer(entityMap); | |
function replacer(str){ | |
if(str.substr(-1) !== ";") str += ";"; | |
return replace(str); | |
} | |
//TODO consider creating a merged map | |
return function(str){ | |
return String(str).replace(re, replacer); | |
}; | |
}()); | |
function sorter(a, b){ | |
return a < b ? 1 : -1; | |
} | |
function getReplacer(map){ | |
return function replace(str){ | |
if(str.charAt(1) === "#"){ | |
if(str.charAt(2) === "X" || str.charAt(2) === "x"){ | |
return decodeCodePoint(parseInt(str.substr(3), 16)); | |
} | |
return decodeCodePoint(parseInt(str.substr(2), 10)); | |
} | |
return map[str.slice(1, -1)]; | |
}; | |
} | |
module.exports = { | |
XML: decodeXMLStrict, | |
HTML: decodeHTML, | |
HTMLStrict: decodeHTMLStrict | |
}; | |
/***/ }, | |
/* 85 */, | |
/* 86 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var decodeMap = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"../maps/decode.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())); | |
module.exports = decodeCodePoint; | |
// modified version of https://github.com/mathiasbynens/he/blob/master/src/he.js#L94-L119 | |
function decodeCodePoint(codePoint){ | |
if((codePoint >= 0xD800 && codePoint <= 0xDFFF) || codePoint > 0x10FFFF){ | |
return "\uFFFD"; | |
} | |
if(codePoint in decodeMap){ | |
codePoint = decodeMap[codePoint]; | |
} | |
var output = ""; | |
if(codePoint > 0xFFFF){ | |
codePoint -= 0x10000; | |
output += String.fromCharCode(codePoint >>> 10 & 0x3FF | 0xD800); | |
codePoint = 0xDC00 | codePoint & 0x3FF; | |
} | |
output += String.fromCharCode(codePoint); | |
return output; | |
} | |
/***/ }, | |
/* 87 */, | |
/* 88 */ | |
/***/ function(module, exports) { | |
var getChildren = exports.getChildren = function(elem){ | |
return elem.children; | |
}; | |
var getParent = exports.getParent = function(elem){ | |
return elem.parent; | |
}; | |
exports.getSiblings = function(elem){ | |
var parent = getParent(elem); | |
return parent ? getChildren(parent) : [elem]; | |
}; | |
exports.getAttributeValue = function(elem, name){ | |
return elem.attribs && elem.attribs[name]; | |
}; | |
exports.hasAttrib = function(elem, name){ | |
return !!elem.attribs && hasOwnProperty.call(elem.attribs, name); | |
}; | |
exports.getName = function(elem){ | |
return elem.name; | |
}; | |
/***/ }, | |
/* 89 */ | |
/***/ function(module, exports) { | |
exports.removeElement = function(elem){ | |
if(elem.prev) elem.prev.next = elem.next; | |
if(elem.next) elem.next.prev = elem.prev; | |
if(elem.parent){ | |
var childs = elem.parent.children; | |
childs.splice(childs.lastIndexOf(elem), 1); | |
} | |
}; | |
exports.replaceElement = function(elem, replacement){ | |
var prev = replacement.prev = elem.prev; | |
if(prev){ | |
prev.next = replacement; | |
} | |
var next = replacement.next = elem.next; | |
if(next){ | |
next.prev = replacement; | |
} | |
var parent = replacement.parent = elem.parent; | |
if(parent){ | |
var childs = parent.children; | |
childs[childs.lastIndexOf(elem)] = replacement; | |
} | |
}; | |
exports.appendChild = function(elem, child){ | |
child.parent = elem; | |
if(elem.children.push(child) !== 1){ | |
var sibling = elem.children[elem.children.length - 2]; | |
sibling.next = child; | |
child.prev = sibling; | |
child.next = null; | |
} | |
}; | |
exports.append = function(elem, next){ | |
var parent = elem.parent, | |
currNext = elem.next; | |
next.next = currNext; | |
next.prev = elem; | |
elem.next = next; | |
next.parent = parent; | |
if(currNext){ | |
currNext.prev = next; | |
if(parent){ | |
var childs = parent.children; | |
childs.splice(childs.lastIndexOf(currNext), 0, next); | |
} | |
} else if(parent){ | |
parent.children.push(next); | |
} | |
}; | |
exports.prepend = function(elem, prev){ | |
var parent = elem.parent; | |
if(parent){ | |
var childs = parent.children; | |
childs.splice(childs.lastIndexOf(elem), 0, prev); | |
} | |
if(elem.prev){ | |
elem.prev.next = prev; | |
} | |
prev.parent = parent; | |
prev.prev = elem.prev; | |
prev.next = elem; | |
elem.prev = prev; | |
}; | |
/***/ }, | |
/* 90 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var isTag = __webpack_require__(51).isTag; | |
module.exports = { | |
filter: filter, | |
find: find, | |
findOneChild: findOneChild, | |
findOne: findOne, | |
existsOne: existsOne, | |
findAll: findAll | |
}; | |
function filter(test, element, recurse, limit){ | |
if(!Array.isArray(element)) element = [element]; | |
if(typeof limit !== "number" || !isFinite(limit)){ | |
limit = Infinity; | |
} | |
return find(test, element, recurse !== false, limit); | |
} | |
function find(test, elems, recurse, limit){ | |
var result = [], childs; | |
for(var i = 0, j = elems.length; i < j; i++){ | |
if(test(elems[i])){ | |
result.push(elems[i]); | |
if(--limit <= 0) break; | |
} | |
childs = elems[i].children; | |
if(recurse && childs && childs.length > 0){ | |
childs = find(test, childs, recurse, limit); | |
result = result.concat(childs); | |
limit -= childs.length; | |
if(limit <= 0) break; | |
} | |
} | |
return result; | |
} | |
function findOneChild(test, elems){ | |
for(var i = 0, l = elems.length; i < l; i++){ | |
if(test(elems[i])) return elems[i]; | |
} | |
return null; | |
} | |
function findOne(test, elems){ | |
var elem = null; | |
for(var i = 0, l = elems.length; i < l && !elem; i++){ | |
if(!isTag(elems[i])){ | |
continue; | |
} else if(test(elems[i])){ | |
elem = elems[i]; | |
} else if(elems[i].children.length > 0){ | |
elem = findOne(test, elems[i].children); | |
} | |
} | |
return elem; | |
} | |
function existsOne(test, elems){ | |
for(var i = 0, l = elems.length; i < l; i++){ | |
if( | |
isTag(elems[i]) && ( | |
test(elems[i]) || ( | |
elems[i].children.length > 0 && | |
existsOne(test, elems[i].children) | |
) | |
) | |
){ | |
return true; | |
} | |
} | |
return false; | |
} | |
function findAll(test, elems){ | |
var result = []; | |
for(var i = 0, j = elems.length; i < j; i++){ | |
if(!isTag(elems[i])) continue; | |
if(test(elems[i])) result.push(elems[i]); | |
if(elems[i].children.length > 0){ | |
result = result.concat(findAll(test, elems[i].children)); | |
} | |
} | |
return result; | |
} | |
/***/ }, | |
/* 91 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var ElementType = __webpack_require__(51); | |
var isTag = exports.isTag = ElementType.isTag; | |
exports.testElement = function(options, element){ | |
for(var key in options){ | |
if(!options.hasOwnProperty(key)); | |
else if(key === "tag_name"){ | |
if(!isTag(element) || !options.tag_name(element.name)){ | |
return false; | |
} | |
} else if(key === "tag_type"){ | |
if(!options.tag_type(element.type)) return false; | |
} else if(key === "tag_contains"){ | |
if(isTag(element) || !options.tag_contains(element.data)){ | |
return false; | |
} | |
} else if(!element.attribs || !options[key](element.attribs[key])){ | |
return false; | |
} | |
} | |
return true; | |
}; | |
var Checks = { | |
tag_name: function(name){ | |
if(typeof name === "function"){ | |
return function(elem){ return isTag(elem) && name(elem.name); }; | |
} else if(name === "*"){ | |
return isTag; | |
} else { | |
return function(elem){ return isTag(elem) && elem.name === name; }; | |
} | |
}, | |
tag_type: function(type){ | |
if(typeof type === "function"){ | |
return function(elem){ return type(elem.type); }; | |
} else { | |
return function(elem){ return elem.type === type; }; | |
} | |
}, | |
tag_contains: function(data){ | |
if(typeof data === "function"){ | |
return function(elem){ return !isTag(elem) && data(elem.data); }; | |
} else { | |
return function(elem){ return !isTag(elem) && elem.data === data; }; | |
} | |
} | |
}; | |
function getAttribCheck(attrib, value){ | |
if(typeof value === "function"){ | |
return function(elem){ return elem.attribs && value(elem.attribs[attrib]); }; | |
} else { | |
return function(elem){ return elem.attribs && elem.attribs[attrib] === value; }; | |
} | |
} | |
function combineFuncs(a, b){ | |
return function(elem){ | |
return a(elem) || b(elem); | |
}; | |
} | |
exports.getElements = function(options, element, recurse, limit){ | |
var funcs = Object.keys(options).map(function(key){ | |
var value = options[key]; | |
return key in Checks ? Checks[key](value) : getAttribCheck(key, value); | |
}); | |
return funcs.length === 0 ? [] : this.filter( | |
funcs.reduce(combineFuncs), | |
element, recurse, limit | |
); | |
}; | |
exports.getElementById = function(id, element, recurse){ | |
if(!Array.isArray(element)) element = [element]; | |
return this.findOne(getAttribCheck("id", id), element, recurse !== false); | |
}; | |
exports.getElementsByTagName = function(name, element, recurse, limit){ | |
return this.filter(Checks.tag_name(name), element, recurse, limit); | |
}; | |
exports.getElementsByTagType = function(type, element, recurse, limit){ | |
return this.filter(Checks.tag_type(type), element, recurse, limit); | |
}; | |
/***/ }, | |
/* 92 */ | |
/***/ function(module, exports) { | |
// removeSubsets | |
// Given an array of nodes, remove any member that is contained by another. | |
exports.removeSubsets = function(nodes) { | |
var idx = nodes.length, node, ancestor, replace; | |
// Check if each node (or one of its ancestors) is already contained in the | |
// array. | |
while (--idx > -1) { | |
node = ancestor = nodes[idx]; | |
// Temporarily remove the node under consideration | |
nodes[idx] = null; | |
replace = true; | |
while (ancestor) { | |
if (nodes.indexOf(ancestor) > -1) { | |
replace = false; | |
nodes.splice(idx, 1); | |
break; | |
} | |
ancestor = ancestor.parent; | |
} | |
// If the node has been found to be unique, re-insert it. | |
if (replace) { | |
nodes[idx] = node; | |
} | |
} | |
return nodes; | |
}; | |
// Source: http://dom.spec.whatwg.org/#dom-node-comparedocumentposition | |
var POSITION = { | |
DISCONNECTED: 1, | |
PRECEDING: 2, | |
FOLLOWING: 4, | |
CONTAINS: 8, | |
CONTAINED_BY: 16 | |
}; | |
// Compare the position of one node against another node in any other document. | |
// The return value is a bitmask with the following values: | |
// | |
// document order: | |
// > There is an ordering, document order, defined on all the nodes in the | |
// > document corresponding to the order in which the first character of the | |
// > XML representation of each node occurs in the XML representation of the | |
// > document after expansion of general entities. Thus, the document element | |
// > node will be the first node. Element nodes occur before their children. | |
// > Thus, document order orders element nodes in order of the occurrence of | |
// > their start-tag in the XML (after expansion of entities). The attribute | |
// > nodes of an element occur after the element and before its children. The | |
// > relative order of attribute nodes is implementation-dependent./ | |
// Source: | |
// http://www.w3.org/TR/DOM-Level-3-Core/glossary.html#dt-document-order | |
// | |
// @argument {Node} nodaA The first node to use in the comparison | |
// @argument {Node} nodeB The second node to use in the comparison | |
// | |
// @return {Number} A bitmask describing the input nodes' relative position. | |
// See http://dom.spec.whatwg.org/#dom-node-comparedocumentposition for | |
// a description of these values. | |
var comparePos = exports.compareDocumentPosition = function(nodeA, nodeB) { | |
var aParents = []; | |
var bParents = []; | |
var current, sharedParent, siblings, aSibling, bSibling, idx; | |
if (nodeA === nodeB) { | |
return 0; | |
} | |
current = nodeA; | |
while (current) { | |
aParents.unshift(current); | |
current = current.parent; | |
} | |
current = nodeB; | |
while (current) { | |
bParents.unshift(current); | |
current = current.parent; | |
} | |
idx = 0; | |
while (aParents[idx] === bParents[idx]) { | |
idx++; | |
} | |
if (idx === 0) { | |
return POSITION.DISCONNECTED; | |
} | |
sharedParent = aParents[idx - 1]; | |
siblings = sharedParent.children; | |
aSibling = aParents[idx]; | |
bSibling = bParents[idx]; | |
if (siblings.indexOf(aSibling) > siblings.indexOf(bSibling)) { | |
if (sharedParent === nodeB) { | |
return POSITION.FOLLOWING | POSITION.CONTAINED_BY; | |
} | |
return POSITION.FOLLOWING; | |
} else { | |
if (sharedParent === nodeA) { | |
return POSITION.PRECEDING | POSITION.CONTAINS; | |
} | |
return POSITION.PRECEDING; | |
} | |
}; | |
// Sort an array of nodes based on their relative position in the document and | |
// remove any duplicate nodes. If the array contains nodes that do not belong | |
// to the same document, sort order is unspecified. | |
// | |
// @argument {Array} nodes Array of DOM nodes | |
// | |
// @returns {Array} collection of unique nodes, sorted in document order | |
exports.uniqueSort = function(nodes) { | |
var idx = nodes.length, node, position; | |
nodes = nodes.slice(); | |
while (--idx > -1) { | |
node = nodes[idx]; | |
position = nodes.indexOf(node); | |
if (position > -1 && position < idx) { | |
nodes.splice(idx, 1); | |
} | |
} | |
nodes.sort(function(a, b) { | |
var relative = comparePos(a, b); | |
if (relative & POSITION.PRECEDING) { | |
return -1; | |
} else if (relative & POSITION.FOLLOWING) { | |
return 1; | |
} | |
return 0; | |
}); | |
return nodes; | |
}; | |
/***/ }, | |
/* 93 */ | |
/***/ function(module, exports, __webpack_require__) { | |
module.exports = CollectingHandler; | |
function CollectingHandler(cbs){ | |
this._cbs = cbs || {}; | |
this.events = []; | |
} | |
var EVENTS = __webpack_require__(37).EVENTS; | |
Object.keys(EVENTS).forEach(function(name){ | |
if(EVENTS[name] === 0){ | |
name = "on" + name; | |
CollectingHandler.prototype[name] = function(){ | |
this.events.push([name]); | |
if(this._cbs[name]) this._cbs[name](); | |
}; | |
} else if(EVENTS[name] === 1){ | |
name = "on" + name; | |
CollectingHandler.prototype[name] = function(a){ | |
this.events.push([name, a]); | |
if(this._cbs[name]) this._cbs[name](a); | |
}; | |
} else if(EVENTS[name] === 2){ | |
name = "on" + name; | |
CollectingHandler.prototype[name] = function(a, b){ | |
this.events.push([name, a, b]); | |
if(this._cbs[name]) this._cbs[name](a, b); | |
}; | |
} else { | |
throw Error("wrong number of arguments"); | |
} | |
}); | |
CollectingHandler.prototype.onreset = function(){ | |
this.events = []; | |
if(this._cbs.onreset) this._cbs.onreset(); | |
}; | |
CollectingHandler.prototype.restart = function(){ | |
if(this._cbs.onreset) this._cbs.onreset(); | |
for(var i = 0, len = this.events.length; i < len; i++){ | |
if(this._cbs[this.events[i][0]]){ | |
var num = this.events[i].length; | |
if(num === 1){ | |
this._cbs[this.events[i][0]](); | |
} else if(num === 2){ | |
this._cbs[this.events[i][0]](this.events[i][1]); | |
} else { | |
this._cbs[this.events[i][0]](this.events[i][1], this.events[i][2]); | |
} | |
} | |
} | |
}; | |
/***/ }, | |
/* 94 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var parse = __webpack_require__(32), | |
render = __webpack_require__(78); | |
/** | |
* HTML Tags | |
*/ | |
var tags = { tag: true, script: true, style: true }; | |
/** | |
* Check if the DOM element is a tag | |
* | |
* isTag(type) includes <script> and <style> tags | |
*/ | |
exports.isTag = function(type) { | |
if (type.type) type = type.type; | |
return tags[type] || false; | |
}; | |
/** | |
* Convert a string to camel case notation. | |
* @param {String} str String to be converted. | |
* @return {String} String in camel case notation. | |
*/ | |
exports.camelCase = function(str) { | |
return str.replace(/[_.-](\w|$)/g, function(_, x) { | |
return x.toUpperCase(); | |
}); | |
}; | |
/** | |
* Convert a string from camel case to "CSS case", where word boundaries are | |
* described by hyphens ("-") and all characters are lower-case. | |
* @param {String} str String to be converted. | |
* @return {string} String in "CSS case". | |
*/ | |
exports.cssCase = function(str) { | |
return str.replace(/[A-Z]/g, '-$&').toLowerCase(); | |
}; | |
/** | |
* Iterate over each DOM element without creating intermediary Cheerio instances. | |
* | |
* This is indented for use internally to avoid otherwise unnecessary memory pressure introduced | |
* by _make. | |
*/ | |
exports.domEach = function(cheerio, fn) { | |
var i = 0, len = cheerio.length; | |
while (i < len && fn.call(cheerio, i, cheerio[i]) !== false) ++i; | |
return cheerio; | |
}; | |
/** | |
* Create a deep copy of the given DOM structure by first rendering it to a | |
* string and then parsing the resultant markup. | |
* | |
* @argument {Object} dom - The htmlparser2-compliant DOM structure | |
* @argument {Object} options - The parsing/rendering options | |
*/ | |
exports.cloneDom = function(dom, options) { | |
return parse(render(dom, options), options).children; | |
}; | |
/* | |
* A simple way to check for HTML strings or ID strings | |
*/ | |
var quickExpr = /^(?:[^#<]*(<[\w\W]+>)[^>]*$|#([\w\-]*)$)/; | |
/* | |
* Check if string is HTML | |
*/ | |
exports.isHtml = function(str) { | |
// Faster than running regex, if str starts with `<` and ends with `>`, assume it's HTML | |
if (str.charAt(0) === '<' && str.charAt(str.length - 1) === '>' && str.length >= 3) return true; | |
// Run the regex | |
var match = quickExpr.exec(str); | |
return !!(match && match[1]); | |
}; | |
/***/ }, | |
/* 95 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var __WEBPACK_AMD_DEFINE_RESULT__;/* WEBPACK VAR INJECTION */(function(global, module) {/** | |
* @license | |
* lodash <https://lodash.com/> | |
* Copyright jQuery Foundation and other contributors <https://jquery.org/> | |
* Released under MIT license <https://lodash.com/license> | |
* Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE> | |
* Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors | |
*/ | |
;(function() { | |
/** Used as a safe reference for `undefined` in pre-ES5 environments. */ | |
var undefined; | |
/** Used as the semantic version number. */ | |
var VERSION = '4.15.0'; | |
/** Used as the size to enable large array optimizations. */ | |
var LARGE_ARRAY_SIZE = 200; | |
/** Used as the `TypeError` message for "Functions" methods. */ | |
var FUNC_ERROR_TEXT = 'Expected a function'; | |
/** Used to stand-in for `undefined` hash values. */ | |
var HASH_UNDEFINED = '__lodash_hash_undefined__'; | |
/** Used as the internal argument placeholder. */ | |
var PLACEHOLDER = '__lodash_placeholder__'; | |
/** Used to compose bitmasks for function 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, | |
FLIP_FLAG = 512; | |
/** Used to compose bitmasks for comparison styles. */ | |
var UNORDERED_COMPARE_FLAG = 1, | |
PARTIAL_COMPARE_FLAG = 2; | |
/** Used as default options for `_.truncate`. */ | |
var DEFAULT_TRUNC_LENGTH = 30, | |
DEFAULT_TRUNC_OMISSION = '...'; | |
/** Used to detect hot functions by number of calls within a span of milliseconds. */ | |
var HOT_COUNT = 150, | |
HOT_SPAN = 16; | |
/** Used to indicate the type of lazy iteratees. */ | |
var LAZY_FILTER_FLAG = 1, | |
LAZY_MAP_FLAG = 2, | |
LAZY_WHILE_FLAG = 3; | |
/** Used as references for various `Number` constants. */ | |
var INFINITY = 1 / 0, | |
MAX_SAFE_INTEGER = 9007199254740991, | |
MAX_INTEGER = 1.7976931348623157e+308, | |
NAN = 0 / 0; | |
/** Used as references for the maximum length and index of an array. */ | |
var MAX_ARRAY_LENGTH = 4294967295, | |
MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1, | |
HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1; | |
/** Used to associate wrap methods with their bit flags. */ | |
var wrapFlags = [ | |
['ary', ARY_FLAG], | |
['bind', BIND_FLAG], | |
['bindKey', BIND_KEY_FLAG], | |
['curry', CURRY_FLAG], | |
['curryRight', CURRY_RIGHT_FLAG], | |
['flip', FLIP_FLAG], | |
['partial', PARTIAL_FLAG], | |
['partialRight', PARTIAL_RIGHT_FLAG], | |
['rearg', REARG_FLAG] | |
]; | |
/** `Object#toString` result references. */ | |
var argsTag = '[object Arguments]', | |
arrayTag = '[object Array]', | |
boolTag = '[object Boolean]', | |
dateTag = '[object Date]', | |
errorTag = '[object Error]', | |
funcTag = '[object Function]', | |
genTag = '[object GeneratorFunction]', | |
mapTag = '[object Map]', | |
numberTag = '[object Number]', | |
objectTag = '[object Object]', | |
promiseTag = '[object Promise]', | |
regexpTag = '[object RegExp]', | |
setTag = '[object Set]', | |
stringTag = '[object String]', | |
symbolTag = '[object Symbol]', | |
weakMapTag = '[object WeakMap]', | |
weakSetTag = '[object WeakSet]'; | |
var arrayBufferTag = '[object ArrayBuffer]', | |
dataViewTag = '[object DataView]', | |
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)[^\\]|\\.)*?\1)\]/, | |
reIsPlainProp = /^\w*$/, | |
reLeadingDot = /^\./, | |
rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g; | |
/** | |
* Used to match `RegExp` | |
* [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns). | |
*/ | |
var reRegExpChar = /[\\^$.*+?()[\]{}|]/g, | |
reHasRegExpChar = RegExp(reRegExpChar.source); | |
/** Used to match leading and trailing whitespace. */ | |
var reTrim = /^\s+|\s+$/g, | |
reTrimStart = /^\s+/, | |
reTrimEnd = /\s+$/; | |
/** Used to match wrap detail comments. */ | |
var reWrapComment = /\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/, | |
reWrapDetails = /\{\n\/\* \[wrapped with (.+)\] \*/, | |
reSplitDetails = /,? & /; | |
/** Used to match words composed of alphanumeric characters. */ | |
var reAsciiWord = /[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g; | |
/** Used to match backslashes in property paths. */ | |
var reEscapeChar = /\\(\\)?/g; | |
/** | |
* Used to match | |
* [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#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 = /^0x/i; | |
/** Used to detect bad signed hexadecimal string values. */ | |
var reIsBadHex = /^[-+]0x[0-9a-f]+$/i; | |
/** Used to detect binary string values. */ | |
var reIsBinary = /^0b[01]+$/i; | |
/** Used to detect host constructors (Safari). */ | |
var reIsHostCtor = /^\[object .+?Constructor\]$/; | |
/** Used to detect octal string values. */ | |
var reIsOctal = /^0o[0-7]+$/i; | |
/** Used to detect unsigned integer values. */ | |
var reIsUint = /^(?:0|[1-9]\d*)$/; | |
/** Used to match Latin Unicode letters (excluding mathematical operators). */ | |
var reLatin = /[\xc0-\xd6\xd8-\xf6\xf8-\xff\u0100-\u017f]/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 compose unicode character classes. */ | |
var rsAstralRange = '\\ud800-\\udfff', | |
rsComboMarksRange = '\\u0300-\\u036f\\ufe20-\\ufe23', | |
rsComboSymbolsRange = '\\u20d0-\\u20f0', | |
rsDingbatRange = '\\u2700-\\u27bf', | |
rsLowerRange = 'a-z\\xdf-\\xf6\\xf8-\\xff', | |
rsMathOpRange = '\\xac\\xb1\\xd7\\xf7', | |
rsNonCharRange = '\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf', | |
rsPunctuationRange = '\\u2000-\\u206f', | |
rsSpaceRange = ' \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000', | |
rsUpperRange = 'A-Z\\xc0-\\xd6\\xd8-\\xde', | |
rsVarRange = '\\ufe0e\\ufe0f', | |
rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange; | |
/** Used to compose unicode capture groups. */ | |
var rsApos = "['\u2019]", | |
rsAstral = '[' + rsAstralRange + ']', | |
rsBreak = '[' + rsBreakRange + ']', | |
rsCombo = '[' + rsComboMarksRange + rsComboSymbolsRange + ']', | |
rsDigits = '\\d+', | |
rsDingbat = '[' + rsDingbatRange + ']', | |
rsLower = '[' + rsLowerRange + ']', | |
rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']', | |
rsFitz = '\\ud83c[\\udffb-\\udfff]', | |
rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')', | |
rsNonAstral = '[^' + rsAstralRange + ']', | |
rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}', | |
rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]', | |
rsUpper = '[' + rsUpperRange + ']', | |
rsZWJ = '\\u200d'; | |
/** Used to compose unicode regexes. */ | |
var rsLowerMisc = '(?:' + rsLower + '|' + rsMisc + ')', | |
rsUpperMisc = '(?:' + rsUpper + '|' + rsMisc + ')', | |
rsOptLowerContr = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?', | |
rsOptUpperContr = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?', | |
reOptMod = rsModifier + '?', | |
rsOptVar = '[' + rsVarRange + ']?', | |
rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*', | |
rsSeq = rsOptVar + reOptMod + rsOptJoin, | |
rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq, | |
rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')'; | |
/** Used to match apostrophes. */ | |
var reApos = RegExp(rsApos, 'g'); | |
/** | |
* Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and | |
* [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols). | |
*/ | |
var reComboMark = RegExp(rsCombo, 'g'); | |
/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */ | |
var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g'); | |
/** Used to match complex or compound words. */ | |
var reUnicodeWord = RegExp([ | |
rsUpper + '?' + rsLower + '+' + rsOptLowerContr + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')', | |
rsUpperMisc + '+' + rsOptUpperContr + '(?=' + [rsBreak, rsUpper + rsLowerMisc, '$'].join('|') + ')', | |
rsUpper + '?' + rsLowerMisc + '+' + rsOptLowerContr, | |
rsUpper + '+' + rsOptUpperContr, | |
rsDigits, | |
rsEmoji | |
].join('|'), 'g'); | |
/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */ | |
var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboMarksRange + rsComboSymbolsRange + rsVarRange + ']'); | |
/** Used to detect strings that need a more robust regexp to match words. */ | |
var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2,}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/; | |
/** Used to assign default `context` object properties. */ | |
var contextProps = [ | |
'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array', | |
'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object', | |
'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array', | |
'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap', | |
'_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout' | |
]; | |
/** 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[dataViewTag] = 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[dataViewTag] = | |
cloneableTags[boolTag] = cloneableTags[dateTag] = | |
cloneableTags[float32Tag] = cloneableTags[float64Tag] = | |
cloneableTags[int8Tag] = cloneableTags[int16Tag] = | |
cloneableTags[int32Tag] = cloneableTags[mapTag] = | |
cloneableTags[numberTag] = cloneableTags[objectTag] = | |
cloneableTags[regexpTag] = cloneableTags[setTag] = | |
cloneableTags[stringTag] = cloneableTags[symbolTag] = | |
cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] = | |
cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true; | |
cloneableTags[errorTag] = cloneableTags[funcTag] = | |
cloneableTags[weakMapTag] = false; | |
/** Used to map Latin Unicode letters to basic Latin letters. */ | |
var deburredLetters = { | |
// Latin-1 Supplement block. | |
'\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', | |
// Latin Extended-A block. | |
'\u0100': 'A', '\u0102': 'A', '\u0104': 'A', | |
'\u0101': 'a', '\u0103': 'a', '\u0105': 'a', | |
'\u0106': 'C', '\u0108': 'C', '\u010a': 'C', '\u010c': 'C', | |
'\u0107': 'c', '\u0109': 'c', '\u010b': 'c', '\u010d': 'c', | |
'\u010e': 'D', '\u0110': 'D', '\u010f': 'd', '\u0111': 'd', | |
'\u0112': 'E', '\u0114': 'E', '\u0116': 'E', '\u0118': 'E', '\u011a': 'E', | |
'\u0113': 'e', '\u0115': 'e', '\u0117': 'e', '\u0119': 'e', '\u011b': 'e', | |
'\u011c': 'G', '\u011e': 'G', '\u0120': 'G', '\u0122': 'G', | |
'\u011d': 'g', '\u011f': 'g', '\u0121': 'g', '\u0123': 'g', | |
'\u0124': 'H', '\u0126': 'H', '\u0125': 'h', '\u0127': 'h', | |
'\u0128': 'I', '\u012a': 'I', '\u012c': 'I', '\u012e': 'I', '\u0130': 'I', | |
'\u0129': 'i', '\u012b': 'i', '\u012d': 'i', '\u012f': 'i', '\u0131': 'i', | |
'\u0134': 'J', '\u0135': 'j', | |
'\u0136': 'K', '\u0137': 'k', '\u0138': 'k', | |
'\u0139': 'L', '\u013b': 'L', '\u013d': 'L', '\u013f': 'L', '\u0141': 'L', | |
'\u013a': 'l', '\u013c': 'l', '\u013e': 'l', '\u0140': 'l', '\u0142': 'l', | |
'\u0143': 'N', '\u0145': 'N', '\u0147': 'N', '\u014a': 'N', | |
'\u0144': 'n', '\u0146': 'n', '\u0148': 'n', '\u014b': 'n', | |
'\u014c': 'O', '\u014e': 'O', '\u0150': 'O', | |
'\u014d': 'o', '\u014f': 'o', '\u0151': 'o', | |
'\u0154': 'R', '\u0156': 'R', '\u0158': 'R', | |
'\u0155': 'r', '\u0157': 'r', '\u0159': 'r', | |
'\u015a': 'S', '\u015c': 'S', '\u015e': 'S', '\u0160': 'S', | |
'\u015b': 's', '\u015d': 's', '\u015f': 's', '\u0161': 's', | |
'\u0162': 'T', '\u0164': 'T', '\u0166': 'T', | |
'\u0163': 't', '\u0165': 't', '\u0167': 't', | |
'\u0168': 'U', '\u016a': 'U', '\u016c': 'U', '\u016e': 'U', '\u0170': 'U', '\u0172': 'U', | |
'\u0169': 'u', '\u016b': 'u', '\u016d': 'u', '\u016f': 'u', '\u0171': 'u', '\u0173': 'u', | |
'\u0174': 'W', '\u0175': 'w', | |
'\u0176': 'Y', '\u0177': 'y', '\u0178': 'Y', | |
'\u0179': 'Z', '\u017b': 'Z', '\u017d': 'Z', | |
'\u017a': 'z', '\u017c': 'z', '\u017e': 'z', | |
'\u0132': 'IJ', '\u0133': 'ij', | |
'\u0152': 'Oe', '\u0153': 'oe', | |
'\u0149': "'n", '\u017f': 'ss' | |
}; | |
/** Used to map characters to HTML entities. */ | |
var htmlEscapes = { | |
'&': '&', | |
'<': '<', | |
'>': '>', | |
'"': '"', | |
"'": ''', | |
'`': '`' | |
}; | |
/** Used to map HTML entities to characters. */ | |
var htmlUnescapes = { | |
'&': '&', | |
'<': '<', | |
'>': '>', | |
'"': '"', | |
''': "'", | |
'`': '`' | |
}; | |
/** Used to escape characters for inclusion in compiled string literals. */ | |
var stringEscapes = { | |
'\\': '\\', | |
"'": "'", | |
'\n': 'n', | |
'\r': 'r', | |
'\u2028': 'u2028', | |
'\u2029': 'u2029' | |
}; | |
/** Built-in method references without a dependency on `root`. */ | |
var freeParseFloat = parseFloat, | |
freeParseInt = parseInt; | |
/** Detect free variable `global` from Node.js. */ | |
var freeGlobal = typeof global == 'object' && global && global.Object === Object && global; | |
/** Detect free variable `self`. */ | |
var freeSelf = typeof self == 'object' && self && self.Object === Object && self; | |
/** Used as a reference to the global object. */ | |
var root = freeGlobal || freeSelf || Function('return this')(); | |
/** Detect free variable `exports`. */ | |
var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports; | |
/** Detect free variable `module`. */ | |
var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module; | |
/** Detect the popular CommonJS extension `module.exports`. */ | |
var moduleExports = freeModule && freeModule.exports === freeExports; | |
/** Detect free variable `process` from Node.js. */ | |
var freeProcess = moduleExports && freeGlobal.process; | |
/** Used to access faster Node.js helpers. */ | |
var nodeUtil = (function() { | |
try { | |
return freeProcess && freeProcess.binding('util'); | |
} catch (e) {} | |
}()); | |
/* Node.js helper references. */ | |
var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer, | |
nodeIsDate = nodeUtil && nodeUtil.isDate, | |
nodeIsMap = nodeUtil && nodeUtil.isMap, | |
nodeIsRegExp = nodeUtil && nodeUtil.isRegExp, | |
nodeIsSet = nodeUtil && nodeUtil.isSet, | |
nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray; | |
/*--------------------------------------------------------------------------*/ | |
/** | |
* Adds the key-value `pair` to `map`. | |
* | |
* @private | |
* @param {Object} map The map to modify. | |
* @param {Array} pair The key-value pair to add. | |
* @returns {Object} Returns `map`. | |
*/ | |
function addMapEntry(map, pair) { | |
// Don't return `map.set` because it's not chainable in IE 11. | |
map.set(pair[0], pair[1]); | |
return map; | |
} | |
/** | |
* Adds `value` to `set`. | |
* | |
* @private | |
* @param {Object} set The set to modify. | |
* @param {*} value The value to add. | |
* @returns {Object} Returns `set`. | |
*/ | |
function addSetEntry(set, value) { | |
// Don't return `set.add` because it's not chainable in IE 11. | |
set.add(value); | |
return set; | |
} | |
/** | |
* A faster alternative to `Function#apply`, this function invokes `func` | |
* with the `this` binding of `thisArg` and the arguments of `args`. | |
* | |
* @private | |
* @param {Function} func The function to invoke. | |
* @param {*} thisArg The `this` binding of `func`. | |
* @param {Array} args The arguments to invoke `func` with. | |
* @returns {*} Returns the result of `func`. | |
*/ | |
function apply(func, thisArg, args) { | |
switch (args.length) { | |
case 0: return func.call(thisArg); | |
case 1: return func.call(thisArg, args[0]); | |
case 2: return func.call(thisArg, args[0], args[1]); | |
case 3: return func.call(thisArg, args[0], args[1], args[2]); | |
} | |
return func.apply(thisArg, args); | |
} | |
/** | |
* A specialized version of `baseAggregator` for arrays. | |
* | |
* @private | |
* @param {Array} [array] The array to iterate over. | |
* @param {Function} setter The function to set `accumulator` values. | |
* @param {Function} iteratee The iteratee to transform keys. | |
* @param {Object} accumulator The initial aggregated object. | |
* @returns {Function} Returns `accumulator`. | |
*/ | |
function arrayAggregator(array, setter, iteratee, accumulator) { | |
var index = -1, | |
length = array ? array.length : 0; | |
while (++index < length) { | |
var value = array[index]; | |
setter(accumulator, value, iteratee(value), array); | |
} | |
return accumulator; | |
} | |
/** | |
* A specialized version of `_.forEach` for arrays without support for | |
* iteratee shorthands. | |
* | |
* @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 ? array.length : 0; | |
while (++index < length) { | |
if (iteratee(array[index], index, array) === false) { | |
break; | |
} | |
} | |
return array; | |
} | |
/** | |
* A specialized version of `_.forEachRight` for arrays without support for | |
* iteratee shorthands. | |
* | |
* @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 ? array.length : 0; | |
while (length--) { | |
if (iteratee(array[length], length, array) === false) { | |
break; | |
} | |
} | |
return array; | |
} | |
/** | |
* A specialized version of `_.every` for arrays without support for | |
* iteratee shorthands. | |
* | |
* @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 ? array.length : 0; | |
while (++index < length) { | |
if (!predicate(array[index], index, array)) { | |
return false; | |
} | |
} | |
return true; | |
} | |
/** | |
* A specialized version of `_.filter` for arrays without support for | |
* iteratee shorthands. | |
* | |
* @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 ? array.length : 0, | |
resIndex = 0, | |
result = []; | |
while (++index < length) { | |
var value = array[index]; | |
if (predicate(value, index, array)) { | |
result[resIndex++] = value; | |
} | |
} | |
return result; | |
} | |
/** | |
* A specialized version of `_.includes` for arrays without support for | |
* specifying an index to search from. | |
* | |
* @private | |
* @param {Array} [array] The array to inspect. | |
* @param {*} target The value to search for. | |
* @returns {boolean} Returns `true` if `target` is found, else `false`. | |
*/ | |
function arrayIncludes(array, value) { | |
var length = array ? array.length : 0; | |
return !!length && baseIndexOf(array, value, 0) > -1; | |
} | |
/** | |
* This function is like `arrayIncludes` except that it accepts a comparator. | |
* | |
* @private | |
* @param {Array} [array] The array to inspect. | |
* @param {*} target The value to search for. | |
* @param {Function} comparator The comparator invoked per element. | |
* @returns {boolean} Returns `true` if `target` is found, else `false`. | |
*/ | |
function arrayIncludesWith(array, value, comparator) { | |
var index = -1, | |
length = array ? array.length : 0; | |
while (++index < length) { | |
if (comparator(value, array[index])) { | |
return true; | |
} | |
} | |
return false; | |
} | |
/** | |
* A specialized version of `_.map` for arrays without support for iteratee | |
* shorthands. | |
* | |
* @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 ? array.length : 0, | |
result = Array(length); | |
while (++index < length) { | |
result[index] = iteratee(array[index], index, array); | |
} | |
return result; | |
} | |
/** | |
* Appends the elements of `values` to `array`. | |
* | |
* @private | |
* @param {Array} array The array to modify. | |
* @param {Array} values The values to append. | |
* @returns {Array} Returns `array`. | |
*/ | |
function arrayPush(array, values) { | |
var index = -1, | |
length = values.length, | |
offset = array.length; | |
while (++index < length) { | |
array[offset + index] = values[index]; | |
} | |
return array; | |
} | |
/** | |
* A specialized version of `_.reduce` for arrays without support for | |
* iteratee shorthands. | |
* | |
* @private | |
* @param {Array} [array] The array to iterate over. | |
* @param {Function} iteratee The function invoked per iteration. | |
* @param {*} [accumulator] The initial value. | |
* @param {boolean} [initAccum] Specify using the first element of `array` as | |
* the initial value. | |
* @returns {*} Returns the accumulated value. | |
*/ | |
function arrayReduce(array, iteratee, accumulator, initAccum) { | |
var index = -1, | |
length = array ? array.length : 0; | |
if (initAccum && length) { | |
accumulator = array[++index]; | |
} | |
while (++index < length) { | |
accumulator = iteratee(accumulator, array[index], index, array); | |
} | |
return accumulator; | |
} | |
/** | |
* A specialized version of `_.reduceRight` for arrays without support for | |
* iteratee shorthands. | |
* | |
* @private | |
* @param {Array} [array] The array to iterate over. | |
* @param {Function} iteratee The function invoked per iteration. | |
* @param {*} [accumulator] The initial value. | |
* @param {boolean} [initAccum] Specify using the last element of `array` as | |
* the initial value. | |
* @returns {*} Returns the accumulated value. | |
*/ | |
function arrayReduceRight(array, iteratee, accumulator, initAccum) { | |
var length = array ? array.length : 0; | |
if (initAccum && length) { | |
accumulator = array[--length]; | |
} | |
while (length--) { | |
accumulator = iteratee(accumulator, array[length], length, array); | |
} | |
return accumulator; | |
} | |
/** | |
* A specialized version of `_.some` for arrays without support for iteratee | |
* shorthands. | |
* | |
* @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 ? array.length : 0; | |
while (++index < length) { | |
if (predicate(array[index], index, array)) { | |
return true; | |
} | |
} | |
return false; | |
} | |
/** | |
* Gets the size of an ASCII `string`. | |
* | |
* @private | |
* @param {string} string The string inspect. | |
* @returns {number} Returns the string size. | |
*/ | |
var asciiSize = baseProperty('length'); | |
/** | |
* Converts an ASCII `string` to an array. | |
* | |
* @private | |
* @param {string} string The string to convert. | |
* @returns {Array} Returns the converted array. | |
*/ | |
function asciiToArray(string) { | |
return string.split(''); | |
} | |
/** | |
* Splits an ASCII `string` into an array of its words. | |
* | |
* @private | |
* @param {string} The string to inspect. | |
* @returns {Array} Returns the words of `string`. | |
*/ | |
function asciiWords(string) { | |
return string.match(reAsciiWord) || []; | |
} | |
/** | |
* The base implementation of methods like `_.findKey` and `_.findLastKey`, | |
* without support for iteratee shorthands, which iterates over `collection` | |
* using `eachFunc`. | |
* | |
* @private | |
* @param {Array|Object} collection The collection to inspect. | |
* @param {Function} predicate The function invoked per iteration. | |
* @param {Function} eachFunc The function to iterate over `collection`. | |
* @returns {*} Returns the found element or its key, else `undefined`. | |
*/ | |
function baseFindKey(collection, predicate, eachFunc) { | |
var result; | |
eachFunc(collection, function(value, key, collection) { | |
if (predicate(value, key, collection)) { | |
result = key; | |
return false; | |
} | |
}); | |
return result; | |
} | |
/** | |
* The base implementation of `_.findIndex` and `_.findLastIndex` without | |
* support for iteratee shorthands. | |
* | |
* @private | |
* @param {Array} array The array to inspect. | |
* @param {Function} predicate The function invoked per iteration. | |
* @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 value, else `-1`. | |
*/ | |
function baseFindIndex(array, predicate, fromIndex, fromRight) { | |
var length = array.length, | |
index = fromIndex + (fromRight ? 1 : -1); | |
while ((fromRight ? index-- : ++index < length)) { | |
if (predicate(array[index], index, array)) { | |
return index; | |
} | |
} | |
return -1; | |
} | |
/** | |
* The base implementation of `_.indexOf` without `fromIndex` bounds checks. | |
* | |
* @private | |
* @param {Array} array The array to inspect. | |
* @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 baseFindIndex(array, baseIsNaN, fromIndex); | |
} | |
var index = fromIndex - 1, | |
length = array.length; | |
while (++index < length) { | |
if (array[index] === value) { | |
return index; | |
} | |
} | |
return -1; | |
} | |
/** | |
* This function is like `baseIndexOf` except that it accepts a comparator. | |
* | |
* @private | |
* @param {Array} array The array to inspect. | |
* @param {*} value The value to search for. | |
* @param {number} fromIndex The index to search from. | |
* @param {Function} comparator The comparator invoked per element. | |
* @returns {number} Returns the index of the matched value, else `-1`. | |
*/ | |
function baseIndexOfWith(array, value, fromIndex, comparator) { | |
var index = fromIndex - 1, | |
length = array.length; | |
while (++index < length) { | |
if (comparator(array[index], value)) { | |
return index; | |
} | |
} | |
return -1; | |
} | |
/** | |
* The base implementation of `_.isNaN` without support for number objects. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is `NaN`, else `false`. | |
*/ | |
function baseIsNaN(value) { | |
return value !== value; | |
} | |
/** | |
* The base implementation of `_.mean` and `_.meanBy` without support for | |
* iteratee shorthands. | |
* | |
* @private | |
* @param {Array} array The array to iterate over. | |
* @param {Function} iteratee The function invoked per iteration. | |
* @returns {number} Returns the mean. | |
*/ | |
function baseMean(array, iteratee) { | |
var length = array ? array.length : 0; | |
return length ? (baseSum(array, iteratee) / length) : NAN; | |
} | |
/** | |
* 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 accessor function. | |
*/ | |
function baseProperty(key) { | |
return function(object) { | |
return object == null ? undefined : object[key]; | |
}; | |
} | |
/** | |
* The base implementation of `_.propertyOf` without support for deep paths. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @returns {Function} Returns the new accessor function. | |
*/ | |
function basePropertyOf(object) { | |
return function(key) { | |
return object == null ? undefined : object[key]; | |
}; | |
} | |
/** | |
* The base implementation of `_.reduce` and `_.reduceRight`, without support | |
* for iteratee shorthands, which iterates over `collection` using `eachFunc`. | |
* | |
* @private | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} iteratee The function invoked per iteration. | |
* @param {*} accumulator The initial value. | |
* @param {boolean} initAccum 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, initAccum, eachFunc) { | |
eachFunc(collection, function(value, index, collection) { | |
accumulator = initAccum | |
? (initAccum = false, value) | |
: iteratee(accumulator, value, index, collection); | |
}); | |
return accumulator; | |
} | |
/** | |
* 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.sort(comparer); | |
while (length--) { | |
array[length] = array[length].value; | |
} | |
return array; | |
} | |
/** | |
* The base implementation of `_.sum` and `_.sumBy` without support for | |
* iteratee shorthands. | |
* | |
* @private | |
* @param {Array} array The array to iterate over. | |
* @param {Function} iteratee The function invoked per iteration. | |
* @returns {number} Returns the sum. | |
*/ | |
function baseSum(array, iteratee) { | |
var result, | |
index = -1, | |
length = array.length; | |
while (++index < length) { | |
var current = iteratee(array[index]); | |
if (current !== undefined) { | |
result = result === undefined ? current : (result + current); | |
} | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `_.times` without support for iteratee shorthands | |
* or max array length checks. | |
* | |
* @private | |
* @param {number} n The number of times to invoke `iteratee`. | |
* @param {Function} iteratee The function invoked per iteration. | |
* @returns {Array} Returns the array of results. | |
*/ | |
function baseTimes(n, iteratee) { | |
var index = -1, | |
result = Array(n); | |
while (++index < n) { | |
result[index] = iteratee(index); | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array | |
* of key-value pairs for `object` 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 key-value pairs. | |
*/ | |
function baseToPairs(object, props) { | |
return arrayMap(props, function(key) { | |
return [key, object[key]]; | |
}); | |
} | |
/** | |
* The base implementation of `_.unary` without support for storing metadata. | |
* | |
* @private | |
* @param {Function} func The function to cap arguments for. | |
* @returns {Function} Returns the new capped function. | |
*/ | |
function baseUnary(func) { | |
return function(value) { | |
return func(value); | |
}; | |
} | |
/** | |
* 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) { | |
return arrayMap(props, function(key) { | |
return object[key]; | |
}); | |
} | |
/** | |
* Checks if a cache value for `key` exists. | |
* | |
* @private | |
* @param {Object} cache The cache to query. | |
* @param {string} key The key of the entry to check. | |
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`. | |
*/ | |
function cacheHas(cache, key) { | |
return cache.has(key); | |
} | |
/** | |
* Used by `_.trim` and `_.trimStart` to get the index of the first string symbol | |
* that is not found in the character symbols. | |
* | |
* @private | |
* @param {Array} strSymbols The string symbols to inspect. | |
* @param {Array} chrSymbols The character symbols to find. | |
* @returns {number} Returns the index of the first unmatched string symbol. | |
*/ | |
function charsStartIndex(strSymbols, chrSymbols) { | |
var index = -1, | |
length = strSymbols.length; | |
while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {} | |
return index; | |
} | |
/** | |
* Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol | |
* that is not found in the character symbols. | |
* | |
* @private | |
* @param {Array} strSymbols The string symbols to inspect. | |
* @param {Array} chrSymbols The character symbols to find. | |
* @returns {number} Returns the index of the last unmatched string symbol. | |
*/ | |
function charsEndIndex(strSymbols, chrSymbols) { | |
var index = strSymbols.length; | |
while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {} | |
return index; | |
} | |
/** | |
* Gets the number of `placeholder` occurrences in `array`. | |
* | |
* @private | |
* @param {Array} array The array to inspect. | |
* @param {*} placeholder The placeholder to search for. | |
* @returns {number} Returns the placeholder count. | |
*/ | |
function countHolders(array, placeholder) { | |
var length = array.length, | |
result = 0; | |
while (length--) { | |
if (array[length] === placeholder) { | |
result++; | |
} | |
} | |
return result; | |
} | |
/** | |
* Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A | |
* letters to basic Latin letters. | |
* | |
* @private | |
* @param {string} letter The matched letter to deburr. | |
* @returns {string} Returns the deburred letter. | |
*/ | |
var deburrLetter = basePropertyOf(deburredLetters); | |
/** | |
* Used by `_.escape` to convert characters to HTML entities. | |
* | |
* @private | |
* @param {string} chr The matched character to escape. | |
* @returns {string} Returns the escaped character. | |
*/ | |
var escapeHtmlChar = basePropertyOf(htmlEscapes); | |
/** | |
* 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 value at `key` of `object`. | |
* | |
* @private | |
* @param {Object} [object] The object to query. | |
* @param {string} key The key of the property to get. | |
* @returns {*} Returns the property value. | |
*/ | |
function getValue(object, key) { | |
return object == null ? undefined : object[key]; | |
} | |
/** | |
* Checks if `string` contains Unicode symbols. | |
* | |
* @private | |
* @param {string} string The string to inspect. | |
* @returns {boolean} Returns `true` if a symbol is found, else `false`. | |
*/ | |
function hasUnicode(string) { | |
return reHasUnicode.test(string); | |
} | |
/** | |
* Checks if `string` contains a word composed of Unicode symbols. | |
* | |
* @private | |
* @param {string} string The string to inspect. | |
* @returns {boolean} Returns `true` if a word is found, else `false`. | |
*/ | |
function hasUnicodeWord(string) { | |
return reHasUnicodeWord.test(string); | |
} | |
/** | |
* Checks if `value` is a host object in IE < 9. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a host object, else `false`. | |
*/ | |
function isHostObject(value) { | |
// Many host objects are `Object` objects that can coerce to strings | |
// despite having improperly defined `toString` methods. | |
var result = false; | |
if (value != null && typeof value.toString != 'function') { | |
try { | |
result = !!(value + ''); | |
} catch (e) {} | |
} | |
return result; | |
} | |
/** | |
* Converts `iterator` to an array. | |
* | |
* @private | |
* @param {Object} iterator The iterator to convert. | |
* @returns {Array} Returns the converted array. | |
*/ | |
function iteratorToArray(iterator) { | |
var data, | |
result = []; | |
while (!(data = iterator.next()).done) { | |
result.push(data.value); | |
} | |
return result; | |
} | |
/** | |
* Converts `map` to its key-value pairs. | |
* | |
* @private | |
* @param {Object} map The map to convert. | |
* @returns {Array} Returns the key-value pairs. | |
*/ | |
function mapToArray(map) { | |
var index = -1, | |
result = Array(map.size); | |
map.forEach(function(value, key) { | |
result[++index] = [key, value]; | |
}); | |
return result; | |
} | |
/** | |
* Creates a unary function that invokes `func` with its argument transformed. | |
* | |
* @private | |
* @param {Function} func The function to wrap. | |
* @param {Function} transform The argument transform. | |
* @returns {Function} Returns the new function. | |
*/ | |
function overArg(func, transform) { | |
return function(arg) { | |
return func(transform(arg)); | |
}; | |
} | |
/** | |
* 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 = 0, | |
result = []; | |
while (++index < length) { | |
var value = array[index]; | |
if (value === placeholder || value === PLACEHOLDER) { | |
array[index] = PLACEHOLDER; | |
result[resIndex++] = index; | |
} | |
} | |
return result; | |
} | |
/** | |
* Converts `set` to an array of its values. | |
* | |
* @private | |
* @param {Object} set The set to convert. | |
* @returns {Array} Returns the values. | |
*/ | |
function setToArray(set) { | |
var index = -1, | |
result = Array(set.size); | |
set.forEach(function(value) { | |
result[++index] = value; | |
}); | |
return result; | |
} | |
/** | |
* Converts `set` to its value-value pairs. | |
* | |
* @private | |
* @param {Object} set The set to convert. | |
* @returns {Array} Returns the value-value pairs. | |
*/ | |
function setToPairs(set) { | |
var index = -1, | |
result = Array(set.size); | |
set.forEach(function(value) { | |
result[++index] = [value, value]; | |
}); | |
return result; | |
} | |
/** | |
* Gets the number of symbols in `string`. | |
* | |
* @private | |
* @param {string} string The string to inspect. | |
* @returns {number} Returns the string size. | |
*/ | |
function stringSize(string) { | |
return hasUnicode(string) | |
? unicodeSize(string) | |
: asciiSize(string); | |
} | |
/** | |
* Converts `string` to an array. | |
* | |
* @private | |
* @param {string} string The string to convert. | |
* @returns {Array} Returns the converted array. | |
*/ | |
function stringToArray(string) { | |
return hasUnicode(string) | |
? unicodeToArray(string) | |
: asciiToArray(string); | |
} | |
/** | |
* Used by `_.unescape` to convert HTML entities to characters. | |
* | |
* @private | |
* @param {string} chr The matched character to unescape. | |
* @returns {string} Returns the unescaped character. | |
*/ | |
var unescapeHtmlChar = basePropertyOf(htmlUnescapes); | |
/** | |
* Gets the size of a Unicode `string`. | |
* | |
* @private | |
* @param {string} string The string inspect. | |
* @returns {number} Returns the string size. | |
*/ | |
function unicodeSize(string) { | |
var result = reUnicode.lastIndex = 0; | |
while (reUnicode.test(string)) { | |
result++; | |
} | |
return result; | |
} | |
/** | |
* Converts a Unicode `string` to an array. | |
* | |
* @private | |
* @param {string} string The string to convert. | |
* @returns {Array} Returns the converted array. | |
*/ | |
function unicodeToArray(string) { | |
return string.match(reUnicode) || []; | |
} | |
/** | |
* Splits a Unicode `string` into an array of its words. | |
* | |
* @private | |
* @param {string} The string to inspect. | |
* @returns {Array} Returns the words of `string`. | |
*/ | |
function unicodeWords(string) { | |
return string.match(reUnicodeWord) || []; | |
} | |
/*--------------------------------------------------------------------------*/ | |
/** | |
* Create a new pristine `lodash` function using the `context` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 1.1.0 | |
* @category Util | |
* @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 | |
* | |
* // Use `context` to stub `Date#getTime` use in `_.now`. | |
* var stubbed = _.runInContext({ | |
* 'Date': function() { | |
* return { 'getTime': stubGetTime }; | |
* } | |
* }); | |
* | |
* // Create a suped-up `defer` in Node.js. | |
* var defer = _.runInContext({ 'setTimeout': setImmediate }).defer; | |
*/ | |
function runInContext(context) { | |
context = context ? _.defaults(root.Object(), context, _.pick(root, contextProps)) : root; | |
/** Built-in constructor references. */ | |
var Array = context.Array, | |
Date = context.Date, | |
Error = context.Error, | |
Function = context.Function, | |
Math = context.Math, | |
Object = context.Object, | |
RegExp = context.RegExp, | |
String = context.String, | |
TypeError = context.TypeError; | |
/** Used for built-in method references. */ | |
var arrayProto = Array.prototype, | |
funcProto = Function.prototype, | |
objectProto = Object.prototype; | |
/** Used to detect overreaching core-js shims. */ | |
var coreJsData = context['__core-js_shared__']; | |
/** Used to detect methods masquerading as native. */ | |
var maskSrcKey = (function() { | |
var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || ''); | |
return uid ? ('Symbol(src)_1.' + uid) : ''; | |
}()); | |
/** Used to resolve the decompiled source of functions. */ | |
var funcToString = funcProto.toString; | |
/** Used to check objects for own properties. */ | |
var hasOwnProperty = objectProto.hasOwnProperty; | |
/** Used to generate unique IDs. */ | |
var idCounter = 0; | |
/** Used to infer the `Object` constructor. */ | |
var objectCtorString = funcToString.call(Object); | |
/** | |
* Used to resolve the | |
* [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring) | |
* of values. | |
*/ | |
var objectToString = objectProto.toString; | |
/** Used to restore the original `_` reference in `_.noConflict`. */ | |
var oldDash = root._; | |
/** Used to detect if a method is native. */ | |
var reIsNative = RegExp('^' + | |
funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&') | |
.replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$' | |
); | |
/** Built-in value references. */ | |
var Buffer = moduleExports ? context.Buffer : undefined, | |
Symbol = context.Symbol, | |
Uint8Array = context.Uint8Array, | |
getPrototype = overArg(Object.getPrototypeOf, Object), | |
iteratorSymbol = Symbol ? Symbol.iterator : undefined, | |
objectCreate = Object.create, | |
propertyIsEnumerable = objectProto.propertyIsEnumerable, | |
splice = arrayProto.splice, | |
spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined; | |
/** Mocked built-ins. */ | |
var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout, | |
ctxNow = Date && Date.now !== root.Date.now && Date.now, | |
ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout; | |
/* Built-in method references for those with the same name as other `lodash` methods. */ | |
var nativeCeil = Math.ceil, | |
nativeFloor = Math.floor, | |
nativeGetSymbols = Object.getOwnPropertySymbols, | |
nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined, | |
nativeIsFinite = context.isFinite, | |
nativeJoin = arrayProto.join, | |
nativeKeys = overArg(Object.keys, Object), | |
nativeMax = Math.max, | |
nativeMin = Math.min, | |
nativeParseInt = context.parseInt, | |
nativeRandom = Math.random, | |
nativeReverse = arrayProto.reverse; | |
/* Built-in method references that are verified to be native. */ | |
var DataView = getNative(context, 'DataView'), | |
Map = getNative(context, 'Map'), | |
Promise = getNative(context, 'Promise'), | |
Set = getNative(context, 'Set'), | |
WeakMap = getNative(context, 'WeakMap'), | |
nativeCreate = getNative(Object, 'create'); | |
/* Used to set `toString` methods. */ | |
var defineProperty = (function() { | |
var func = getNative(Object, 'defineProperty'), | |
name = getNative.name; | |
return (name && name.length > 2) ? func : undefined; | |
}()); | |
/** Used to store function metadata. */ | |
var metaMap = WeakMap && new WeakMap; | |
/** Detect if properties shadowing those on `Object.prototype` are non-enumerable. */ | |
var nonEnumShadows = !propertyIsEnumerable.call({ 'valueOf': 1 }, 'valueOf'); | |
/** Used to lookup unminified function names. */ | |
var realNames = {}; | |
/** Used to detect maps, sets, and weakmaps. */ | |
var dataViewCtorString = toSource(DataView), | |
mapCtorString = toSource(Map), | |
promiseCtorString = toSource(Promise), | |
setCtorString = toSource(Set), | |
weakMapCtorString = toSource(WeakMap); | |
/** Used to convert symbols to primitives and strings. */ | |
var symbolProto = Symbol ? Symbol.prototype : undefined, | |
symbolValueOf = symbolProto ? symbolProto.valueOf : undefined, | |
symbolToString = symbolProto ? symbolProto.toString : undefined; | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Creates a `lodash` object which wraps `value` to enable implicit method | |
* chain sequences. Methods that operate on and return arrays, collections, | |
* and functions can be chained together. Methods that retrieve a single value | |
* or may return a primitive value will automatically end the chain sequence | |
* and return the unwrapped value. Otherwise, the value must be unwrapped | |
* with `_#value`. | |
* | |
* Explicit chain sequences, which must be unwrapped with `_#value`, may be | |
* enabled using `_.chain`. | |
* | |
* The execution of chained methods is lazy, that is, it's deferred until | |
* `_#value` is implicitly or explicitly called. | |
* | |
* Lazy evaluation allows several methods to support shortcut fusion. | |
* Shortcut fusion is an optimization to merge iteratee calls; this avoids | |
* the creation of intermediate arrays and can greatly reduce the number of | |
* iteratee executions. Sections of a chain sequence qualify for shortcut | |
* fusion if the section is applied to an array of at least `200` elements | |
* and any iteratees accept only one argument. The heuristic for whether a | |
* section qualifies for shortcut fusion is subject to change. | |
* | |
* 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`, `shift`, `sort`, `splice`, and `unshift` | |
* | |
* The wrapper `String` methods are: | |
* `replace` and `split` | |
* | |
* The wrapper methods that support shortcut fusion are: | |
* `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`, | |
* `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`, | |
* `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray` | |
* | |
* The chainable wrapper methods are: | |
* `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`, | |
* `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`, | |
* `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`, | |
* `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`, | |
* `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`, | |
* `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`, | |
* `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`, | |
* `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`, | |
* `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`, | |
* `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`, | |
* `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`, | |
* `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`, | |
* `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`, | |
* `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`, | |
* `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`, | |
* `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`, | |
* `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`, | |
* `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`, | |
* `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`, | |
* `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`, | |
* `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`, | |
* `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`, | |
* `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`, | |
* `zipObject`, `zipObjectDeep`, and `zipWith` | |
* | |
* The wrapper methods that are **not** chainable by default are: | |
* `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`, | |
* `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`, | |
* `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`, | |
* `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`, | |
* `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`, | |
* `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`, | |
* `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`, | |
* `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`, | |
* `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`, | |
* `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`, | |
* `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`, | |
* `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`, | |
* `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`, | |
* `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`, | |
* `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`, | |
* `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`, | |
* `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`, | |
* `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`, | |
* `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`, | |
* `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`, | |
* `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`, | |
* `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`, | |
* `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`, | |
* `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`, | |
* `upperFirst`, `value`, and `words` | |
* | |
* @name _ | |
* @constructor | |
* @category Seq | |
* @param {*} value The value to wrap in a `lodash` instance. | |
* @returns {Object} Returns the new `lodash` wrapper instance. | |
* @example | |
* | |
* function square(n) { | |
* return n * n; | |
* } | |
* | |
* var wrapped = _([1, 2, 3]); | |
* | |
* // Returns an unwrapped value. | |
* wrapped.reduce(_.add); | |
* // => 6 | |
* | |
* // Returns a wrapped value. | |
* var squares = wrapped.map(square); | |
* | |
* _.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, '__wrapped__')) { | |
return wrapperClone(value); | |
} | |
} | |
return new LodashWrapper(value); | |
} | |
/** | |
* The function whose prototype chain sequence 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 explicit method chain sequences. | |
*/ | |
function LodashWrapper(value, chainAll) { | |
this.__wrapped__ = value; | |
this.__actions__ = []; | |
this.__chain__ = !!chainAll; | |
this.__index__ = 0; | |
this.__values__ = undefined; | |
} | |
/** | |
* 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 | |
} | |
}; | |
// Ensure wrappers are instances of `baseLodash`. | |
lodash.prototype = baseLodash.prototype; | |
lodash.prototype.constructor = lodash; | |
LodashWrapper.prototype = baseCreate(baseLodash.prototype); | |
LodashWrapper.prototype.constructor = LodashWrapper; | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Creates a lazy wrapper object which wraps `value` to enable lazy evaluation. | |
* | |
* @private | |
* @constructor | |
* @param {*} value The value to wrap. | |
*/ | |
function LazyWrapper(value) { | |
this.__wrapped__ = value; | |
this.__actions__ = []; | |
this.__dir__ = 1; | |
this.__filtered__ = false; | |
this.__iteratees__ = []; | |
this.__takeCount__ = MAX_ARRAY_LENGTH; | |
this.__views__ = []; | |
} | |
/** | |
* Creates a clone of the lazy wrapper object. | |
* | |
* @private | |
* @name clone | |
* @memberOf LazyWrapper | |
* @returns {Object} Returns the cloned `LazyWrapper` object. | |
*/ | |
function lazyClone() { | |
var result = new LazyWrapper(this.__wrapped__); | |
result.__actions__ = copyArray(this.__actions__); | |
result.__dir__ = this.__dir__; | |
result.__filtered__ = this.__filtered__; | |
result.__iteratees__ = copyArray(this.__iteratees__); | |
result.__takeCount__ = this.__takeCount__; | |
result.__views__ = copyArray(this.__views__); | |
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 { | |
result = this.clone(); | |
result.__dir__ *= -1; | |
} | |
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(), | |
dir = this.__dir__, | |
isArr = isArray(array), | |
isRight = dir < 0, | |
arrLength = isArr ? array.length : 0, | |
view = getView(0, arrLength, this.__views__), | |
start = view.start, | |
end = view.end, | |
length = end - start, | |
index = isRight ? end : (start - 1), | |
iteratees = this.__iteratees__, | |
iterLength = iteratees.length, | |
resIndex = 0, | |
takeCount = nativeMin(length, this.__takeCount__); | |
if (!isArr || arrLength < LARGE_ARRAY_SIZE || | |
(arrLength == length && takeCount == length)) { | |
return baseWrapperValue(array, this.__actions__); | |
} | |
var 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, | |
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; | |
} | |
// Ensure `LazyWrapper` is an instance of `baseLodash`. | |
LazyWrapper.prototype = baseCreate(baseLodash.prototype); | |
LazyWrapper.prototype.constructor = LazyWrapper; | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Creates a hash object. | |
* | |
* @private | |
* @constructor | |
* @param {Array} [entries] The key-value pairs to cache. | |
*/ | |
function Hash(entries) { | |
var index = -1, | |
length = entries ? entries.length : 0; | |
this.clear(); | |
while (++index < length) { | |
var entry = entries[index]; | |
this.set(entry[0], entry[1]); | |
} | |
} | |
/** | |
* Removes all key-value entries from the hash. | |
* | |
* @private | |
* @name clear | |
* @memberOf Hash | |
*/ | |
function hashClear() { | |
this.__data__ = nativeCreate ? nativeCreate(null) : {}; | |
} | |
/** | |
* Removes `key` and its value from the hash. | |
* | |
* @private | |
* @name delete | |
* @memberOf Hash | |
* @param {Object} hash The hash to modify. | |
* @param {string} key The key of the value to remove. | |
* @returns {boolean} Returns `true` if the entry was removed, else `false`. | |
*/ | |
function hashDelete(key) { | |
return this.has(key) && delete this.__data__[key]; | |
} | |
/** | |
* Gets the hash value for `key`. | |
* | |
* @private | |
* @name get | |
* @memberOf Hash | |
* @param {string} key The key of the value to get. | |
* @returns {*} Returns the entry value. | |
*/ | |
function hashGet(key) { | |
var data = this.__data__; | |
if (nativeCreate) { | |
var result = data[key]; | |
return result === HASH_UNDEFINED ? undefined : result; | |
} | |
return hasOwnProperty.call(data, key) ? data[key] : undefined; | |
} | |
/** | |
* Checks if a hash value for `key` exists. | |
* | |
* @private | |
* @name has | |
* @memberOf Hash | |
* @param {string} key The key of the entry to check. | |
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`. | |
*/ | |
function hashHas(key) { | |
var data = this.__data__; | |
return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key); | |
} | |
/** | |
* Sets the hash `key` to `value`. | |
* | |
* @private | |
* @name set | |
* @memberOf Hash | |
* @param {string} key The key of the value to set. | |
* @param {*} value The value to set. | |
* @returns {Object} Returns the hash instance. | |
*/ | |
function hashSet(key, value) { | |
var data = this.__data__; | |
data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value; | |
return this; | |
} | |
// Add methods to `Hash`. | |
Hash.prototype.clear = hashClear; | |
Hash.prototype['delete'] = hashDelete; | |
Hash.prototype.get = hashGet; | |
Hash.prototype.has = hashHas; | |
Hash.prototype.set = hashSet; | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Creates an list cache object. | |
* | |
* @private | |
* @constructor | |
* @param {Array} [entries] The key-value pairs to cache. | |
*/ | |
function ListCache(entries) { | |
var index = -1, | |
length = entries ? entries.length : 0; | |
this.clear(); | |
while (++index < length) { | |
var entry = entries[index]; | |
this.set(entry[0], entry[1]); | |
} | |
} | |
/** | |
* Removes all key-value entries from the list cache. | |
* | |
* @private | |
* @name clear | |
* @memberOf ListCache | |
*/ | |
function listCacheClear() { | |
this.__data__ = []; | |
} | |
/** | |
* Removes `key` and its value from the list cache. | |
* | |
* @private | |
* @name delete | |
* @memberOf ListCache | |
* @param {string} key The key of the value to remove. | |
* @returns {boolean} Returns `true` if the entry was removed, else `false`. | |
*/ | |
function listCacheDelete(key) { | |
var data = this.__data__, | |
index = assocIndexOf(data, key); | |
if (index < 0) { | |
return false; | |
} | |
var lastIndex = data.length - 1; | |
if (index == lastIndex) { | |
data.pop(); | |
} else { | |
splice.call(data, index, 1); | |
} | |
return true; | |
} | |
/** | |
* Gets the list cache value for `key`. | |
* | |
* @private | |
* @name get | |
* @memberOf ListCache | |
* @param {string} key The key of the value to get. | |
* @returns {*} Returns the entry value. | |
*/ | |
function listCacheGet(key) { | |
var data = this.__data__, | |
index = assocIndexOf(data, key); | |
return index < 0 ? undefined : data[index][1]; | |
} | |
/** | |
* Checks if a list cache value for `key` exists. | |
* | |
* @private | |
* @name has | |
* @memberOf ListCache | |
* @param {string} key The key of the entry to check. | |
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`. | |
*/ | |
function listCacheHas(key) { | |
return assocIndexOf(this.__data__, key) > -1; | |
} | |
/** | |
* Sets the list cache `key` to `value`. | |
* | |
* @private | |
* @name set | |
* @memberOf ListCache | |
* @param {string} key The key of the value to set. | |
* @param {*} value The value to set. | |
* @returns {Object} Returns the list cache instance. | |
*/ | |
function listCacheSet(key, value) { | |
var data = this.__data__, | |
index = assocIndexOf(data, key); | |
if (index < 0) { | |
data.push([key, value]); | |
} else { | |
data[index][1] = value; | |
} | |
return this; | |
} | |
// Add methods to `ListCache`. | |
ListCache.prototype.clear = listCacheClear; | |
ListCache.prototype['delete'] = listCacheDelete; | |
ListCache.prototype.get = listCacheGet; | |
ListCache.prototype.has = listCacheHas; | |
ListCache.prototype.set = listCacheSet; | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Creates a map cache object to store key-value pairs. | |
* | |
* @private | |
* @constructor | |
* @param {Array} [entries] The key-value pairs to cache. | |
*/ | |
function MapCache(entries) { | |
var index = -1, | |
length = entries ? entries.length : 0; | |
this.clear(); | |
while (++index < length) { | |
var entry = entries[index]; | |
this.set(entry[0], entry[1]); | |
} | |
} | |
/** | |
* Removes all key-value entries from the map. | |
* | |
* @private | |
* @name clear | |
* @memberOf MapCache | |
*/ | |
function mapCacheClear() { | |
this.__data__ = { | |
'hash': new Hash, | |
'map': new (Map || ListCache), | |
'string': new Hash | |
}; | |
} | |
/** | |
* Removes `key` and its value from the map. | |
* | |
* @private | |
* @name delete | |
* @memberOf MapCache | |
* @param {string} key The key of the value to remove. | |
* @returns {boolean} Returns `true` if the entry was removed, else `false`. | |
*/ | |
function mapCacheDelete(key) { | |
return getMapData(this, key)['delete'](key); | |
} | |
/** | |
* Gets the map value for `key`. | |
* | |
* @private | |
* @name get | |
* @memberOf MapCache | |
* @param {string} key The key of the value to get. | |
* @returns {*} Returns the entry value. | |
*/ | |
function mapCacheGet(key) { | |
return getMapData(this, key).get(key); | |
} | |
/** | |
* Checks if a map value for `key` exists. | |
* | |
* @private | |
* @name has | |
* @memberOf MapCache | |
* @param {string} key The key of the entry to check. | |
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`. | |
*/ | |
function mapCacheHas(key) { | |
return getMapData(this, key).has(key); | |
} | |
/** | |
* Sets the map `key` to `value`. | |
* | |
* @private | |
* @name set | |
* @memberOf MapCache | |
* @param {string} key The key of the value to set. | |
* @param {*} value The value to set. | |
* @returns {Object} Returns the map cache instance. | |
*/ | |
function mapCacheSet(key, value) { | |
getMapData(this, key).set(key, value); | |
return this; | |
} | |
// Add methods to `MapCache`. | |
MapCache.prototype.clear = mapCacheClear; | |
MapCache.prototype['delete'] = mapCacheDelete; | |
MapCache.prototype.get = mapCacheGet; | |
MapCache.prototype.has = mapCacheHas; | |
MapCache.prototype.set = mapCacheSet; | |
/*------------------------------------------------------------------------*/ | |
/** | |
* | |
* Creates an array cache object to store unique values. | |
* | |
* @private | |
* @constructor | |
* @param {Array} [values] The values to cache. | |
*/ | |
function SetCache(values) { | |
var index = -1, | |
length = values ? values.length : 0; | |
this.__data__ = new MapCache; | |
while (++index < length) { | |
this.add(values[index]); | |
} | |
} | |
/** | |
* Adds `value` to the array cache. | |
* | |
* @private | |
* @name add | |
* @memberOf SetCache | |
* @alias push | |
* @param {*} value The value to cache. | |
* @returns {Object} Returns the cache instance. | |
*/ | |
function setCacheAdd(value) { | |
this.__data__.set(value, HASH_UNDEFINED); | |
return this; | |
} | |
/** | |
* Checks if `value` is in the array cache. | |
* | |
* @private | |
* @name has | |
* @memberOf SetCache | |
* @param {*} value The value to search for. | |
* @returns {number} Returns `true` if `value` is found, else `false`. | |
*/ | |
function setCacheHas(value) { | |
return this.__data__.has(value); | |
} | |
// Add methods to `SetCache`. | |
SetCache.prototype.add = SetCache.prototype.push = setCacheAdd; | |
SetCache.prototype.has = setCacheHas; | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Creates a stack cache object to store key-value pairs. | |
* | |
* @private | |
* @constructor | |
* @param {Array} [entries] The key-value pairs to cache. | |
*/ | |
function Stack(entries) { | |
this.__data__ = new ListCache(entries); | |
} | |
/** | |
* Removes all key-value entries from the stack. | |
* | |
* @private | |
* @name clear | |
* @memberOf Stack | |
*/ | |
function stackClear() { | |
this.__data__ = new ListCache; | |
} | |
/** | |
* Removes `key` and its value from the stack. | |
* | |
* @private | |
* @name delete | |
* @memberOf Stack | |
* @param {string} key The key of the value to remove. | |
* @returns {boolean} Returns `true` if the entry was removed, else `false`. | |
*/ | |
function stackDelete(key) { | |
return this.__data__['delete'](key); | |
} | |
/** | |
* Gets the stack value for `key`. | |
* | |
* @private | |
* @name get | |
* @memberOf Stack | |
* @param {string} key The key of the value to get. | |
* @returns {*} Returns the entry value. | |
*/ | |
function stackGet(key) { | |
return this.__data__.get(key); | |
} | |
/** | |
* Checks if a stack value for `key` exists. | |
* | |
* @private | |
* @name has | |
* @memberOf Stack | |
* @param {string} key The key of the entry to check. | |
* @returns {boolean} Returns `true` if an entry for `key` exists, else `false`. | |
*/ | |
function stackHas(key) { | |
return this.__data__.has(key); | |
} | |
/** | |
* Sets the stack `key` to `value`. | |
* | |
* @private | |
* @name set | |
* @memberOf Stack | |
* @param {string} key The key of the value to set. | |
* @param {*} value The value to set. | |
* @returns {Object} Returns the stack cache instance. | |
*/ | |
function stackSet(key, value) { | |
var cache = this.__data__; | |
if (cache instanceof ListCache) { | |
var pairs = cache.__data__; | |
if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) { | |
pairs.push([key, value]); | |
return this; | |
} | |
cache = this.__data__ = new MapCache(pairs); | |
} | |
cache.set(key, value); | |
return this; | |
} | |
// Add methods to `Stack`. | |
Stack.prototype.clear = stackClear; | |
Stack.prototype['delete'] = stackDelete; | |
Stack.prototype.get = stackGet; | |
Stack.prototype.has = stackHas; | |
Stack.prototype.set = stackSet; | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Creates an array of the enumerable property names of the array-like `value`. | |
* | |
* @private | |
* @param {*} value The value to query. | |
* @param {boolean} inherited Specify returning inherited property names. | |
* @returns {Array} Returns the array of property names. | |
*/ | |
function arrayLikeKeys(value, inherited) { | |
// Safari 8.1 makes `arguments.callee` enumerable in strict mode. | |
// Safari 9 makes `arguments.length` enumerable in strict mode. | |
var result = (isArray(value) || isArguments(value)) | |
? baseTimes(value.length, String) | |
: []; | |
var length = result.length, | |
skipIndexes = !!length; | |
for (var key in value) { | |
if ((inherited || hasOwnProperty.call(value, key)) && | |
!(skipIndexes && (key == 'length' || isIndex(key, length)))) { | |
result.push(key); | |
} | |
} | |
return result; | |
} | |
/** | |
* Used by `_.defaults` to customize its `_.assignIn` use. | |
* | |
* @private | |
* @param {*} objValue The destination value. | |
* @param {*} srcValue The source value. | |
* @param {string} key The key of the property to assign. | |
* @param {Object} object The parent object of `objValue`. | |
* @returns {*} Returns the value to assign. | |
*/ | |
function assignInDefaults(objValue, srcValue, key, object) { | |
if (objValue === undefined || | |
(eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) { | |
return srcValue; | |
} | |
return objValue; | |
} | |
/** | |
* This function is like `assignValue` except that it doesn't assign | |
* `undefined` values. | |
* | |
* @private | |
* @param {Object} object The object to modify. | |
* @param {string} key The key of the property to assign. | |
* @param {*} value The value to assign. | |
*/ | |
function assignMergeValue(object, key, value) { | |
if ((value !== undefined && !eq(object[key], value)) || | |
(typeof key == 'number' && value === undefined && !(key in object))) { | |
object[key] = value; | |
} | |
} | |
/** | |
* Assigns `value` to `key` of `object` if the existing value is not equivalent | |
* using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) | |
* for equality comparisons. | |
* | |
* @private | |
* @param {Object} object The object to modify. | |
* @param {string} key The key of the property to assign. | |
* @param {*} value The value to assign. | |
*/ | |
function assignValue(object, key, value) { | |
var objValue = object[key]; | |
if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) || | |
(value === undefined && !(key in object))) { | |
object[key] = value; | |
} | |
} | |
/** | |
* Gets the index at which the `key` is found in `array` of key-value pairs. | |
* | |
* @private | |
* @param {Array} array The array to inspect. | |
* @param {*} key The key to search for. | |
* @returns {number} Returns the index of the matched value, else `-1`. | |
*/ | |
function assocIndexOf(array, key) { | |
var length = array.length; | |
while (length--) { | |
if (eq(array[length][0], key)) { | |
return length; | |
} | |
} | |
return -1; | |
} | |
/** | |
* Aggregates elements of `collection` on `accumulator` with keys transformed | |
* by `iteratee` and values set by `setter`. | |
* | |
* @private | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} setter The function to set `accumulator` values. | |
* @param {Function} iteratee The iteratee to transform keys. | |
* @param {Object} accumulator The initial aggregated object. | |
* @returns {Function} Returns `accumulator`. | |
*/ | |
function baseAggregator(collection, setter, iteratee, accumulator) { | |
baseEach(collection, function(value, key, collection) { | |
setter(accumulator, value, iteratee(value), collection); | |
}); | |
return accumulator; | |
} | |
/** | |
* The base implementation of `_.assign` without support for multiple sources | |
* or `customizer` functions. | |
* | |
* @private | |
* @param {Object} object The destination object. | |
* @param {Object} source The source object. | |
* @returns {Object} Returns `object`. | |
*/ | |
function baseAssign(object, source) { | |
return object && copyObject(source, keys(source), object); | |
} | |
/** | |
* The base implementation of `_.at` without support for individual paths. | |
* | |
* @private | |
* @param {Object} object The object to iterate over. | |
* @param {string[]} paths The property paths of elements to pick. | |
* @returns {Array} Returns the picked elements. | |
*/ | |
function baseAt(object, paths) { | |
var index = -1, | |
isNil = object == null, | |
length = paths.length, | |
result = Array(length); | |
while (++index < length) { | |
result[index] = isNil ? undefined : get(object, paths[index]); | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `_.clamp` which doesn't coerce arguments. | |
* | |
* @private | |
* @param {number} number The number to clamp. | |
* @param {number} [lower] The lower bound. | |
* @param {number} upper The upper bound. | |
* @returns {number} Returns the clamped number. | |
*/ | |
function baseClamp(number, lower, upper) { | |
if (number === number) { | |
if (upper !== undefined) { | |
number = number <= upper ? number : upper; | |
} | |
if (lower !== undefined) { | |
number = number >= lower ? number : lower; | |
} | |
} | |
return number; | |
} | |
/** | |
* The base implementation of `_.clone` and `_.cloneDeep` which tracks | |
* traversed objects. | |
* | |
* @private | |
* @param {*} value The value to clone. | |
* @param {boolean} [isDeep] Specify a deep clone. | |
* @param {boolean} [isFull] Specify a clone including symbols. | |
* @param {Function} [customizer] The function to customize cloning. | |
* @param {string} [key] The key of `value`. | |
* @param {Object} [object] The parent object of `value`. | |
* @param {Object} [stack] Tracks traversed objects and their clone counterparts. | |
* @returns {*} Returns the cloned value. | |
*/ | |
function baseClone(value, isDeep, isFull, customizer, key, object, stack) { | |
var result; | |
if (customizer) { | |
result = object ? customizer(value, key, object, stack) : customizer(value); | |
} | |
if (result !== undefined) { | |
return result; | |
} | |
if (!isObject(value)) { | |
return value; | |
} | |
var isArr = isArray(value); | |
if (isArr) { | |
result = initCloneArray(value); | |
if (!isDeep) { | |
return copyArray(value, result); | |
} | |
} else { | |
var tag = getTag(value), | |
isFunc = tag == funcTag || tag == genTag; | |
if (isBuffer(value)) { | |
return cloneBuffer(value, isDeep); | |
} | |
if (tag == objectTag || tag == argsTag || (isFunc && !object)) { | |
if (isHostObject(value)) { | |
return object ? value : {}; | |
} | |
result = initCloneObject(isFunc ? {} : value); | |
if (!isDeep) { | |
return copySymbols(value, baseAssign(result, value)); | |
} | |
} else { | |
if (!cloneableTags[tag]) { | |
return object ? value : {}; | |
} | |
result = initCloneByTag(value, tag, baseClone, isDeep); | |
} | |
} | |
// Check for circular references and return its corresponding clone. | |
stack || (stack = new Stack); | |
var stacked = stack.get(value); | |
if (stacked) { | |
return stacked; | |
} | |
stack.set(value, result); | |
if (!isArr) { | |
var props = isFull ? getAllKeys(value) : keys(value); | |
} | |
arrayEach(props || value, function(subValue, key) { | |
if (props) { | |
key = subValue; | |
subValue = value[key]; | |
} | |
// Recursively populate clone (susceptible to call stack limits). | |
assignValue(result, key, baseClone(subValue, isDeep, isFull, customizer, key, value, stack)); | |
}); | |
return result; | |
} | |
/** | |
* The base implementation of `_.conforms` which doesn't clone `source`. | |
* | |
* @private | |
* @param {Object} source The object of property predicates to conform to. | |
* @returns {Function} Returns the new spec function. | |
*/ | |
function baseConforms(source) { | |
var props = keys(source); | |
return function(object) { | |
return baseConformsTo(object, source, props); | |
}; | |
} | |
/** | |
* The base implementation of `_.conformsTo` which accepts `props` to check. | |
* | |
* @private | |
* @param {Object} object The object to inspect. | |
* @param {Object} source The object of property predicates to conform to. | |
* @returns {boolean} Returns `true` if `object` conforms, else `false`. | |
*/ | |
function baseConformsTo(object, source, props) { | |
var length = props.length; | |
if (object == null) { | |
return !length; | |
} | |
object = Object(object); | |
while (length--) { | |
var key = props[length], | |
predicate = source[key], | |
value = object[key]; | |
if ((value === undefined && !(key in object)) || !predicate(value)) { | |
return false; | |
} | |
} | |
return true; | |
} | |
/** | |
* 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. | |
*/ | |
function baseCreate(proto) { | |
return isObject(proto) ? objectCreate(proto) : {}; | |
} | |
/** | |
* The base implementation of `_.delay` and `_.defer` which accepts `args` | |
* to provide to `func`. | |
* | |
* @private | |
* @param {Function} func The function to delay. | |
* @param {number} wait The number of milliseconds to delay invocation. | |
* @param {Array} args The arguments to provide to `func`. | |
* @returns {number|Object} Returns the timer id or timeout object. | |
*/ | |
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 methods like `_.difference` without support | |
* for excluding multiple arrays or iteratee shorthands. | |
* | |
* @private | |
* @param {Array} array The array to inspect. | |
* @param {Array} values The values to exclude. | |
* @param {Function} [iteratee] The iteratee invoked per element. | |
* @param {Function} [comparator] The comparator invoked per element. | |
* @returns {Array} Returns the new array of filtered values. | |
*/ | |
function baseDifference(array, values, iteratee, comparator) { | |
var index = -1, | |
includes = arrayIncludes, | |
isCommon = true, | |
length = array.length, | |
result = [], | |
valuesLength = values.length; | |
if (!length) { | |
return result; | |
} | |
if (iteratee) { | |
values = arrayMap(values, baseUnary(iteratee)); | |
} | |
if (comparator) { | |
includes = arrayIncludesWith; | |
isCommon = false; | |
} | |
else if (values.length >= LARGE_ARRAY_SIZE) { | |
includes = cacheHas; | |
isCommon = false; | |
values = new SetCache(values); | |
} | |
outer: | |
while (++index < length) { | |
var value = array[index], | |
computed = iteratee ? iteratee(value) : value; | |
value = (comparator || value !== 0) ? value : 0; | |
if (isCommon && computed === computed) { | |
var valuesIndex = valuesLength; | |
while (valuesIndex--) { | |
if (values[valuesIndex] === computed) { | |
continue outer; | |
} | |
} | |
result.push(value); | |
} | |
else if (!includes(values, computed, comparator)) { | |
result.push(value); | |
} | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `_.forEach` without support for iteratee shorthands. | |
* | |
* @private | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} iteratee The function invoked per iteration. | |
* @returns {Array|Object} Returns `collection`. | |
*/ | |
var baseEach = createBaseEach(baseForOwn); | |
/** | |
* The base implementation of `_.forEachRight` without support for iteratee shorthands. | |
* | |
* @private | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} iteratee The function invoked per iteration. | |
* @returns {Array|Object} Returns `collection`. | |
*/ | |
var baseEachRight = createBaseEach(baseForOwnRight, true); | |
/** | |
* The base implementation of `_.every` without support for iteratee shorthands. | |
* | |
* @private | |
* @param {Array|Object} 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 methods like `_.max` and `_.min` which accepts a | |
* `comparator` to determine the extremum value. | |
* | |
* @private | |
* @param {Array} array The array to iterate over. | |
* @param {Function} iteratee The iteratee invoked per iteration. | |
* @param {Function} comparator The comparator used to compare values. | |
* @returns {*} Returns the extremum value. | |
*/ | |
function baseExtremum(array, iteratee, comparator) { | |
var index = -1, | |
length = array.length; | |
while (++index < length) { | |
var value = array[index], | |
current = iteratee(value); | |
if (current != null && (computed === undefined | |
? (current === current && !isSymbol(current)) | |
: comparator(current, computed) | |
)) { | |
var computed = current, | |
result = value; | |
} | |
} | |
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 = toInteger(start); | |
if (start < 0) { | |
start = -start > length ? 0 : (length + start); | |
} | |
end = (end === undefined || end > length) ? length : toInteger(end); | |
if (end < 0) { | |
end += length; | |
} | |
end = start > end ? 0 : toLength(end); | |
while (start < end) { | |
array[start++] = value; | |
} | |
return array; | |
} | |
/** | |
* The base implementation of `_.filter` without support for iteratee shorthands. | |
* | |
* @private | |
* @param {Array|Object} 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 `_.flatten` with support for restricting flattening. | |
* | |
* @private | |
* @param {Array} array The array to flatten. | |
* @param {number} depth The maximum recursion depth. | |
* @param {boolean} [predicate=isFlattenable] The function invoked per iteration. | |
* @param {boolean} [isStrict] Restrict to values that pass `predicate` checks. | |
* @param {Array} [result=[]] The initial result value. | |
* @returns {Array} Returns the new flattened array. | |
*/ | |
function baseFlatten(array, depth, predicate, isStrict, result) { | |
var index = -1, | |
length = array.length; | |
predicate || (predicate = isFlattenable); | |
result || (result = []); | |
while (++index < length) { | |
var value = array[index]; | |
if (depth > 0 && predicate(value)) { | |
if (depth > 1) { | |
// Recursively flatten arrays (susceptible to call stack limits). | |
baseFlatten(value, depth - 1, predicate, isStrict, result); | |
} else { | |
arrayPush(result, value); | |
} | |
} else if (!isStrict) { | |
result[result.length] = value; | |
} | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `baseForOwn` which iterates over `object` | |
* properties returned by `keysFunc` and invokes `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 `_.forOwn` without support for iteratee shorthands. | |
* | |
* @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 object && baseFor(object, iteratee, keys); | |
} | |
/** | |
* The base implementation of `_.forOwnRight` without support for iteratee shorthands. | |
* | |
* @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 object && baseForRight(object, iteratee, keys); | |
} | |
/** | |
* The base implementation of `_.functions` which creates an array of | |
* `object` function property names filtered from `props`. | |
* | |
* @private | |
* @param {Object} object The object to inspect. | |
* @param {Array} props The property names to filter. | |
* @returns {Array} Returns the function names. | |
*/ | |
function baseFunctions(object, props) { | |
return arrayFilter(props, function(key) { | |
return isFunction(object[key]); | |
}); | |
} | |
/** | |
* The base implementation of `_.get` without support for default values. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @param {Array|string} path The path of the property to get. | |
* @returns {*} Returns the resolved value. | |
*/ | |
function baseGet(object, path) { | |
path = isKey(path, object) ? [path] : castPath(path); | |
var index = 0, | |
length = path.length; | |
while (object != null && index < length) { | |
object = object[toKey(path[index++])]; | |
} | |
return (index && index == length) ? object : undefined; | |
} | |
/** | |
* The base implementation of `getAllKeys` and `getAllKeysIn` which uses | |
* `keysFunc` and `symbolsFunc` to get the enumerable property names and | |
* symbols of `object`. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @param {Function} keysFunc The function to get the keys of `object`. | |
* @param {Function} symbolsFunc The function to get the symbols of `object`. | |
* @returns {Array} Returns the array of property names and symbols. | |
*/ | |
function baseGetAllKeys(object, keysFunc, symbolsFunc) { | |
var result = keysFunc(object); | |
return isArray(object) ? result : arrayPush(result, symbolsFunc(object)); | |
} | |
/** | |
* The base implementation of `getTag`. | |
* | |
* @private | |
* @param {*} value The value to query. | |
* @returns {string} Returns the `toStringTag`. | |
*/ | |
function baseGetTag(value) { | |
return objectToString.call(value); | |
} | |
/** | |
* The base implementation of `_.gt` which doesn't coerce arguments. | |
* | |
* @private | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @returns {boolean} Returns `true` if `value` is greater than `other`, | |
* else `false`. | |
*/ | |
function baseGt(value, other) { | |
return value > other; | |
} | |
/** | |
* The base implementation of `_.has` without support for deep paths. | |
* | |
* @private | |
* @param {Object} [object] The object to query. | |
* @param {Array|string} key The key to check. | |
* @returns {boolean} Returns `true` if `key` exists, else `false`. | |
*/ | |
function baseHas(object, key) { | |
return object != null && hasOwnProperty.call(object, key); | |
} | |
/** | |
* The base implementation of `_.hasIn` without support for deep paths. | |
* | |
* @private | |
* @param {Object} [object] The object to query. | |
* @param {Array|string} key The key to check. | |
* @returns {boolean} Returns `true` if `key` exists, else `false`. | |
*/ | |
function baseHasIn(object, key) { | |
return object != null && key in Object(object); | |
} | |
/** | |
* The base implementation of `_.inRange` which doesn't coerce arguments. | |
* | |
* @private | |
* @param {number} number The number to check. | |
* @param {number} start The start of the range. | |
* @param {number} end The end of the range. | |
* @returns {boolean} Returns `true` if `number` is in the range, else `false`. | |
*/ | |
function baseInRange(number, start, end) { | |
return number >= nativeMin(start, end) && number < nativeMax(start, end); | |
} | |
/** | |
* The base implementation of methods like `_.intersection`, without support | |
* for iteratee shorthands, that accepts an array of arrays to inspect. | |
* | |
* @private | |
* @param {Array} arrays The arrays to inspect. | |
* @param {Function} [iteratee] The iteratee invoked per element. | |
* @param {Function} [comparator] The comparator invoked per element. | |
* @returns {Array} Returns the new array of shared values. | |
*/ | |
function baseIntersection(arrays, iteratee, comparator) { | |
var includes = comparator ? arrayIncludesWith : arrayIncludes, | |
length = arrays[0].length, | |
othLength = arrays.length, | |
othIndex = othLength, | |
caches = Array(othLength), | |
maxLength = Infinity, | |
result = []; | |
while (othIndex--) { | |
var array = arrays[othIndex]; | |
if (othIndex && iteratee) { | |
array = arrayMap(array, baseUnary(iteratee)); | |
} | |
maxLength = nativeMin(array.length, maxLength); | |
caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120)) | |
? new SetCache(othIndex && array) | |
: undefined; | |
} | |
array = arrays[0]; | |
var index = -1, | |
seen = caches[0]; | |
outer: | |
while (++index < length && result.length < maxLength) { | |
var value = array[index], | |
computed = iteratee ? iteratee(value) : value; | |
value = (comparator || value !== 0) ? value : 0; | |
if (!(seen | |
? cacheHas(seen, computed) | |
: includes(result, computed, comparator) | |
)) { | |
othIndex = othLength; | |
while (--othIndex) { | |
var cache = caches[othIndex]; | |
if (!(cache | |
? cacheHas(cache, computed) | |
: includes(arrays[othIndex], computed, comparator)) | |
) { | |
continue outer; | |
} | |
} | |
if (seen) { | |
seen.push(computed); | |
} | |
result.push(value); | |
} | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `_.invert` and `_.invertBy` which inverts | |
* `object` with values transformed by `iteratee` and set by `setter`. | |
* | |
* @private | |
* @param {Object} object The object to iterate over. | |
* @param {Function} setter The function to set `accumulator` values. | |
* @param {Function} iteratee The iteratee to transform values. | |
* @param {Object} accumulator The initial inverted object. | |
* @returns {Function} Returns `accumulator`. | |
*/ | |
function baseInverter(object, setter, iteratee, accumulator) { | |
baseForOwn(object, function(value, key, object) { | |
setter(accumulator, iteratee(value), key, object); | |
}); | |
return accumulator; | |
} | |
/** | |
* The base implementation of `_.invoke` without support for individual | |
* method arguments. | |
* | |
* @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 baseInvoke(object, path, args) { | |
if (!isKey(path, object)) { | |
path = castPath(path); | |
object = parent(object, path); | |
path = last(path); | |
} | |
var func = object == null ? object : object[toKey(path)]; | |
return func == null ? undefined : apply(func, object, args); | |
} | |
/** | |
* The base implementation of `_.isArrayBuffer` without Node.js optimizations. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is an array buffer, else `false`. | |
*/ | |
function baseIsArrayBuffer(value) { | |
return isObjectLike(value) && objectToString.call(value) == arrayBufferTag; | |
} | |
/** | |
* The base implementation of `_.isDate` without Node.js optimizations. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a date object, else `false`. | |
*/ | |
function baseIsDate(value) { | |
return isObjectLike(value) && objectToString.call(value) == dateTag; | |
} | |
/** | |
* The base implementation of `_.isEqual` which supports partial comparisons | |
* and tracks traversed objects. | |
* | |
* @private | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @param {Function} [customizer] The function to customize comparisons. | |
* @param {boolean} [bitmask] The bitmask of comparison flags. | |
* The bitmask may be composed of the following flags: | |
* 1 - Unordered comparison | |
* 2 - Partial comparison | |
* @param {Object} [stack] Tracks traversed `value` and `other` objects. | |
* @returns {boolean} Returns `true` if the values are equivalent, else `false`. | |
*/ | |
function baseIsEqual(value, other, customizer, bitmask, stack) { | |
if (value === other) { | |
return true; | |
} | |
if (value == null || other == null || (!isObject(value) && !isObjectLike(other))) { | |
return value !== value && other !== other; | |
} | |
return baseIsEqualDeep(value, other, baseIsEqual, customizer, bitmask, stack); | |
} | |
/** | |
* 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 comparisons. | |
* @param {number} [bitmask] The bitmask of comparison flags. See `baseIsEqual` | |
* for more details. | |
* @param {Object} [stack] Tracks traversed `object` and `other` objects. | |
* @returns {boolean} Returns `true` if the objects are equivalent, else `false`. | |
*/ | |
function baseIsEqualDeep(object, other, equalFunc, customizer, bitmask, stack) { | |
var objIsArr = isArray(object), | |
othIsArr = isArray(other), | |
objTag = arrayTag, | |
othTag = arrayTag; | |
if (!objIsArr) { | |
objTag = getTag(object); | |
objTag = objTag == argsTag ? objectTag : objTag; | |
} | |
if (!othIsArr) { | |
othTag = getTag(other); | |
othTag = othTag == argsTag ? objectTag : othTag; | |
} | |
var objIsObj = objTag == objectTag && !isHostObject(object), | |
othIsObj = othTag == objectTag && !isHostObject(other), | |
isSameTag = objTag == othTag; | |
if (isSameTag && !objIsObj) { | |
stack || (stack = new Stack); | |
return (objIsArr || isTypedArray(object)) | |
? equalArrays(object, other, equalFunc, customizer, bitmask, stack) | |
: equalByTag(object, other, objTag, equalFunc, customizer, bitmask, stack); | |
} | |
if (!(bitmask & PARTIAL_COMPARE_FLAG)) { | |
var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'), | |
othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__'); | |
if (objIsWrapped || othIsWrapped) { | |
var objUnwrapped = objIsWrapped ? object.value() : object, | |
othUnwrapped = othIsWrapped ? other.value() : other; | |
stack || (stack = new Stack); | |
return equalFunc(objUnwrapped, othUnwrapped, customizer, bitmask, stack); | |
} | |
} | |
if (!isSameTag) { | |
return false; | |
} | |
stack || (stack = new Stack); | |
return equalObjects(object, other, equalFunc, customizer, bitmask, stack); | |
} | |
/** | |
* The base implementation of `_.isMap` without Node.js optimizations. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a map, else `false`. | |
*/ | |
function baseIsMap(value) { | |
return isObjectLike(value) && getTag(value) == mapTag; | |
} | |
/** | |
* The base implementation of `_.isMatch` without support for iteratee shorthands. | |
* | |
* @private | |
* @param {Object} object The object to inspect. | |
* @param {Object} source The object of property values to match. | |
* @param {Array} matchData The property names, values, and compare flags to match. | |
* @param {Function} [customizer] The function to customize comparisons. | |
* @returns {boolean} Returns `true` if `object` is a match, else `false`. | |
*/ | |
function baseIsMatch(object, source, matchData, customizer) { | |
var index = matchData.length, | |
length = index, | |
noCustomizer = !customizer; | |
if (object == null) { | |
return !length; | |
} | |
object = Object(object); | |
while (index--) { | |
var data = matchData[index]; | |
if ((noCustomizer && data[2]) | |
? data[1] !== object[data[0]] | |
: !(data[0] in object) | |
) { | |
return false; | |
} | |
} | |
while (++index < length) { | |
data = matchData[index]; | |
var key = data[0], | |
objValue = object[key], | |
srcValue = data[1]; | |
if (noCustomizer && data[2]) { | |
if (objValue === undefined && !(key in object)) { | |
return false; | |
} | |
} else { | |
var stack = new Stack; | |
if (customizer) { | |
var result = customizer(objValue, srcValue, key, object, source, stack); | |
} | |
if (!(result === undefined | |
? baseIsEqual(srcValue, objValue, customizer, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG, stack) | |
: result | |
)) { | |
return false; | |
} | |
} | |
} | |
return true; | |
} | |
/** | |
* The base implementation of `_.isNative` without bad shim checks. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a native function, | |
* else `false`. | |
*/ | |
function baseIsNative(value) { | |
if (!isObject(value) || isMasked(value)) { | |
return false; | |
} | |
var pattern = (isFunction(value) || isHostObject(value)) ? reIsNative : reIsHostCtor; | |
return pattern.test(toSource(value)); | |
} | |
/** | |
* The base implementation of `_.isRegExp` without Node.js optimizations. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a regexp, else `false`. | |
*/ | |
function baseIsRegExp(value) { | |
return isObject(value) && objectToString.call(value) == regexpTag; | |
} | |
/** | |
* The base implementation of `_.isSet` without Node.js optimizations. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a set, else `false`. | |
*/ | |
function baseIsSet(value) { | |
return isObjectLike(value) && getTag(value) == setTag; | |
} | |
/** | |
* The base implementation of `_.isTypedArray` without Node.js optimizations. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a typed array, else `false`. | |
*/ | |
function baseIsTypedArray(value) { | |
return isObjectLike(value) && | |
isLength(value.length) && !!typedArrayTags[objectToString.call(value)]; | |
} | |
/** | |
* The base implementation of `_.iteratee`. | |
* | |
* @private | |
* @param {*} [value=_.identity] The value to convert to an iteratee. | |
* @returns {Function} Returns the iteratee. | |
*/ | |
function baseIteratee(value) { | |
// Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9. | |
// See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details. | |
if (typeof value == 'function') { | |
return value; | |
} | |
if (value == null) { | |
return identity; | |
} | |
if (typeof value == 'object') { | |
return isArray(value) | |
? baseMatchesProperty(value[0], value[1]) | |
: baseMatches(value); | |
} | |
return property(value); | |
} | |
/** | |
* The base implementation of `_.keys` which doesn't treat sparse arrays as dense. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @returns {Array} Returns the array of property names. | |
*/ | |
function baseKeys(object) { | |
if (!isPrototype(object)) { | |
return nativeKeys(object); | |
} | |
var result = []; | |
for (var key in Object(object)) { | |
if (hasOwnProperty.call(object, key) && key != 'constructor') { | |
result.push(key); | |
} | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @returns {Array} Returns the array of property names. | |
*/ | |
function baseKeysIn(object) { | |
if (!isObject(object)) { | |
return nativeKeysIn(object); | |
} | |
var isProto = isPrototype(object), | |
result = []; | |
for (var key in object) { | |
if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) { | |
result.push(key); | |
} | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `_.lt` which doesn't coerce arguments. | |
* | |
* @private | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @returns {boolean} Returns `true` if `value` is less than `other`, | |
* else `false`. | |
*/ | |
function baseLt(value, other) { | |
return value < other; | |
} | |
/** | |
* The base implementation of `_.map` without support for iteratee shorthands. | |
* | |
* @private | |
* @param {Array|Object} 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, | |
result = isArrayLike(collection) ? Array(collection.length) : []; | |
baseEach(collection, function(value, key, collection) { | |
result[++index] = iteratee(value, key, collection); | |
}); | |
return result; | |
} | |
/** | |
* The base implementation of `_.matches` which doesn't clone `source`. | |
* | |
* @private | |
* @param {Object} source The object of property values to match. | |
* @returns {Function} Returns the new spec function. | |
*/ | |
function baseMatches(source) { | |
var matchData = getMatchData(source); | |
if (matchData.length == 1 && matchData[0][2]) { | |
return matchesStrictComparable(matchData[0][0], matchData[0][1]); | |
} | |
return function(object) { | |
return object === source || baseIsMatch(object, source, matchData); | |
}; | |
} | |
/** | |
* The base implementation of `_.matchesProperty` which doesn't clone `srcValue`. | |
* | |
* @private | |
* @param {string} path The path of the property to get. | |
* @param {*} srcValue The value to match. | |
* @returns {Function} Returns the new spec function. | |
*/ | |
function baseMatchesProperty(path, srcValue) { | |
if (isKey(path) && isStrictComparable(srcValue)) { | |
return matchesStrictComparable(toKey(path), srcValue); | |
} | |
return function(object) { | |
var objValue = get(object, path); | |
return (objValue === undefined && objValue === srcValue) | |
? hasIn(object, path) | |
: baseIsEqual(srcValue, objValue, undefined, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG); | |
}; | |
} | |
/** | |
* The base implementation of `_.merge` without support for multiple sources. | |
* | |
* @private | |
* @param {Object} object The destination object. | |
* @param {Object} source The source object. | |
* @param {number} srcIndex The index of `source`. | |
* @param {Function} [customizer] The function to customize merged values. | |
* @param {Object} [stack] Tracks traversed source values and their merged | |
* counterparts. | |
*/ | |
function baseMerge(object, source, srcIndex, customizer, stack) { | |
if (object === source) { | |
return; | |
} | |
if (!(isArray(source) || isTypedArray(source))) { | |
var props = baseKeysIn(source); | |
} | |
arrayEach(props || source, function(srcValue, key) { | |
if (props) { | |
key = srcValue; | |
srcValue = source[key]; | |
} | |
if (isObject(srcValue)) { | |
stack || (stack = new Stack); | |
baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack); | |
} | |
else { | |
var newValue = customizer | |
? customizer(object[key], srcValue, (key + ''), object, source, stack) | |
: undefined; | |
if (newValue === undefined) { | |
newValue = srcValue; | |
} | |
assignMergeValue(object, key, newValue); | |
} | |
}); | |
} | |
/** | |
* 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 {number} srcIndex The index of `source`. | |
* @param {Function} mergeFunc The function to merge values. | |
* @param {Function} [customizer] The function to customize assigned values. | |
* @param {Object} [stack] Tracks traversed source values and their merged | |
* counterparts. | |
*/ | |
function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) { | |
var objValue = object[key], | |
srcValue = source[key], | |
stacked = stack.get(srcValue); | |
if (stacked) { | |
assignMergeValue(object, key, stacked); | |
return; | |
} | |
var newValue = customizer | |
? customizer(objValue, srcValue, (key + ''), object, source, stack) | |
: undefined; | |
var isCommon = newValue === undefined; | |
if (isCommon) { | |
newValue = srcValue; | |
if (isArray(srcValue) || isTypedArray(srcValue)) { | |
if (isArray(objValue)) { | |
newValue = objValue; | |
} | |
else if (isArrayLikeObject(objValue)) { | |
newValue = copyArray(objValue); | |
} | |
else { | |
isCommon = false; | |
newValue = baseClone(srcValue, true); | |
} | |
} | |
else if (isPlainObject(srcValue) || isArguments(srcValue)) { | |
if (isArguments(objValue)) { | |
newValue = toPlainObject(objValue); | |
} | |
else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) { | |
isCommon = false; | |
newValue = baseClone(srcValue, true); | |
} | |
else { | |
newValue = objValue; | |
} | |
} | |
else { | |
isCommon = false; | |
} | |
} | |
if (isCommon) { | |
// Recursively merge objects and arrays (susceptible to call stack limits). | |
stack.set(srcValue, newValue); | |
mergeFunc(newValue, srcValue, srcIndex, customizer, stack); | |
stack['delete'](srcValue); | |
} | |
assignMergeValue(object, key, newValue); | |
} | |
/** | |
* The base implementation of `_.nth` which doesn't coerce arguments. | |
* | |
* @private | |
* @param {Array} array The array to query. | |
* @param {number} n The index of the element to return. | |
* @returns {*} Returns the nth element of `array`. | |
*/ | |
function baseNth(array, n) { | |
var length = array.length; | |
if (!length) { | |
return; | |
} | |
n += n < 0 ? length : 0; | |
return isIndex(n, length) ? array[n] : undefined; | |
} | |
/** | |
* The base implementation of `_.orderBy` without param guards. | |
* | |
* @private | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by. | |
* @param {string[]} orders The sort orders of `iteratees`. | |
* @returns {Array} Returns the new sorted array. | |
*/ | |
function baseOrderBy(collection, iteratees, orders) { | |
var index = -1; | |
iteratees = arrayMap(iteratees.length ? iteratees : [identity], baseUnary(getIteratee())); | |
var result = baseMap(collection, function(value, key, collection) { | |
var criteria = arrayMap(iteratees, function(iteratee) { | |
return iteratee(value); | |
}); | |
return { 'criteria': criteria, 'index': ++index, 'value': value }; | |
}); | |
return baseSortBy(result, function(object, other) { | |
return compareMultiple(object, other, orders); | |
}); | |
} | |
/** | |
* The base implementation of `_.pick` without support for individual | |
* property identifiers. | |
* | |
* @private | |
* @param {Object} object The source object. | |
* @param {string[]} props The property identifiers to pick. | |
* @returns {Object} Returns the new object. | |
*/ | |
function basePick(object, props) { | |
object = Object(object); | |
return basePickBy(object, props, function(value, key) { | |
return key in object; | |
}); | |
} | |
/** | |
* The base implementation of `_.pickBy` without support for iteratee shorthands. | |
* | |
* @private | |
* @param {Object} object The source object. | |
* @param {string[]} props The property identifiers to pick from. | |
* @param {Function} predicate The function invoked per property. | |
* @returns {Object} Returns the new object. | |
*/ | |
function basePickBy(object, props, predicate) { | |
var index = -1, | |
length = props.length, | |
result = {}; | |
while (++index < length) { | |
var key = props[index], | |
value = object[key]; | |
if (predicate(value, key)) { | |
result[key] = value; | |
} | |
} | |
return result; | |
} | |
/** | |
* 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 accessor function. | |
*/ | |
function basePropertyDeep(path) { | |
return function(object) { | |
return baseGet(object, path); | |
}; | |
} | |
/** | |
* The base implementation of `_.pullAllBy` without support for iteratee | |
* shorthands. | |
* | |
* @private | |
* @param {Array} array The array to modify. | |
* @param {Array} values The values to remove. | |
* @param {Function} [iteratee] The iteratee invoked per element. | |
* @param {Function} [comparator] The comparator invoked per element. | |
* @returns {Array} Returns `array`. | |
*/ | |
function basePullAll(array, values, iteratee, comparator) { | |
var indexOf = comparator ? baseIndexOfWith : baseIndexOf, | |
index = -1, | |
length = values.length, | |
seen = array; | |
if (array === values) { | |
values = copyArray(values); | |
} | |
if (iteratee) { | |
seen = arrayMap(array, baseUnary(iteratee)); | |
} | |
while (++index < length) { | |
var fromIndex = 0, | |
value = values[index], | |
computed = iteratee ? iteratee(value) : value; | |
while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) { | |
if (seen !== array) { | |
splice.call(seen, fromIndex, 1); | |
} | |
splice.call(array, fromIndex, 1); | |
} | |
} | |
return array; | |
} | |
/** | |
* The base implementation of `_.pullAt` without support for individual | |
* indexes or 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 = array ? indexes.length : 0, | |
lastIndex = length - 1; | |
while (length--) { | |
var index = indexes[length]; | |
if (length == lastIndex || index !== previous) { | |
var previous = index; | |
if (isIndex(index)) { | |
splice.call(array, index, 1); | |
} | |
else if (!isKey(index, array)) { | |
var path = castPath(index), | |
object = parent(array, path); | |
if (object != null) { | |
delete object[toKey(last(path))]; | |
} | |
} | |
else { | |
delete array[toKey(index)]; | |
} | |
} | |
} | |
return array; | |
} | |
/** | |
* The base implementation of `_.random` without support for returning | |
* floating-point numbers. | |
* | |
* @private | |
* @param {number} lower The lower bound. | |
* @param {number} upper The upper bound. | |
* @returns {number} Returns the random number. | |
*/ | |
function baseRandom(lower, upper) { | |
return lower + nativeFloor(nativeRandom() * (upper - lower + 1)); | |
} | |
/** | |
* The base implementation of `_.range` and `_.rangeRight` which doesn't | |
* coerce arguments. | |
* | |
* @private | |
* @param {number} start The start of the range. | |
* @param {number} end The end of the range. | |
* @param {number} step The value to increment or decrement by. | |
* @param {boolean} [fromRight] Specify iterating from right to left. | |
* @returns {Array} Returns the range of numbers. | |
*/ | |
function baseRange(start, end, step, fromRight) { | |
var index = -1, | |
length = nativeMax(nativeCeil((end - start) / (step || 1)), 0), | |
result = Array(length); | |
while (length--) { | |
result[fromRight ? length : ++index] = start; | |
start += step; | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `_.repeat` which doesn't coerce arguments. | |
* | |
* @private | |
* @param {string} string The string to repeat. | |
* @param {number} n The number of times to repeat the string. | |
* @returns {string} Returns the repeated string. | |
*/ | |
function baseRepeat(string, n) { | |
var result = ''; | |
if (!string || n < 1 || n > MAX_SAFE_INTEGER) { | |
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 = nativeFloor(n / 2); | |
if (n) { | |
string += string; | |
} | |
} while (n); | |
return result; | |
} | |
/** | |
* The base implementation of `_.rest` which doesn't validate or coerce arguments. | |
* | |
* @private | |
* @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. | |
*/ | |
function baseRest(func, start) { | |
start = nativeMax(start === undefined ? (func.length - 1) : start, 0); | |
return function() { | |
var args = arguments, | |
index = -1, | |
length = nativeMax(args.length - start, 0), | |
array = Array(length); | |
while (++index < length) { | |
array[index] = args[start + index]; | |
} | |
index = -1; | |
var otherArgs = Array(start + 1); | |
while (++index < start) { | |
otherArgs[index] = args[index]; | |
} | |
otherArgs[start] = array; | |
return apply(func, this, otherArgs); | |
}; | |
} | |
/** | |
* The base implementation of `_.set`. | |
* | |
* @private | |
* @param {Object} object The object to modify. | |
* @param {Array|string} path The path of the property to set. | |
* @param {*} value The value to set. | |
* @param {Function} [customizer] The function to customize path creation. | |
* @returns {Object} Returns `object`. | |
*/ | |
function baseSet(object, path, value, customizer) { | |
if (!isObject(object)) { | |
return object; | |
} | |
path = isKey(path, object) ? [path] : castPath(path); | |
var index = -1, | |
length = path.length, | |
lastIndex = length - 1, | |
nested = object; | |
while (nested != null && ++index < length) { | |
var key = toKey(path[index]), | |
newValue = value; | |
if (index != lastIndex) { | |
var objValue = nested[key]; | |
newValue = customizer ? customizer(objValue, key, nested) : undefined; | |
if (newValue === undefined) { | |
newValue = isObject(objValue) | |
? objValue | |
: (isIndex(path[index + 1]) ? [] : {}); | |
} | |
} | |
assignValue(nested, key, newValue); | |
nested = nested[key]; | |
} | |
return object; | |
} | |
/** | |
* 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; | |
}; | |
/** | |
* 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; | |
if (start < 0) { | |
start = -start > length ? 0 : (length + start); | |
} | |
end = end > length ? length : end; | |
if (end < 0) { | |
end += length; | |
} | |
length = start > end ? 0 : ((end - start) >>> 0); | |
start >>>= 0; | |
var result = Array(length); | |
while (++index < length) { | |
result[index] = array[index + start]; | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `_.some` without support for iteratee shorthands. | |
* | |
* @private | |
* @param {Array|Object} 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; | |
baseEach(collection, function(value, index, collection) { | |
result = predicate(value, index, collection); | |
return !result; | |
}); | |
return !!result; | |
} | |
/** | |
* The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which | |
* 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 baseSortedIndex(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 (computed !== null && !isSymbol(computed) && | |
(retHighest ? (computed <= value) : (computed < value))) { | |
low = mid + 1; | |
} else { | |
high = mid; | |
} | |
} | |
return high; | |
} | |
return baseSortedIndexBy(array, value, identity, retHighest); | |
} | |
/** | |
* The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy` | |
* which 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 iteratee invoked per element. | |
* @param {boolean} [retHighest] Specify returning the highest qualified index. | |
* @returns {number} Returns the index at which `value` should be inserted | |
* into `array`. | |
*/ | |
function baseSortedIndexBy(array, value, iteratee, retHighest) { | |
value = iteratee(value); | |
var low = 0, | |
high = array ? array.length : 0, | |
valIsNaN = value !== value, | |
valIsNull = value === null, | |
valIsSymbol = isSymbol(value), | |
valIsUndefined = value === undefined; | |
while (low < high) { | |
var mid = nativeFloor((low + high) / 2), | |
computed = iteratee(array[mid]), | |
othIsDefined = computed !== undefined, | |
othIsNull = computed === null, | |
othIsReflexive = computed === computed, | |
othIsSymbol = isSymbol(computed); | |
if (valIsNaN) { | |
var setLow = retHighest || othIsReflexive; | |
} else if (valIsUndefined) { | |
setLow = othIsReflexive && (retHighest || othIsDefined); | |
} else if (valIsNull) { | |
setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull); | |
} else if (valIsSymbol) { | |
setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol); | |
} else if (othIsNull || othIsSymbol) { | |
setLow = false; | |
} else { | |
setLow = retHighest ? (computed <= value) : (computed < value); | |
} | |
if (setLow) { | |
low = mid + 1; | |
} else { | |
high = mid; | |
} | |
} | |
return nativeMin(high, MAX_ARRAY_INDEX); | |
} | |
/** | |
* The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without | |
* support for iteratee shorthands. | |
* | |
* @private | |
* @param {Array} array The array to inspect. | |
* @param {Function} [iteratee] The iteratee invoked per element. | |
* @returns {Array} Returns the new duplicate free array. | |
*/ | |
function baseSortedUniq(array, iteratee) { | |
var index = -1, | |
length = array.length, | |
resIndex = 0, | |
result = []; | |
while (++index < length) { | |
var value = array[index], | |
computed = iteratee ? iteratee(value) : value; | |
if (!index || !eq(computed, seen)) { | |
var seen = computed; | |
result[resIndex++] = value === 0 ? 0 : value; | |
} | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `_.toNumber` which doesn't ensure correct | |
* conversions of binary, hexadecimal, or octal string values. | |
* | |
* @private | |
* @param {*} value The value to process. | |
* @returns {number} Returns the number. | |
*/ | |
function baseToNumber(value) { | |
if (typeof value == 'number') { | |
return value; | |
} | |
if (isSymbol(value)) { | |
return NAN; | |
} | |
return +value; | |
} | |
/** | |
* The base implementation of `_.toString` which doesn't convert nullish | |
* values to empty strings. | |
* | |
* @private | |
* @param {*} value The value to process. | |
* @returns {string} Returns the string. | |
*/ | |
function baseToString(value) { | |
// Exit early for strings to avoid a performance hit in some environments. | |
if (typeof value == 'string') { | |
return value; | |
} | |
if (isSymbol(value)) { | |
return symbolToString ? symbolToString.call(value) : ''; | |
} | |
var result = (value + ''); | |
return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result; | |
} | |
/** | |
* The base implementation of `_.uniqBy` without support for iteratee shorthands. | |
* | |
* @private | |
* @param {Array} array The array to inspect. | |
* @param {Function} [iteratee] The iteratee invoked per element. | |
* @param {Function} [comparator] The comparator invoked per element. | |
* @returns {Array} Returns the new duplicate free array. | |
*/ | |
function baseUniq(array, iteratee, comparator) { | |
var index = -1, | |
includes = arrayIncludes, | |
length = array.length, | |
isCommon = true, | |
result = [], | |
seen = result; | |
if (comparator) { | |
isCommon = false; | |
includes = arrayIncludesWith; | |
} | |
else if (length >= LARGE_ARRAY_SIZE) { | |
var set = iteratee ? null : createSet(array); | |
if (set) { | |
return setToArray(set); | |
} | |
isCommon = false; | |
includes = cacheHas; | |
seen = new SetCache; | |
} | |
else { | |
seen = iteratee ? [] : result; | |
} | |
outer: | |
while (++index < length) { | |
var value = array[index], | |
computed = iteratee ? iteratee(value) : value; | |
value = (comparator || value !== 0) ? value : 0; | |
if (isCommon && computed === computed) { | |
var seenIndex = seen.length; | |
while (seenIndex--) { | |
if (seen[seenIndex] === computed) { | |
continue outer; | |
} | |
} | |
if (iteratee) { | |
seen.push(computed); | |
} | |
result.push(value); | |
} | |
else if (!includes(seen, computed, comparator)) { | |
if (seen !== result) { | |
seen.push(computed); | |
} | |
result.push(value); | |
} | |
} | |
return result; | |
} | |
/** | |
* The base implementation of `_.unset`. | |
* | |
* @private | |
* @param {Object} object The object to modify. | |
* @param {Array|string} path The path of the property to unset. | |
* @returns {boolean} Returns `true` if the property is deleted, else `false`. | |
*/ | |
function baseUnset(object, path) { | |
path = isKey(path, object) ? [path] : castPath(path); | |
object = parent(object, path); | |
var key = toKey(last(path)); | |
return !(object != null && hasOwnProperty.call(object, key)) || delete object[key]; | |
} | |
/** | |
* The base implementation of `_.update`. | |
* | |
* @private | |
* @param {Object} object The object to modify. | |
* @param {Array|string} path The path of the property to update. | |
* @param {Function} updater The function to produce the updated value. | |
* @param {Function} [customizer] The function to customize path creation. | |
* @returns {Object} Returns `object`. | |
*/ | |
function baseUpdate(object, path, updater, customizer) { | |
return baseSet(object, path, updater(baseGet(object, path)), customizer); | |
} | |
/** | |
* The base implementation of methods like `_.dropWhile` and `_.takeWhile` | |
* without support for iteratee shorthands. | |
* | |
* @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; | |
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 perform 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 arrayReduce(actions, function(result, action) { | |
return action.func.apply(action.thisArg, arrayPush([result], action.args)); | |
}, result); | |
} | |
/** | |
* The base implementation of methods like `_.xor`, without support for | |
* iteratee shorthands, that accepts an array of arrays to inspect. | |
* | |
* @private | |
* @param {Array} arrays The arrays to inspect. | |
* @param {Function} [iteratee] The iteratee invoked per element. | |
* @param {Function} [comparator] The comparator invoked per element. | |
* @returns {Array} Returns the new array of values. | |
*/ | |
function baseXor(arrays, iteratee, comparator) { | |
var index = -1, | |
length = arrays.length; | |
while (++index < length) { | |
var result = result | |
? arrayPush( | |
baseDifference(result, arrays[index], iteratee, comparator), | |
baseDifference(arrays[index], result, iteratee, comparator) | |
) | |
: arrays[index]; | |
} | |
return (result && result.length) ? baseUniq(result, iteratee, comparator) : []; | |
} | |
/** | |
* This base implementation of `_.zipObject` which assigns values using `assignFunc`. | |
* | |
* @private | |
* @param {Array} props The property identifiers. | |
* @param {Array} values The property values. | |
* @param {Function} assignFunc The function to assign values. | |
* @returns {Object} Returns the new object. | |
*/ | |
function baseZipObject(props, values, assignFunc) { | |
var index = -1, | |
length = props.length, | |
valsLength = values.length, | |
result = {}; | |
while (++index < length) { | |
var value = index < valsLength ? values[index] : undefined; | |
assignFunc(result, props[index], value); | |
} | |
return result; | |
} | |
/** | |
* Casts `value` to an empty array if it's not an array like object. | |
* | |
* @private | |
* @param {*} value The value to inspect. | |
* @returns {Array|Object} Returns the cast array-like object. | |
*/ | |
function castArrayLikeObject(value) { | |
return isArrayLikeObject(value) ? value : []; | |
} | |
/** | |
* Casts `value` to `identity` if it's not a function. | |
* | |
* @private | |
* @param {*} value The value to inspect. | |
* @returns {Function} Returns cast function. | |
*/ | |
function castFunction(value) { | |
return typeof value == 'function' ? value : identity; | |
} | |
/** | |
* Casts `value` to a path array if it's not one. | |
* | |
* @private | |
* @param {*} value The value to inspect. | |
* @returns {Array} Returns the cast property path array. | |
*/ | |
function castPath(value) { | |
return isArray(value) ? value : stringToPath(value); | |
} | |
/** | |
* Casts `array` to a slice if it's needed. | |
* | |
* @private | |
* @param {Array} array The array to inspect. | |
* @param {number} start The start position. | |
* @param {number} [end=array.length] The end position. | |
* @returns {Array} Returns the cast slice. | |
*/ | |
function castSlice(array, start, end) { | |
var length = array.length; | |
end = end === undefined ? length : end; | |
return (!start && end >= length) ? array : baseSlice(array, start, end); | |
} | |
/** | |
* A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout). | |
* | |
* @private | |
* @param {number|Object} id The timer id or timeout object of the timer to clear. | |
*/ | |
var clearTimeout = ctxClearTimeout || function(id) { | |
return root.clearTimeout(id); | |
}; | |
/** | |
* Creates a clone of `buffer`. | |
* | |
* @private | |
* @param {Buffer} buffer The buffer to clone. | |
* @param {boolean} [isDeep] Specify a deep clone. | |
* @returns {Buffer} Returns the cloned buffer. | |
*/ | |
function cloneBuffer(buffer, isDeep) { | |
if (isDeep) { | |
return buffer.slice(); | |
} | |
var result = new buffer.constructor(buffer.length); | |
buffer.copy(result); | |
return result; | |
} | |
/** | |
* Creates a clone of `arrayBuffer`. | |
* | |
* @private | |
* @param {ArrayBuffer} arrayBuffer The array buffer to clone. | |
* @returns {ArrayBuffer} Returns the cloned array buffer. | |
*/ | |
function cloneArrayBuffer(arrayBuffer) { | |
var result = new arrayBuffer.constructor(arrayBuffer.byteLength); | |
new Uint8Array(result).set(new Uint8Array(arrayBuffer)); | |
return result; | |
} | |
/** | |
* Creates a clone of `dataView`. | |
* | |
* @private | |
* @param {Object} dataView The data view to clone. | |
* @param {boolean} [isDeep] Specify a deep clone. | |
* @returns {Object} Returns the cloned data view. | |
*/ | |
function cloneDataView(dataView, isDeep) { | |
var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer; | |
return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength); | |
} | |
/** | |
* Creates a clone of `map`. | |
* | |
* @private | |
* @param {Object} map The map to clone. | |
* @param {Function} cloneFunc The function to clone values. | |
* @param {boolean} [isDeep] Specify a deep clone. | |
* @returns {Object} Returns the cloned map. | |
*/ | |
function cloneMap(map, isDeep, cloneFunc) { | |
var array = isDeep ? cloneFunc(mapToArray(map), true) : mapToArray(map); | |
return arrayReduce(array, addMapEntry, new map.constructor); | |
} | |
/** | |
* Creates a clone of `regexp`. | |
* | |
* @private | |
* @param {Object} regexp The regexp to clone. | |
* @returns {Object} Returns the cloned regexp. | |
*/ | |
function cloneRegExp(regexp) { | |
var result = new regexp.constructor(regexp.source, reFlags.exec(regexp)); | |
result.lastIndex = regexp.lastIndex; | |
return result; | |
} | |
/** | |
* Creates a clone of `set`. | |
* | |
* @private | |
* @param {Object} set The set to clone. | |
* @param {Function} cloneFunc The function to clone values. | |
* @param {boolean} [isDeep] Specify a deep clone. | |
* @returns {Object} Returns the cloned set. | |
*/ | |
function cloneSet(set, isDeep, cloneFunc) { | |
var array = isDeep ? cloneFunc(setToArray(set), true) : setToArray(set); | |
return arrayReduce(array, addSetEntry, new set.constructor); | |
} | |
/** | |
* Creates a clone of the `symbol` object. | |
* | |
* @private | |
* @param {Object} symbol The symbol object to clone. | |
* @returns {Object} Returns the cloned symbol object. | |
*/ | |
function cloneSymbol(symbol) { | |
return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {}; | |
} | |
/** | |
* Creates a clone of `typedArray`. | |
* | |
* @private | |
* @param {Object} typedArray The typed array to clone. | |
* @param {boolean} [isDeep] Specify a deep clone. | |
* @returns {Object} Returns the cloned typed array. | |
*/ | |
function cloneTypedArray(typedArray, isDeep) { | |
var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer; | |
return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length); | |
} | |
/** | |
* Compares values to sort them in ascending order. | |
* | |
* @private | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @returns {number} Returns the sort order indicator for `value`. | |
*/ | |
function compareAscending(value, other) { | |
if (value !== other) { | |
var valIsDefined = value !== undefined, | |
valIsNull = value === null, | |
valIsReflexive = value === value, | |
valIsSymbol = isSymbol(value); | |
var othIsDefined = other !== undefined, | |
othIsNull = other === null, | |
othIsReflexive = other === other, | |
othIsSymbol = isSymbol(other); | |
if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) || | |
(valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) || | |
(valIsNull && othIsDefined && othIsReflexive) || | |
(!valIsDefined && othIsReflexive) || | |
!valIsReflexive) { | |
return 1; | |
} | |
if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) || | |
(othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) || | |
(othIsNull && valIsDefined && valIsReflexive) || | |
(!othIsDefined && valIsReflexive) || | |
!othIsReflexive) { | |
return -1; | |
} | |
} | |
return 0; | |
} | |
/** | |
* Used by `_.orderBy` to compare multiple properties of a value to another | |
* and stable sort them. | |
* | |
* If `orders` is unspecified, all values are sorted in ascending order. Otherwise, | |
* specify an order of "desc" for descending or "asc" for ascending sort order | |
* of corresponding values. | |
* | |
* @private | |
* @param {Object} object The object to compare. | |
* @param {Object} other The other object to compare. | |
* @param {boolean[]|string[]} 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 = compareAscending(objCriteria[index], othCriteria[index]); | |
if (result) { | |
if (index >= ordersLength) { | |
return result; | |
} | |
var order = orders[index]; | |
return result * (order == 'desc' ? -1 : 1); | |
} | |
} | |
// 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://bugs.chromium.org/p/v8/issues/detail?id=90 for more details. | |
return object.index - other.index; | |
} | |
/** | |
* Creates an array that is the composition of partially applied arguments, | |
* placeholders, and provided arguments into a single array of arguments. | |
* | |
* @private | |
* @param {Array} args The provided arguments. | |
* @param {Array} partials The arguments to prepend to those provided. | |
* @param {Array} holders The `partials` placeholder indexes. | |
* @params {boolean} [isCurried] Specify composing for a curried function. | |
* @returns {Array} Returns the new array of composed arguments. | |
*/ | |
function composeArgs(args, partials, holders, isCurried) { | |
var argsIndex = -1, | |
argsLength = args.length, | |
holdersLength = holders.length, | |
leftIndex = -1, | |
leftLength = partials.length, | |
rangeLength = nativeMax(argsLength - holdersLength, 0), | |
result = Array(leftLength + rangeLength), | |
isUncurried = !isCurried; | |
while (++leftIndex < leftLength) { | |
result[leftIndex] = partials[leftIndex]; | |
} | |
while (++argsIndex < holdersLength) { | |
if (isUncurried || argsIndex < argsLength) { | |
result[holders[argsIndex]] = args[argsIndex]; | |
} | |
} | |
while (rangeLength--) { | |
result[leftIndex++] = args[argsIndex++]; | |
} | |
return result; | |
} | |
/** | |
* This function is like `composeArgs` except that the arguments composition | |
* is tailored for `_.partialRight`. | |
* | |
* @private | |
* @param {Array} args The provided arguments. | |
* @param {Array} partials The arguments to append to those provided. | |
* @param {Array} holders The `partials` placeholder indexes. | |
* @params {boolean} [isCurried] Specify composing for a curried function. | |
* @returns {Array} Returns the new array of composed arguments. | |
*/ | |
function composeArgsRight(args, partials, holders, isCurried) { | |
var argsIndex = -1, | |
argsLength = args.length, | |
holdersIndex = -1, | |
holdersLength = holders.length, | |
rightIndex = -1, | |
rightLength = partials.length, | |
rangeLength = nativeMax(argsLength - holdersLength, 0), | |
result = Array(rangeLength + rightLength), | |
isUncurried = !isCurried; | |
while (++argsIndex < rangeLength) { | |
result[argsIndex] = args[argsIndex]; | |
} | |
var offset = argsIndex; | |
while (++rightIndex < rightLength) { | |
result[offset + rightIndex] = partials[rightIndex]; | |
} | |
while (++holdersIndex < holdersLength) { | |
if (isUncurried || argsIndex < argsLength) { | |
result[offset + holders[holdersIndex]] = args[argsIndex++]; | |
} | |
} | |
return result; | |
} | |
/** | |
* 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 copyArray(source, array) { | |
var index = -1, | |
length = source.length; | |
array || (array = Array(length)); | |
while (++index < length) { | |
array[index] = source[index]; | |
} | |
return array; | |
} | |
/** | |
* Copies properties of `source` to `object`. | |
* | |
* @private | |
* @param {Object} source The object to copy properties from. | |
* @param {Array} props The property identifiers to copy. | |
* @param {Object} [object={}] The object to copy properties to. | |
* @param {Function} [customizer] The function to customize copied values. | |
* @returns {Object} Returns `object`. | |
*/ | |
function copyObject(source, props, object, customizer) { | |
object || (object = {}); | |
var index = -1, | |
length = props.length; | |
while (++index < length) { | |
var key = props[index]; | |
var newValue = customizer | |
? customizer(object[key], source[key], key, object, source) | |
: undefined; | |
assignValue(object, key, newValue === undefined ? source[key] : newValue); | |
} | |
return object; | |
} | |
/** | |
* Copies own symbol properties of `source` to `object`. | |
* | |
* @private | |
* @param {Object} source The object to copy symbols from. | |
* @param {Object} [object={}] The object to copy symbols to. | |
* @returns {Object} Returns `object`. | |
*/ | |
function copySymbols(source, object) { | |
return copyObject(source, getSymbols(source), object); | |
} | |
/** | |
* Creates a function like `_.groupBy`. | |
* | |
* @private | |
* @param {Function} setter The function to set accumulator values. | |
* @param {Function} [initializer] The accumulator object initializer. | |
* @returns {Function} Returns the new aggregator function. | |
*/ | |
function createAggregator(setter, initializer) { | |
return function(collection, iteratee) { | |
var func = isArray(collection) ? arrayAggregator : baseAggregator, | |
accumulator = initializer ? initializer() : {}; | |
return func(collection, setter, getIteratee(iteratee, 2), accumulator); | |
}; | |
} | |
/** | |
* Creates a function like `_.assign`. | |
* | |
* @private | |
* @param {Function} assigner The function to assign values. | |
* @returns {Function} Returns the new assigner function. | |
*/ | |
function createAssigner(assigner) { | |
return baseRest(function(object, sources) { | |
var index = -1, | |
length = sources.length, | |
customizer = length > 1 ? sources[length - 1] : undefined, | |
guard = length > 2 ? sources[2] : undefined; | |
customizer = (assigner.length > 3 && typeof customizer == 'function') | |
? (length--, customizer) | |
: undefined; | |
if (guard && isIterateeCall(sources[0], sources[1], guard)) { | |
customizer = length < 3 ? undefined : customizer; | |
length = 1; | |
} | |
object = Object(object); | |
while (++index < length) { | |
var source = sources[index]; | |
if (source) { | |
assigner(object, source, index, customizer); | |
} | |
} | |
return object; | |
}); | |
} | |
/** | |
* 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) { | |
if (collection == null) { | |
return collection; | |
} | |
if (!isArrayLike(collection)) { | |
return eachFunc(collection, iteratee); | |
} | |
var length = collection.length, | |
index = fromRight ? length : -1, | |
iterable = Object(collection); | |
while ((fromRight ? index-- : ++index < length)) { | |
if (iteratee(iterable[index], index, iterable) === false) { | |
break; | |
} | |
} | |
return collection; | |
}; | |
} | |
/** | |
* Creates a base function for methods like `_.forIn` and `_.forOwn`. | |
* | |
* @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 index = -1, | |
iterable = Object(object), | |
props = keysFunc(object), | |
length = props.length; | |
while (length--) { | |
var key = props[fromRight ? length : ++index]; | |
if (iteratee(iterable[key], key, iterable) === false) { | |
break; | |
} | |
} | |
return object; | |
}; | |
} | |
/** | |
* Creates a function that wraps `func` to invoke it with the optional `this` | |
* binding of `thisArg`. | |
* | |
* @private | |
* @param {Function} func The function to wrap. | |
* @param {number} bitmask The bitmask flags. See `createWrap` for more details. | |
* @param {*} [thisArg] The `this` binding of `func`. | |
* @returns {Function} Returns the new wrapped function. | |
*/ | |
function createBind(func, bitmask, thisArg) { | |
var isBind = bitmask & BIND_FLAG, | |
Ctor = createCtor(func); | |
function wrapper() { | |
var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func; | |
return fn.apply(isBind ? thisArg : this, arguments); | |
} | |
return wrapper; | |
} | |
/** | |
* Creates a function like `_.lowerFirst`. | |
* | |
* @private | |
* @param {string} methodName The name of the `String` case method to use. | |
* @returns {Function} Returns the new case function. | |
*/ | |
function createCaseFirst(methodName) { | |
return function(string) { | |
string = toString(string); | |
var strSymbols = hasUnicode(string) | |
? stringToArray(string) | |
: undefined; | |
var chr = strSymbols | |
? strSymbols[0] | |
: string.charAt(0); | |
var trailing = strSymbols | |
? castSlice(strSymbols, 1).join('') | |
: string.slice(1); | |
return chr[methodName]() + trailing; | |
}; | |
} | |
/** | |
* Creates a function like `_.camelCase`. | |
* | |
* @private | |
* @param {Function} callback The function to combine each word. | |
* @returns {Function} Returns the new compounder function. | |
*/ | |
function createCompounder(callback) { | |
return function(string) { | |
return arrayReduce(words(deburr(string).replace(reApos, '')), callback, ''); | |
}; | |
} | |
/** | |
* 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 createCtor(Ctor) { | |
return function() { | |
// Use a `switch` statement to work with class constructors. See | |
// http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist | |
// for more details. | |
var args = arguments; | |
switch (args.length) { | |
case 0: return new Ctor; | |
case 1: return new Ctor(args[0]); | |
case 2: return new Ctor(args[0], args[1]); | |
case 3: return new Ctor(args[0], args[1], args[2]); | |
case 4: return new Ctor(args[0], args[1], args[2], args[3]); | |
case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]); | |
case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]); | |
case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]); | |
} | |
var thisBinding = baseCreate(Ctor.prototype), | |
result = Ctor.apply(thisBinding, args); | |
// Mimic the constructor's `return` behavior. | |
// See https://es5.github.io/#x13.2.2 for more details. | |
return isObject(result) ? result : thisBinding; | |
}; | |
} | |
/** | |
* Creates a function that wraps `func` to enable currying. | |
* | |
* @private | |
* @param {Function} func The function to wrap. | |
* @param {number} bitmask The bitmask flags. See `createWrap` for more details. | |
* @param {number} arity The arity of `func`. | |
* @returns {Function} Returns the new wrapped function. | |
*/ | |
function createCurry(func, bitmask, arity) { | |
var Ctor = createCtor(func); | |
function wrapper() { | |
var length = arguments.length, | |
args = Array(length), | |
index = length, | |
placeholder = getHolder(wrapper); | |
while (index--) { | |
args[index] = arguments[index]; | |
} | |
var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder) | |
? [] | |
: replaceHolders(args, placeholder); | |
length -= holders.length; | |
if (length < arity) { | |
return createRecurry( | |
func, bitmask, createHybrid, wrapper.placeholder, undefined, | |
args, holders, undefined, undefined, arity - length); | |
} | |
var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func; | |
return apply(fn, this, args); | |
} | |
return wrapper; | |
} | |
/** | |
* Creates a `_.find` or `_.findLast` function. | |
* | |
* @private | |
* @param {Function} findIndexFunc The function to find the collection index. | |
* @returns {Function} Returns the new find function. | |
*/ | |
function createFind(findIndexFunc) { | |
return function(collection, predicate, fromIndex) { | |
var iterable = Object(collection); | |
if (!isArrayLike(collection)) { | |
var iteratee = getIteratee(predicate, 3); | |
collection = keys(collection); | |
predicate = function(key) { return iteratee(iterable[key], key, iterable); }; | |
} | |
var index = findIndexFunc(collection, predicate, fromIndex); | |
return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined; | |
}; | |
} | |
/** | |
* 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 baseRest(function(funcs) { | |
funcs = baseFlatten(funcs, 1); | |
var length = funcs.length, | |
index = length, | |
prereq = LodashWrapper.prototype.thru; | |
if (fromRight) { | |
funcs.reverse(); | |
} | |
while (index--) { | |
var func = funcs[index]; | |
if (typeof func != 'function') { | |
throw new TypeError(FUNC_ERROR_TEXT); | |
} | |
if (prereq && !wrapper && getFuncName(func) == 'wrapper') { | |
var wrapper = new LodashWrapper([], true); | |
} | |
} | |
index = wrapper ? index : length; | |
while (++index < length) { | |
func = funcs[index]; | |
var funcName = getFuncName(func), | |
data = funcName == 'wrapper' ? getData(func) : undefined; | |
if (data && isLaziable(data[0]) && | |
data[1] == (ARY_FLAG | CURRY_FLAG | PARTIAL_FLAG | REARG_FLAG) && | |
!data[4].length && data[9] == 1 | |
) { | |
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, | |
value = args[0]; | |
if (wrapper && args.length == 1 && | |
isArray(value) && value.length >= LARGE_ARRAY_SIZE) { | |
return wrapper.plant(value).value(); | |
} | |
var index = 0, | |
result = length ? funcs[index].apply(this, args) : value; | |
while (++index < length) { | |
result = funcs[index].call(this, result); | |
} | |
return result; | |
}; | |
}); | |
} | |
/** | |
* Creates a function that wraps `func` to invoke it with optional `this` | |
* binding of `thisArg`, partial application, and currying. | |
* | |
* @private | |
* @param {Function|string} func The function or method name to wrap. | |
* @param {number} bitmask The bitmask flags. See `createWrap` 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 createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) { | |
var isAry = bitmask & ARY_FLAG, | |
isBind = bitmask & BIND_FLAG, | |
isBindKey = bitmask & BIND_KEY_FLAG, | |
isCurried = bitmask & (CURRY_FLAG | CURRY_RIGHT_FLAG), | |
isFlip = bitmask & FLIP_FLAG, | |
Ctor = isBindKey ? undefined : createCtor(func); | |
function wrapper() { | |
var length = arguments.length, | |
args = Array(length), | |
index = length; | |
while (index--) { | |
args[index] = arguments[index]; | |
} | |
if (isCurried) { | |
var placeholder = getHolder(wrapper), | |
holdersCount = countHolders(args, placeholder); | |
} | |
if (partials) { | |
args = composeArgs(args, partials, holders, isCurried); | |
} | |
if (partialsRight) { | |
args = composeArgsRight(args, partialsRight, holdersRight, isCurried); | |
} | |
length -= holdersCount; | |
if (isCurried && length < arity) { | |
var newHolders = replaceHolders(args, placeholder); | |
return createRecurry( | |
func, bitmask, createHybrid, wrapper.placeholder, thisArg, | |
args, newHolders, argPos, ary, arity - length | |
); | |
} | |
var thisBinding = isBind ? thisArg : this, | |
fn = isBindKey ? thisBinding[func] : func; | |
length = args.length; | |
if (argPos) { | |
args = reorder(args, argPos); | |
} else if (isFlip && length > 1) { | |
args.reverse(); | |
} | |
if (isAry && ary < length) { | |
args.length = ary; | |
} | |
if (this && this !== root && this instanceof wrapper) { | |
fn = Ctor || createCtor(fn); | |
} | |
return fn.apply(thisBinding, args); | |
} | |
return wrapper; | |
} | |
/** | |
* Creates a function like `_.invertBy`. | |
* | |
* @private | |
* @param {Function} setter The function to set accumulator values. | |
* @param {Function} toIteratee The function to resolve iteratees. | |
* @returns {Function} Returns the new inverter function. | |
*/ | |
function createInverter(setter, toIteratee) { | |
return function(object, iteratee) { | |
return baseInverter(object, setter, toIteratee(iteratee), {}); | |
}; | |
} | |
/** | |
* Creates a function that performs a mathematical operation on two values. | |
* | |
* @private | |
* @param {Function} operator The function to perform the operation. | |
* @param {number} [defaultValue] The value used for `undefined` arguments. | |
* @returns {Function} Returns the new mathematical operation function. | |
*/ | |
function createMathOperation(operator, defaultValue) { | |
return function(value, other) { | |
var result; | |
if (value === undefined && other === undefined) { | |
return defaultValue; | |
} | |
if (value !== undefined) { | |
result = value; | |
} | |
if (other !== undefined) { | |
if (result === undefined) { | |
return other; | |
} | |
if (typeof value == 'string' || typeof other == 'string') { | |
value = baseToString(value); | |
other = baseToString(other); | |
} else { | |
value = baseToNumber(value); | |
other = baseToNumber(other); | |
} | |
result = operator(value, other); | |
} | |
return result; | |
}; | |
} | |
/** | |
* Creates a function like `_.over`. | |
* | |
* @private | |
* @param {Function} arrayFunc The function to iterate over iteratees. | |
* @returns {Function} Returns the new over function. | |
*/ | |
function createOver(arrayFunc) { | |
return baseRest(function(iteratees) { | |
iteratees = (iteratees.length == 1 && isArray(iteratees[0])) | |
? arrayMap(iteratees[0], baseUnary(getIteratee())) | |
: arrayMap(baseFlatten(iteratees, 1), baseUnary(getIteratee())); | |
return baseRest(function(args) { | |
var thisArg = this; | |
return arrayFunc(iteratees, function(iteratee) { | |
return apply(iteratee, thisArg, args); | |
}); | |
}); | |
}); | |
} | |
/** | |
* Creates the padding for `string` based on `length`. The `chars` string | |
* is truncated if the number of characters exceeds `length`. | |
* | |
* @private | |
* @param {number} length The padding length. | |
* @param {string} [chars=' '] The string used as padding. | |
* @returns {string} Returns the padding for `string`. | |
*/ | |
function createPadding(length, chars) { | |
chars = chars === undefined ? ' ' : baseToString(chars); | |
var charsLength = chars.length; | |
if (charsLength < 2) { | |
return charsLength ? baseRepeat(chars, length) : chars; | |
} | |
var result = baseRepeat(chars, nativeCeil(length / stringSize(chars))); | |
return hasUnicode(chars) | |
? castSlice(stringToArray(result), 0, length).join('') | |
: result.slice(0, length); | |
} | |
/** | |
* Creates a function that wraps `func` to invoke it with the `this` binding | |
* of `thisArg` and `partials` prepended to the arguments it receives. | |
* | |
* @private | |
* @param {Function} func The function to wrap. | |
* @param {number} bitmask The bitmask flags. See `createWrap` 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 wrapped function. | |
*/ | |
function createPartial(func, bitmask, thisArg, partials) { | |
var isBind = bitmask & BIND_FLAG, | |
Ctor = createCtor(func); | |
function wrapper() { | |
var argsIndex = -1, | |
argsLength = arguments.length, | |
leftIndex = -1, | |
leftLength = partials.length, | |
args = Array(leftLength + argsLength), | |
fn = (this && this !== root && this instanceof wrapper) ? Ctor : func; | |
while (++leftIndex < leftLength) { | |
args[leftIndex] = partials[leftIndex]; | |
} | |
while (argsLength--) { | |
args[leftIndex++] = arguments[++argsIndex]; | |
} | |
return apply(fn, isBind ? thisArg : this, args); | |
} | |
return wrapper; | |
} | |
/** | |
* Creates a `_.range` or `_.rangeRight` function. | |
* | |
* @private | |
* @param {boolean} [fromRight] Specify iterating from right to left. | |
* @returns {Function} Returns the new range function. | |
*/ | |
function createRange(fromRight) { | |
return function(start, end, step) { | |
if (step && typeof step != 'number' && isIterateeCall(start, end, step)) { | |
end = step = undefined; | |
} | |
// Ensure the sign of `-0` is preserved. | |
start = toFinite(start); | |
if (end === undefined) { | |
end = start; | |
start = 0; | |
} else { | |
end = toFinite(end); | |
} | |
step = step === undefined ? (start < end ? 1 : -1) : toFinite(step); | |
return baseRange(start, end, step, fromRight); | |
}; | |
} | |
/** | |
* Creates a function that performs a relational operation on two values. | |
* | |
* @private | |
* @param {Function} operator The function to perform the operation. | |
* @returns {Function} Returns the new relational operation function. | |
*/ | |
function createRelationalOperation(operator) { | |
return function(value, other) { | |
if (!(typeof value == 'string' && typeof other == 'string')) { | |
value = toNumber(value); | |
other = toNumber(other); | |
} | |
return operator(value, other); | |
}; | |
} | |
/** | |
* Creates a function that wraps `func` to continue currying. | |
* | |
* @private | |
* @param {Function} func The function to wrap. | |
* @param {number} bitmask The bitmask flags. See `createWrap` for more details. | |
* @param {Function} wrapFunc The function to create the `func` wrapper. | |
* @param {*} placeholder The placeholder value. | |
* @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} [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 createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) { | |
var isCurry = bitmask & CURRY_FLAG, | |
newHolders = isCurry ? holders : undefined, | |
newHoldersRight = isCurry ? undefined : holders, | |
newPartials = isCurry ? partials : undefined, | |
newPartialsRight = isCurry ? undefined : partials; | |
bitmask |= (isCurry ? PARTIAL_FLAG : PARTIAL_RIGHT_FLAG); | |
bitmask &= ~(isCurry ? PARTIAL_RIGHT_FLAG : PARTIAL_FLAG); | |
if (!(bitmask & CURRY_BOUND_FLAG)) { | |
bitmask &= ~(BIND_FLAG | BIND_KEY_FLAG); | |
} | |
var newData = [ | |
func, bitmask, thisArg, newPartials, newHolders, newPartialsRight, | |
newHoldersRight, argPos, ary, arity | |
]; | |
var result = wrapFunc.apply(undefined, newData); | |
if (isLaziable(func)) { | |
setData(result, newData); | |
} | |
result.placeholder = placeholder; | |
return setWrapToString(result, func, bitmask); | |
} | |
/** | |
* Creates a function like `_.round`. | |
* | |
* @private | |
* @param {string} methodName The name of the `Math` method to use when rounding. | |
* @returns {Function} Returns the new round function. | |
*/ | |
function createRound(methodName) { | |
var func = Math[methodName]; | |
return function(number, precision) { | |
number = toNumber(number); | |
precision = nativeMin(toInteger(precision), 292); | |
if (precision) { | |
// Shift with exponential notation to avoid floating-point issues. | |
// See [MDN](https://mdn.io/round#Examples) for more details. | |
var pair = (toString(number) + 'e').split('e'), | |
value = func(pair[0] + 'e' + (+pair[1] + precision)); | |
pair = (toString(value) + 'e').split('e'); | |
return +(pair[0] + 'e' + (+pair[1] - precision)); | |
} | |
return func(number); | |
}; | |
} | |
/** | |
* Creates a set object of `values`. | |
* | |
* @private | |
* @param {Array} values The values to add to the set. | |
* @returns {Object} Returns the new set. | |
*/ | |
var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) { | |
return new Set(values); | |
}; | |
/** | |
* Creates a `_.toPairs` or `_.toPairsIn` function. | |
* | |
* @private | |
* @param {Function} keysFunc The function to get the keys of a given object. | |
* @returns {Function} Returns the new pairs function. | |
*/ | |
function createToPairs(keysFunc) { | |
return function(object) { | |
var tag = getTag(object); | |
if (tag == mapTag) { | |
return mapToArray(object); | |
} | |
if (tag == setTag) { | |
return setToPairs(object); | |
} | |
return baseToPairs(object, keysFunc(object)); | |
}; | |
} | |
/** | |
* 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 wrap. | |
* @param {number} bitmask The bitmask 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` | |
* 512 - `_.flip` | |
* @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 createWrap(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 = undefined; | |
} | |
ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0); | |
arity = arity === undefined ? arity : toInteger(arity); | |
length -= holders ? holders.length : 0; | |
if (bitmask & PARTIAL_RIGHT_FLAG) { | |
var partialsRight = partials, | |
holdersRight = holders; | |
partials = holders = undefined; | |
} | |
var data = isBindKey ? undefined : getData(func); | |
var newData = [ | |
func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, | |
argPos, ary, arity | |
]; | |
if (data) { | |
mergeData(newData, data); | |
} | |
func = newData[0]; | |
bitmask = newData[1]; | |
thisArg = newData[2]; | |
partials = newData[3]; | |
holders = newData[4]; | |
arity = newData[9] = newData[9] == null | |
? (isBindKey ? 0 : func.length) | |
: nativeMax(newData[9] - length, 0); | |
if (!arity && bitmask & (CURRY_FLAG | CURRY_RIGHT_FLAG)) { | |
bitmask &= ~(CURRY_FLAG | CURRY_RIGHT_FLAG); | |
} | |
if (!bitmask || bitmask == BIND_FLAG) { | |
var result = createBind(func, bitmask, thisArg); | |
} else if (bitmask == CURRY_FLAG || bitmask == CURRY_RIGHT_FLAG) { | |
result = createCurry(func, bitmask, arity); | |
} else if ((bitmask == PARTIAL_FLAG || bitmask == (BIND_FLAG | PARTIAL_FLAG)) && !holders.length) { | |
result = createPartial(func, bitmask, thisArg, partials); | |
} else { | |
result = createHybrid.apply(undefined, newData); | |
} | |
var setter = data ? baseSetData : setData; | |
return setWrapToString(setter(result, newData), func, bitmask); | |
} | |
/** | |
* 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 comparisons. | |
* @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual` | |
* for more details. | |
* @param {Object} stack Tracks traversed `array` and `other` objects. | |
* @returns {boolean} Returns `true` if the arrays are equivalent, else `false`. | |
*/ | |
function equalArrays(array, other, equalFunc, customizer, bitmask, stack) { | |
var isPartial = bitmask & PARTIAL_COMPARE_FLAG, | |
arrLength = array.length, | |
othLength = other.length; | |
if (arrLength != othLength && !(isPartial && othLength > arrLength)) { | |
return false; | |
} | |
// Assume cyclic values are equal. | |
var stacked = stack.get(array); | |
if (stacked && stack.get(other)) { | |
return stacked == other; | |
} | |
var index = -1, | |
result = true, | |
seen = (bitmask & UNORDERED_COMPARE_FLAG) ? new SetCache : undefined; | |
stack.set(array, other); | |
stack.set(other, array); | |
// Ignore non-index properties. | |
while (++index < arrLength) { | |
var arrValue = array[index], | |
othValue = other[index]; | |
if (customizer) { | |
var compared = isPartial | |
? customizer(othValue, arrValue, index, other, array, stack) | |
: customizer(arrValue, othValue, index, array, other, stack); | |
} | |
if (compared !== undefined) { | |
if (compared) { | |
continue; | |
} | |
result = false; | |
break; | |
} | |
// Recursively compare arrays (susceptible to call stack limits). | |
if (seen) { | |
if (!arraySome(other, function(othValue, othIndex) { | |
if (!seen.has(othIndex) && | |
(arrValue === othValue || equalFunc(arrValue, othValue, customizer, bitmask, stack))) { | |
return seen.add(othIndex); | |
} | |
})) { | |
result = false; | |
break; | |
} | |
} else if (!( | |
arrValue === othValue || | |
equalFunc(arrValue, othValue, customizer, bitmask, stack) | |
)) { | |
result = false; | |
break; | |
} | |
} | |
stack['delete'](array); | |
stack['delete'](other); | |
return result; | |
} | |
/** | |
* 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} object The object to compare. | |
* @param {Object} other The other object to compare. | |
* @param {string} tag The `toStringTag` of the objects to compare. | |
* @param {Function} equalFunc The function to determine equivalents of values. | |
* @param {Function} customizer The function to customize comparisons. | |
* @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual` | |
* for more details. | |
* @param {Object} stack Tracks traversed `object` and `other` objects. | |
* @returns {boolean} Returns `true` if the objects are equivalent, else `false`. | |
*/ | |
function equalByTag(object, other, tag, equalFunc, customizer, bitmask, stack) { | |
switch (tag) { | |
case dataViewTag: | |
if ((object.byteLength != other.byteLength) || | |
(object.byteOffset != other.byteOffset)) { | |
return false; | |
} | |
object = object.buffer; | |
other = other.buffer; | |
case arrayBufferTag: | |
if ((object.byteLength != other.byteLength) || | |
!equalFunc(new Uint8Array(object), new Uint8Array(other))) { | |
return false; | |
} | |
return true; | |
case boolTag: | |
case dateTag: | |
case numberTag: | |
// Coerce booleans to `1` or `0` and dates to milliseconds. | |
// Invalid dates are coerced to `NaN`. | |
return eq(+object, +other); | |
case errorTag: | |
return object.name == other.name && object.message == other.message; | |
case regexpTag: | |
case stringTag: | |
// Coerce regexes to strings and treat strings, primitives and objects, | |
// as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring | |
// for more details. | |
return object == (other + ''); | |
case mapTag: | |
var convert = mapToArray; | |
case setTag: | |
var isPartial = bitmask & PARTIAL_COMPARE_FLAG; | |
convert || (convert = setToArray); | |
if (object.size != other.size && !isPartial) { | |
return false; | |
} | |
// Assume cyclic values are equal. | |
var stacked = stack.get(object); | |
if (stacked) { | |
return stacked == other; | |
} | |
bitmask |= UNORDERED_COMPARE_FLAG; | |
// Recursively compare objects (susceptible to call stack limits). | |
stack.set(object, other); | |
var result = equalArrays(convert(object), convert(other), equalFunc, customizer, bitmask, stack); | |
stack['delete'](object); | |
return result; | |
case symbolTag: | |
if (symbolValueOf) { | |
return symbolValueOf.call(object) == symbolValueOf.call(other); | |
} | |
} | |
return false; | |
} | |
/** | |
* 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 comparisons. | |
* @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual` | |
* for more details. | |
* @param {Object} stack Tracks traversed `object` and `other` objects. | |
* @returns {boolean} Returns `true` if the objects are equivalent, else `false`. | |
*/ | |
function equalObjects(object, other, equalFunc, customizer, bitmask, stack) { | |
var isPartial = bitmask & PARTIAL_COMPARE_FLAG, | |
objProps = keys(object), | |
objLength = objProps.length, | |
othProps = keys(other), | |
othLength = othProps.length; | |
if (objLength != othLength && !isPartial) { | |
return false; | |
} | |
var index = objLength; | |
while (index--) { | |
var key = objProps[index]; | |
if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) { | |
return false; | |
} | |
} | |
// Assume cyclic values are equal. | |
var stacked = stack.get(object); | |
if (stacked && stack.get(other)) { | |
return stacked == other; | |
} | |
var result = true; | |
stack.set(object, other); | |
stack.set(other, object); | |
var skipCtor = isPartial; | |
while (++index < objLength) { | |
key = objProps[index]; | |
var objValue = object[key], | |
othValue = other[key]; | |
if (customizer) { | |
var compared = isPartial | |
? customizer(othValue, objValue, key, other, object, stack) | |
: customizer(objValue, othValue, key, object, other, stack); | |
} | |
// Recursively compare objects (susceptible to call stack limits). | |
if (!(compared === undefined | |
? (objValue === othValue || equalFunc(objValue, othValue, customizer, bitmask, stack)) | |
: compared | |
)) { | |
result = false; | |
break; | |
} | |
skipCtor || (skipCtor = key == 'constructor'); | |
} | |
if (result && !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)) { | |
result = false; | |
} | |
} | |
stack['delete'](object); | |
stack['delete'](other); | |
return result; | |
} | |
/** | |
* Creates an array of own enumerable property names and symbols of `object`. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @returns {Array} Returns the array of property names and symbols. | |
*/ | |
function getAllKeys(object) { | |
return baseGetAllKeys(object, keys, getSymbols); | |
} | |
/** | |
* Creates an array of own and inherited enumerable property names and | |
* symbols of `object`. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @returns {Array} Returns the array of property names and symbols. | |
*/ | |
function getAllKeysIn(object) { | |
return baseGetAllKeys(object, keysIn, getSymbolsIn); | |
} | |
/** | |
* 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); | |
}; | |
/** | |
* Gets the name of `func`. | |
* | |
* @private | |
* @param {Function} func The function to query. | |
* @returns {string} Returns the function name. | |
*/ | |
function getFuncName(func) { | |
var result = (func.name + ''), | |
array = realNames[result], | |
length = hasOwnProperty.call(realNames, result) ? array.length : 0; | |
while (length--) { | |
var data = array[length], | |
otherFunc = data.func; | |
if (otherFunc == null || otherFunc == func) { | |
return data.name; | |
} | |
} | |
return result; | |
} | |
/** | |
* Gets the argument placeholder value for `func`. | |
* | |
* @private | |
* @param {Function} func The function to inspect. | |
* @returns {*} Returns the placeholder value. | |
*/ | |
function getHolder(func) { | |
var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func; | |
return object.placeholder; | |
} | |
/** | |
* Gets the appropriate "iteratee" function. If `_.iteratee` is customized, | |
* this function returns the custom method, otherwise it returns `baseIteratee`. | |
* If arguments are provided, the chosen function is invoked with them and | |
* its result is returned. | |
* | |
* @private | |
* @param {*} [value] The value to convert to an iteratee. | |
* @param {number} [arity] The arity of the created iteratee. | |
* @returns {Function} Returns the chosen function or its result. | |
*/ | |
function getIteratee() { | |
var result = lodash.iteratee || iteratee; | |
result = result === iteratee ? baseIteratee : result; | |
return arguments.length ? result(arguments[0], arguments[1]) : result; | |
} | |
/** | |
* Gets the data for `map`. | |
* | |
* @private | |
* @param {Object} map The map to query. | |
* @param {string} key The reference key. | |
* @returns {*} Returns the map data. | |
*/ | |
function getMapData(map, key) { | |
var data = map.__data__; | |
return isKeyable(key) | |
? data[typeof key == 'string' ? 'string' : 'hash'] | |
: data.map; | |
} | |
/** | |
* Gets the property names, values, and compare flags of `object`. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @returns {Array} Returns the match data of `object`. | |
*/ | |
function getMatchData(object) { | |
var result = keys(object), | |
length = result.length; | |
while (length--) { | |
var key = result[length], | |
value = object[key]; | |
result[length] = [key, value, isStrictComparable(value)]; | |
} | |
return result; | |
} | |
/** | |
* Gets the native function at `key` of `object`. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @param {string} key The key of the method to get. | |
* @returns {*} Returns the function if it's native, else `undefined`. | |
*/ | |
function getNative(object, key) { | |
var value = getValue(object, key); | |
return baseIsNative(value) ? value : undefined; | |
} | |
/** | |
* Creates an array of the own enumerable symbol properties of `object`. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @returns {Array} Returns the array of symbols. | |
*/ | |
var getSymbols = nativeGetSymbols ? overArg(nativeGetSymbols, Object) : stubArray; | |
/** | |
* Creates an array of the own and inherited enumerable symbol properties | |
* of `object`. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @returns {Array} Returns the array of symbols. | |
*/ | |
var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) { | |
var result = []; | |
while (object) { | |
arrayPush(result, getSymbols(object)); | |
object = getPrototype(object); | |
} | |
return result; | |
}; | |
/** | |
* Gets the `toStringTag` of `value`. | |
* | |
* @private | |
* @param {*} value The value to query. | |
* @returns {string} Returns the `toStringTag`. | |
*/ | |
var getTag = baseGetTag; | |
// Fallback for data views, maps, sets, and weak maps in IE 11, | |
// for data views in Edge < 14, and promises in Node.js. | |
if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) || | |
(Map && getTag(new Map) != mapTag) || | |
(Promise && getTag(Promise.resolve()) != promiseTag) || | |
(Set && getTag(new Set) != setTag) || | |
(WeakMap && getTag(new WeakMap) != weakMapTag)) { | |
getTag = function(value) { | |
var result = objectToString.call(value), | |
Ctor = result == objectTag ? value.constructor : undefined, | |
ctorString = Ctor ? toSource(Ctor) : undefined; | |
if (ctorString) { | |
switch (ctorString) { | |
case dataViewCtorString: return dataViewTag; | |
case mapCtorString: return mapTag; | |
case promiseCtorString: return promiseTag; | |
case setCtorString: return setTag; | |
case weakMapCtorString: return weakMapTag; | |
} | |
} | |
return result; | |
}; | |
} | |
/** | |
* 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.length; | |
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 }; | |
} | |
/** | |
* Extracts wrapper details from the `source` body comment. | |
* | |
* @private | |
* @param {string} source The source to inspect. | |
* @returns {Array} Returns the wrapper details. | |
*/ | |
function getWrapDetails(source) { | |
var match = source.match(reWrapDetails); | |
return match ? match[1].split(reSplitDetails) : []; | |
} | |
/** | |
* Checks if `path` exists on `object`. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @param {Array|string} path The path to check. | |
* @param {Function} hasFunc The function to check properties. | |
* @returns {boolean} Returns `true` if `path` exists, else `false`. | |
*/ | |
function hasPath(object, path, hasFunc) { | |
path = isKey(path, object) ? [path] : castPath(path); | |
var result, | |
index = -1, | |
length = path.length; | |
while (++index < length) { | |
var key = toKey(path[index]); | |
if (!(result = object != null && hasFunc(object, key))) { | |
break; | |
} | |
object = object[key]; | |
} | |
if (result) { | |
return result; | |
} | |
var length = object ? object.length : 0; | |
return !!length && isLength(length) && isIndex(key, length) && | |
(isArray(object) || isArguments(object)); | |
} | |
/** | |
* 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 = array.constructor(length); | |
// Add 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) { | |
return (typeof object.constructor == 'function' && !isPrototype(object)) | |
? baseCreate(getPrototype(object)) | |
: {}; | |
} | |
/** | |
* 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 {Function} cloneFunc The function to clone values. | |
* @param {boolean} [isDeep] Specify a deep clone. | |
* @returns {Object} Returns the initialized clone. | |
*/ | |
function initCloneByTag(object, tag, cloneFunc, isDeep) { | |
var Ctor = object.constructor; | |
switch (tag) { | |
case arrayBufferTag: | |
return cloneArrayBuffer(object); | |
case boolTag: | |
case dateTag: | |
return new Ctor(+object); | |
case dataViewTag: | |
return cloneDataView(object, isDeep); | |
case float32Tag: case float64Tag: | |
case int8Tag: case int16Tag: case int32Tag: | |
case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag: | |
return cloneTypedArray(object, isDeep); | |
case mapTag: | |
return cloneMap(object, isDeep, cloneFunc); | |
case numberTag: | |
case stringTag: | |
return new Ctor(object); | |
case regexpTag: | |
return cloneRegExp(object); | |
case setTag: | |
return cloneSet(object, isDeep, cloneFunc); | |
case symbolTag: | |
return cloneSymbol(object); | |
} | |
} | |
/** | |
* Inserts wrapper `details` in a comment at the top of the `source` body. | |
* | |
* @private | |
* @param {string} source The source to modify. | |
* @returns {Array} details The details to insert. | |
* @returns {string} Returns the modified source. | |
*/ | |
function insertWrapDetails(source, details) { | |
var length = details.length, | |
lastIndex = length - 1; | |
details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex]; | |
details = details.join(length > 2 ? ', ' : ' '); | |
return source.replace(reWrapComment, '{\n/* [wrapped with ' + details + '] */\n'); | |
} | |
/** | |
* Checks if `value` is a flattenable `arguments` object or array. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is flattenable, else `false`. | |
*/ | |
function isFlattenable(value) { | |
return isArray(value) || isArguments(value) || | |
!!(spreadableSymbol && value && value[spreadableSymbol]); | |
} | |
/** | |
* 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) { | |
length = length == null ? MAX_SAFE_INTEGER : length; | |
return !!length && | |
(typeof value == 'number' || reIsUint.test(value)) && | |
(value > -1 && value % 1 == 0 && value < length); | |
} | |
/** | |
* Checks if the given 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' | |
? (isArrayLike(object) && isIndex(index, object.length)) | |
: (type == 'string' && index in object) | |
) { | |
return eq(object[index], value); | |
} | |
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) { | |
if (isArray(value)) { | |
return false; | |
} | |
var type = typeof value; | |
if (type == 'number' || type == 'symbol' || type == 'boolean' || | |
value == null || isSymbol(value)) { | |
return true; | |
} | |
return reIsPlainProp.test(value) || !reIsDeepProp.test(value) || | |
(object != null && value in Object(object)); | |
} | |
/** | |
* Checks if `value` is suitable for use as unique object key. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is suitable, else `false`. | |
*/ | |
function isKeyable(value) { | |
var type = typeof value; | |
return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean') | |
? (value !== '__proto__') | |
: (value === null); | |
} | |
/** | |
* 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), | |
other = lodash[funcName]; | |
if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) { | |
return false; | |
} | |
if (func === other) { | |
return true; | |
} | |
var data = getData(other); | |
return !!data && func === data[0]; | |
} | |
/** | |
* Checks if `func` has its source masked. | |
* | |
* @private | |
* @param {Function} func The function to check. | |
* @returns {boolean} Returns `true` if `func` is masked, else `false`. | |
*/ | |
function isMasked(func) { | |
return !!maskSrcKey && (maskSrcKey in func); | |
} | |
/** | |
* Checks if `func` is capable of being masked. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `func` is maskable, else `false`. | |
*/ | |
var isMaskable = coreJsData ? isFunction : stubFalse; | |
/** | |
* Checks if `value` is likely a prototype object. | |
* | |
* @private | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a prototype, else `false`. | |
*/ | |
function isPrototype(value) { | |
var Ctor = value && value.constructor, | |
proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto; | |
return value === proto; | |
} | |
/** | |
* 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 && !isObject(value); | |
} | |
/** | |
* A specialized version of `matchesProperty` for source values suitable | |
* for strict equality comparisons, i.e. `===`. | |
* | |
* @private | |
* @param {string} key The key of the property to get. | |
* @param {*} srcValue The value to match. | |
* @returns {Function} Returns the new spec function. | |
*/ | |
function matchesStrictComparable(key, srcValue) { | |
return function(object) { | |
if (object == null) { | |
return false; | |
} | |
return object[key] === srcValue && | |
(srcValue !== undefined || (key in Object(object))); | |
}; | |
} | |
/** | |
* Merges the function metadata of `source` into `data`. | |
* | |
* Merging metadata reduces the number of wrappers used 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` modify function arguments, making the order in which they are | |
* executed important, preventing the merging of metadata. However, we make | |
* an exception for a safe combined 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 < (BIND_FLAG | BIND_KEY_FLAG | 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)) && (source[7].length <= source[8]) && (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]) : value; | |
data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4]; | |
} | |
// Compose partial right arguments. | |
value = source[5]; | |
if (value) { | |
partials = data[5]; | |
data[5] = partials ? composeArgsRight(partials, value, source[6]) : value; | |
data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6]; | |
} | |
// Use source `argPos` if available. | |
value = source[7]; | |
if (value) { | |
data[7] = 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; | |
} | |
/** | |
* Used by `_.defaultsDeep` to customize its `_.merge` use. | |
* | |
* @private | |
* @param {*} objValue The destination value. | |
* @param {*} srcValue The source value. | |
* @param {string} key The key of the property to merge. | |
* @param {Object} object The parent object of `objValue`. | |
* @param {Object} source The parent object of `srcValue`. | |
* @param {Object} [stack] Tracks traversed source values and their merged | |
* counterparts. | |
* @returns {*} Returns the value to assign. | |
*/ | |
function mergeDefaults(objValue, srcValue, key, object, source, stack) { | |
if (isObject(objValue) && isObject(srcValue)) { | |
// Recursively merge objects and arrays (susceptible to call stack limits). | |
stack.set(srcValue, objValue); | |
baseMerge(objValue, srcValue, undefined, mergeDefaults, stack); | |
stack['delete'](srcValue); | |
} | |
return objValue; | |
} | |
/** | |
* This function is like | |
* [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys) | |
* except that it includes inherited enumerable properties. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @returns {Array} Returns the array of property names. | |
*/ | |
function nativeKeysIn(object) { | |
var result = []; | |
if (object != null) { | |
for (var key in Object(object)) { | |
result.push(key); | |
} | |
} | |
return result; | |
} | |
/** | |
* Gets the parent value at `path` of `object`. | |
* | |
* @private | |
* @param {Object} object The object to query. | |
* @param {Array} path The path to get the parent value of. | |
* @returns {*} Returns the parent value. | |
*/ | |
function parent(object, path) { | |
return path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1)); | |
} | |
/** | |
* 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 = copyArray(array); | |
while (length--) { | |
var index = indexes[length]; | |
array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined; | |
} | |
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://bugs.chromium.org/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 simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout). | |
* | |
* @private | |
* @param {Function} func The function to delay. | |
* @param {number} wait The number of milliseconds to delay invocation. | |
* @returns {number|Object} Returns the timer id or timeout object. | |
*/ | |
var setTimeout = ctxSetTimeout || function(func, wait) { | |
return root.setTimeout(func, wait); | |
}; | |
/** | |
* Sets the `toString` method of `wrapper` to mimic the source of `reference` | |
* with wrapper details in a comment at the top of the source body. | |
* | |
* @private | |
* @param {Function} wrapper The function to modify. | |
* @param {Function} reference The reference function. | |
* @param {number} bitmask The bitmask flags. See `createWrap` for more details. | |
* @returns {Function} Returns `wrapper`. | |
*/ | |
var setWrapToString = !defineProperty ? identity : function(wrapper, reference, bitmask) { | |
var source = (reference + ''); | |
return defineProperty(wrapper, 'toString', { | |
'configurable': true, | |
'enumerable': false, | |
'value': constant(insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask))) | |
}); | |
}; | |
/** | |
* Converts `string` to a property path array. | |
* | |
* @private | |
* @param {string} string The string to convert. | |
* @returns {Array} Returns the property path array. | |
*/ | |
var stringToPath = memoize(function(string) { | |
string = toString(string); | |
var result = []; | |
if (reLeadingDot.test(string)) { | |
result.push(''); | |
} | |
string.replace(rePropName, function(match, number, quote, string) { | |
result.push(quote ? string.replace(reEscapeChar, '$1') : (number || match)); | |
}); | |
return result; | |
}); | |
/** | |
* Converts `value` to a string key if it's not a string or symbol. | |
* | |
* @private | |
* @param {*} value The value to inspect. | |
* @returns {string|symbol} Returns the key. | |
*/ | |
function toKey(value) { | |
if (typeof value == 'string' || isSymbol(value)) { | |
return value; | |
} | |
var result = (value + ''); | |
return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result; | |
} | |
/** | |
* Converts `func` to its source code. | |
* | |
* @private | |
* @param {Function} func The function to process. | |
* @returns {string} Returns the source code. | |
*/ | |
function toSource(func) { | |
if (func != null) { | |
try { | |
return funcToString.call(func); | |
} catch (e) {} | |
try { | |
return (func + ''); | |
} catch (e) {} | |
} | |
return ''; | |
} | |
/** | |
* Updates wrapper `details` based on `bitmask` flags. | |
* | |
* @private | |
* @returns {Array} details The details to modify. | |
* @param {number} bitmask The bitmask flags. See `createWrap` for more details. | |
* @returns {Array} Returns `details`. | |
*/ | |
function updateWrapDetails(details, bitmask) { | |
arrayEach(wrapFlags, function(pair) { | |
var value = '_.' + pair[0]; | |
if ((bitmask & pair[1]) && !arrayIncludes(details, value)) { | |
details.push(value); | |
} | |
}); | |
return details.sort(); | |
} | |
/** | |
* Creates a clone of `wrapper`. | |
* | |
* @private | |
* @param {Object} wrapper The wrapper to clone. | |
* @returns {Object} Returns the cloned wrapper. | |
*/ | |
function wrapperClone(wrapper) { | |
if (wrapper instanceof LazyWrapper) { | |
return wrapper.clone(); | |
} | |
var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__); | |
result.__actions__ = copyArray(wrapper.__actions__); | |
result.__index__ = wrapper.__index__; | |
result.__values__ = wrapper.__values__; | |
return result; | |
} | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Creates an array of elements split into groups the length of `size`. | |
* If `array` can't be split evenly, the final chunk will be the remaining | |
* elements. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Array | |
* @param {Array} array The array to process. | |
* @param {number} [size=1] The length of each chunk | |
* @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. | |
* @returns {Array} Returns the new array of 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 === undefined)) { | |
size = 1; | |
} else { | |
size = nativeMax(toInteger(size), 0); | |
} | |
var length = array ? array.length : 0; | |
if (!length || size < 1) { | |
return []; | |
} | |
var index = 0, | |
resIndex = 0, | |
result = Array(nativeCeil(length / size)); | |
while (index < length) { | |
result[resIndex++] = baseSlice(array, index, (index += size)); | |
} | |
return result; | |
} | |
/** | |
* Creates an array with all falsey values removed. The values `false`, `null`, | |
* `0`, `""`, `undefined`, and `NaN` are falsey. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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 = 0, | |
result = []; | |
while (++index < length) { | |
var value = array[index]; | |
if (value) { | |
result[resIndex++] = value; | |
} | |
} | |
return result; | |
} | |
/** | |
* Creates a new array concatenating `array` with any additional arrays | |
* and/or values. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to concatenate. | |
* @param {...*} [values] The values to concatenate. | |
* @returns {Array} Returns the new concatenated array. | |
* @example | |
* | |
* var array = [1]; | |
* var other = _.concat(array, 2, [3], [[4]]); | |
* | |
* console.log(other); | |
* // => [1, 2, 3, [4]] | |
* | |
* console.log(array); | |
* // => [1] | |
*/ | |
function concat() { | |
var length = arguments.length, | |
args = Array(length ? length - 1 : 0), | |
array = arguments[0], | |
index = length; | |
while (index--) { | |
args[index - 1] = arguments[index]; | |
} | |
return length | |
? arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1)) | |
: []; | |
} | |
/** | |
* Creates an array of `array` values not included in the other given arrays | |
* using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) | |
* for equality comparisons. The order of result values is determined by the | |
* order they occur in the first array. | |
* | |
* **Note:** Unlike `_.pullAll`, this method returns a new array. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {...Array} [values] The values to exclude. | |
* @returns {Array} Returns the new array of filtered values. | |
* @see _.without, _.xor | |
* @example | |
* | |
* _.difference([2, 1], [2, 3]); | |
* // => [1] | |
*/ | |
var difference = baseRest(function(array, values) { | |
return isArrayLikeObject(array) | |
? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true)) | |
: []; | |
}); | |
/** | |
* This method is like `_.difference` except that it accepts `iteratee` which | |
* is invoked for each element of `array` and `values` to generate the criterion | |
* by which they're compared. Result values are chosen from the first array. | |
* The iteratee is invoked with one argument: (value). | |
* | |
* **Note:** Unlike `_.pullAllBy`, this method returns a new array. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {...Array} [values] The values to exclude. | |
* @param {Function} [iteratee=_.identity] The iteratee invoked per element. | |
* @returns {Array} Returns the new array of filtered values. | |
* @example | |
* | |
* _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor); | |
* // => [1.2] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x'); | |
* // => [{ 'x': 2 }] | |
*/ | |
var differenceBy = baseRest(function(array, values) { | |
var iteratee = last(values); | |
if (isArrayLikeObject(iteratee)) { | |
iteratee = undefined; | |
} | |
return isArrayLikeObject(array) | |
? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2)) | |
: []; | |
}); | |
/** | |
* This method is like `_.difference` except that it accepts `comparator` | |
* which is invoked to compare elements of `array` to `values`. Result values | |
* are chosen from the first array. The comparator is invoked with two arguments: | |
* (arrVal, othVal). | |
* | |
* **Note:** Unlike `_.pullAllWith`, this method returns a new array. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {...Array} [values] The values to exclude. | |
* @param {Function} [comparator] The comparator invoked per element. | |
* @returns {Array} Returns the new array of filtered values. | |
* @example | |
* | |
* var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; | |
* | |
* _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual); | |
* // => [{ 'x': 2, 'y': 1 }] | |
*/ | |
var differenceWith = baseRest(function(array, values) { | |
var comparator = last(values); | |
if (isArrayLikeObject(comparator)) { | |
comparator = undefined; | |
} | |
return isArrayLikeObject(array) | |
? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator) | |
: []; | |
}); | |
/** | |
* Creates a slice of `array` with `n` elements dropped from the beginning. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.5.0 | |
* @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 an iteratee for methods 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 []; | |
} | |
n = (guard || n === undefined) ? 1 : toInteger(n); | |
return baseSlice(array, n < 0 ? 0 : n, length); | |
} | |
/** | |
* Creates a slice of `array` with `n` elements dropped from the end. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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 an iteratee for methods 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 []; | |
} | |
n = (guard || n === undefined) ? 1 : toInteger(n); | |
n = length - n; | |
return baseSlice(array, 0, n < 0 ? 0 : n); | |
} | |
/** | |
* Creates a slice of `array` excluding elements dropped from the end. | |
* Elements are dropped until `predicate` returns falsey. The predicate is | |
* invoked with three arguments: (value, index, array). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Array | |
* @param {Array} array The array to query. | |
* @param {Function} [predicate=_.identity] The function invoked per iteration. | |
* @returns {Array} Returns the slice of `array`. | |
* @example | |
* | |
* var users = [ | |
* { 'user': 'barney', 'active': true }, | |
* { 'user': 'fred', 'active': false }, | |
* { 'user': 'pebbles', 'active': false } | |
* ]; | |
* | |
* _.dropRightWhile(users, function(o) { return !o.active; }); | |
* // => objects for ['barney'] | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.dropRightWhile(users, { 'user': 'pebbles', 'active': false }); | |
* // => objects for ['barney', 'fred'] | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.dropRightWhile(users, ['active', false]); | |
* // => objects for ['barney'] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.dropRightWhile(users, 'active'); | |
* // => objects for ['barney', 'fred', 'pebbles'] | |
*/ | |
function dropRightWhile(array, predicate) { | |
return (array && array.length) | |
? baseWhile(array, getIteratee(predicate, 3), true, true) | |
: []; | |
} | |
/** | |
* Creates a slice of `array` excluding elements dropped from the beginning. | |
* Elements are dropped until `predicate` returns falsey. The predicate is | |
* invoked with three arguments: (value, index, array). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Array | |
* @param {Array} array The array to query. | |
* @param {Function} [predicate=_.identity] | |
* The function invoked per iteration. | |
* @returns {Array} Returns the slice of `array`. | |
* @example | |
* | |
* var users = [ | |
* { 'user': 'barney', 'active': false }, | |
* { 'user': 'fred', 'active': false }, | |
* { 'user': 'pebbles', 'active': true } | |
* ]; | |
* | |
* _.dropWhile(users, function(o) { return !o.active; }); | |
* // => objects for ['pebbles'] | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.dropWhile(users, { 'user': 'barney', 'active': false }); | |
* // => objects for ['fred', 'pebbles'] | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.dropWhile(users, ['active', false]); | |
* // => objects for ['pebbles'] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.dropWhile(users, 'active'); | |
* // => objects for ['barney', 'fred', 'pebbles'] | |
*/ | |
function dropWhile(array, predicate) { | |
return (array && array.length) | |
? baseWhile(array, getIteratee(predicate, 3), true) | |
: []; | |
} | |
/** | |
* Fills elements of `array` with `value` from `start` up to, but not | |
* including, `end`. | |
* | |
* **Note:** This method mutates `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.2.0 | |
* @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, 10], '*', 1, 3); | |
* // => [4, '*', '*', 10] | |
*/ | |
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. | |
* | |
* @static | |
* @memberOf _ | |
* @since 1.1.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {Function} [predicate=_.identity] | |
* The function invoked per iteration. | |
* @param {number} [fromIndex=0] The index to search from. | |
* @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(o) { return o.user == 'barney'; }); | |
* // => 0 | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.findIndex(users, { 'user': 'fred', 'active': false }); | |
* // => 1 | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.findIndex(users, ['active', false]); | |
* // => 0 | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.findIndex(users, 'active'); | |
* // => 2 | |
*/ | |
function findIndex(array, predicate, fromIndex) { | |
var length = array ? array.length : 0; | |
if (!length) { | |
return -1; | |
} | |
var index = fromIndex == null ? 0 : toInteger(fromIndex); | |
if (index < 0) { | |
index = nativeMax(length + index, 0); | |
} | |
return baseFindIndex(array, getIteratee(predicate, 3), index); | |
} | |
/** | |
* This method is like `_.findIndex` except that it iterates over elements | |
* of `collection` from right to left. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.0.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {Function} [predicate=_.identity] | |
* The function invoked per iteration. | |
* @param {number} [fromIndex=array.length-1] The index to search from. | |
* @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(o) { return o.user == 'pebbles'; }); | |
* // => 2 | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.findLastIndex(users, { 'user': 'barney', 'active': true }); | |
* // => 0 | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.findLastIndex(users, ['active', false]); | |
* // => 2 | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.findLastIndex(users, 'active'); | |
* // => 0 | |
*/ | |
function findLastIndex(array, predicate, fromIndex) { | |
var length = array ? array.length : 0; | |
if (!length) { | |
return -1; | |
} | |
var index = length - 1; | |
if (fromIndex !== undefined) { | |
index = toInteger(fromIndex); | |
index = fromIndex < 0 | |
? nativeMax(length + index, 0) | |
: nativeMin(index, length - 1); | |
} | |
return baseFindIndex(array, getIteratee(predicate, 3), index, true); | |
} | |
/** | |
* Flattens `array` a single level deep. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Array | |
* @param {Array} array The array to flatten. | |
* @returns {Array} Returns the new flattened array. | |
* @example | |
* | |
* _.flatten([1, [2, [3, [4]], 5]]); | |
* // => [1, 2, [3, [4]], 5] | |
*/ | |
function flatten(array) { | |
var length = array ? array.length : 0; | |
return length ? baseFlatten(array, 1) : []; | |
} | |
/** | |
* Recursively flattens `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Array | |
* @param {Array} array The array to flatten. | |
* @returns {Array} Returns the new flattened array. | |
* @example | |
* | |
* _.flattenDeep([1, [2, [3, [4]], 5]]); | |
* // => [1, 2, 3, 4, 5] | |
*/ | |
function flattenDeep(array) { | |
var length = array ? array.length : 0; | |
return length ? baseFlatten(array, INFINITY) : []; | |
} | |
/** | |
* Recursively flatten `array` up to `depth` times. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.4.0 | |
* @category Array | |
* @param {Array} array The array to flatten. | |
* @param {number} [depth=1] The maximum recursion depth. | |
* @returns {Array} Returns the new flattened array. | |
* @example | |
* | |
* var array = [1, [2, [3, [4]], 5]]; | |
* | |
* _.flattenDepth(array, 1); | |
* // => [1, 2, [3, [4]], 5] | |
* | |
* _.flattenDepth(array, 2); | |
* // => [1, 2, 3, [4], 5] | |
*/ | |
function flattenDepth(array, depth) { | |
var length = array ? array.length : 0; | |
if (!length) { | |
return []; | |
} | |
depth = depth === undefined ? 1 : toInteger(depth); | |
return baseFlatten(array, depth); | |
} | |
/** | |
* The inverse of `_.toPairs`; this method returns an object composed | |
* from key-value `pairs`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} pairs The key-value pairs. | |
* @returns {Object} Returns the new object. | |
* @example | |
* | |
* _.fromPairs([['a', 1], ['b', 2]]); | |
* // => { 'a': 1, 'b': 2 } | |
*/ | |
function fromPairs(pairs) { | |
var index = -1, | |
length = pairs ? pairs.length : 0, | |
result = {}; | |
while (++index < length) { | |
var pair = pairs[index]; | |
result[pair[0]] = pair[1]; | |
} | |
return result; | |
} | |
/** | |
* Gets the first element of `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @alias first | |
* @category Array | |
* @param {Array} array The array to query. | |
* @returns {*} Returns the first element of `array`. | |
* @example | |
* | |
* _.head([1, 2, 3]); | |
* // => 1 | |
* | |
* _.head([]); | |
* // => undefined | |
*/ | |
function head(array) { | |
return (array && array.length) ? array[0] : undefined; | |
} | |
/** | |
* Gets the index at which the first occurrence of `value` is found in `array` | |
* using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) | |
* for equality comparisons. If `fromIndex` is negative, it's used as the | |
* offset from the end of `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {*} value The value to search for. | |
* @param {number} [fromIndex=0] The index to search from. | |
* @returns {number} Returns the index of the matched value, else `-1`. | |
* @example | |
* | |
* _.indexOf([1, 2, 1, 2], 2); | |
* // => 1 | |
* | |
* // Search from the `fromIndex`. | |
* _.indexOf([1, 2, 1, 2], 2, 2); | |
* // => 3 | |
*/ | |
function indexOf(array, value, fromIndex) { | |
var length = array ? array.length : 0; | |
if (!length) { | |
return -1; | |
} | |
var index = fromIndex == null ? 0 : toInteger(fromIndex); | |
if (index < 0) { | |
index = nativeMax(length + index, 0); | |
} | |
return baseIndexOf(array, value, index); | |
} | |
/** | |
* Gets all but the last element of `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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) { | |
var length = array ? array.length : 0; | |
return length ? baseSlice(array, 0, -1) : []; | |
} | |
/** | |
* Creates an array of unique values that are included in all given arrays | |
* using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) | |
* for equality comparisons. The order of result values is determined by the | |
* order they occur in the first array. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Array | |
* @param {...Array} [arrays] The arrays to inspect. | |
* @returns {Array} Returns the new array of intersecting values. | |
* @example | |
* | |
* _.intersection([2, 1], [2, 3]); | |
* // => [2] | |
*/ | |
var intersection = baseRest(function(arrays) { | |
var mapped = arrayMap(arrays, castArrayLikeObject); | |
return (mapped.length && mapped[0] === arrays[0]) | |
? baseIntersection(mapped) | |
: []; | |
}); | |
/** | |
* This method is like `_.intersection` except that it accepts `iteratee` | |
* which is invoked for each element of each `arrays` to generate the criterion | |
* by which they're compared. Result values are chosen from the first array. | |
* The iteratee is invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {...Array} [arrays] The arrays to inspect. | |
* @param {Function} [iteratee=_.identity] The iteratee invoked per element. | |
* @returns {Array} Returns the new array of intersecting values. | |
* @example | |
* | |
* _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor); | |
* // => [2.1] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x'); | |
* // => [{ 'x': 1 }] | |
*/ | |
var intersectionBy = baseRest(function(arrays) { | |
var iteratee = last(arrays), | |
mapped = arrayMap(arrays, castArrayLikeObject); | |
if (iteratee === last(mapped)) { | |
iteratee = undefined; | |
} else { | |
mapped.pop(); | |
} | |
return (mapped.length && mapped[0] === arrays[0]) | |
? baseIntersection(mapped, getIteratee(iteratee, 2)) | |
: []; | |
}); | |
/** | |
* This method is like `_.intersection` except that it accepts `comparator` | |
* which is invoked to compare elements of `arrays`. Result values are chosen | |
* from the first array. The comparator is invoked with two arguments: | |
* (arrVal, othVal). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {...Array} [arrays] The arrays to inspect. | |
* @param {Function} [comparator] The comparator invoked per element. | |
* @returns {Array} Returns the new array of intersecting values. | |
* @example | |
* | |
* var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; | |
* var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }]; | |
* | |
* _.intersectionWith(objects, others, _.isEqual); | |
* // => [{ 'x': 1, 'y': 2 }] | |
*/ | |
var intersectionWith = baseRest(function(arrays) { | |
var comparator = last(arrays), | |
mapped = arrayMap(arrays, castArrayLikeObject); | |
if (comparator === last(mapped)) { | |
comparator = undefined; | |
} else { | |
mapped.pop(); | |
} | |
return (mapped.length && mapped[0] === arrays[0]) | |
? baseIntersection(mapped, undefined, comparator) | |
: []; | |
}); | |
/** | |
* Converts all elements in `array` into a string separated by `separator`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to convert. | |
* @param {string} [separator=','] The element separator. | |
* @returns {string} Returns the joined string. | |
* @example | |
* | |
* _.join(['a', 'b', 'c'], '~'); | |
* // => 'a~b~c' | |
*/ | |
function join(array, separator) { | |
return array ? nativeJoin.call(array, separator) : ''; | |
} | |
/** | |
* Gets the last element of `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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 _ | |
* @since 0.1.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {*} value The value to search for. | |
* @param {number} [fromIndex=array.length-1] The index to search from. | |
* @returns {number} Returns the index of the matched value, else `-1`. | |
* @example | |
* | |
* _.lastIndexOf([1, 2, 1, 2], 2); | |
* // => 3 | |
* | |
* // Search from the `fromIndex`. | |
* _.lastIndexOf([1, 2, 1, 2], 2, 2); | |
* // => 1 | |
*/ | |
function lastIndexOf(array, value, fromIndex) { | |
var length = array ? array.length : 0; | |
if (!length) { | |
return -1; | |
} | |
var index = length; | |
if (fromIndex !== undefined) { | |
index = toInteger(fromIndex); | |
index = ( | |
index < 0 | |
? nativeMax(length + index, 0) | |
: nativeMin(index, length - 1) | |
) + 1; | |
} | |
if (value !== value) { | |
return baseFindIndex(array, baseIsNaN, index - 1, true); | |
} | |
while (index--) { | |
if (array[index] === value) { | |
return index; | |
} | |
} | |
return -1; | |
} | |
/** | |
* Gets the element at index `n` of `array`. If `n` is negative, the nth | |
* element from the end is returned. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.11.0 | |
* @category Array | |
* @param {Array} array The array to query. | |
* @param {number} [n=0] The index of the element to return. | |
* @returns {*} Returns the nth element of `array`. | |
* @example | |
* | |
* var array = ['a', 'b', 'c', 'd']; | |
* | |
* _.nth(array, 1); | |
* // => 'b' | |
* | |
* _.nth(array, -2); | |
* // => 'c'; | |
*/ | |
function nth(array, n) { | |
return (array && array.length) ? baseNth(array, toInteger(n)) : undefined; | |
} | |
/** | |
* Removes all given values from `array` using | |
* [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) | |
* for equality comparisons. | |
* | |
* **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove` | |
* to remove elements from an array by predicate. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.0.0 | |
* @category Array | |
* @param {Array} array The array to modify. | |
* @param {...*} [values] The values to remove. | |
* @returns {Array} Returns `array`. | |
* @example | |
* | |
* var array = ['a', 'b', 'c', 'a', 'b', 'c']; | |
* | |
* _.pull(array, 'a', 'c'); | |
* console.log(array); | |
* // => ['b', 'b'] | |
*/ | |
var pull = baseRest(pullAll); | |
/** | |
* This method is like `_.pull` except that it accepts an array of values to remove. | |
* | |
* **Note:** Unlike `_.difference`, this method mutates `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to modify. | |
* @param {Array} values The values to remove. | |
* @returns {Array} Returns `array`. | |
* @example | |
* | |
* var array = ['a', 'b', 'c', 'a', 'b', 'c']; | |
* | |
* _.pullAll(array, ['a', 'c']); | |
* console.log(array); | |
* // => ['b', 'b'] | |
*/ | |
function pullAll(array, values) { | |
return (array && array.length && values && values.length) | |
? basePullAll(array, values) | |
: array; | |
} | |
/** | |
* This method is like `_.pullAll` except that it accepts `iteratee` which is | |
* invoked for each element of `array` and `values` to generate the criterion | |
* by which they're compared. The iteratee is invoked with one argument: (value). | |
* | |
* **Note:** Unlike `_.differenceBy`, this method mutates `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to modify. | |
* @param {Array} values The values to remove. | |
* @param {Function} [iteratee=_.identity] | |
* The iteratee invoked per element. | |
* @returns {Array} Returns `array`. | |
* @example | |
* | |
* var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }]; | |
* | |
* _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x'); | |
* console.log(array); | |
* // => [{ 'x': 2 }] | |
*/ | |
function pullAllBy(array, values, iteratee) { | |
return (array && array.length && values && values.length) | |
? basePullAll(array, values, getIteratee(iteratee, 2)) | |
: array; | |
} | |
/** | |
* This method is like `_.pullAll` except that it accepts `comparator` which | |
* is invoked to compare elements of `array` to `values`. The comparator is | |
* invoked with two arguments: (arrVal, othVal). | |
* | |
* **Note:** Unlike `_.differenceWith`, this method mutates `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.6.0 | |
* @category Array | |
* @param {Array} array The array to modify. | |
* @param {Array} values The values to remove. | |
* @param {Function} [comparator] The comparator invoked per element. | |
* @returns {Array} Returns `array`. | |
* @example | |
* | |
* var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }]; | |
* | |
* _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual); | |
* console.log(array); | |
* // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }] | |
*/ | |
function pullAllWith(array, values, comparator) { | |
return (array && array.length && values && values.length) | |
? basePullAll(array, values, undefined, comparator) | |
: array; | |
} | |
/** | |
* Removes elements from `array` corresponding to `indexes` and returns an | |
* array of removed elements. | |
* | |
* **Note:** Unlike `_.at`, this method mutates `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Array | |
* @param {Array} array The array to modify. | |
* @param {...(number|number[])} [indexes] The indexes of elements to remove. | |
* @returns {Array} Returns the new array of removed elements. | |
* @example | |
* | |
* var array = ['a', 'b', 'c', 'd']; | |
* var pulled = _.pullAt(array, [1, 3]); | |
* | |
* console.log(array); | |
* // => ['a', 'c'] | |
* | |
* console.log(pulled); | |
* // => ['b', 'd'] | |
*/ | |
var pullAt = baseRest(function(array, indexes) { | |
indexes = baseFlatten(indexes, 1); | |
var length = array ? array.length : 0, | |
result = baseAt(array, indexes); | |
basePullAt(array, arrayMap(indexes, function(index) { | |
return isIndex(index, length) ? +index : index; | |
}).sort(compareAscending)); | |
return result; | |
}); | |
/** | |
* Removes all elements from `array` that `predicate` returns truthy for | |
* and returns an array of the removed elements. The predicate is invoked | |
* with three arguments: (value, index, array). | |
* | |
* **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull` | |
* to pull elements from an array by value. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.0.0 | |
* @category Array | |
* @param {Array} array The array to modify. | |
* @param {Function} [predicate=_.identity] | |
* The function invoked per iteration. | |
* @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) { | |
var result = []; | |
if (!(array && array.length)) { | |
return result; | |
} | |
var index = -1, | |
indexes = [], | |
length = array.length; | |
predicate = getIteratee(predicate, 3); | |
while (++index < length) { | |
var value = array[index]; | |
if (predicate(value, index, array)) { | |
result.push(value); | |
indexes.push(index); | |
} | |
} | |
basePullAt(array, indexes); | |
return result; | |
} | |
/** | |
* Reverses `array` so that the first element becomes the last, the second | |
* element becomes the second to last, and so on. | |
* | |
* **Note:** This method mutates `array` and is based on | |
* [`Array#reverse`](https://mdn.io/Array/reverse). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to modify. | |
* @returns {Array} Returns `array`. | |
* @example | |
* | |
* var array = [1, 2, 3]; | |
* | |
* _.reverse(array); | |
* // => [3, 2, 1] | |
* | |
* console.log(array); | |
* // => [3, 2, 1] | |
*/ | |
function reverse(array) { | |
return array ? nativeReverse.call(array) : array; | |
} | |
/** | |
* Creates a slice of `array` from `start` up to, but not including, `end`. | |
* | |
* **Note:** This method is used instead of | |
* [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are | |
* returned. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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; | |
} | |
else { | |
start = start == null ? 0 : toInteger(start); | |
end = end === undefined ? length : toInteger(end); | |
} | |
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. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Array | |
* @param {Array} array The sorted array to inspect. | |
* @param {*} value The value to evaluate. | |
* @returns {number} Returns the index at which `value` should be inserted | |
* into `array`. | |
* @example | |
* | |
* _.sortedIndex([30, 50], 40); | |
* // => 1 | |
*/ | |
function sortedIndex(array, value) { | |
return baseSortedIndex(array, value); | |
} | |
/** | |
* This method is like `_.sortedIndex` except that it accepts `iteratee` | |
* which is invoked for `value` and each element of `array` to compute their | |
* sort ranking. The iteratee is invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The sorted array to inspect. | |
* @param {*} value The value to evaluate. | |
* @param {Function} [iteratee=_.identity] | |
* The iteratee invoked per element. | |
* @returns {number} Returns the index at which `value` should be inserted | |
* into `array`. | |
* @example | |
* | |
* var objects = [{ 'x': 4 }, { 'x': 5 }]; | |
* | |
* _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; }); | |
* // => 0 | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.sortedIndexBy(objects, { 'x': 4 }, 'x'); | |
* // => 0 | |
*/ | |
function sortedIndexBy(array, value, iteratee) { | |
return baseSortedIndexBy(array, value, getIteratee(iteratee, 2)); | |
} | |
/** | |
* This method is like `_.indexOf` except that it performs a binary | |
* search on a sorted `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {*} value The value to search for. | |
* @returns {number} Returns the index of the matched value, else `-1`. | |
* @example | |
* | |
* _.sortedIndexOf([4, 5, 5, 5, 6], 5); | |
* // => 1 | |
*/ | |
function sortedIndexOf(array, value) { | |
var length = array ? array.length : 0; | |
if (length) { | |
var index = baseSortedIndex(array, value); | |
if (index < length && eq(array[index], value)) { | |
return index; | |
} | |
} | |
return -1; | |
} | |
/** | |
* 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 _ | |
* @since 3.0.0 | |
* @category Array | |
* @param {Array} array The sorted array to inspect. | |
* @param {*} value The value to evaluate. | |
* @returns {number} Returns the index at which `value` should be inserted | |
* into `array`. | |
* @example | |
* | |
* _.sortedLastIndex([4, 5, 5, 5, 6], 5); | |
* // => 4 | |
*/ | |
function sortedLastIndex(array, value) { | |
return baseSortedIndex(array, value, true); | |
} | |
/** | |
* This method is like `_.sortedLastIndex` except that it accepts `iteratee` | |
* which is invoked for `value` and each element of `array` to compute their | |
* sort ranking. The iteratee is invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The sorted array to inspect. | |
* @param {*} value The value to evaluate. | |
* @param {Function} [iteratee=_.identity] | |
* The iteratee invoked per element. | |
* @returns {number} Returns the index at which `value` should be inserted | |
* into `array`. | |
* @example | |
* | |
* var objects = [{ 'x': 4 }, { 'x': 5 }]; | |
* | |
* _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; }); | |
* // => 1 | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.sortedLastIndexBy(objects, { 'x': 4 }, 'x'); | |
* // => 1 | |
*/ | |
function sortedLastIndexBy(array, value, iteratee) { | |
return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true); | |
} | |
/** | |
* This method is like `_.lastIndexOf` except that it performs a binary | |
* search on a sorted `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {*} value The value to search for. | |
* @returns {number} Returns the index of the matched value, else `-1`. | |
* @example | |
* | |
* _.sortedLastIndexOf([4, 5, 5, 5, 6], 5); | |
* // => 3 | |
*/ | |
function sortedLastIndexOf(array, value) { | |
var length = array ? array.length : 0; | |
if (length) { | |
var index = baseSortedIndex(array, value, true) - 1; | |
if (eq(array[index], value)) { | |
return index; | |
} | |
} | |
return -1; | |
} | |
/** | |
* This method is like `_.uniq` except that it's designed and optimized | |
* for sorted arrays. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @returns {Array} Returns the new duplicate free array. | |
* @example | |
* | |
* _.sortedUniq([1, 1, 2]); | |
* // => [1, 2] | |
*/ | |
function sortedUniq(array) { | |
return (array && array.length) | |
? baseSortedUniq(array) | |
: []; | |
} | |
/** | |
* This method is like `_.uniqBy` except that it's designed and optimized | |
* for sorted arrays. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {Function} [iteratee] The iteratee invoked per element. | |
* @returns {Array} Returns the new duplicate free array. | |
* @example | |
* | |
* _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor); | |
* // => [1.1, 2.3] | |
*/ | |
function sortedUniqBy(array, iteratee) { | |
return (array && array.length) | |
? baseSortedUniq(array, getIteratee(iteratee, 2)) | |
: []; | |
} | |
/** | |
* Gets all but the first element of `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to query. | |
* @returns {Array} Returns the slice of `array`. | |
* @example | |
* | |
* _.tail([1, 2, 3]); | |
* // => [2, 3] | |
*/ | |
function tail(array) { | |
var length = array ? array.length : 0; | |
return length ? baseSlice(array, 1, length) : []; | |
} | |
/** | |
* Creates a slice of `array` with `n` elements taken from the beginning. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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 an iteratee for methods 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) { | |
if (!(array && array.length)) { | |
return []; | |
} | |
n = (guard || n === undefined) ? 1 : toInteger(n); | |
return baseSlice(array, 0, n < 0 ? 0 : n); | |
} | |
/** | |
* Creates a slice of `array` with `n` elements taken from the end. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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 an iteratee for methods 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 []; | |
} | |
n = (guard || n === undefined) ? 1 : toInteger(n); | |
n = length - n; | |
return baseSlice(array, n < 0 ? 0 : n, length); | |
} | |
/** | |
* Creates a slice of `array` with elements taken from the end. Elements are | |
* taken until `predicate` returns falsey. The predicate is invoked with | |
* three arguments: (value, index, array). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Array | |
* @param {Array} array The array to query. | |
* @param {Function} [predicate=_.identity] | |
* The function invoked per iteration. | |
* @returns {Array} Returns the slice of `array`. | |
* @example | |
* | |
* var users = [ | |
* { 'user': 'barney', 'active': true }, | |
* { 'user': 'fred', 'active': false }, | |
* { 'user': 'pebbles', 'active': false } | |
* ]; | |
* | |
* _.takeRightWhile(users, function(o) { return !o.active; }); | |
* // => objects for ['fred', 'pebbles'] | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.takeRightWhile(users, { 'user': 'pebbles', 'active': false }); | |
* // => objects for ['pebbles'] | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.takeRightWhile(users, ['active', false]); | |
* // => objects for ['fred', 'pebbles'] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.takeRightWhile(users, 'active'); | |
* // => [] | |
*/ | |
function takeRightWhile(array, predicate) { | |
return (array && array.length) | |
? baseWhile(array, getIteratee(predicate, 3), false, true) | |
: []; | |
} | |
/** | |
* Creates a slice of `array` with elements taken from the beginning. Elements | |
* are taken until `predicate` returns falsey. The predicate is invoked with | |
* three arguments: (value, index, array). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Array | |
* @param {Array} array The array to query. | |
* @param {Function} [predicate=_.identity] | |
* The function invoked per iteration. | |
* @returns {Array} Returns the slice of `array`. | |
* @example | |
* | |
* var users = [ | |
* { 'user': 'barney', 'active': false }, | |
* { 'user': 'fred', 'active': false}, | |
* { 'user': 'pebbles', 'active': true } | |
* ]; | |
* | |
* _.takeWhile(users, function(o) { return !o.active; }); | |
* // => objects for ['barney', 'fred'] | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.takeWhile(users, { 'user': 'barney', 'active': false }); | |
* // => objects for ['barney'] | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.takeWhile(users, ['active', false]); | |
* // => objects for ['barney', 'fred'] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.takeWhile(users, 'active'); | |
* // => [] | |
*/ | |
function takeWhile(array, predicate) { | |
return (array && array.length) | |
? baseWhile(array, getIteratee(predicate, 3)) | |
: []; | |
} | |
/** | |
* Creates an array of unique values, in order, from all given arrays using | |
* [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) | |
* for equality comparisons. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Array | |
* @param {...Array} [arrays] The arrays to inspect. | |
* @returns {Array} Returns the new array of combined values. | |
* @example | |
* | |
* _.union([2], [1, 2]); | |
* // => [2, 1] | |
*/ | |
var union = baseRest(function(arrays) { | |
return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true)); | |
}); | |
/** | |
* This method is like `_.union` except that it accepts `iteratee` which is | |
* invoked for each element of each `arrays` to generate the criterion by | |
* which uniqueness is computed. Result values are chosen from the first | |
* array in which the value occurs. The iteratee is invoked with one argument: | |
* (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {...Array} [arrays] The arrays to inspect. | |
* @param {Function} [iteratee=_.identity] | |
* The iteratee invoked per element. | |
* @returns {Array} Returns the new array of combined values. | |
* @example | |
* | |
* _.unionBy([2.1], [1.2, 2.3], Math.floor); | |
* // => [2.1, 1.2] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x'); | |
* // => [{ 'x': 1 }, { 'x': 2 }] | |
*/ | |
var unionBy = baseRest(function(arrays) { | |
var iteratee = last(arrays); | |
if (isArrayLikeObject(iteratee)) { | |
iteratee = undefined; | |
} | |
return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2)); | |
}); | |
/** | |
* This method is like `_.union` except that it accepts `comparator` which | |
* is invoked to compare elements of `arrays`. Result values are chosen from | |
* the first array in which the value occurs. The comparator is invoked | |
* with two arguments: (arrVal, othVal). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {...Array} [arrays] The arrays to inspect. | |
* @param {Function} [comparator] The comparator invoked per element. | |
* @returns {Array} Returns the new array of combined values. | |
* @example | |
* | |
* var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; | |
* var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }]; | |
* | |
* _.unionWith(objects, others, _.isEqual); | |
* // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }] | |
*/ | |
var unionWith = baseRest(function(arrays) { | |
var comparator = last(arrays); | |
if (isArrayLikeObject(comparator)) { | |
comparator = undefined; | |
} | |
return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator); | |
}); | |
/** | |
* Creates a duplicate-free version of an array, using | |
* [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) | |
* for equality comparisons, in which only the first occurrence of each | |
* element is kept. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @returns {Array} Returns the new duplicate free array. | |
* @example | |
* | |
* _.uniq([2, 1, 2]); | |
* // => [2, 1] | |
*/ | |
function uniq(array) { | |
return (array && array.length) | |
? baseUniq(array) | |
: []; | |
} | |
/** | |
* This method is like `_.uniq` except that it accepts `iteratee` which is | |
* invoked for each element in `array` to generate the criterion by which | |
* uniqueness is computed. The iteratee is invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {Function} [iteratee=_.identity] | |
* The iteratee invoked per element. | |
* @returns {Array} Returns the new duplicate free array. | |
* @example | |
* | |
* _.uniqBy([2.1, 1.2, 2.3], Math.floor); | |
* // => [2.1, 1.2] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x'); | |
* // => [{ 'x': 1 }, { 'x': 2 }] | |
*/ | |
function uniqBy(array, iteratee) { | |
return (array && array.length) | |
? baseUniq(array, getIteratee(iteratee, 2)) | |
: []; | |
} | |
/** | |
* This method is like `_.uniq` except that it accepts `comparator` which | |
* is invoked to compare elements of `array`. The comparator is invoked with | |
* two arguments: (arrVal, othVal). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {Function} [comparator] The comparator invoked per element. | |
* @returns {Array} Returns the new duplicate free array. | |
* @example | |
* | |
* var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }]; | |
* | |
* _.uniqWith(objects, _.isEqual); | |
* // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }] | |
*/ | |
function uniqWith(array, comparator) { | |
return (array && array.length) | |
? baseUniq(array, undefined, comparator) | |
: []; | |
} | |
/** | |
* 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 _ | |
* @since 1.2.0 | |
* @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(['a', 'b'], [1, 2], [true, false]); | |
* // => [['a', 1, true], ['b', 2, false]] | |
* | |
* _.unzip(zipped); | |
* // => [['a', 'b'], [1, 2], [true, false]] | |
*/ | |
function unzip(array) { | |
if (!(array && array.length)) { | |
return []; | |
} | |
var length = 0; | |
array = arrayFilter(array, function(group) { | |
if (isArrayLikeObject(group)) { | |
length = nativeMax(group.length, length); | |
return true; | |
} | |
}); | |
return baseTimes(length, function(index) { | |
return arrayMap(array, baseProperty(index)); | |
}); | |
} | |
/** | |
* This method is like `_.unzip` except that it accepts `iteratee` to specify | |
* how regrouped values should be combined. The iteratee is invoked with the | |
* elements of each group: (...group). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.8.0 | |
* @category Array | |
* @param {Array} array The array of grouped elements to process. | |
* @param {Function} [iteratee=_.identity] The function to combine | |
* regrouped values. | |
* @returns {Array} Returns the new array of regrouped elements. | |
* @example | |
* | |
* var zipped = _.zip([1, 2], [10, 20], [100, 200]); | |
* // => [[1, 10, 100], [2, 20, 200]] | |
* | |
* _.unzipWith(zipped, _.add); | |
* // => [3, 30, 300] | |
*/ | |
function unzipWith(array, iteratee) { | |
if (!(array && array.length)) { | |
return []; | |
} | |
var result = unzip(array); | |
if (iteratee == null) { | |
return result; | |
} | |
return arrayMap(result, function(group) { | |
return apply(iteratee, undefined, group); | |
}); | |
} | |
/** | |
* Creates an array excluding all given values using | |
* [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) | |
* for equality comparisons. | |
* | |
* **Note:** Unlike `_.pull`, this method returns a new array. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Array | |
* @param {Array} array The array to inspect. | |
* @param {...*} [values] The values to exclude. | |
* @returns {Array} Returns the new array of filtered values. | |
* @see _.difference, _.xor | |
* @example | |
* | |
* _.without([2, 1, 2, 3], 1, 2); | |
* // => [3] | |
*/ | |
var without = baseRest(function(array, values) { | |
return isArrayLikeObject(array) | |
? baseDifference(array, values) | |
: []; | |
}); | |
/** | |
* Creates an array of unique values that is the | |
* [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference) | |
* of the given arrays. The order of result values is determined by the order | |
* they occur in the arrays. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.4.0 | |
* @category Array | |
* @param {...Array} [arrays] The arrays to inspect. | |
* @returns {Array} Returns the new array of filtered values. | |
* @see _.difference, _.without | |
* @example | |
* | |
* _.xor([2, 1], [2, 3]); | |
* // => [1, 3] | |
*/ | |
var xor = baseRest(function(arrays) { | |
return baseXor(arrayFilter(arrays, isArrayLikeObject)); | |
}); | |
/** | |
* This method is like `_.xor` except that it accepts `iteratee` which is | |
* invoked for each element of each `arrays` to generate the criterion by | |
* which by which they're compared. The iteratee is invoked with one argument: | |
* (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {...Array} [arrays] The arrays to inspect. | |
* @param {Function} [iteratee=_.identity] | |
* The iteratee invoked per element. | |
* @returns {Array} Returns the new array of filtered values. | |
* @example | |
* | |
* _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor); | |
* // => [1.2, 3.4] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x'); | |
* // => [{ 'x': 2 }] | |
*/ | |
var xorBy = baseRest(function(arrays) { | |
var iteratee = last(arrays); | |
if (isArrayLikeObject(iteratee)) { | |
iteratee = undefined; | |
} | |
return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2)); | |
}); | |
/** | |
* This method is like `_.xor` except that it accepts `comparator` which is | |
* invoked to compare elements of `arrays`. The comparator is invoked with | |
* two arguments: (arrVal, othVal). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Array | |
* @param {...Array} [arrays] The arrays to inspect. | |
* @param {Function} [comparator] The comparator invoked per element. | |
* @returns {Array} Returns the new array of filtered values. | |
* @example | |
* | |
* var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; | |
* var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }]; | |
* | |
* _.xorWith(objects, others, _.isEqual); | |
* // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }] | |
*/ | |
var xorWith = baseRest(function(arrays) { | |
var comparator = last(arrays); | |
if (isArrayLikeObject(comparator)) { | |
comparator = undefined; | |
} | |
return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator); | |
}); | |
/** | |
* 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 _ | |
* @since 0.1.0 | |
* @category Array | |
* @param {...Array} [arrays] The arrays to process. | |
* @returns {Array} Returns the new array of grouped elements. | |
* @example | |
* | |
* _.zip(['a', 'b'], [1, 2], [true, false]); | |
* // => [['a', 1, true], ['b', 2, false]] | |
*/ | |
var zip = baseRest(unzip); | |
/** | |
* This method is like `_.fromPairs` except that it accepts two arrays, | |
* one of property identifiers and one of corresponding values. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.4.0 | |
* @category Array | |
* @param {Array} [props=[]] The property identifiers. | |
* @param {Array} [values=[]] The property values. | |
* @returns {Object} Returns the new object. | |
* @example | |
* | |
* _.zipObject(['a', 'b'], [1, 2]); | |
* // => { 'a': 1, 'b': 2 } | |
*/ | |
function zipObject(props, values) { | |
return baseZipObject(props || [], values || [], assignValue); | |
} | |
/** | |
* This method is like `_.zipObject` except that it supports property paths. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.1.0 | |
* @category Array | |
* @param {Array} [props=[]] The property identifiers. | |
* @param {Array} [values=[]] The property values. | |
* @returns {Object} Returns the new object. | |
* @example | |
* | |
* _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]); | |
* // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } } | |
*/ | |
function zipObjectDeep(props, values) { | |
return baseZipObject(props || [], values || [], baseSet); | |
} | |
/** | |
* This method is like `_.zip` except that it accepts `iteratee` to specify | |
* how grouped values should be combined. The iteratee is invoked with the | |
* elements of each group: (...group). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.8.0 | |
* @category Array | |
* @param {...Array} [arrays] The arrays to process. | |
* @param {Function} [iteratee=_.identity] The function to combine grouped values. | |
* @returns {Array} Returns the new array of grouped elements. | |
* @example | |
* | |
* _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) { | |
* return a + b + c; | |
* }); | |
* // => [111, 222] | |
*/ | |
var zipWith = baseRest(function(arrays) { | |
var length = arrays.length, | |
iteratee = length > 1 ? arrays[length - 1] : undefined; | |
iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined; | |
return unzipWith(arrays, iteratee); | |
}); | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Creates a `lodash` wrapper instance that wraps `value` with explicit method | |
* chain sequences enabled. The result of such sequences must be unwrapped | |
* with `_#value`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 1.3.0 | |
* @category Seq | |
* @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(o) { | |
* return o.user + ' is ' + o.age; | |
* }) | |
* .head() | |
* .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 invoked with one argument; (value). The purpose of this method is to | |
* "tap into" a method chain sequence in order to modify intermediate results. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Seq | |
* @param {*} value The value to provide to `interceptor`. | |
* @param {Function} interceptor The function to invoke. | |
* @returns {*} Returns `value`. | |
* @example | |
* | |
* _([1, 2, 3]) | |
* .tap(function(array) { | |
* // Mutate input array. | |
* array.pop(); | |
* }) | |
* .reverse() | |
* .value(); | |
* // => [2, 1] | |
*/ | |
function tap(value, interceptor) { | |
interceptor(value); | |
return value; | |
} | |
/** | |
* This method is like `_.tap` except that it returns the result of `interceptor`. | |
* The purpose of this method is to "pass thru" values replacing intermediate | |
* results in a method chain sequence. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Seq | |
* @param {*} value The value to provide to `interceptor`. | |
* @param {Function} interceptor The function to invoke. | |
* @returns {*} Returns the result of `interceptor`. | |
* @example | |
* | |
* _(' abc ') | |
* .chain() | |
* .trim() | |
* .thru(function(value) { | |
* return [value]; | |
* }) | |
* .value(); | |
* // => ['abc'] | |
*/ | |
function thru(value, interceptor) { | |
return interceptor(value); | |
} | |
/** | |
* This method is the wrapper version of `_.at`. | |
* | |
* @name at | |
* @memberOf _ | |
* @since 1.0.0 | |
* @category Seq | |
* @param {...(string|string[])} [paths] The property paths of elements to pick. | |
* @returns {Object} Returns the new `lodash` wrapper instance. | |
* @example | |
* | |
* var object = { 'a': [{ 'b': { 'c': 3 } }, 4] }; | |
* | |
* _(object).at(['a[0].b.c', 'a[1]']).value(); | |
* // => [3, 4] | |
*/ | |
var wrapperAt = baseRest(function(paths) { | |
paths = baseFlatten(paths, 1); | |
var length = paths.length, | |
start = length ? paths[0] : 0, | |
value = this.__wrapped__, | |
interceptor = function(object) { return baseAt(object, paths); }; | |
if (length > 1 || this.__actions__.length || | |
!(value instanceof LazyWrapper) || !isIndex(start)) { | |
return this.thru(interceptor); | |
} | |
value = value.slice(start, +start + (length ? 1 : 0)); | |
value.__actions__.push({ | |
'func': thru, | |
'args': [interceptor], | |
'thisArg': undefined | |
}); | |
return new LodashWrapper(value, this.__chain__).thru(function(array) { | |
if (length && !array.length) { | |
array.push(undefined); | |
} | |
return array; | |
}); | |
}); | |
/** | |
* Creates a `lodash` wrapper instance with explicit method chain sequences enabled. | |
* | |
* @name chain | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Seq | |
* @returns {Object} Returns the new `lodash` wrapper instance. | |
* @example | |
* | |
* var users = [ | |
* { 'user': 'barney', 'age': 36 }, | |
* { 'user': 'fred', 'age': 40 } | |
* ]; | |
* | |
* // A sequence without explicit chaining. | |
* _(users).head(); | |
* // => { 'user': 'barney', 'age': 36 } | |
* | |
* // A sequence with explicit chaining. | |
* _(users) | |
* .chain() | |
* .head() | |
* .pick('user') | |
* .value(); | |
* // => { 'user': 'barney' } | |
*/ | |
function wrapperChain() { | |
return chain(this); | |
} | |
/** | |
* Executes the chain sequence and returns the wrapped result. | |
* | |
* @name commit | |
* @memberOf _ | |
* @since 3.2.0 | |
* @category Seq | |
* @returns {Object} Returns the new `lodash` wrapper instance. | |
* @example | |
* | |
* var array = [1, 2]; | |
* var wrapped = _(array).push(3); | |
* | |
* console.log(array); | |
* // => [1, 2] | |
* | |
* wrapped = wrapped.commit(); | |
* console.log(array); | |
* // => [1, 2, 3] | |
* | |
* wrapped.last(); | |
* // => 3 | |
* | |
* console.log(array); | |
* // => [1, 2, 3] | |
*/ | |
function wrapperCommit() { | |
return new LodashWrapper(this.value(), this.__chain__); | |
} | |
/** | |
* Gets the next value on a wrapped object following the | |
* [iterator protocol](https://mdn.io/iteration_protocols#iterator). | |
* | |
* @name next | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Seq | |
* @returns {Object} Returns the next iterator value. | |
* @example | |
* | |
* var wrapped = _([1, 2]); | |
* | |
* wrapped.next(); | |
* // => { 'done': false, 'value': 1 } | |
* | |
* wrapped.next(); | |
* // => { 'done': false, 'value': 2 } | |
* | |
* wrapped.next(); | |
* // => { 'done': true, 'value': undefined } | |
*/ | |
function wrapperNext() { | |
if (this.__values__ === undefined) { | |
this.__values__ = toArray(this.value()); | |
} | |
var done = this.__index__ >= this.__values__.length, | |
value = done ? undefined : this.__values__[this.__index__++]; | |
return { 'done': done, 'value': value }; | |
} | |
/** | |
* Enables the wrapper to be iterable. | |
* | |
* @name Symbol.iterator | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Seq | |
* @returns {Object} Returns the wrapper object. | |
* @example | |
* | |
* var wrapped = _([1, 2]); | |
* | |
* wrapped[Symbol.iterator]() === wrapped; | |
* // => true | |
* | |
* Array.from(wrapped); | |
* // => [1, 2] | |
*/ | |
function wrapperToIterator() { | |
return this; | |
} | |
/** | |
* Creates a clone of the chain sequence planting `value` as the wrapped value. | |
* | |
* @name plant | |
* @memberOf _ | |
* @since 3.2.0 | |
* @category Seq | |
* @param {*} value The value to plant. | |
* @returns {Object} Returns the new `lodash` wrapper instance. | |
* @example | |
* | |
* function square(n) { | |
* return n * n; | |
* } | |
* | |
* var wrapped = _([1, 2]).map(square); | |
* var other = wrapped.plant([3, 4]); | |
* | |
* other.value(); | |
* // => [9, 16] | |
* | |
* wrapped.value(); | |
* // => [1, 4] | |
*/ | |
function wrapperPlant(value) { | |
var result, | |
parent = this; | |
while (parent instanceof baseLodash) { | |
var clone = wrapperClone(parent); | |
clone.__index__ = 0; | |
clone.__values__ = undefined; | |
if (result) { | |
previous.__wrapped__ = clone; | |
} else { | |
result = clone; | |
} | |
var previous = clone; | |
parent = parent.__wrapped__; | |
} | |
previous.__wrapped__ = value; | |
return result; | |
} | |
/** | |
* This method is the wrapper version of `_.reverse`. | |
* | |
* **Note:** This method mutates the wrapped array. | |
* | |
* @name reverse | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Seq | |
* @returns {Object} Returns the new `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) { | |
var wrapped = value; | |
if (this.__actions__.length) { | |
wrapped = new LazyWrapper(this); | |
} | |
wrapped = wrapped.reverse(); | |
wrapped.__actions__.push({ | |
'func': thru, | |
'args': [reverse], | |
'thisArg': undefined | |
}); | |
return new LodashWrapper(wrapped, this.__chain__); | |
} | |
return this.thru(reverse); | |
} | |
/** | |
* Executes the chain sequence to resolve the unwrapped value. | |
* | |
* @name value | |
* @memberOf _ | |
* @since 0.1.0 | |
* @alias toJSON, valueOf | |
* @category Seq | |
* @returns {*} Returns the resolved unwrapped value. | |
* @example | |
* | |
* _([1, 2, 3]).value(); | |
* // => [1, 2, 3] | |
*/ | |
function wrapperValue() { | |
return baseWrapperValue(this.__wrapped__, this.__actions__); | |
} | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Creates an object composed of keys generated from the results of running | |
* each element of `collection` thru `iteratee`. The corresponding value of | |
* each key is the number of times the key was returned by `iteratee`. The | |
* iteratee is invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.5.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [iteratee=_.identity] | |
* The iteratee to transform keys. | |
* @returns {Object} Returns the composed aggregate object. | |
* @example | |
* | |
* _.countBy([6.1, 4.2, 6.3], Math.floor); | |
* // => { '4': 1, '6': 2 } | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.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`. | |
* Iteration is stopped once `predicate` returns falsey. The predicate is | |
* invoked with three arguments: (value, index|key, collection). | |
* | |
* **Note:** This method returns `true` for | |
* [empty collections](https://en.wikipedia.org/wiki/Empty_set) because | |
* [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of | |
* elements of empty collections. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [predicate=_.identity] | |
* The function invoked per iteration. | |
* @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. | |
* @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', 'age': 36, 'active': false }, | |
* { 'user': 'fred', 'age': 40, 'active': false } | |
* ]; | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.every(users, { 'user': 'barney', 'active': false }); | |
* // => false | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.every(users, ['active', false]); | |
* // => true | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.every(users, 'active'); | |
* // => false | |
*/ | |
function every(collection, predicate, guard) { | |
var func = isArray(collection) ? arrayEvery : baseEvery; | |
if (guard && isIterateeCall(collection, predicate, guard)) { | |
predicate = undefined; | |
} | |
return func(collection, getIteratee(predicate, 3)); | |
} | |
/** | |
* Iterates over elements of `collection`, returning an array of all elements | |
* `predicate` returns truthy for. The predicate is invoked with three | |
* arguments: (value, index|key, collection). | |
* | |
* **Note:** Unlike `_.remove`, this method returns a new array. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [predicate=_.identity] | |
* The function invoked per iteration. | |
* @returns {Array} Returns the new filtered array. | |
* @see _.reject | |
* @example | |
* | |
* var users = [ | |
* { 'user': 'barney', 'age': 36, 'active': true }, | |
* { 'user': 'fred', 'age': 40, 'active': false } | |
* ]; | |
* | |
* _.filter(users, function(o) { return !o.active; }); | |
* // => objects for ['fred'] | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.filter(users, { 'age': 36, 'active': true }); | |
* // => objects for ['barney'] | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.filter(users, ['active', false]); | |
* // => objects for ['fred'] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.filter(users, 'active'); | |
* // => objects for ['barney'] | |
*/ | |
function filter(collection, predicate) { | |
var func = isArray(collection) ? arrayFilter : baseFilter; | |
return func(collection, getIteratee(predicate, 3)); | |
} | |
/** | |
* Iterates over elements of `collection`, returning the first element | |
* `predicate` returns truthy for. The predicate is invoked with three | |
* arguments: (value, index|key, collection). | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to inspect. | |
* @param {Function} [predicate=_.identity] | |
* The function invoked per iteration. | |
* @param {number} [fromIndex=0] The index to search from. | |
* @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 } | |
* ]; | |
* | |
* _.find(users, function(o) { return o.age < 40; }); | |
* // => object for 'barney' | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.find(users, { 'age': 1, 'active': true }); | |
* // => object for 'pebbles' | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.find(users, ['active', false]); | |
* // => object for 'fred' | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.find(users, 'active'); | |
* // => object for 'barney' | |
*/ | |
var find = createFind(findIndex); | |
/** | |
* This method is like `_.find` except that it iterates over elements of | |
* `collection` from right to left. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.0.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to inspect. | |
* @param {Function} [predicate=_.identity] | |
* The function invoked per iteration. | |
* @param {number} [fromIndex=collection.length-1] The index to search from. | |
* @returns {*} Returns the matched element, else `undefined`. | |
* @example | |
* | |
* _.findLast([1, 2, 3, 4], function(n) { | |
* return n % 2 == 1; | |
* }); | |
* // => 3 | |
*/ | |
var findLast = createFind(findLastIndex); | |
/** | |
* Creates a flattened array of values by running each element in `collection` | |
* thru `iteratee` and flattening the mapped results. The iteratee is invoked | |
* with three arguments: (value, index|key, collection). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [iteratee=_.identity] | |
* The function invoked per iteration. | |
* @returns {Array} Returns the new flattened array. | |
* @example | |
* | |
* function duplicate(n) { | |
* return [n, n]; | |
* } | |
* | |
* _.flatMap([1, 2], duplicate); | |
* // => [1, 1, 2, 2] | |
*/ | |
function flatMap(collection, iteratee) { | |
return baseFlatten(map(collection, iteratee), 1); | |
} | |
/** | |
* This method is like `_.flatMap` except that it recursively flattens the | |
* mapped results. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.7.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [iteratee=_.identity] | |
* The function invoked per iteration. | |
* @returns {Array} Returns the new flattened array. | |
* @example | |
* | |
* function duplicate(n) { | |
* return [[[n, n]]]; | |
* } | |
* | |
* _.flatMapDeep([1, 2], duplicate); | |
* // => [1, 1, 2, 2] | |
*/ | |
function flatMapDeep(collection, iteratee) { | |
return baseFlatten(map(collection, iteratee), INFINITY); | |
} | |
/** | |
* This method is like `_.flatMap` except that it recursively flattens the | |
* mapped results up to `depth` times. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.7.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [iteratee=_.identity] | |
* The function invoked per iteration. | |
* @param {number} [depth=1] The maximum recursion depth. | |
* @returns {Array} Returns the new flattened array. | |
* @example | |
* | |
* function duplicate(n) { | |
* return [[[n, n]]]; | |
* } | |
* | |
* _.flatMapDepth([1, 2], duplicate, 2); | |
* // => [[1, 1], [2, 2]] | |
*/ | |
function flatMapDepth(collection, iteratee, depth) { | |
depth = depth === undefined ? 1 : toInteger(depth); | |
return baseFlatten(map(collection, iteratee), depth); | |
} | |
/** | |
* Iterates over elements of `collection` and invokes `iteratee` for each element. | |
* The iteratee is 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 use `_.forIn` | |
* or `_.forOwn` for object iteration. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @alias each | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @returns {Array|Object} Returns `collection`. | |
* @see _.forEachRight | |
* @example | |
* | |
* _([1, 2]).forEach(function(value) { | |
* console.log(value); | |
* }); | |
* // => Logs `1` then `2`. | |
* | |
* _.forEach({ 'a': 1, 'b': 2 }, function(value, key) { | |
* console.log(key); | |
* }); | |
* // => Logs 'a' then 'b' (iteration order is not guaranteed). | |
*/ | |
function forEach(collection, iteratee) { | |
var func = isArray(collection) ? arrayEach : baseEach; | |
return func(collection, getIteratee(iteratee, 3)); | |
} | |
/** | |
* This method is like `_.forEach` except that it iterates over elements of | |
* `collection` from right to left. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.0.0 | |
* @alias eachRight | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @returns {Array|Object} Returns `collection`. | |
* @see _.forEach | |
* @example | |
* | |
* _.forEachRight([1, 2], function(value) { | |
* console.log(value); | |
* }); | |
* // => Logs `2` then `1`. | |
*/ | |
function forEachRight(collection, iteratee) { | |
var func = isArray(collection) ? arrayEachRight : baseEachRight; | |
return func(collection, getIteratee(iteratee, 3)); | |
} | |
/** | |
* Creates an object composed of keys generated from the results of running | |
* each element of `collection` thru `iteratee`. The order of grouped values | |
* is determined by the order they occur in `collection`. The corresponding | |
* value of each key is an array of elements responsible for generating the | |
* key. The iteratee is invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [iteratee=_.identity] | |
* The iteratee to transform keys. | |
* @returns {Object} Returns the composed aggregate object. | |
* @example | |
* | |
* _.groupBy([6.1, 4.2, 6.3], Math.floor); | |
* // => { '4': [4.2], '6': [6.1, 6.3] } | |
* | |
* // The `_.property` iteratee 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`. If `collection` is a string, it's | |
* checked for a substring of `value`, otherwise | |
* [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) | |
* is used for equality comparisons. If `fromIndex` is negative, it's used as | |
* the offset from the end of `collection`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object|string} collection The collection to inspect. | |
* @param {*} value The value to search for. | |
* @param {number} [fromIndex=0] The index to search from. | |
* @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`. | |
* @returns {boolean} Returns `true` if `value` is found, else `false`. | |
* @example | |
* | |
* _.includes([1, 2, 3], 1); | |
* // => true | |
* | |
* _.includes([1, 2, 3], 1, 2); | |
* // => false | |
* | |
* _.includes({ 'a': 1, 'b': 2 }, 1); | |
* // => true | |
* | |
* _.includes('abcd', 'bc'); | |
* // => true | |
*/ | |
function includes(collection, value, fromIndex, guard) { | |
collection = isArrayLike(collection) ? collection : values(collection); | |
fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0; | |
var length = collection.length; | |
if (fromIndex < 0) { | |
fromIndex = nativeMax(length + fromIndex, 0); | |
} | |
return isString(collection) | |
? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1) | |
: (!!length && baseIndexOf(collection, value, fromIndex) > -1); | |
} | |
/** | |
* Invokes the method at `path` of each element in `collection`, returning | |
* an array of the results of each invoked method. Any additional arguments | |
* are provided to each invoked method. If `path` is a function, it's invoked | |
* for, and `this` bound to, each element in `collection`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Collection | |
* @param {Array|Object} 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 each method with. | |
* @returns {Array} Returns the array of results. | |
* @example | |
* | |
* _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort'); | |
* // => [[1, 5, 7], [1, 2, 3]] | |
* | |
* _.invokeMap([123, 456], String.prototype.split, ''); | |
* // => [['1', '2', '3'], ['4', '5', '6']] | |
*/ | |
var invokeMap = baseRest(function(collection, path, args) { | |
var index = -1, | |
isFunc = typeof path == 'function', | |
isProp = isKey(path), | |
result = isArrayLike(collection) ? Array(collection.length) : []; | |
baseEach(collection, function(value) { | |
var func = isFunc ? path : ((isProp && value != null) ? value[path] : undefined); | |
result[++index] = func ? apply(func, value, args) : baseInvoke(value, path, args); | |
}); | |
return result; | |
}); | |
/** | |
* Creates an object composed of keys generated from the results of running | |
* each element of `collection` thru `iteratee`. The corresponding value of | |
* each key is the last element responsible for generating the key. The | |
* iteratee is invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [iteratee=_.identity] | |
* The iteratee to transform keys. | |
* @returns {Object} Returns the composed aggregate object. | |
* @example | |
* | |
* var array = [ | |
* { 'dir': 'left', 'code': 97 }, | |
* { 'dir': 'right', 'code': 100 } | |
* ]; | |
* | |
* _.keyBy(array, function(o) { | |
* return String.fromCharCode(o.code); | |
* }); | |
* // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } } | |
* | |
* _.keyBy(array, 'dir'); | |
* // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } } | |
*/ | |
var keyBy = createAggregator(function(result, value, key) { | |
result[key] = value; | |
}); | |
/** | |
* Creates an array of values by running each element in `collection` thru | |
* `iteratee`. The iteratee is invoked with three arguments: | |
* (value, index|key, collection). | |
* | |
* Many lodash methods are guarded to work as iteratees for methods like | |
* `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`. | |
* | |
* The guarded methods are: | |
* `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`, | |
* `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`, | |
* `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`, | |
* `template`, `trim`, `trimEnd`, `trimStart`, and `words` | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @returns {Array} Returns the new mapped array. | |
* @example | |
* | |
* function square(n) { | |
* return n * n; | |
* } | |
* | |
* _.map([4, 8], square); | |
* // => [16, 64] | |
* | |
* _.map({ 'a': 4, 'b': 8 }, square); | |
* // => [16, 64] (iteration order is not guaranteed) | |
* | |
* var users = [ | |
* { 'user': 'barney' }, | |
* { 'user': 'fred' } | |
* ]; | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.map(users, 'user'); | |
* // => ['barney', 'fred'] | |
*/ | |
function map(collection, iteratee) { | |
var func = isArray(collection) ? arrayMap : baseMap; | |
return func(collection, getIteratee(iteratee, 3)); | |
} | |
/** | |
* This method is like `_.sortBy` except that it allows specifying the sort | |
* orders of the iteratees to sort by. If `orders` is unspecified, all values | |
* are sorted in ascending order. Otherwise, specify an order of "desc" for | |
* descending or "asc" for ascending sort order of corresponding values. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]] | |
* The iteratees to sort by. | |
* @param {string[]} [orders] The sort orders of `iteratees`. | |
* @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`. | |
* @returns {Array} Returns the new sorted array. | |
* @example | |
* | |
* var users = [ | |
* { 'user': 'fred', 'age': 48 }, | |
* { 'user': 'barney', 'age': 34 }, | |
* { 'user': 'fred', 'age': 40 }, | |
* { 'user': 'barney', 'age': 36 } | |
* ]; | |
* | |
* // Sort by `user` in ascending order and by `age` in descending order. | |
* _.orderBy(users, ['user', 'age'], ['asc', 'desc']); | |
* // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]] | |
*/ | |
function orderBy(collection, iteratees, orders, guard) { | |
if (collection == null) { | |
return []; | |
} | |
if (!isArray(iteratees)) { | |
iteratees = iteratees == null ? [] : [iteratees]; | |
} | |
orders = guard ? undefined : orders; | |
if (!isArray(orders)) { | |
orders = orders == null ? [] : [orders]; | |
} | |
return baseOrderBy(collection, iteratees, orders); | |
} | |
/** | |
* Creates an array of elements split into two groups, the first of which | |
* contains elements `predicate` returns truthy for, the second of which | |
* contains elements `predicate` returns falsey for. The predicate is | |
* invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [predicate=_.identity] The function invoked per iteration. | |
* @returns {Array} Returns the array of grouped elements. | |
* @example | |
* | |
* var users = [ | |
* { 'user': 'barney', 'age': 36, 'active': false }, | |
* { 'user': 'fred', 'age': 40, 'active': true }, | |
* { 'user': 'pebbles', 'age': 1, 'active': false } | |
* ]; | |
* | |
* _.partition(users, function(o) { return o.active; }); | |
* // => objects for [['fred'], ['barney', 'pebbles']] | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.partition(users, { 'age': 1, 'active': false }); | |
* // => objects for [['pebbles'], ['barney', 'fred']] | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.partition(users, ['active', false]); | |
* // => objects for [['barney', 'pebbles'], ['fred']] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.partition(users, 'active'); | |
* // => objects for [['fred'], ['barney', 'pebbles']] | |
*/ | |
var partition = createAggregator(function(result, value, key) { | |
result[key ? 0 : 1].push(value); | |
}, function() { return [[], []]; }); | |
/** | |
* Reduces `collection` to a value which is the accumulated result of running | |
* each element in `collection` thru `iteratee`, where each successive | |
* invocation is supplied the return value of the previous. If `accumulator` | |
* is not given, the first element of `collection` is used as the initial | |
* value. The iteratee is invoked with four arguments: | |
* (accumulator, value, index|key, collection). | |
* | |
* Many lodash methods are guarded to work as iteratees for methods like | |
* `_.reduce`, `_.reduceRight`, and `_.transform`. | |
* | |
* The guarded methods are: | |
* `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`, | |
* and `sortBy` | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @param {*} [accumulator] The initial value. | |
* @returns {*} Returns the accumulated value. | |
* @see _.reduceRight | |
* @example | |
* | |
* _.reduce([1, 2], function(sum, n) { | |
* return sum + n; | |
* }, 0); | |
* // => 3 | |
* | |
* _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) { | |
* (result[value] || (result[value] = [])).push(key); | |
* return result; | |
* }, {}); | |
* // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed) | |
*/ | |
function reduce(collection, iteratee, accumulator) { | |
var func = isArray(collection) ? arrayReduce : baseReduce, | |
initAccum = arguments.length < 3; | |
return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach); | |
} | |
/** | |
* This method is like `_.reduce` except that it iterates over elements of | |
* `collection` from right to left. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @param {*} [accumulator] The initial value. | |
* @returns {*} Returns the accumulated value. | |
* @see _.reduce | |
* @example | |
* | |
* var array = [[0, 1], [2, 3], [4, 5]]; | |
* | |
* _.reduceRight(array, function(flattened, other) { | |
* return flattened.concat(other); | |
* }, []); | |
* // => [4, 5, 2, 3, 0, 1] | |
*/ | |
function reduceRight(collection, iteratee, accumulator) { | |
var func = isArray(collection) ? arrayReduceRight : baseReduce, | |
initAccum = arguments.length < 3; | |
return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight); | |
} | |
/** | |
* The opposite of `_.filter`; this method returns the elements of `collection` | |
* that `predicate` does **not** return truthy for. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [predicate=_.identity] The function invoked per iteration. | |
* @returns {Array} Returns the new filtered array. | |
* @see _.filter | |
* @example | |
* | |
* var users = [ | |
* { 'user': 'barney', 'age': 36, 'active': false }, | |
* { 'user': 'fred', 'age': 40, 'active': true } | |
* ]; | |
* | |
* _.reject(users, function(o) { return !o.active; }); | |
* // => objects for ['fred'] | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.reject(users, { 'age': 40, 'active': true }); | |
* // => objects for ['barney'] | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.reject(users, ['active', false]); | |
* // => objects for ['fred'] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.reject(users, 'active'); | |
* // => objects for ['barney'] | |
*/ | |
function reject(collection, predicate) { | |
var func = isArray(collection) ? arrayFilter : baseFilter; | |
return func(collection, negate(getIteratee(predicate, 3))); | |
} | |
/** | |
* Gets a random element from `collection`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.0.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to sample. | |
* @returns {*} Returns the random element. | |
* @example | |
* | |
* _.sample([1, 2, 3, 4]); | |
* // => 2 | |
*/ | |
function sample(collection) { | |
var array = isArrayLike(collection) ? collection : values(collection), | |
length = array.length; | |
return length > 0 ? array[baseRandom(0, length - 1)] : undefined; | |
} | |
/** | |
* Gets `n` random elements at unique keys from `collection` up to the | |
* size of `collection`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to sample. | |
* @param {number} [n=1] The number of elements to sample. | |
* @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. | |
* @returns {Array} Returns the random elements. | |
* @example | |
* | |
* _.sampleSize([1, 2, 3], 2); | |
* // => [3, 1] | |
* | |
* _.sampleSize([1, 2, 3], 4); | |
* // => [2, 3, 1] | |
*/ | |
function sampleSize(collection, n, guard) { | |
var index = -1, | |
result = toArray(collection), | |
length = result.length, | |
lastIndex = length - 1; | |
if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) { | |
n = 1; | |
} else { | |
n = baseClamp(toInteger(n), 0, length); | |
} | |
while (++index < n) { | |
var rand = baseRandom(index, lastIndex), | |
value = result[rand]; | |
result[rand] = result[index]; | |
result[index] = value; | |
} | |
result.length = n; | |
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 _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object} 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) { | |
return sampleSize(collection, MAX_ARRAY_LENGTH); | |
} | |
/** | |
* Gets the size of `collection` by returning its length for array-like | |
* values or the number of own enumerable string keyed properties for objects. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object|string} collection The collection to inspect. | |
* @returns {number} Returns the collection size. | |
* @example | |
* | |
* _.size([1, 2, 3]); | |
* // => 3 | |
* | |
* _.size({ 'a': 1, 'b': 2 }); | |
* // => 2 | |
* | |
* _.size('pebbles'); | |
* // => 7 | |
*/ | |
function size(collection) { | |
if (collection == null) { | |
return 0; | |
} | |
if (isArrayLike(collection)) { | |
return isString(collection) ? stringSize(collection) : collection.length; | |
} | |
var tag = getTag(collection); | |
if (tag == mapTag || tag == setTag) { | |
return collection.size; | |
} | |
return baseKeys(collection).length; | |
} | |
/** | |
* Checks if `predicate` returns truthy for **any** element of `collection`. | |
* Iteration is stopped once `predicate` returns truthy. The predicate is | |
* invoked with three arguments: (value, index|key, collection). | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {Function} [predicate=_.identity] The function invoked per iteration. | |
* @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. | |
* @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 } | |
* ]; | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.some(users, { 'user': 'barney', 'active': false }); | |
* // => false | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.some(users, ['active', false]); | |
* // => true | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.some(users, 'active'); | |
* // => true | |
*/ | |
function some(collection, predicate, guard) { | |
var func = isArray(collection) ? arraySome : baseSome; | |
if (guard && isIterateeCall(collection, predicate, guard)) { | |
predicate = undefined; | |
} | |
return func(collection, getIteratee(predicate, 3)); | |
} | |
/** | |
* Creates an array of elements, sorted in ascending order by the results of | |
* running each element in a collection thru each iteratee. This method | |
* performs a stable sort, that is, it preserves the original sort order of | |
* equal elements. The iteratees are invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Collection | |
* @param {Array|Object} collection The collection to iterate over. | |
* @param {...(Function|Function[])} [iteratees=[_.identity]] | |
* The iteratees to sort by. | |
* @returns {Array} Returns the new sorted array. | |
* @example | |
* | |
* var users = [ | |
* { 'user': 'fred', 'age': 48 }, | |
* { 'user': 'barney', 'age': 36 }, | |
* { 'user': 'fred', 'age': 40 }, | |
* { 'user': 'barney', 'age': 34 } | |
* ]; | |
* | |
* _.sortBy(users, function(o) { return o.user; }); | |
* // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]] | |
* | |
* _.sortBy(users, ['user', 'age']); | |
* // => objects for [['barney', 34], ['barney', 36], ['fred', 40], ['fred', 48]] | |
* | |
* _.sortBy(users, 'user', function(o) { | |
* return Math.floor(o.age / 10); | |
* }); | |
* // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]] | |
*/ | |
var sortBy = baseRest(function(collection, iteratees) { | |
if (collection == null) { | |
return []; | |
} | |
var length = iteratees.length; | |
if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) { | |
iteratees = []; | |
} else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) { | |
iteratees = [iteratees[0]]; | |
} | |
return baseOrderBy(collection, baseFlatten(iteratees, 1), []); | |
}); | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Gets the timestamp of the number of milliseconds that have elapsed since | |
* the Unix epoch (1 January 1970 00:00:00 UTC). | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.4.0 | |
* @category Date | |
* @returns {number} Returns the timestamp. | |
* @example | |
* | |
* _.defer(function(stamp) { | |
* console.log(_.now() - stamp); | |
* }, _.now()); | |
* // => Logs the number of milliseconds it took for the deferred invocation. | |
*/ | |
var now = ctxNow || function() { | |
return root.Date.now(); | |
}; | |
/*------------------------------------------------------------------------*/ | |
/** | |
* The opposite of `_.before`; this method creates a function that invokes | |
* `func` once it's called `n` or more times. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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') { | |
throw new TypeError(FUNC_ERROR_TEXT); | |
} | |
n = toInteger(n); | |
return function() { | |
if (--n < 1) { | |
return func.apply(this, arguments); | |
} | |
}; | |
} | |
/** | |
* Creates a function that invokes `func`, with up to `n` arguments, | |
* ignoring any additional arguments. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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 an iteratee for methods like `_.map`. | |
* @returns {Function} Returns the new capped function. | |
* @example | |
* | |
* _.map(['6', '8', '10'], _.ary(parseInt, 1)); | |
* // => [6, 8, 10] | |
*/ | |
function ary(func, n, guard) { | |
n = guard ? undefined : n; | |
n = (func && n == null) ? func.length : n; | |
return createWrap(func, ARY_FLAG, undefined, undefined, undefined, undefined, n); | |
} | |
/** | |
* Creates a function that invokes `func`, with the `this` binding and arguments | |
* of the created function, while it's called less than `n` times. Subsequent | |
* calls to the created function return the result of the last `func` invocation. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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(element).on('click', _.before(5, addContactToList)); | |
* // => Allows adding up to 4 contacts to the list. | |
*/ | |
function before(n, func) { | |
var result; | |
if (typeof func != 'function') { | |
throw new TypeError(FUNC_ERROR_TEXT); | |
} | |
n = toInteger(n); | |
return function() { | |
if (--n > 0) { | |
result = func.apply(this, arguments); | |
} | |
if (n <= 1) { | |
func = undefined; | |
} | |
return result; | |
}; | |
} | |
/** | |
* Creates a function that invokes `func` with the `this` binding of `thisArg` | |
* and `partials` prepended to the arguments it receives. | |
* | |
* 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 doesn't set the "length" | |
* property of bound functions. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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 | |
* | |
* function greet(greeting, punctuation) { | |
* return greeting + ' ' + this.user + punctuation; | |
* } | |
* | |
* var object = { 'user': 'fred' }; | |
* | |
* var bound = _.bind(greet, object, 'hi'); | |
* bound('!'); | |
* // => 'hi fred!' | |
* | |
* // Bound with placeholders. | |
* var bound = _.bind(greet, object, _, '!'); | |
* bound('hi'); | |
* // => 'hi fred!' | |
*/ | |
var bind = baseRest(function(func, thisArg, partials) { | |
var bitmask = BIND_FLAG; | |
if (partials.length) { | |
var holders = replaceHolders(partials, getHolder(bind)); | |
bitmask |= PARTIAL_FLAG; | |
} | |
return createWrap(func, bitmask, thisArg, partials, holders); | |
}); | |
/** | |
* Creates a function that invokes the method at `object[key]` with `partials` | |
* prepended to the arguments it receives. | |
* | |
* 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 _ | |
* @since 0.10.0 | |
* @category Function | |
* @param {Object} object The object to invoke the method on. | |
* @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!' | |
* | |
* // Bound with placeholders. | |
* var bound = _.bindKey(object, 'greet', _, '!'); | |
* bound('hi'); | |
* // => 'hiya fred!' | |
*/ | |
var bindKey = baseRest(function(object, key, partials) { | |
var bitmask = BIND_FLAG | BIND_KEY_FLAG; | |
if (partials.length) { | |
var holders = replaceHolders(partials, getHolder(bindKey)); | |
bitmask |= PARTIAL_FLAG; | |
} | |
return createWrap(key, bitmask, object, partials, holders); | |
}); | |
/** | |
* Creates a function that accepts arguments of `func` and either invokes | |
* `func` returning its result, if at least `arity` number of arguments have | |
* been provided, or returns a function that accepts 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 doesn't set the "length" property of curried functions. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.0.0 | |
* @category Function | |
* @param {Function} func The function to curry. | |
* @param {number} [arity=func.length] The arity of `func`. | |
* @param- {Object} [guard] Enables use as an iteratee for methods 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] | |
* | |
* // Curried with placeholders. | |
* curried(1)(_, 3)(2); | |
* // => [1, 2, 3] | |
*/ | |
function curry(func, arity, guard) { | |
arity = guard ? undefined : arity; | |
var result = createWrap(func, CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity); | |
result.placeholder = curry.placeholder; | |
return result; | |
} | |
/** | |
* 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 doesn't set the "length" property of curried functions. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Function | |
* @param {Function} func The function to curry. | |
* @param {number} [arity=func.length] The arity of `func`. | |
* @param- {Object} [guard] Enables use as an iteratee for methods 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] | |
* | |
* // Curried with placeholders. | |
* curried(3)(1, _)(2); | |
* // => [1, 2, 3] | |
*/ | |
function curryRight(func, arity, guard) { | |
arity = guard ? undefined : arity; | |
var result = createWrap(func, CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity); | |
result.placeholder = curryRight.placeholder; | |
return result; | |
} | |
/** | |
* Creates a debounced function that delays invoking `func` until after `wait` | |
* milliseconds have elapsed since the last time the debounced function was | |
* invoked. The debounced function comes with a `cancel` method to cancel | |
* delayed `func` invocations and a `flush` method to immediately invoke them. | |
* Provide `options` to indicate whether `func` should be invoked on the | |
* leading and/or trailing edge of the `wait` timeout. The `func` is invoked | |
* with the last arguments provided to the debounced function. 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 debounced function | |
* is invoked more than once during the `wait` timeout. | |
* | |
* If `wait` is `0` and `leading` is `false`, `func` invocation is deferred | |
* until to the next tick, similar to `setTimeout` with a timeout of `0`. | |
* | |
* See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/) | |
* for details over the differences between `_.debounce` and `_.throttle`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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's 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 clicked, debouncing subsequent calls. | |
* jQuery(element).on('click', _.debounce(sendMail, 300, { | |
* 'leading': true, | |
* 'trailing': false | |
* })); | |
* | |
* // Ensure `batchLog` is invoked once after 1 second of debounced calls. | |
* var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 }); | |
* var source = new EventSource('/stream'); | |
* jQuery(source).on('message', debounced); | |
* | |
* // Cancel the trailing debounced invocation. | |
* jQuery(window).on('popstate', debounced.cancel); | |
*/ | |
function debounce(func, wait, options) { | |
var lastArgs, | |
lastThis, | |
maxWait, | |
result, | |
timerId, | |
lastCallTime, | |
lastInvokeTime = 0, | |
leading = false, | |
maxing = false, | |
trailing = true; | |
if (typeof func != 'function') { | |
throw new TypeError(FUNC_ERROR_TEXT); | |
} | |
wait = toNumber(wait) || 0; | |
if (isObject(options)) { | |
leading = !!options.leading; | |
maxing = 'maxWait' in options; | |
maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait; | |
trailing = 'trailing' in options ? !!options.trailing : trailing; | |
} | |
function invokeFunc(time) { | |
var args = lastArgs, | |
thisArg = lastThis; | |
lastArgs = lastThis = undefined; | |
lastInvokeTime = time; | |
result = func.apply(thisArg, args); | |
return result; | |
} | |
function leadingEdge(time) { | |
// Reset any `maxWait` timer. | |
lastInvokeTime = time; | |
// Start the timer for the trailing edge. | |
timerId = setTimeout(timerExpired, wait); | |
// Invoke the leading edge. | |
return leading ? invokeFunc(time) : result; | |
} | |
function remainingWait(time) { | |
var timeSinceLastCall = time - lastCallTime, | |
timeSinceLastInvoke = time - lastInvokeTime, | |
result = wait - timeSinceLastCall; | |
return maxing ? nativeMin(result, maxWait - timeSinceLastInvoke) : result; | |
} | |
function shouldInvoke(time) { | |
var timeSinceLastCall = time - lastCallTime, | |
timeSinceLastInvoke = time - lastInvokeTime; | |
// Either this is the first call, activity has stopped and we're at the | |
// trailing edge, the system time has gone backwards and we're treating | |
// it as the trailing edge, or we've hit the `maxWait` limit. | |
return (lastCallTime === undefined || (timeSinceLastCall >= wait) || | |
(timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait)); | |
} | |
function timerExpired() { | |
var time = now(); | |
if (shouldInvoke(time)) { | |
return trailingEdge(time); | |
} | |
// Restart the timer. | |
timerId = setTimeout(timerExpired, remainingWait(time)); | |
} | |
function trailingEdge(time) { | |
timerId = undefined; | |
// Only invoke if we have `lastArgs` which means `func` has been | |
// debounced at least once. | |
if (trailing && lastArgs) { | |
return invokeFunc(time); | |
} | |
lastArgs = lastThis = undefined; | |
return result; | |
} | |
function cancel() { | |
if (timerId !== undefined) { | |
clearTimeout(timerId); | |
} | |
lastInvokeTime = 0; | |
lastArgs = lastCallTime = lastThis = timerId = undefined; | |
} | |
function flush() { | |
return timerId === undefined ? result : trailingEdge(now()); | |
} | |
function debounced() { | |
var time = now(), | |
isInvoking = shouldInvoke(time); | |
lastArgs = arguments; | |
lastThis = this; | |
lastCallTime = time; | |
if (isInvoking) { | |
if (timerId === undefined) { | |
return leadingEdge(lastCallTime); | |
} | |
if (maxing) { | |
// Handle invocations in a tight loop. | |
timerId = setTimeout(timerExpired, wait); | |
return invokeFunc(lastCallTime); | |
} | |
} | |
if (timerId === undefined) { | |
timerId = setTimeout(timerExpired, wait); | |
} | |
return result; | |
} | |
debounced.cancel = cancel; | |
debounced.flush = flush; | |
return debounced; | |
} | |
/** | |
* Defers invoking the `func` until the current call stack has cleared. Any | |
* additional arguments are provided to `func` when it's invoked. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Function | |
* @param {Function} func The function to defer. | |
* @param {...*} [args] The arguments to invoke `func` with. | |
* @returns {number} Returns the timer id. | |
* @example | |
* | |
* _.defer(function(text) { | |
* console.log(text); | |
* }, 'deferred'); | |
* // => Logs 'deferred' after one or more milliseconds. | |
*/ | |
var defer = baseRest(function(func, args) { | |
return baseDelay(func, 1, args); | |
}); | |
/** | |
* Invokes `func` after `wait` milliseconds. Any additional arguments are | |
* provided to `func` when it's invoked. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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 `func` with. | |
* @returns {number} Returns the timer id. | |
* @example | |
* | |
* _.delay(function(text) { | |
* console.log(text); | |
* }, 1000, 'later'); | |
* // => Logs 'later' after one second. | |
*/ | |
var delay = baseRest(function(func, wait, args) { | |
return baseDelay(func, toNumber(wait) || 0, args); | |
}); | |
/** | |
* Creates a function that invokes `func` with arguments reversed. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Function | |
* @param {Function} func The function to flip arguments for. | |
* @returns {Function} Returns the new flipped function. | |
* @example | |
* | |
* var flipped = _.flip(function() { | |
* return _.toArray(arguments); | |
* }); | |
* | |
* flipped('a', 'b', 'c', 'd'); | |
* // => ['d', 'c', 'b', 'a'] | |
*/ | |
function flip(func) { | |
return createWrap(func, FLIP_FLAG); | |
} | |
/** | |
* 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 used as the map 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`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object) | |
* method interface of `delete`, `get`, `has`, and `set`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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 memoized function. | |
* @example | |
* | |
* var object = { 'a': 1, 'b': 2 }; | |
* var other = { 'c': 3, 'd': 4 }; | |
* | |
* var values = _.memoize(_.values); | |
* values(object); | |
* // => [1, 2] | |
* | |
* values(other); | |
* // => [3, 4] | |
* | |
* object.a = 2; | |
* values(object); | |
* // => [1, 2] | |
* | |
* // Modify the result cache. | |
* values.cache.set(object, ['a', 'b']); | |
* values(object); | |
* // => ['a', 'b'] | |
* | |
* // Replace `_.memoize.Cache`. | |
* _.memoize.Cache = WeakMap; | |
*/ | |
function memoize(func, resolver) { | |
if (typeof func != 'function' || (resolver && typeof resolver != 'function')) { | |
throw new TypeError(FUNC_ERROR_TEXT); | |
} | |
var memoized = function() { | |
var args = arguments, | |
key = resolver ? resolver.apply(this, args) : args[0], | |
cache = memoized.cache; | |
if (cache.has(key)) { | |
return cache.get(key); | |
} | |
var result = func.apply(this, args); | |
memoized.cache = cache.set(key, result); | |
return result; | |
}; | |
memoized.cache = new (memoize.Cache || MapCache); | |
return memoized; | |
} | |
// Assign cache to `_.memoize`. | |
memoize.Cache = MapCache; | |
/** | |
* 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 _ | |
* @since 3.0.0 | |
* @category Function | |
* @param {Function} predicate The predicate to negate. | |
* @returns {Function} Returns the new negated 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() { | |
var args = arguments; | |
switch (args.length) { | |
case 0: return !predicate.call(this); | |
case 1: return !predicate.call(this, args[0]); | |
case 2: return !predicate.call(this, args[0], args[1]); | |
case 3: return !predicate.call(this, args[0], args[1], args[2]); | |
} | |
return !predicate.apply(this, args); | |
}; | |
} | |
/** | |
* Creates a function that is restricted to invoking `func` once. Repeat calls | |
* to the function return the value of the first invocation. The `func` is | |
* invoked with the `this` binding and arguments of the created function. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Function | |
* @param {Function} func The function to restrict. | |
* @returns {Function} Returns the new restricted function. | |
* @example | |
* | |
* var initialize = _.once(createApplication); | |
* initialize(); | |
* initialize(); | |
* // => `createApplication` is invoked once | |
*/ | |
function once(func) { | |
return before(2, func); | |
} | |
/** | |
* Creates a function that invokes `func` with its arguments transformed. | |
* | |
* @static | |
* @since 4.0.0 | |
* @memberOf _ | |
* @category Function | |
* @param {Function} func The function to wrap. | |
* @param {...(Function|Function[])} [transforms=[_.identity]] | |
* The argument transforms. | |
* @returns {Function} Returns the new function. | |
* @example | |
* | |
* function doubled(n) { | |
* return n * 2; | |
* } | |
* | |
* function square(n) { | |
* return n * n; | |
* } | |
* | |
* var func = _.overArgs(function(x, y) { | |
* return [x, y]; | |
* }, [square, doubled]); | |
* | |
* func(9, 3); | |
* // => [81, 6] | |
* | |
* func(10, 5); | |
* // => [100, 10] | |
*/ | |
var overArgs = baseRest(function(func, transforms) { | |
transforms = (transforms.length == 1 && isArray(transforms[0])) | |
? arrayMap(transforms[0], baseUnary(getIteratee())) | |
: arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee())); | |
var funcsLength = transforms.length; | |
return baseRest(function(args) { | |
var index = -1, | |
length = nativeMin(args.length, funcsLength); | |
while (++index < length) { | |
args[index] = transforms[index].call(this, args[index]); | |
} | |
return apply(func, this, args); | |
}); | |
}); | |
/** | |
* Creates a function that invokes `func` with `partials` prepended to the | |
* arguments it receives. 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 doesn't set the "length" property of partially | |
* applied functions. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.2.0 | |
* @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 | |
* | |
* function greet(greeting, name) { | |
* return greeting + ' ' + name; | |
* } | |
* | |
* var sayHelloTo = _.partial(greet, 'hello'); | |
* sayHelloTo('fred'); | |
* // => 'hello fred' | |
* | |
* // Partially applied with placeholders. | |
* var greetFred = _.partial(greet, _, 'fred'); | |
* greetFred('hi'); | |
* // => 'hi fred' | |
*/ | |
var partial = baseRest(function(func, partials) { | |
var holders = replaceHolders(partials, getHolder(partial)); | |
return createWrap(func, PARTIAL_FLAG, undefined, partials, holders); | |
}); | |
/** | |
* This method is like `_.partial` except that partially applied arguments | |
* are appended to the arguments it receives. | |
* | |
* The `_.partialRight.placeholder` value, which defaults to `_` in monolithic | |
* builds, may be used as a placeholder for partially applied arguments. | |
* | |
* **Note:** This method doesn't set the "length" property of partially | |
* applied functions. | |
* | |
* @static | |
* @memberOf _ | |
* @since 1.0.0 | |
* @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 | |
* | |
* function greet(greeting, name) { | |
* return greeting + ' ' + name; | |
* } | |
* | |
* var greetFred = _.partialRight(greet, 'fred'); | |
* greetFred('hi'); | |
* // => 'hi fred' | |
* | |
* // Partially applied with placeholders. | |
* var sayHelloTo = _.partialRight(greet, 'hello', _); | |
* sayHelloTo('fred'); | |
* // => 'hello fred' | |
*/ | |
var partialRight = baseRest(function(func, partials) { | |
var holders = replaceHolders(partials, getHolder(partialRight)); | |
return createWrap(func, PARTIAL_RIGHT_FLAG, undefined, partials, holders); | |
}); | |
/** | |
* 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 _ | |
* @since 3.0.0 | |
* @category Function | |
* @param {Function} func The function to rearrange arguments for. | |
* @param {...(number|number[])} indexes The arranged argument 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 rearg = baseRest(function(func, indexes) { | |
return createWrap(func, REARG_FLAG, undefined, undefined, undefined, baseFlatten(indexes, 1)); | |
}); | |
/** | |
* 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://mdn.io/rest_parameters). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @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 = _.rest(function(what, names) { | |
* return what + ' ' + _.initial(names).join(', ') + | |
* (_.size(names) > 1 ? ', & ' : '') + _.last(names); | |
* }); | |
* | |
* say('hello', 'fred', 'barney', 'pebbles'); | |
* // => 'hello fred, barney, & pebbles' | |
*/ | |
function rest(func, start) { | |
if (typeof func != 'function') { | |
throw new TypeError(FUNC_ERROR_TEXT); | |
} | |
start = start === undefined ? start : toInteger(start); | |
return baseRest(func, start); | |
} | |
/** | |
* Creates a function that invokes `func` with the `this` binding of the | |
* create function and an array of arguments much like | |
* [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply). | |
* | |
* **Note:** This method is based on the | |
* [spread operator](https://mdn.io/spread_operator). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.2.0 | |
* @category Function | |
* @param {Function} func The function to spread arguments over. | |
* @param {number} [start=0] The start position of the spread. | |
* @returns {Function} Returns the new function. | |
* @example | |
* | |
* var say = _.spread(function(who, what) { | |
* return who + ' says ' + what; | |
* }); | |
* | |
* say(['fred', 'hello']); | |
* // => 'fred says hello' | |
* | |
* 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, start) { | |
if (typeof func != 'function') { | |
throw new TypeError(FUNC_ERROR_TEXT); | |
} | |
start = start === undefined ? 0 : nativeMax(toInteger(start), 0); | |
return baseRest(function(args) { | |
var array = args[start], | |
otherArgs = castSlice(args, 0, start); | |
if (array) { | |
arrayPush(otherArgs, array); | |
} | |
return apply(func, this, otherArgs); | |
}); | |
} | |
/** | |
* Creates a throttled function that only invokes `func` at most once per | |
* every `wait` milliseconds. The throttled function comes with a `cancel` | |
* method to cancel delayed `func` invocations and a `flush` method to | |
* immediately invoke them. Provide `options` to indicate whether `func` | |
* should be invoked on the leading and/or trailing edge of the `wait` | |
* timeout. The `func` is invoked with the last arguments provided to the | |
* throttled function. Subsequent calls to the throttled 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 throttled function | |
* is invoked more than once during the `wait` timeout. | |
* | |
* If `wait` is `0` and `leading` is `false`, `func` invocation is deferred | |
* until to the next tick, similar to `setTimeout` with a timeout of `0`. | |
* | |
* See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/) | |
* for details over the differences between `_.throttle` and `_.debounce`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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. | |
* var throttled = _.throttle(renewToken, 300000, { 'trailing': false }); | |
* jQuery(element).on('click', throttled); | |
* | |
* // Cancel the trailing throttled invocation. | |
* 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 (isObject(options)) { | |
leading = 'leading' in options ? !!options.leading : leading; | |
trailing = 'trailing' in options ? !!options.trailing : trailing; | |
} | |
return debounce(func, wait, { | |
'leading': leading, | |
'maxWait': wait, | |
'trailing': trailing | |
}); | |
} | |
/** | |
* Creates a function that accepts up to one argument, ignoring any | |
* additional arguments. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Function | |
* @param {Function} func The function to cap arguments for. | |
* @returns {Function} Returns the new capped function. | |
* @example | |
* | |
* _.map(['6', '8', '10'], _.unary(parseInt)); | |
* // => [6, 8, 10] | |
*/ | |
function unary(func) { | |
return ary(func, 1); | |
} | |
/** | |
* Creates a function that provides `value` to `wrapper` as its first | |
* argument. Any additional arguments provided to the function are appended | |
* to those provided to the `wrapper`. The wrapper is invoked with the `this` | |
* binding of the created function. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Function | |
* @param {*} value The value to wrap. | |
* @param {Function} [wrapper=identity] 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 partial(wrapper, value); | |
} | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Casts `value` as an array if it's not one. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.4.0 | |
* @category Lang | |
* @param {*} value The value to inspect. | |
* @returns {Array} Returns the cast array. | |
* @example | |
* | |
* _.castArray(1); | |
* // => [1] | |
* | |
* _.castArray({ 'a': 1 }); | |
* // => [{ 'a': 1 }] | |
* | |
* _.castArray('abc'); | |
* // => ['abc'] | |
* | |
* _.castArray(null); | |
* // => [null] | |
* | |
* _.castArray(undefined); | |
* // => [undefined] | |
* | |
* _.castArray(); | |
* // => [] | |
* | |
* var array = [1, 2, 3]; | |
* console.log(_.castArray(array) === array); | |
* // => true | |
*/ | |
function castArray() { | |
if (!arguments.length) { | |
return []; | |
} | |
var value = arguments[0]; | |
return isArray(value) ? value : [value]; | |
} | |
/** | |
* Creates a shallow clone of `value`. | |
* | |
* **Note:** This method is loosely based on the | |
* [structured clone algorithm](https://mdn.io/Structured_clone_algorithm) | |
* and supports cloning arrays, array buffers, booleans, date objects, maps, | |
* numbers, `Object` objects, regexes, sets, strings, symbols, and typed | |
* arrays. The own enumerable properties of `arguments` objects are cloned | |
* as plain objects. An empty object is returned for uncloneable values such | |
* as error objects, functions, DOM nodes, and WeakMaps. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to clone. | |
* @returns {*} Returns the cloned value. | |
* @see _.cloneDeep | |
* @example | |
* | |
* var objects = [{ 'a': 1 }, { 'b': 2 }]; | |
* | |
* var shallow = _.clone(objects); | |
* console.log(shallow[0] === objects[0]); | |
* // => true | |
*/ | |
function clone(value) { | |
return baseClone(value, false, true); | |
} | |
/** | |
* This method is like `_.clone` except that it accepts `customizer` which | |
* is invoked to produce the cloned value. If `customizer` returns `undefined`, | |
* cloning is handled by the method instead. The `customizer` is invoked with | |
* up to four arguments; (value [, index|key, object, stack]). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to clone. | |
* @param {Function} [customizer] The function to customize cloning. | |
* @returns {*} Returns the cloned value. | |
* @see _.cloneDeepWith | |
* @example | |
* | |
* function customizer(value) { | |
* if (_.isElement(value)) { | |
* return value.cloneNode(false); | |
* } | |
* } | |
* | |
* var el = _.cloneWith(document.body, customizer); | |
* | |
* console.log(el === document.body); | |
* // => false | |
* console.log(el.nodeName); | |
* // => 'BODY' | |
* console.log(el.childNodes.length); | |
* // => 0 | |
*/ | |
function cloneWith(value, customizer) { | |
return baseClone(value, false, true, customizer); | |
} | |
/** | |
* This method is like `_.clone` except that it recursively clones `value`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 1.0.0 | |
* @category Lang | |
* @param {*} value The value to recursively clone. | |
* @returns {*} Returns the deep cloned value. | |
* @see _.clone | |
* @example | |
* | |
* var objects = [{ 'a': 1 }, { 'b': 2 }]; | |
* | |
* var deep = _.cloneDeep(objects); | |
* console.log(deep[0] === objects[0]); | |
* // => false | |
*/ | |
function cloneDeep(value) { | |
return baseClone(value, true, true); | |
} | |
/** | |
* This method is like `_.cloneWith` except that it recursively clones `value`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to recursively clone. | |
* @param {Function} [customizer] The function to customize cloning. | |
* @returns {*} Returns the deep cloned value. | |
* @see _.cloneWith | |
* @example | |
* | |
* function customizer(value) { | |
* if (_.isElement(value)) { | |
* return value.cloneNode(true); | |
* } | |
* } | |
* | |
* var el = _.cloneDeepWith(document.body, customizer); | |
* | |
* console.log(el === document.body); | |
* // => false | |
* console.log(el.nodeName); | |
* // => 'BODY' | |
* console.log(el.childNodes.length); | |
* // => 20 | |
*/ | |
function cloneDeepWith(value, customizer) { | |
return baseClone(value, true, true, customizer); | |
} | |
/** | |
* Checks if `object` conforms to `source` by invoking the predicate | |
* properties of `source` with the corresponding property values of `object`. | |
* | |
* **Note:** This method is equivalent to `_.conforms` when `source` is | |
* partially applied. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.14.0 | |
* @category Lang | |
* @param {Object} object The object to inspect. | |
* @param {Object} source The object of property predicates to conform to. | |
* @returns {boolean} Returns `true` if `object` conforms, else `false`. | |
* @example | |
* | |
* var object = { 'a': 1, 'b': 2 }; | |
* | |
* _.conformsTo(object, { 'b': function(n) { return n > 1; } }); | |
* // => true | |
* | |
* _.conformsTo(object, { 'b': function(n) { return n > 2; } }); | |
* // => false | |
*/ | |
function conformsTo(object, source) { | |
return source == null || baseConformsTo(object, source, keys(source)); | |
} | |
/** | |
* Performs a | |
* [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) | |
* comparison between two values to determine if they are equivalent. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @returns {boolean} Returns `true` if the values are equivalent, else `false`. | |
* @example | |
* | |
* var object = { 'a': 1 }; | |
* var other = { 'a': 1 }; | |
* | |
* _.eq(object, object); | |
* // => true | |
* | |
* _.eq(object, other); | |
* // => false | |
* | |
* _.eq('a', 'a'); | |
* // => true | |
* | |
* _.eq('a', Object('a')); | |
* // => false | |
* | |
* _.eq(NaN, NaN); | |
* // => true | |
*/ | |
function eq(value, other) { | |
return value === other || (value !== value && other !== other); | |
} | |
/** | |
* Checks if `value` is greater than `other`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.9.0 | |
* @category Lang | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @returns {boolean} Returns `true` if `value` is greater than `other`, | |
* else `false`. | |
* @see _.lt | |
* @example | |
* | |
* _.gt(3, 1); | |
* // => true | |
* | |
* _.gt(3, 3); | |
* // => false | |
* | |
* _.gt(1, 3); | |
* // => false | |
*/ | |
var gt = createRelationalOperation(baseGt); | |
/** | |
* Checks if `value` is greater than or equal to `other`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.9.0 | |
* @category Lang | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @returns {boolean} Returns `true` if `value` is greater than or equal to | |
* `other`, else `false`. | |
* @see _.lte | |
* @example | |
* | |
* _.gte(3, 1); | |
* // => true | |
* | |
* _.gte(3, 3); | |
* // => true | |
* | |
* _.gte(1, 3); | |
* // => false | |
*/ | |
var gte = createRelationalOperation(function(value, other) { | |
return value >= other; | |
}); | |
/** | |
* Checks if `value` is likely an `arguments` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is an `arguments` object, | |
* else `false`. | |
* @example | |
* | |
* _.isArguments(function() { return arguments; }()); | |
* // => true | |
* | |
* _.isArguments([1, 2, 3]); | |
* // => false | |
*/ | |
function isArguments(value) { | |
// Safari 8.1 makes `arguments.callee` enumerable in strict mode. | |
return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') && | |
(!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag); | |
} | |
/** | |
* Checks if `value` is classified as an `Array` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is an array, else `false`. | |
* @example | |
* | |
* _.isArray([1, 2, 3]); | |
* // => true | |
* | |
* _.isArray(document.body.children); | |
* // => false | |
* | |
* _.isArray('abc'); | |
* // => false | |
* | |
* _.isArray(_.noop); | |
* // => false | |
*/ | |
var isArray = Array.isArray; | |
/** | |
* Checks if `value` is classified as an `ArrayBuffer` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.3.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is an array buffer, else `false`. | |
* @example | |
* | |
* _.isArrayBuffer(new ArrayBuffer(2)); | |
* // => true | |
* | |
* _.isArrayBuffer(new Array(2)); | |
* // => false | |
*/ | |
var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer; | |
/** | |
* Checks if `value` is array-like. A value is considered array-like if it's | |
* not a function and has a `value.length` that's an integer greater than or | |
* equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is array-like, else `false`. | |
* @example | |
* | |
* _.isArrayLike([1, 2, 3]); | |
* // => true | |
* | |
* _.isArrayLike(document.body.children); | |
* // => true | |
* | |
* _.isArrayLike('abc'); | |
* // => true | |
* | |
* _.isArrayLike(_.noop); | |
* // => false | |
*/ | |
function isArrayLike(value) { | |
return value != null && isLength(value.length) && !isFunction(value); | |
} | |
/** | |
* This method is like `_.isArrayLike` except that it also checks if `value` | |
* is an object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is an array-like object, | |
* else `false`. | |
* @example | |
* | |
* _.isArrayLikeObject([1, 2, 3]); | |
* // => true | |
* | |
* _.isArrayLikeObject(document.body.children); | |
* // => true | |
* | |
* _.isArrayLikeObject('abc'); | |
* // => false | |
* | |
* _.isArrayLikeObject(_.noop); | |
* // => false | |
*/ | |
function isArrayLikeObject(value) { | |
return isObjectLike(value) && isArrayLike(value); | |
} | |
/** | |
* Checks if `value` is classified as a boolean primitive or object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a boolean, else `false`. | |
* @example | |
* | |
* _.isBoolean(false); | |
* // => true | |
* | |
* _.isBoolean(null); | |
* // => false | |
*/ | |
function isBoolean(value) { | |
return value === true || value === false || | |
(isObjectLike(value) && objectToString.call(value) == boolTag); | |
} | |
/** | |
* Checks if `value` is a buffer. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.3.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a buffer, else `false`. | |
* @example | |
* | |
* _.isBuffer(new Buffer(2)); | |
* // => true | |
* | |
* _.isBuffer(new Uint8Array(2)); | |
* // => false | |
*/ | |
var isBuffer = nativeIsBuffer || stubFalse; | |
/** | |
* Checks if `value` is classified as a `Date` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a date object, else `false`. | |
* @example | |
* | |
* _.isDate(new Date); | |
* // => true | |
* | |
* _.isDate('Mon April 23 2012'); | |
* // => false | |
*/ | |
var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate; | |
/** | |
* Checks if `value` is likely a DOM element. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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) && !isPlainObject(value); | |
} | |
/** | |
* Checks if `value` is an empty object, collection, map, or set. | |
* | |
* Objects are considered empty if they have no own enumerable string keyed | |
* properties. | |
* | |
* Array-like values such as `arguments` objects, arrays, buffers, strings, or | |
* jQuery-like collections are considered empty if they have a `length` of `0`. | |
* Similarly, maps and sets are considered empty if they have a `size` of `0`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @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 (isArrayLike(value) && | |
(isArray(value) || typeof value == 'string' || | |
typeof value.splice == 'function' || isBuffer(value) || isArguments(value))) { | |
return !value.length; | |
} | |
var tag = getTag(value); | |
if (tag == mapTag || tag == setTag) { | |
return !value.size; | |
} | |
if (nonEnumShadows || isPrototype(value)) { | |
return !nativeKeys(value).length; | |
} | |
for (var key in value) { | |
if (hasOwnProperty.call(value, key)) { | |
return false; | |
} | |
} | |
return true; | |
} | |
/** | |
* Performs a deep comparison between two values to determine if they are | |
* equivalent. | |
* | |
* **Note:** This method supports comparing arrays, array buffers, booleans, | |
* date objects, error objects, maps, numbers, `Object` objects, regexes, | |
* sets, strings, symbols, and typed arrays. `Object` objects are compared | |
* by their own, not inherited, enumerable properties. Functions and DOM | |
* nodes are **not** supported. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @returns {boolean} Returns `true` if the values are equivalent, else `false`. | |
* @example | |
* | |
* var object = { 'a': 1 }; | |
* var other = { 'a': 1 }; | |
* | |
* _.isEqual(object, other); | |
* // => true | |
* | |
* object === other; | |
* // => false | |
*/ | |
function isEqual(value, other) { | |
return baseIsEqual(value, other); | |
} | |
/** | |
* This method is like `_.isEqual` except that it accepts `customizer` which | |
* is invoked to compare values. If `customizer` returns `undefined`, comparisons | |
* are handled by the method instead. The `customizer` is invoked with up to | |
* six arguments: (objValue, othValue [, index|key, object, other, stack]). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @param {Function} [customizer] The function to customize comparisons. | |
* @returns {boolean} Returns `true` if the values are equivalent, else `false`. | |
* @example | |
* | |
* function isGreeting(value) { | |
* return /^h(?:i|ello)$/.test(value); | |
* } | |
* | |
* function customizer(objValue, othValue) { | |
* if (isGreeting(objValue) && isGreeting(othValue)) { | |
* return true; | |
* } | |
* } | |
* | |
* var array = ['hello', 'goodbye']; | |
* var other = ['hi', 'goodbye']; | |
* | |
* _.isEqualWith(array, other, customizer); | |
* // => true | |
*/ | |
function isEqualWith(value, other, customizer) { | |
customizer = typeof customizer == 'function' ? customizer : undefined; | |
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 _ | |
* @since 3.0.0 | |
* @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) { | |
if (!isObjectLike(value)) { | |
return false; | |
} | |
return (objectToString.call(value) == errorTag) || | |
(typeof value.message == 'string' && typeof value.name == 'string'); | |
} | |
/** | |
* Checks if `value` is a finite primitive number. | |
* | |
* **Note:** This method is based on | |
* [`Number.isFinite`](https://mdn.io/Number/isFinite). | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a finite number, else `false`. | |
* @example | |
* | |
* _.isFinite(3); | |
* // => true | |
* | |
* _.isFinite(Number.MIN_VALUE); | |
* // => true | |
* | |
* _.isFinite(Infinity); | |
* // => false | |
* | |
* _.isFinite('3'); | |
* // => false | |
*/ | |
function isFinite(value) { | |
return typeof value == 'number' && nativeIsFinite(value); | |
} | |
/** | |
* Checks if `value` is classified as a `Function` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a function, else `false`. | |
* @example | |
* | |
* _.isFunction(_); | |
* // => true | |
* | |
* _.isFunction(/abc/); | |
* // => false | |
*/ | |
function isFunction(value) { | |
// The use of `Object#toString` avoids issues with the `typeof` operator | |
// in Safari 8-9 which returns 'object' for typed array and other constructors. | |
var tag = isObject(value) ? objectToString.call(value) : ''; | |
return tag == funcTag || tag == genTag; | |
} | |
/** | |
* Checks if `value` is an integer. | |
* | |
* **Note:** This method is based on | |
* [`Number.isInteger`](https://mdn.io/Number/isInteger). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is an integer, else `false`. | |
* @example | |
* | |
* _.isInteger(3); | |
* // => true | |
* | |
* _.isInteger(Number.MIN_VALUE); | |
* // => false | |
* | |
* _.isInteger(Infinity); | |
* // => false | |
* | |
* _.isInteger('3'); | |
* // => false | |
*/ | |
function isInteger(value) { | |
return typeof value == 'number' && value == toInteger(value); | |
} | |
/** | |
* Checks if `value` is a valid array-like length. | |
* | |
* **Note:** This method is loosely based on | |
* [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a valid length, else `false`. | |
* @example | |
* | |
* _.isLength(3); | |
* // => true | |
* | |
* _.isLength(Number.MIN_VALUE); | |
* // => false | |
* | |
* _.isLength(Infinity); | |
* // => false | |
* | |
* _.isLength('3'); | |
* // => false | |
*/ | |
function isLength(value) { | |
return typeof value == 'number' && | |
value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER; | |
} | |
/** | |
* Checks if `value` is the | |
* [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types) | |
* of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`) | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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(_.noop); | |
* // => true | |
* | |
* _.isObject(null); | |
* // => false | |
*/ | |
function isObject(value) { | |
var type = typeof value; | |
return !!value && (type == 'object' || type == 'function'); | |
} | |
/** | |
* Checks if `value` is object-like. A value is object-like if it's not `null` | |
* and has a `typeof` result of "object". | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is object-like, else `false`. | |
* @example | |
* | |
* _.isObjectLike({}); | |
* // => true | |
* | |
* _.isObjectLike([1, 2, 3]); | |
* // => true | |
* | |
* _.isObjectLike(_.noop); | |
* // => false | |
* | |
* _.isObjectLike(null); | |
* // => false | |
*/ | |
function isObjectLike(value) { | |
return !!value && typeof value == 'object'; | |
} | |
/** | |
* Checks if `value` is classified as a `Map` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.3.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a map, else `false`. | |
* @example | |
* | |
* _.isMap(new Map); | |
* // => true | |
* | |
* _.isMap(new WeakMap); | |
* // => false | |
*/ | |
var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap; | |
/** | |
* Performs a partial deep comparison between `object` and `source` to | |
* determine if `object` contains equivalent property values. | |
* | |
* **Note:** This method is equivalent to `_.matches` when `source` is | |
* partially applied. | |
* | |
* Partial comparisons will match empty array and empty object `source` | |
* values against any array or object value, respectively. See `_.isEqual` | |
* for a list of supported value comparisons. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Lang | |
* @param {Object} object The object to inspect. | |
* @param {Object} source The object of property values to match. | |
* @returns {boolean} Returns `true` if `object` is a match, else `false`. | |
* @example | |
* | |
* var object = { 'a': 1, 'b': 2 }; | |
* | |
* _.isMatch(object, { 'b': 2 }); | |
* // => true | |
* | |
* _.isMatch(object, { 'b': 1 }); | |
* // => false | |
*/ | |
function isMatch(object, source) { | |
return object === source || baseIsMatch(object, source, getMatchData(source)); | |
} | |
/** | |
* This method is like `_.isMatch` except that it accepts `customizer` which | |
* is invoked to compare values. If `customizer` returns `undefined`, comparisons | |
* are handled by the method instead. The `customizer` is invoked with five | |
* arguments: (objValue, srcValue, index|key, object, source). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @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 comparisons. | |
* @returns {boolean} Returns `true` if `object` is a match, else `false`. | |
* @example | |
* | |
* function isGreeting(value) { | |
* return /^h(?:i|ello)$/.test(value); | |
* } | |
* | |
* function customizer(objValue, srcValue) { | |
* if (isGreeting(objValue) && isGreeting(srcValue)) { | |
* return true; | |
* } | |
* } | |
* | |
* var object = { 'greeting': 'hello' }; | |
* var source = { 'greeting': 'hi' }; | |
* | |
* _.isMatchWith(object, source, customizer); | |
* // => true | |
*/ | |
function isMatchWith(object, source, customizer) { | |
customizer = typeof customizer == 'function' ? customizer : undefined; | |
return baseIsMatch(object, source, getMatchData(source), customizer); | |
} | |
/** | |
* Checks if `value` is `NaN`. | |
* | |
* **Note:** This method is based on | |
* [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as | |
* global [`isNaN`](https://mdn.io/isNaN) which returns `true` for | |
* `undefined` and other non-number values. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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 | |
// ActiveX objects in IE. | |
return isNumber(value) && value != +value; | |
} | |
/** | |
* Checks if `value` is a pristine native function. | |
* | |
* **Note:** This method can't reliably detect native functions in the presence | |
* of the core-js package because core-js circumvents this kind of detection. | |
* Despite multiple requests, the core-js maintainer has made it clear: any | |
* attempt to fix the detection will be obstructed. As a result, we're left | |
* with little choice but to throw an error. Unfortunately, this also affects | |
* packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill), | |
* which rely on core-js. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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 (isMaskable(value)) { | |
throw new Error('This method is not supported with core-js. Try https://github.com/es-shims.'); | |
} | |
return baseIsNative(value); | |
} | |
/** | |
* Checks if `value` is `null`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @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; | |
} | |
/** | |
* Checks if `value` is `null` or `undefined`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is nullish, else `false`. | |
* @example | |
* | |
* _.isNil(null); | |
* // => true | |
* | |
* _.isNil(void 0); | |
* // => true | |
* | |
* _.isNil(NaN); | |
* // => false | |
*/ | |
function isNil(value) { | |
return value == null; | |
} | |
/** | |
* 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 _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a number, else `false`. | |
* @example | |
* | |
* _.isNumber(3); | |
* // => true | |
* | |
* _.isNumber(Number.MIN_VALUE); | |
* // => true | |
* | |
* _.isNumber(Infinity); | |
* // => true | |
* | |
* _.isNumber('3'); | |
* // => false | |
*/ | |
function isNumber(value) { | |
return typeof value == 'number' || | |
(isObjectLike(value) && objectToString.call(value) == numberTag); | |
} | |
/** | |
* Checks if `value` is a plain object, that is, an object created by the | |
* `Object` constructor or one with a `[[Prototype]]` of `null`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.8.0 | |
* @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 | |
*/ | |
function isPlainObject(value) { | |
if (!isObjectLike(value) || | |
objectToString.call(value) != objectTag || isHostObject(value)) { | |
return false; | |
} | |
var proto = getPrototype(value); | |
if (proto === null) { | |
return true; | |
} | |
var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor; | |
return (typeof Ctor == 'function' && | |
Ctor instanceof Ctor && funcToString.call(Ctor) == objectCtorString); | |
} | |
/** | |
* Checks if `value` is classified as a `RegExp` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.1.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a regexp, else `false`. | |
* @example | |
* | |
* _.isRegExp(/abc/); | |
* // => true | |
* | |
* _.isRegExp('/abc/'); | |
* // => false | |
*/ | |
var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp; | |
/** | |
* Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754 | |
* double precision number which isn't the result of a rounded unsafe integer. | |
* | |
* **Note:** This method is based on | |
* [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a safe integer, else `false`. | |
* @example | |
* | |
* _.isSafeInteger(3); | |
* // => true | |
* | |
* _.isSafeInteger(Number.MIN_VALUE); | |
* // => false | |
* | |
* _.isSafeInteger(Infinity); | |
* // => false | |
* | |
* _.isSafeInteger('3'); | |
* // => false | |
*/ | |
function isSafeInteger(value) { | |
return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER; | |
} | |
/** | |
* Checks if `value` is classified as a `Set` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.3.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a set, else `false`. | |
* @example | |
* | |
* _.isSet(new Set); | |
* // => true | |
* | |
* _.isSet(new WeakSet); | |
* // => false | |
*/ | |
var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet; | |
/** | |
* Checks if `value` is classified as a `String` primitive or object. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a string, else `false`. | |
* @example | |
* | |
* _.isString('abc'); | |
* // => true | |
* | |
* _.isString(1); | |
* // => false | |
*/ | |
function isString(value) { | |
return typeof value == 'string' || | |
(!isArray(value) && isObjectLike(value) && objectToString.call(value) == stringTag); | |
} | |
/** | |
* Checks if `value` is classified as a `Symbol` primitive or object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a symbol, else `false`. | |
* @example | |
* | |
* _.isSymbol(Symbol.iterator); | |
* // => true | |
* | |
* _.isSymbol('abc'); | |
* // => false | |
*/ | |
function isSymbol(value) { | |
return typeof value == 'symbol' || | |
(isObjectLike(value) && objectToString.call(value) == symbolTag); | |
} | |
/** | |
* Checks if `value` is classified as a typed array. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a typed array, else `false`. | |
* @example | |
* | |
* _.isTypedArray(new Uint8Array); | |
* // => true | |
* | |
* _.isTypedArray([]); | |
* // => false | |
*/ | |
var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray; | |
/** | |
* Checks if `value` is `undefined`. | |
* | |
* @static | |
* @since 0.1.0 | |
* @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; | |
} | |
/** | |
* Checks if `value` is classified as a `WeakMap` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.3.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a weak map, else `false`. | |
* @example | |
* | |
* _.isWeakMap(new WeakMap); | |
* // => true | |
* | |
* _.isWeakMap(new Map); | |
* // => false | |
*/ | |
function isWeakMap(value) { | |
return isObjectLike(value) && getTag(value) == weakMapTag; | |
} | |
/** | |
* Checks if `value` is classified as a `WeakSet` object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.3.0 | |
* @category Lang | |
* @param {*} value The value to check. | |
* @returns {boolean} Returns `true` if `value` is a weak set, else `false`. | |
* @example | |
* | |
* _.isWeakSet(new WeakSet); | |
* // => true | |
* | |
* _.isWeakSet(new Set); | |
* // => false | |
*/ | |
function isWeakSet(value) { | |
return isObjectLike(value) && objectToString.call(value) == weakSetTag; | |
} | |
/** | |
* Checks if `value` is less than `other`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.9.0 | |
* @category Lang | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @returns {boolean} Returns `true` if `value` is less than `other`, | |
* else `false`. | |
* @see _.gt | |
* @example | |
* | |
* _.lt(1, 3); | |
* // => true | |
* | |
* _.lt(3, 3); | |
* // => false | |
* | |
* _.lt(3, 1); | |
* // => false | |
*/ | |
var lt = createRelationalOperation(baseLt); | |
/** | |
* Checks if `value` is less than or equal to `other`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.9.0 | |
* @category Lang | |
* @param {*} value The value to compare. | |
* @param {*} other The other value to compare. | |
* @returns {boolean} Returns `true` if `value` is less than or equal to | |
* `other`, else `false`. | |
* @see _.gte | |
* @example | |
* | |
* _.lte(1, 3); | |
* // => true | |
* | |
* _.lte(3, 3); | |
* // => true | |
* | |
* _.lte(3, 1); | |
* // => false | |
*/ | |
var lte = createRelationalOperation(function(value, other) { | |
return value <= other; | |
}); | |
/** | |
* Converts `value` to an array. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Lang | |
* @param {*} value The value to convert. | |
* @returns {Array} Returns the converted array. | |
* @example | |
* | |
* _.toArray({ 'a': 1, 'b': 2 }); | |
* // => [1, 2] | |
* | |
* _.toArray('abc'); | |
* // => ['a', 'b', 'c'] | |
* | |
* _.toArray(1); | |
* // => [] | |
* | |
* _.toArray(null); | |
* // => [] | |
*/ | |
function toArray(value) { | |
if (!value) { | |
return []; | |
} | |
if (isArrayLike(value)) { | |
return isString(value) ? stringToArray(value) : copyArray(value); | |
} | |
if (iteratorSymbol && value[iteratorSymbol]) { | |
return iteratorToArray(value[iteratorSymbol]()); | |
} | |
var tag = getTag(value), | |
func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values); | |
return func(value); | |
} | |
/** | |
* Converts `value` to a finite number. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.12.0 | |
* @category Lang | |
* @param {*} value The value to convert. | |
* @returns {number} Returns the converted number. | |
* @example | |
* | |
* _.toFinite(3.2); | |
* // => 3.2 | |
* | |
* _.toFinite(Number.MIN_VALUE); | |
* // => 5e-324 | |
* | |
* _.toFinite(Infinity); | |
* // => 1.7976931348623157e+308 | |
* | |
* _.toFinite('3.2'); | |
* // => 3.2 | |
*/ | |
function toFinite(value) { | |
if (!value) { | |
return value === 0 ? value : 0; | |
} | |
value = toNumber(value); | |
if (value === INFINITY || value === -INFINITY) { | |
var sign = (value < 0 ? -1 : 1); | |
return sign * MAX_INTEGER; | |
} | |
return value === value ? value : 0; | |
} | |
/** | |
* Converts `value` to an integer. | |
* | |
* **Note:** This method is loosely based on | |
* [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to convert. | |
* @returns {number} Returns the converted integer. | |
* @example | |
* | |
* _.toInteger(3.2); | |
* // => 3 | |
* | |
* _.toInteger(Number.MIN_VALUE); | |
* // => 0 | |
* | |
* _.toInteger(Infinity); | |
* // => 1.7976931348623157e+308 | |
* | |
* _.toInteger('3.2'); | |
* // => 3 | |
*/ | |
function toInteger(value) { | |
var result = toFinite(value), | |
remainder = result % 1; | |
return result === result ? (remainder ? result - remainder : result) : 0; | |
} | |
/** | |
* Converts `value` to an integer suitable for use as the length of an | |
* array-like object. | |
* | |
* **Note:** This method is based on | |
* [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to convert. | |
* @returns {number} Returns the converted integer. | |
* @example | |
* | |
* _.toLength(3.2); | |
* // => 3 | |
* | |
* _.toLength(Number.MIN_VALUE); | |
* // => 0 | |
* | |
* _.toLength(Infinity); | |
* // => 4294967295 | |
* | |
* _.toLength('3.2'); | |
* // => 3 | |
*/ | |
function toLength(value) { | |
return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0; | |
} | |
/** | |
* Converts `value` to a number. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to process. | |
* @returns {number} Returns the number. | |
* @example | |
* | |
* _.toNumber(3.2); | |
* // => 3.2 | |
* | |
* _.toNumber(Number.MIN_VALUE); | |
* // => 5e-324 | |
* | |
* _.toNumber(Infinity); | |
* // => Infinity | |
* | |
* _.toNumber('3.2'); | |
* // => 3.2 | |
*/ | |
function toNumber(value) { | |
if (typeof value == 'number') { | |
return value; | |
} | |
if (isSymbol(value)) { | |
return NAN; | |
} | |
if (isObject(value)) { | |
var other = typeof value.valueOf == 'function' ? value.valueOf() : value; | |
value = isObject(other) ? (other + '') : other; | |
} | |
if (typeof value != 'string') { | |
return value === 0 ? value : +value; | |
} | |
value = value.replace(reTrim, ''); | |
var isBinary = reIsBinary.test(value); | |
return (isBinary || reIsOctal.test(value)) | |
? freeParseInt(value.slice(2), isBinary ? 2 : 8) | |
: (reIsBadHex.test(value) ? NAN : +value); | |
} | |
/** | |
* Converts `value` to a plain object flattening inherited enumerable string | |
* keyed properties of `value` to own properties of the plain object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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 copyObject(value, keysIn(value)); | |
} | |
/** | |
* Converts `value` to a safe integer. A safe integer can be compared and | |
* represented correctly. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to convert. | |
* @returns {number} Returns the converted integer. | |
* @example | |
* | |
* _.toSafeInteger(3.2); | |
* // => 3 | |
* | |
* _.toSafeInteger(Number.MIN_VALUE); | |
* // => 0 | |
* | |
* _.toSafeInteger(Infinity); | |
* // => 9007199254740991 | |
* | |
* _.toSafeInteger('3.2'); | |
* // => 3 | |
*/ | |
function toSafeInteger(value) { | |
return baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER); | |
} | |
/** | |
* Converts `value` to a string. An empty string is returned for `null` | |
* and `undefined` values. The sign of `-0` is preserved. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Lang | |
* @param {*} value The value to process. | |
* @returns {string} Returns the string. | |
* @example | |
* | |
* _.toString(null); | |
* // => '' | |
* | |
* _.toString(-0); | |
* // => '-0' | |
* | |
* _.toString([1, 2, 3]); | |
* // => '1,2,3' | |
*/ | |
function toString(value) { | |
return value == null ? '' : baseToString(value); | |
} | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Assigns own enumerable string keyed properties of source objects to the | |
* destination object. Source objects are applied from left to right. | |
* Subsequent sources overwrite property assignments of previous sources. | |
* | |
* **Note:** This method mutates `object` and is loosely based on | |
* [`Object.assign`](https://mdn.io/Object/assign). | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.10.0 | |
* @category Object | |
* @param {Object} object The destination object. | |
* @param {...Object} [sources] The source objects. | |
* @returns {Object} Returns `object`. | |
* @see _.assignIn | |
* @example | |
* | |
* function Foo() { | |
* this.a = 1; | |
* } | |
* | |
* function Bar() { | |
* this.c = 3; | |
* } | |
* | |
* Foo.prototype.b = 2; | |
* Bar.prototype.d = 4; | |
* | |
* _.assign({ 'a': 0 }, new Foo, new Bar); | |
* // => { 'a': 1, 'c': 3 } | |
*/ | |
var assign = createAssigner(function(object, source) { | |
if (nonEnumShadows || isPrototype(source) || isArrayLike(source)) { | |
copyObject(source, keys(source), object); | |
return; | |
} | |
for (var key in source) { | |
if (hasOwnProperty.call(source, key)) { | |
assignValue(object, key, source[key]); | |
} | |
} | |
}); | |
/** | |
* This method is like `_.assign` except that it iterates over own and | |
* inherited source properties. | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @alias extend | |
* @category Object | |
* @param {Object} object The destination object. | |
* @param {...Object} [sources] The source objects. | |
* @returns {Object} Returns `object`. | |
* @see _.assign | |
* @example | |
* | |
* function Foo() { | |
* this.a = 1; | |
* } | |
* | |
* function Bar() { | |
* this.c = 3; | |
* } | |
* | |
* Foo.prototype.b = 2; | |
* Bar.prototype.d = 4; | |
* | |
* _.assignIn({ 'a': 0 }, new Foo, new Bar); | |
* // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 } | |
*/ | |
var assignIn = createAssigner(function(object, source) { | |
copyObject(source, keysIn(source), object); | |
}); | |
/** | |
* This method is like `_.assignIn` except that it accepts `customizer` | |
* which is invoked to produce the assigned values. If `customizer` returns | |
* `undefined`, assignment is handled by the method instead. The `customizer` | |
* is invoked with five arguments: (objValue, srcValue, key, object, source). | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @alias extendWith | |
* @category Object | |
* @param {Object} object The destination object. | |
* @param {...Object} sources The source objects. | |
* @param {Function} [customizer] The function to customize assigned values. | |
* @returns {Object} Returns `object`. | |
* @see _.assignWith | |
* @example | |
* | |
* function customizer(objValue, srcValue) { | |
* return _.isUndefined(objValue) ? srcValue : objValue; | |
* } | |
* | |
* var defaults = _.partialRight(_.assignInWith, customizer); | |
* | |
* defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 }); | |
* // => { 'a': 1, 'b': 2 } | |
*/ | |
var assignInWith = createAssigner(function(object, source, srcIndex, customizer) { | |
copyObject(source, keysIn(source), object, customizer); | |
}); | |
/** | |
* This method is like `_.assign` except that it accepts `customizer` | |
* which is invoked to produce the assigned values. If `customizer` returns | |
* `undefined`, assignment is handled by the method instead. The `customizer` | |
* is invoked with five arguments: (objValue, srcValue, key, object, source). | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Object | |
* @param {Object} object The destination object. | |
* @param {...Object} sources The source objects. | |
* @param {Function} [customizer] The function to customize assigned values. | |
* @returns {Object} Returns `object`. | |
* @see _.assignInWith | |
* @example | |
* | |
* function customizer(objValue, srcValue) { | |
* return _.isUndefined(objValue) ? srcValue : objValue; | |
* } | |
* | |
* var defaults = _.partialRight(_.assignWith, customizer); | |
* | |
* defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 }); | |
* // => { 'a': 1, 'b': 2 } | |
*/ | |
var assignWith = createAssigner(function(object, source, srcIndex, customizer) { | |
copyObject(source, keys(source), object, customizer); | |
}); | |
/** | |
* Creates an array of values corresponding to `paths` of `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 1.0.0 | |
* @category Object | |
* @param {Object} object The object to iterate over. | |
* @param {...(string|string[])} [paths] The property paths of elements to pick. | |
* @returns {Array} Returns the picked values. | |
* @example | |
* | |
* var object = { 'a': [{ 'b': { 'c': 3 } }, 4] }; | |
* | |
* _.at(object, ['a[0].b.c', 'a[1]']); | |
* // => [3, 4] | |
*/ | |
var at = baseRest(function(object, paths) { | |
return baseAt(object, baseFlatten(paths, 1)); | |
}); | |
/** | |
* Creates an object that inherits from the `prototype` object. If a | |
* `properties` object is given, its own enumerable string keyed properties | |
* are assigned to the created object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.3.0 | |
* @category Object | |
* @param {Object} prototype The object to inherit from. | |
* @param {Object} [properties] The properties to assign to the object. | |
* @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) { | |
var result = baseCreate(prototype); | |
return properties ? baseAssign(result, properties) : result; | |
} | |
/** | |
* Assigns own and inherited enumerable string keyed properties of source | |
* objects to the destination object for all destination properties that | |
* resolve to `undefined`. Source objects are applied from left to right. | |
* Once a property is set, additional values of the same property are ignored. | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Object | |
* @param {Object} object The destination object. | |
* @param {...Object} [sources] The source objects. | |
* @returns {Object} Returns `object`. | |
* @see _.defaultsDeep | |
* @example | |
* | |
* _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 }); | |
* // => { 'a': 1, 'b': 2 } | |
*/ | |
var defaults = baseRest(function(args) { | |
args.push(undefined, assignInDefaults); | |
return apply(assignInWith, undefined, args); | |
}); | |
/** | |
* This method is like `_.defaults` except that it recursively assigns | |
* default properties. | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.10.0 | |
* @category Object | |
* @param {Object} object The destination object. | |
* @param {...Object} [sources] The source objects. | |
* @returns {Object} Returns `object`. | |
* @see _.defaults | |
* @example | |
* | |
* _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } }); | |
* // => { 'a': { 'b': 2, 'c': 3 } } | |
*/ | |
var defaultsDeep = baseRest(function(args) { | |
args.push(undefined, mergeDefaults); | |
return apply(mergeWith, 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. | |
* | |
* @static | |
* @memberOf _ | |
* @since 1.1.0 | |
* @category Object | |
* @param {Object} object The object to inspect. | |
* @param {Function} [predicate=_.identity] The function invoked per iteration. | |
* @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(o) { return o.age < 40; }); | |
* // => 'barney' (iteration order is not guaranteed) | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.findKey(users, { 'age': 1, 'active': true }); | |
* // => 'pebbles' | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.findKey(users, ['active', false]); | |
* // => 'fred' | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.findKey(users, 'active'); | |
* // => 'barney' | |
*/ | |
function findKey(object, predicate) { | |
return baseFindKey(object, getIteratee(predicate, 3), baseForOwn); | |
} | |
/** | |
* This method is like `_.findKey` except that it iterates over elements of | |
* a collection in the opposite order. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.0.0 | |
* @category Object | |
* @param {Object} object The object to inspect. | |
* @param {Function} [predicate=_.identity] The function invoked per iteration. | |
* @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(o) { return o.age < 40; }); | |
* // => returns 'pebbles' assuming `_.findKey` returns 'barney' | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.findLastKey(users, { 'age': 36, 'active': true }); | |
* // => 'barney' | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.findLastKey(users, ['active', false]); | |
* // => 'fred' | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.findLastKey(users, 'active'); | |
* // => 'pebbles' | |
*/ | |
function findLastKey(object, predicate) { | |
return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight); | |
} | |
/** | |
* Iterates over own and inherited enumerable string keyed properties of an | |
* object and invokes `iteratee` for each property. The iteratee is invoked | |
* with three arguments: (value, key, object). Iteratee functions may exit | |
* iteration early by explicitly returning `false`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.3.0 | |
* @category Object | |
* @param {Object} object The object to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @returns {Object} Returns `object`. | |
* @see _.forInRight | |
* @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', then 'c' (iteration order is not guaranteed). | |
*/ | |
function forIn(object, iteratee) { | |
return object == null | |
? object | |
: baseFor(object, getIteratee(iteratee, 3), keysIn); | |
} | |
/** | |
* This method is like `_.forIn` except that it iterates over properties of | |
* `object` in the opposite order. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.0.0 | |
* @category Object | |
* @param {Object} object The object to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @returns {Object} Returns `object`. | |
* @see _.forIn | |
* @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', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'. | |
*/ | |
function forInRight(object, iteratee) { | |
return object == null | |
? object | |
: baseForRight(object, getIteratee(iteratee, 3), keysIn); | |
} | |
/** | |
* Iterates over own enumerable string keyed properties of an object and | |
* invokes `iteratee` for each property. The iteratee is invoked with three | |
* arguments: (value, key, object). Iteratee functions may exit iteration | |
* early by explicitly returning `false`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.3.0 | |
* @category Object | |
* @param {Object} object The object to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @returns {Object} Returns `object`. | |
* @see _.forOwnRight | |
* @example | |
* | |
* function Foo() { | |
* this.a = 1; | |
* this.b = 2; | |
* } | |
* | |
* Foo.prototype.c = 3; | |
* | |
* _.forOwn(new Foo, function(value, key) { | |
* console.log(key); | |
* }); | |
* // => Logs 'a' then 'b' (iteration order is not guaranteed). | |
*/ | |
function forOwn(object, iteratee) { | |
return object && baseForOwn(object, getIteratee(iteratee, 3)); | |
} | |
/** | |
* This method is like `_.forOwn` except that it iterates over properties of | |
* `object` in the opposite order. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.0.0 | |
* @category Object | |
* @param {Object} object The object to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @returns {Object} Returns `object`. | |
* @see _.forOwn | |
* @example | |
* | |
* function Foo() { | |
* this.a = 1; | |
* this.b = 2; | |
* } | |
* | |
* Foo.prototype.c = 3; | |
* | |
* _.forOwnRight(new Foo, function(value, key) { | |
* console.log(key); | |
* }); | |
* // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'. | |
*/ | |
function forOwnRight(object, iteratee) { | |
return object && baseForOwnRight(object, getIteratee(iteratee, 3)); | |
} | |
/** | |
* Creates an array of function property names from own enumerable properties | |
* of `object`. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Object | |
* @param {Object} object The object to inspect. | |
* @returns {Array} Returns the function names. | |
* @see _.functionsIn | |
* @example | |
* | |
* function Foo() { | |
* this.a = _.constant('a'); | |
* this.b = _.constant('b'); | |
* } | |
* | |
* Foo.prototype.c = _.constant('c'); | |
* | |
* _.functions(new Foo); | |
* // => ['a', 'b'] | |
*/ | |
function functions(object) { | |
return object == null ? [] : baseFunctions(object, keys(object)); | |
} | |
/** | |
* Creates an array of function property names from own and inherited | |
* enumerable properties of `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Object | |
* @param {Object} object The object to inspect. | |
* @returns {Array} Returns the function names. | |
* @see _.functions | |
* @example | |
* | |
* function Foo() { | |
* this.a = _.constant('a'); | |
* this.b = _.constant('b'); | |
* } | |
* | |
* Foo.prototype.c = _.constant('c'); | |
* | |
* _.functionsIn(new Foo); | |
* // => ['a', 'b', 'c'] | |
*/ | |
function functionsIn(object) { | |
return object == null ? [] : baseFunctions(object, keysIn(object)); | |
} | |
/** | |
* Gets the value at `path` of `object`. If the resolved value is | |
* `undefined`, the `defaultValue` is returned in its place. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.7.0 | |
* @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 for `undefined` resolved values. | |
* @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, path); | |
return result === undefined ? defaultValue : result; | |
} | |
/** | |
* Checks if `path` is a direct property of `object`. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Object | |
* @param {Object} object The object to query. | |
* @param {Array|string} path The path to check. | |
* @returns {boolean} Returns `true` if `path` exists, else `false`. | |
* @example | |
* | |
* var object = { 'a': { 'b': 2 } }; | |
* var other = _.create({ 'a': _.create({ 'b': 2 }) }); | |
* | |
* _.has(object, 'a'); | |
* // => true | |
* | |
* _.has(object, 'a.b'); | |
* // => true | |
* | |
* _.has(object, ['a', 'b']); | |
* // => true | |
* | |
* _.has(other, 'a'); | |
* // => false | |
*/ | |
function has(object, path) { | |
return object != null && hasPath(object, path, baseHas); | |
} | |
/** | |
* Checks if `path` is a direct or inherited property of `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Object | |
* @param {Object} object The object to query. | |
* @param {Array|string} path The path to check. | |
* @returns {boolean} Returns `true` if `path` exists, else `false`. | |
* @example | |
* | |
* var object = _.create({ 'a': _.create({ 'b': 2 }) }); | |
* | |
* _.hasIn(object, 'a'); | |
* // => true | |
* | |
* _.hasIn(object, 'a.b'); | |
* // => true | |
* | |
* _.hasIn(object, ['a', 'b']); | |
* // => true | |
* | |
* _.hasIn(object, 'b'); | |
* // => false | |
*/ | |
function hasIn(object, path) { | |
return object != null && hasPath(object, path, baseHasIn); | |
} | |
/** | |
* 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. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.7.0 | |
* @category Object | |
* @param {Object} object The object to invert. | |
* @returns {Object} Returns the new inverted object. | |
* @example | |
* | |
* var object = { 'a': 1, 'b': 2, 'c': 1 }; | |
* | |
* _.invert(object); | |
* // => { '1': 'c', '2': 'b' } | |
*/ | |
var invert = createInverter(function(result, value, key) { | |
result[value] = key; | |
}, constant(identity)); | |
/** | |
* This method is like `_.invert` except that the inverted object is generated | |
* from the results of running each element of `object` thru `iteratee`. The | |
* corresponding inverted value of each inverted key is an array of keys | |
* responsible for generating the inverted value. The iteratee is invoked | |
* with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.1.0 | |
* @category Object | |
* @param {Object} object The object to invert. | |
* @param {Function} [iteratee=_.identity] The iteratee invoked per element. | |
* @returns {Object} Returns the new inverted object. | |
* @example | |
* | |
* var object = { 'a': 1, 'b': 2, 'c': 1 }; | |
* | |
* _.invertBy(object); | |
* // => { '1': ['a', 'c'], '2': ['b'] } | |
* | |
* _.invertBy(object, function(value) { | |
* return 'group' + value; | |
* }); | |
* // => { 'group1': ['a', 'c'], 'group2': ['b'] } | |
*/ | |
var invertBy = createInverter(function(result, value, key) { | |
if (hasOwnProperty.call(result, value)) { | |
result[value].push(key); | |
} else { | |
result[value] = [key]; | |
} | |
}, getIteratee); | |
/** | |
* Invokes the method at `path` of `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Object | |
* @param {Object} object The object to query. | |
* @param {Array|string} path The path of the method to invoke. | |
* @param {...*} [args] The arguments to invoke the method with. | |
* @returns {*} Returns the result of the invoked method. | |
* @example | |
* | |
* var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] }; | |
* | |
* _.invoke(object, 'a[0].b.c.slice', 1, 3); | |
* // => [2, 3] | |
*/ | |
var invoke = baseRest(baseInvoke); | |
/** | |
* Creates an array of the own enumerable property names of `object`. | |
* | |
* **Note:** Non-object values are coerced to objects. See the | |
* [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys) | |
* for more details. | |
* | |
* @static | |
* @since 0.1.0 | |
* @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'] | |
*/ | |
function keys(object) { | |
return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object); | |
} | |
/** | |
* Creates an array of the own and inherited enumerable property names of `object`. | |
* | |
* **Note:** Non-object values are coerced to objects. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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) { | |
return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object); | |
} | |
/** | |
* The opposite of `_.mapValues`; this method creates an object with the | |
* same values as `object` and keys generated by running each own enumerable | |
* string keyed property of `object` thru `iteratee`. The iteratee is invoked | |
* with three arguments: (value, key, object). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.8.0 | |
* @category Object | |
* @param {Object} object The object to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @returns {Object} Returns the new mapped object. | |
* @see _.mapValues | |
* @example | |
* | |
* _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) { | |
* return key + value; | |
* }); | |
* // => { 'a1': 1, 'b2': 2 } | |
*/ | |
function mapKeys(object, iteratee) { | |
var result = {}; | |
iteratee = getIteratee(iteratee, 3); | |
baseForOwn(object, function(value, key, object) { | |
result[iteratee(value, key, object)] = value; | |
}); | |
return result; | |
} | |
/** | |
* Creates an object with the same keys as `object` and values generated | |
* by running each own enumerable string keyed property of `object` thru | |
* `iteratee`. The iteratee is invoked with three arguments: | |
* (value, key, object). | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.4.0 | |
* @category Object | |
* @param {Object} object The object to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @returns {Object} Returns the new mapped object. | |
* @see _.mapKeys | |
* @example | |
* | |
* var users = { | |
* 'fred': { 'user': 'fred', 'age': 40 }, | |
* 'pebbles': { 'user': 'pebbles', 'age': 1 } | |
* }; | |
* | |
* _.mapValues(users, function(o) { return o.age; }); | |
* // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed) | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.mapValues(users, 'age'); | |
* // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed) | |
*/ | |
function mapValues(object, iteratee) { | |
var result = {}; | |
iteratee = getIteratee(iteratee, 3); | |
baseForOwn(object, function(value, key, object) { | |
result[key] = iteratee(value, key, object); | |
}); | |
return result; | |
} | |
/** | |
* This method is like `_.assign` except that it recursively merges own and | |
* inherited enumerable string keyed properties of source objects into the | |
* destination object. Source properties that resolve to `undefined` are | |
* skipped if a destination value exists. Array and plain object properties | |
* are merged recursively. Other objects and value types are overridden by | |
* assignment. Source objects are applied from left to right. Subsequent | |
* sources overwrite property assignments of previous sources. | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.5.0 | |
* @category Object | |
* @param {Object} object The destination object. | |
* @param {...Object} [sources] The source objects. | |
* @returns {Object} Returns `object`. | |
* @example | |
* | |
* var object = { | |
* 'a': [{ 'b': 2 }, { 'd': 4 }] | |
* }; | |
* | |
* var other = { | |
* 'a': [{ 'c': 3 }, { 'e': 5 }] | |
* }; | |
* | |
* _.merge(object, other); | |
* // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] } | |
*/ | |
var merge = createAssigner(function(object, source, srcIndex) { | |
baseMerge(object, source, srcIndex); | |
}); | |
/** | |
* This method is like `_.merge` except that it accepts `customizer` which | |
* 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 invoked with seven arguments: | |
* (objValue, srcValue, key, object, source, stack). | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Object | |
* @param {Object} object The destination object. | |
* @param {...Object} sources The source objects. | |
* @param {Function} customizer The function to customize assigned values. | |
* @returns {Object} Returns `object`. | |
* @example | |
* | |
* function customizer(objValue, srcValue) { | |
* if (_.isArray(objValue)) { | |
* return objValue.concat(srcValue); | |
* } | |
* } | |
* | |
* var object = { 'a': [1], 'b': [2] }; | |
* var other = { 'a': [3], 'b': [4] }; | |
* | |
* _.mergeWith(object, other, customizer); | |
* // => { 'a': [1, 3], 'b': [2, 4] } | |
*/ | |
var mergeWith = createAssigner(function(object, source, srcIndex, customizer) { | |
baseMerge(object, source, srcIndex, customizer); | |
}); | |
/** | |
* The opposite of `_.pick`; this method creates an object composed of the | |
* own and inherited enumerable string keyed properties of `object` that are | |
* not omitted. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Object | |
* @param {Object} object The source object. | |
* @param {...(string|string[])} [props] The property identifiers to omit. | |
* @returns {Object} Returns the new object. | |
* @example | |
* | |
* var object = { 'a': 1, 'b': '2', 'c': 3 }; | |
* | |
* _.omit(object, ['a', 'c']); | |
* // => { 'b': '2' } | |
*/ | |
var omit = baseRest(function(object, props) { | |
if (object == null) { | |
return {}; | |
} | |
props = arrayMap(baseFlatten(props, 1), toKey); | |
return basePick(object, baseDifference(getAllKeysIn(object), props)); | |
}); | |
/** | |
* The opposite of `_.pickBy`; this method creates an object composed of | |
* the own and inherited enumerable string keyed properties of `object` that | |
* `predicate` doesn't return truthy for. The predicate is invoked with two | |
* arguments: (value, key). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Object | |
* @param {Object} object The source object. | |
* @param {Function} [predicate=_.identity] The function invoked per property. | |
* @returns {Object} Returns the new object. | |
* @example | |
* | |
* var object = { 'a': 1, 'b': '2', 'c': 3 }; | |
* | |
* _.omitBy(object, _.isNumber); | |
* // => { 'b': '2' } | |
*/ | |
function omitBy(object, predicate) { | |
return pickBy(object, negate(getIteratee(predicate))); | |
} | |
/** | |
* Creates an object composed of the picked `object` properties. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Object | |
* @param {Object} object The source object. | |
* @param {...(string|string[])} [props] The property identifiers to pick. | |
* @returns {Object} Returns the new object. | |
* @example | |
* | |
* var object = { 'a': 1, 'b': '2', 'c': 3 }; | |
* | |
* _.pick(object, ['a', 'c']); | |
* // => { 'a': 1, 'c': 3 } | |
*/ | |
var pick = baseRest(function(object, props) { | |
return object == null ? {} : basePick(object, arrayMap(baseFlatten(props, 1), toKey)); | |
}); | |
/** | |
* Creates an object composed of the `object` properties `predicate` returns | |
* truthy for. The predicate is invoked with two arguments: (value, key). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Object | |
* @param {Object} object The source object. | |
* @param {Function} [predicate=_.identity] The function invoked per property. | |
* @returns {Object} Returns the new object. | |
* @example | |
* | |
* var object = { 'a': 1, 'b': '2', 'c': 3 }; | |
* | |
* _.pickBy(object, _.isNumber); | |
* // => { 'a': 1, 'c': 3 } | |
*/ | |
function pickBy(object, predicate) { | |
return object == null ? {} : basePickBy(object, getAllKeysIn(object), getIteratee(predicate)); | |
} | |
/** | |
* This method is like `_.get` except that if the resolved value is a | |
* function it's invoked with the `this` binding of its parent object and | |
* its result is returned. | |
* | |
* @static | |
* @since 0.1.0 | |
* @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 for `undefined` resolved values. | |
* @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[0].b.c3', 'default'); | |
* // => 'default' | |
* | |
* _.result(object, 'a[0].b.c3', _.constant('default')); | |
* // => 'default' | |
*/ | |
function result(object, path, defaultValue) { | |
path = isKey(path, object) ? [path] : castPath(path); | |
var index = -1, | |
length = path.length; | |
// Ensure the loop is entered when path is empty. | |
if (!length) { | |
object = undefined; | |
length = 1; | |
} | |
while (++index < length) { | |
var value = object == null ? undefined : object[toKey(path[index])]; | |
if (value === undefined) { | |
index = length; | |
value = defaultValue; | |
} | |
object = isFunction(value) ? value.call(object) : value; | |
} | |
return object; | |
} | |
/** | |
* Sets the value at `path` of `object`. If a portion of `path` doesn't exist, | |
* it's created. Arrays are created for missing index properties while objects | |
* are created for all other missing properties. Use `_.setWith` to customize | |
* `path` creation. | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.7.0 | |
* @category Object | |
* @param {Object} object The object to modify. | |
* @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) { | |
return object == null ? object : baseSet(object, path, value); | |
} | |
/** | |
* This method is like `_.set` except that it accepts `customizer` which is | |
* invoked to produce the objects of `path`. If `customizer` returns `undefined` | |
* path creation is handled by the method instead. The `customizer` is invoked | |
* with three arguments: (nsValue, key, nsObject). | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Object | |
* @param {Object} object The object to modify. | |
* @param {Array|string} path The path of the property to set. | |
* @param {*} value The value to set. | |
* @param {Function} [customizer] The function to customize assigned values. | |
* @returns {Object} Returns `object`. | |
* @example | |
* | |
* var object = {}; | |
* | |
* _.setWith(object, '[0][1]', 'a', Object); | |
* // => { '0': { '1': 'a' } } | |
*/ | |
function setWith(object, path, value, customizer) { | |
customizer = typeof customizer == 'function' ? customizer : undefined; | |
return object == null ? object : baseSet(object, path, value, customizer); | |
} | |
/** | |
* Creates an array of own enumerable string keyed-value pairs for `object` | |
* which can be consumed by `_.fromPairs`. If `object` is a map or set, its | |
* entries are returned. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @alias entries | |
* @category Object | |
* @param {Object} object The object to query. | |
* @returns {Array} Returns the key-value pairs. | |
* @example | |
* | |
* function Foo() { | |
* this.a = 1; | |
* this.b = 2; | |
* } | |
* | |
* Foo.prototype.c = 3; | |
* | |
* _.toPairs(new Foo); | |
* // => [['a', 1], ['b', 2]] (iteration order is not guaranteed) | |
*/ | |
var toPairs = createToPairs(keys); | |
/** | |
* Creates an array of own and inherited enumerable string keyed-value pairs | |
* for `object` which can be consumed by `_.fromPairs`. If `object` is a map | |
* or set, its entries are returned. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @alias entriesIn | |
* @category Object | |
* @param {Object} object The object to query. | |
* @returns {Array} Returns the key-value pairs. | |
* @example | |
* | |
* function Foo() { | |
* this.a = 1; | |
* this.b = 2; | |
* } | |
* | |
* Foo.prototype.c = 3; | |
* | |
* _.toPairsIn(new Foo); | |
* // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed) | |
*/ | |
var toPairsIn = createToPairs(keysIn); | |
/** | |
* An alternative to `_.reduce`; this method transforms `object` to a new | |
* `accumulator` object which is the result of running each of its own | |
* enumerable string keyed properties thru `iteratee`, with each invocation | |
* potentially mutating the `accumulator` object. If `accumulator` is not | |
* provided, a new object with the same `[[Prototype]]` will be used. The | |
* iteratee is invoked with four arguments: (accumulator, value, key, object). | |
* Iteratee functions may exit iteration early by explicitly returning `false`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 1.3.0 | |
* @category Object | |
* @param {Object} object The object to iterate over. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @param {*} [accumulator] The custom accumulator value. | |
* @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, 'c': 1 }, function(result, value, key) { | |
* (result[value] || (result[value] = [])).push(key); | |
* }, {}); | |
* // => { '1': ['a', 'c'], '2': ['b'] } | |
*/ | |
function transform(object, iteratee, accumulator) { | |
var isArr = isArray(object) || isTypedArray(object); | |
iteratee = getIteratee(iteratee, 4); | |
if (accumulator == null) { | |
if (isArr || isObject(object)) { | |
var Ctor = object.constructor; | |
if (isArr) { | |
accumulator = isArray(object) ? new Ctor : []; | |
} else { | |
accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {}; | |
} | |
} else { | |
accumulator = {}; | |
} | |
} | |
(isArr ? arrayEach : baseForOwn)(object, function(value, index, object) { | |
return iteratee(accumulator, value, index, object); | |
}); | |
return accumulator; | |
} | |
/** | |
* Removes the property at `path` of `object`. | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Object | |
* @param {Object} object The object to modify. | |
* @param {Array|string} path The path of the property to unset. | |
* @returns {boolean} Returns `true` if the property is deleted, else `false`. | |
* @example | |
* | |
* var object = { 'a': [{ 'b': { 'c': 7 } }] }; | |
* _.unset(object, 'a[0].b.c'); | |
* // => true | |
* | |
* console.log(object); | |
* // => { 'a': [{ 'b': {} }] }; | |
* | |
* _.unset(object, ['a', '0', 'b', 'c']); | |
* // => true | |
* | |
* console.log(object); | |
* // => { 'a': [{ 'b': {} }] }; | |
*/ | |
function unset(object, path) { | |
return object == null ? true : baseUnset(object, path); | |
} | |
/** | |
* This method is like `_.set` except that accepts `updater` to produce the | |
* value to set. Use `_.updateWith` to customize `path` creation. The `updater` | |
* is invoked with one argument: (value). | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.6.0 | |
* @category Object | |
* @param {Object} object The object to modify. | |
* @param {Array|string} path The path of the property to set. | |
* @param {Function} updater The function to produce the updated value. | |
* @returns {Object} Returns `object`. | |
* @example | |
* | |
* var object = { 'a': [{ 'b': { 'c': 3 } }] }; | |
* | |
* _.update(object, 'a[0].b.c', function(n) { return n * n; }); | |
* console.log(object.a[0].b.c); | |
* // => 9 | |
* | |
* _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; }); | |
* console.log(object.x[0].y.z); | |
* // => 0 | |
*/ | |
function update(object, path, updater) { | |
return object == null ? object : baseUpdate(object, path, castFunction(updater)); | |
} | |
/** | |
* This method is like `_.update` except that it accepts `customizer` which is | |
* invoked to produce the objects of `path`. If `customizer` returns `undefined` | |
* path creation is handled by the method instead. The `customizer` is invoked | |
* with three arguments: (nsValue, key, nsObject). | |
* | |
* **Note:** This method mutates `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.6.0 | |
* @category Object | |
* @param {Object} object The object to modify. | |
* @param {Array|string} path The path of the property to set. | |
* @param {Function} updater The function to produce the updated value. | |
* @param {Function} [customizer] The function to customize assigned values. | |
* @returns {Object} Returns `object`. | |
* @example | |
* | |
* var object = {}; | |
* | |
* _.updateWith(object, '[0][1]', _.constant('a'), Object); | |
* // => { '0': { '1': 'a' } } | |
*/ | |
function updateWith(object, path, updater, customizer) { | |
customizer = typeof customizer == 'function' ? customizer : undefined; | |
return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer); | |
} | |
/** | |
* Creates an array of the own enumerable string keyed property values of `object`. | |
* | |
* **Note:** Non-object values are coerced to objects. | |
* | |
* @static | |
* @since 0.1.0 | |
* @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 object ? baseValues(object, keys(object)) : []; | |
} | |
/** | |
* Creates an array of the own and inherited enumerable string keyed property | |
* values of `object`. | |
* | |
* **Note:** Non-object values are coerced to objects. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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 object == null ? [] : baseValues(object, keysIn(object)); | |
} | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Clamps `number` within the inclusive `lower` and `upper` bounds. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Number | |
* @param {number} number The number to clamp. | |
* @param {number} [lower] The lower bound. | |
* @param {number} upper The upper bound. | |
* @returns {number} Returns the clamped number. | |
* @example | |
* | |
* _.clamp(-10, -5, 5); | |
* // => -5 | |
* | |
* _.clamp(10, -5, 5); | |
* // => 5 | |
*/ | |
function clamp(number, lower, upper) { | |
if (upper === undefined) { | |
upper = lower; | |
lower = undefined; | |
} | |
if (upper !== undefined) { | |
upper = toNumber(upper); | |
upper = upper === upper ? upper : 0; | |
} | |
if (lower !== undefined) { | |
lower = toNumber(lower); | |
lower = lower === lower ? lower : 0; | |
} | |
return baseClamp(toNumber(number), lower, upper); | |
} | |
/** | |
* Checks if `n` is between `start` and up to, but not including, `end`. If | |
* `end` is not specified, it's set to `start` with `start` then set to `0`. | |
* If `start` is greater than `end` the params are swapped to support | |
* negative ranges. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.3.0 | |
* @category Number | |
* @param {number} number 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 `number` is in the range, else `false`. | |
* @see _.range, _.rangeRight | |
* @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 | |
* | |
* _.inRange(-3, -2, -6); | |
* // => true | |
*/ | |
function inRange(number, start, end) { | |
start = toFinite(start); | |
if (end === undefined) { | |
end = start; | |
start = 0; | |
} else { | |
end = toFinite(end); | |
} | |
number = toNumber(number); | |
return baseInRange(number, start, end); | |
} | |
/** | |
* Produces a random number between the inclusive `lower` and `upper` bounds. | |
* If only one argument is provided a number between `0` and the given number | |
* is returned. If `floating` is `true`, or either `lower` or `upper` are | |
* floats, a floating-point number is returned instead of an integer. | |
* | |
* **Note:** JavaScript follows the IEEE-754 standard for resolving | |
* floating-point values which can produce unexpected results. | |
* | |
* @static | |
* @memberOf _ | |
* @since 0.7.0 | |
* @category Number | |
* @param {number} [lower=0] The lower bound. | |
* @param {number} [upper=1] The upper bound. | |
* @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(lower, upper, floating) { | |
if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) { | |
upper = floating = undefined; | |
} | |
if (floating === undefined) { | |
if (typeof upper == 'boolean') { | |
floating = upper; | |
upper = undefined; | |
} | |
else if (typeof lower == 'boolean') { | |
floating = lower; | |
lower = undefined; | |
} | |
} | |
if (lower === undefined && upper === undefined) { | |
lower = 0; | |
upper = 1; | |
} | |
else { | |
lower = toFinite(lower); | |
if (upper === undefined) { | |
upper = lower; | |
lower = 0; | |
} else { | |
upper = toFinite(upper); | |
} | |
} | |
if (lower > upper) { | |
var temp = lower; | |
lower = upper; | |
upper = temp; | |
} | |
if (floating || lower % 1 || upper % 1) { | |
var rand = nativeRandom(); | |
return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper); | |
} | |
return baseRandom(lower, upper); | |
} | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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 ? capitalize(word) : word); | |
}); | |
/** | |
* Converts the first character of `string` to upper case and the remaining | |
* to lower case. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category String | |
* @param {string} [string=''] The string to capitalize. | |
* @returns {string} Returns the capitalized string. | |
* @example | |
* | |
* _.capitalize('FRED'); | |
* // => 'Fred' | |
*/ | |
function capitalize(string) { | |
return upperFirst(toString(string).toLowerCase()); | |
} | |
/** | |
* Deburrs `string` by converting | |
* [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table) | |
* and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A) | |
* letters to basic Latin letters and removing | |
* [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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 = toString(string); | |
return string && string.replace(reLatin, deburrLetter).replace(reComboMark, ''); | |
} | |
/** | |
* Checks if `string` ends with the given target string. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category String | |
* @param {string} [string=''] The string to inspect. | |
* @param {string} [target] The string to search for. | |
* @param {number} [position=string.length] The position to search up to. | |
* @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 = toString(string); | |
target = baseToString(target); | |
var length = string.length; | |
position = position === undefined | |
? length | |
: baseClamp(toInteger(position), 0, length); | |
var end = position; | |
position -= target.length; | |
return position >= 0 && string.slice(position, end) == target; | |
} | |
/** | |
* 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 need 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 IE < 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 | |
* @since 0.1.0 | |
* @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) { | |
string = toString(string); | |
return (string && reHasUnescapedHtml.test(string)) | |
? string.replace(reUnescapedHtml, escapeHtmlChar) | |
: string; | |
} | |
/** | |
* Escapes the `RegExp` special characters "^", "$", "\", ".", "*", "+", | |
* "?", "(", ")", "[", "]", "{", "}", and "|" in `string`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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 = toString(string); | |
return (string && reHasRegExpChar.test(string)) | |
? string.replace(reRegExpChar, '\\$&') | |
: string; | |
} | |
/** | |
* Converts `string` to | |
* [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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(); | |
}); | |
/** | |
* Converts `string`, as space separated words, to lower case. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to convert. | |
* @returns {string} Returns the lower cased string. | |
* @example | |
* | |
* _.lowerCase('--Foo-Bar--'); | |
* // => 'foo bar' | |
* | |
* _.lowerCase('fooBar'); | |
* // => 'foo bar' | |
* | |
* _.lowerCase('__FOO_BAR__'); | |
* // => 'foo bar' | |
*/ | |
var lowerCase = createCompounder(function(result, word, index) { | |
return result + (index ? ' ' : '') + word.toLowerCase(); | |
}); | |
/** | |
* Converts the first character of `string` to lower case. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to convert. | |
* @returns {string} Returns the converted string. | |
* @example | |
* | |
* _.lowerFirst('Fred'); | |
* // => 'fred' | |
* | |
* _.lowerFirst('FRED'); | |
* // => 'fRED' | |
*/ | |
var lowerFirst = createCaseFirst('toLowerCase'); | |
/** | |
* Pads `string` on the left and right sides if it's shorter than `length`. | |
* Padding characters are truncated if they can't be evenly divided by `length`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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 = toString(string); | |
length = toInteger(length); | |
var strLength = length ? stringSize(string) : 0; | |
if (!length || strLength >= length) { | |
return string; | |
} | |
var mid = (length - strLength) / 2; | |
return ( | |
createPadding(nativeFloor(mid), chars) + | |
string + | |
createPadding(nativeCeil(mid), chars) | |
); | |
} | |
/** | |
* Pads `string` on the right side if it's shorter than `length`. Padding | |
* characters are truncated if they exceed `length`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @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 | |
* | |
* _.padEnd('abc', 6); | |
* // => 'abc ' | |
* | |
* _.padEnd('abc', 6, '_-'); | |
* // => 'abc_-_' | |
* | |
* _.padEnd('abc', 3); | |
* // => 'abc' | |
*/ | |
function padEnd(string, length, chars) { | |
string = toString(string); | |
length = toInteger(length); | |
var strLength = length ? stringSize(string) : 0; | |
return (length && strLength < length) | |
? (string + createPadding(length - strLength, chars)) | |
: string; | |
} | |
/** | |
* Pads `string` on the left side if it's shorter than `length`. Padding | |
* characters are truncated if they exceed `length`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @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 | |
* | |
* _.padStart('abc', 6); | |
* // => ' abc' | |
* | |
* _.padStart('abc', 6, '_-'); | |
* // => '_-_abc' | |
* | |
* _.padStart('abc', 3); | |
* // => 'abc' | |
*/ | |
function padStart(string, length, chars) { | |
string = toString(string); | |
length = toInteger(length); | |
var strLength = length ? stringSize(string) : 0; | |
return (length && strLength < length) | |
? (createPadding(length - strLength, chars) + string) | |
: string; | |
} | |
/** | |
* 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/#x15.1.2.2) of `parseInt`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 1.1.0 | |
* @category String | |
* @param {string} string The string to convert. | |
* @param {number} [radix=10] The radix to interpret `value` by. | |
* @param- {Object} [guard] Enables use as an iteratee for methods 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) { | |
// Chrome fails to trim leading <BOM> whitespace characters. | |
// See https://bugs.chromium.org/p/v8/issues/detail?id=3109 for more details. | |
if (guard || radix == null) { | |
radix = 0; | |
} else if (radix) { | |
radix = +radix; | |
} | |
string = toString(string).replace(reTrim, ''); | |
return nativeParseInt(string, radix || (reHasHexPrefix.test(string) ? 16 : 10)); | |
} | |
/** | |
* Repeats the given string `n` times. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category String | |
* @param {string} [string=''] The string to repeat. | |
* @param {number} [n=1] The number of times to repeat the string. | |
* @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. | |
* @returns {string} Returns the repeated string. | |
* @example | |
* | |
* _.repeat('*', 3); | |
* // => '***' | |
* | |
* _.repeat('abc', 2); | |
* // => 'abcabc' | |
* | |
* _.repeat('abc', 0); | |
* // => '' | |
*/ | |
function repeat(string, n, guard) { | |
if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) { | |
n = 1; | |
} else { | |
n = toInteger(n); | |
} | |
return baseRepeat(toString(string), n); | |
} | |
/** | |
* Replaces matches for `pattern` in `string` with `replacement`. | |
* | |
* **Note:** This method is based on | |
* [`String#replace`](https://mdn.io/String/replace). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to modify. | |
* @param {RegExp|string} pattern The pattern to replace. | |
* @param {Function|string} replacement The match replacement. | |
* @returns {string} Returns the modified string. | |
* @example | |
* | |
* _.replace('Hi Fred', 'Fred', 'Barney'); | |
* // => 'Hi Barney' | |
*/ | |
function replace() { | |
var args = arguments, | |
string = toString(args[0]); | |
return args.length < 3 ? string : string.replace(args[1], args[2]); | |
} | |
/** | |
* Converts `string` to | |
* [snake case](https://en.wikipedia.org/wiki/Snake_case). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @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(); | |
}); | |
/** | |
* Splits `string` by `separator`. | |
* | |
* **Note:** This method is based on | |
* [`String#split`](https://mdn.io/String/split). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to split. | |
* @param {RegExp|string} separator The separator pattern to split by. | |
* @param {number} [limit] The length to truncate results to. | |
* @returns {Array} Returns the string segments. | |
* @example | |
* | |
* _.split('a-b-c', '-', 2); | |
* // => ['a', 'b'] | |
*/ | |
function split(string, separator, limit) { | |
if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) { | |
separator = limit = undefined; | |
} | |
limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0; | |
if (!limit) { | |
return []; | |
} | |
string = toString(string); | |
if (string && ( | |
typeof separator == 'string' || | |
(separator != null && !isRegExp(separator)) | |
)) { | |
separator = baseToString(separator); | |
if (!separator && hasUnicode(string)) { | |
return castSlice(stringToArray(string), 0, limit); | |
} | |
} | |
return string.split(separator, limit); | |
} | |
/** | |
* Converts `string` to | |
* [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage). | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.1.0 | |
* @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 ? ' ' : '') + upperFirst(word); | |
}); | |
/** | |
* Checks if `string` starts with the given target string. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category String | |
* @param {string} [string=''] The string to inspect. | |
* @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 = toString(string); | |
position = baseClamp(toInteger(position), 0, string.length); | |
target = baseToString(target); | |
return string.slice(position, position + target.length) == target; | |
} | |
/** | |
* 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 given, 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 | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category String | |
* @param {string} [string=''] The template string. | |
* @param {Object} [options={}] The options object. | |
* @param {RegExp} [options.escape=_.templateSettings.escape] | |
* The HTML "escape" delimiter. | |
* @param {RegExp} [options.evaluate=_.templateSettings.evaluate] | |
* The "evaluate" delimiter. | |
* @param {Object} [options.imports=_.templateSettings.imports] | |
* An object to import into the template as free variables. | |
* @param {RegExp} [options.interpolate=_.templateSettings.interpolate] | |
* The "interpolate" delimiter. | |
* @param {string} [options.sourceURL='lodash.templateSources[n]'] | |
* The sourceURL of the compiled template. | |
* @param {string} [options.variable='obj'] | |
* The data object variable name. | |
* @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. | |
* @returns {Function} Returns the compiled template function. | |
* @example | |
* | |
* // Use the "interpolate" delimiter to create a compiled template. | |
* var compiled = _.template('hello <%= user %>!'); | |
* compiled({ 'user': 'fred' }); | |
* // => 'hello fred!' | |
* | |
* // Use the HTML "escape" delimiter to escape data property values. | |
* var compiled = _.template('<b><%- value %></b>'); | |
* compiled({ 'value': '<script>' }); | |
* // => '<b><script></b>' | |
* | |
* // Use 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>' | |
* | |
* // Use the internal `print` function in "evaluate" delimiters. | |
* var compiled = _.template('<% print("hello " + user); %>!'); | |
* compiled({ 'user': 'barney' }); | |
* // => 'hello barney!' | |
* | |
* // Use the ES delimiter as an alternative to the default "interpolate" delimiter. | |
* var compiled = _.template('hello ${ user }!'); | |
* compiled({ 'user': 'pebbles' }); | |
* // => 'hello pebbles!' | |
* | |
* // Use backslashes to treat delimiters as plain text. | |
* var compiled = _.template('<%= "\\<%- value %\\>" %>'); | |
* compiled({ 'value': 'ignored' }); | |
* // => '<%- value %>' | |
* | |
* // Use 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>' | |
* | |
* // Use 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. | |
* | |
* // Use 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; | |
* // } | |
* | |
* // Use custom template delimiters. | |
* _.templateSettings.interpolate = /{{([\s\S]+?)}}/g; | |
* var compiled = _.template('hello {{ user }}!'); | |
* compiled({ 'user': 'mustache' }); | |
* // => 'hello mustache!' | |
* | |
* // Use the `source` property to inline compiled templates for meaningful | |
* // line numbers in error messages and stack traces. | |
* fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\ | |
* var JST = {\ | |
* "main": ' + _.template(mainText).source + '\ | |
* };\ | |
* '); | |
*/ | |
function template(string, options, guard) { | |
// 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 (guard && isIterateeCall(string, options, guard)) { | |
options = undefined; | |
} | |
string = toString(string); | |
options = assignInWith({}, options, settings, assignInDefaults); | |
var imports = assignInWith({}, options.imports, settings.imports, assignInDefaults), | |
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; | |
// The JS engine embedded in Adobe products needs `match` returned in | |
// order to produce the correct `offset` value. | |
return match; | |
}); | |
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); | |
}); | |
// 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; | |
} | |
/** | |
* Converts `string`, as a whole, to lower case just like | |
* [String#toLowerCase](https://mdn.io/toLowerCase). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to convert. | |
* @returns {string} Returns the lower cased string. | |
* @example | |
* | |
* _.toLower('--Foo-Bar--'); | |
* // => '--foo-bar--' | |
* | |
* _.toLower('fooBar'); | |
* // => 'foobar' | |
* | |
* _.toLower('__FOO_BAR__'); | |
* // => '__foo_bar__' | |
*/ | |
function toLower(value) { | |
return toString(value).toLowerCase(); | |
} | |
/** | |
* Converts `string`, as a whole, to upper case just like | |
* [String#toUpperCase](https://mdn.io/toUpperCase). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to convert. | |
* @returns {string} Returns the upper cased string. | |
* @example | |
* | |
* _.toUpper('--foo-bar--'); | |
* // => '--FOO-BAR--' | |
* | |
* _.toUpper('fooBar'); | |
* // => 'FOOBAR' | |
* | |
* _.toUpper('__foo_bar__'); | |
* // => '__FOO_BAR__' | |
*/ | |
function toUpper(value) { | |
return toString(value).toUpperCase(); | |
} | |
/** | |
* Removes leading and trailing whitespace or specified characters from `string`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category String | |
* @param {string} [string=''] The string to trim. | |
* @param {string} [chars=whitespace] The characters to trim. | |
* @param- {Object} [guard] Enables use as an iteratee for methods 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) { | |
string = toString(string); | |
if (string && (guard || chars === undefined)) { | |
return string.replace(reTrim, ''); | |
} | |
if (!string || !(chars = baseToString(chars))) { | |
return string; | |
} | |
var strSymbols = stringToArray(string), | |
chrSymbols = stringToArray(chars), | |
start = charsStartIndex(strSymbols, chrSymbols), | |
end = charsEndIndex(strSymbols, chrSymbols) + 1; | |
return castSlice(strSymbols, start, end).join(''); | |
} | |
/** | |
* Removes trailing whitespace or specified characters from `string`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to trim. | |
* @param {string} [chars=whitespace] The characters to trim. | |
* @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. | |
* @returns {string} Returns the trimmed string. | |
* @example | |
* | |
* _.trimEnd(' abc '); | |
* // => ' abc' | |
* | |
* _.trimEnd('-_-abc-_-', '_-'); | |
* // => '-_-abc' | |
*/ | |
function trimEnd(string, chars, guard) { | |
string = toString(string); | |
if (string && (guard || chars === undefined)) { | |
return string.replace(reTrimEnd, ''); | |
} | |
if (!string || !(chars = baseToString(chars))) { | |
return string; | |
} | |
var strSymbols = stringToArray(string), | |
end = charsEndIndex(strSymbols, stringToArray(chars)) + 1; | |
return castSlice(strSymbols, 0, end).join(''); | |
} | |
/** | |
* Removes leading whitespace or specified characters from `string`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to trim. | |
* @param {string} [chars=whitespace] The characters to trim. | |
* @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. | |
* @returns {string} Returns the trimmed string. | |
* @example | |
* | |
* _.trimStart(' abc '); | |
* // => 'abc ' | |
* | |
* _.trimStart('-_-abc-_-', '_-'); | |
* // => 'abc-_-' | |
*/ | |
function trimStart(string, chars, guard) { | |
string = toString(string); | |
if (string && (guard || chars === undefined)) { | |
return string.replace(reTrimStart, ''); | |
} | |
if (!string || !(chars = baseToString(chars))) { | |
return string; | |
} | |
var strSymbols = stringToArray(string), | |
start = charsStartIndex(strSymbols, stringToArray(chars)); | |
return castSlice(strSymbols, start).join(''); | |
} | |
/** | |
* Truncates `string` if it's 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 _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to truncate. | |
* @param {Object} [options={}] The options object. | |
* @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. | |
* @returns {string} Returns the truncated string. | |
* @example | |
* | |
* _.truncate('hi-diddly-ho there, neighborino'); | |
* // => 'hi-diddly-ho there, neighbo...' | |
* | |
* _.truncate('hi-diddly-ho there, neighborino', { | |
* 'length': 24, | |
* 'separator': ' ' | |
* }); | |
* // => 'hi-diddly-ho there,...' | |
* | |
* _.truncate('hi-diddly-ho there, neighborino', { | |
* 'length': 24, | |
* 'separator': /,? +/ | |
* }); | |
* // => 'hi-diddly-ho there...' | |
* | |
* _.truncate('hi-diddly-ho there, neighborino', { | |
* 'omission': ' [...]' | |
* }); | |
* // => 'hi-diddly-ho there, neig [...]' | |
*/ | |
function truncate(string, options) { | |
var length = DEFAULT_TRUNC_LENGTH, | |
omission = DEFAULT_TRUNC_OMISSION; | |
if (isObject(options)) { | |
var separator = 'separator' in options ? options.separator : separator; | |
length = 'length' in options ? toInteger(options.length) : length; | |
omission = 'omission' in options ? baseToString(options.omission) : omission; | |
} | |
string = toString(string); | |
var strLength = string.length; | |
if (hasUnicode(string)) { | |
var strSymbols = stringToArray(string); | |
strLength = strSymbols.length; | |
} | |
if (length >= strLength) { | |
return string; | |
} | |
var end = length - stringSize(omission); | |
if (end < 1) { | |
return omission; | |
} | |
var result = strSymbols | |
? castSlice(strSymbols, 0, end).join('') | |
: string.slice(0, end); | |
if (separator === undefined) { | |
return result + omission; | |
} | |
if (strSymbols) { | |
end += (result.length - end); | |
} | |
if (isRegExp(separator)) { | |
if (string.slice(end).search(separator)) { | |
var match, | |
substring = result; | |
if (!separator.global) { | |
separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g'); | |
} | |
separator.lastIndex = 0; | |
while ((match = separator.exec(substring))) { | |
var newEnd = match.index; | |
} | |
result = result.slice(0, newEnd === undefined ? end : newEnd); | |
} | |
} else if (string.indexOf(baseToString(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 _ | |
* @since 0.6.0 | |
* @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 = toString(string); | |
return (string && reHasEscapedHtml.test(string)) | |
? string.replace(reEscapedHtml, unescapeHtmlChar) | |
: string; | |
} | |
/** | |
* Converts `string`, as space separated words, to upper case. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to convert. | |
* @returns {string} Returns the upper cased string. | |
* @example | |
* | |
* _.upperCase('--foo-bar'); | |
* // => 'FOO BAR' | |
* | |
* _.upperCase('fooBar'); | |
* // => 'FOO BAR' | |
* | |
* _.upperCase('__foo_bar__'); | |
* // => 'FOO BAR' | |
*/ | |
var upperCase = createCompounder(function(result, word, index) { | |
return result + (index ? ' ' : '') + word.toUpperCase(); | |
}); | |
/** | |
* Converts the first character of `string` to upper case. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category String | |
* @param {string} [string=''] The string to convert. | |
* @returns {string} Returns the converted string. | |
* @example | |
* | |
* _.upperFirst('fred'); | |
* // => 'Fred' | |
* | |
* _.upperFirst('FRED'); | |
* // => 'FRED' | |
*/ | |
var upperFirst = createCaseFirst('toUpperCase'); | |
/** | |
* Splits `string` into an array of its words. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category String | |
* @param {string} [string=''] The string to inspect. | |
* @param {RegExp|string} [pattern] The pattern to match words. | |
* @param- {Object} [guard] Enables use as an iteratee for methods 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) { | |
string = toString(string); | |
pattern = guard ? undefined : pattern; | |
if (pattern === undefined) { | |
return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string); | |
} | |
return string.match(pattern) || []; | |
} | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Attempts to invoke `func`, returning either the result or the caught error | |
* object. Any additional arguments are provided to `func` when it's invoked. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Util | |
* @param {Function} func The function to attempt. | |
* @param {...*} [args] The arguments to invoke `func` with. | |
* @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 = baseRest(function(func, args) { | |
try { | |
return apply(func, undefined, args); | |
} catch (e) { | |
return isError(e) ? e : new Error(e); | |
} | |
}); | |
/** | |
* Binds methods of an object to the object itself, overwriting the existing | |
* method. | |
* | |
* **Note:** This method doesn't set the "length" property of bound functions. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Util | |
* @param {Object} object The object to bind and assign the bound methods to. | |
* @param {...(string|string[])} methodNames The object method names to bind. | |
* @returns {Object} Returns `object`. | |
* @example | |
* | |
* var view = { | |
* 'label': 'docs', | |
* 'click': function() { | |
* console.log('clicked ' + this.label); | |
* } | |
* }; | |
* | |
* _.bindAll(view, ['click']); | |
* jQuery(element).on('click', view.click); | |
* // => Logs 'clicked docs' when clicked. | |
*/ | |
var bindAll = baseRest(function(object, methodNames) { | |
arrayEach(baseFlatten(methodNames, 1), function(key) { | |
key = toKey(key); | |
object[key] = bind(object[key], object); | |
}); | |
return object; | |
}); | |
/** | |
* Creates a function that iterates over `pairs` and invokes the corresponding | |
* function of the first predicate to return truthy. The predicate-function | |
* pairs are invoked with the `this` binding and arguments of the created | |
* function. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Util | |
* @param {Array} pairs The predicate-function pairs. | |
* @returns {Function} Returns the new composite function. | |
* @example | |
* | |
* var func = _.cond([ | |
* [_.matches({ 'a': 1 }), _.constant('matches A')], | |
* [_.conforms({ 'b': _.isNumber }), _.constant('matches B')], | |
* [_.stubTrue, _.constant('no match')] | |
* ]); | |
* | |
* func({ 'a': 1, 'b': 2 }); | |
* // => 'matches A' | |
* | |
* func({ 'a': 0, 'b': 1 }); | |
* // => 'matches B' | |
* | |
* func({ 'a': '1', 'b': '2' }); | |
* // => 'no match' | |
*/ | |
function cond(pairs) { | |
var length = pairs ? pairs.length : 0, | |
toIteratee = getIteratee(); | |
pairs = !length ? [] : arrayMap(pairs, function(pair) { | |
if (typeof pair[1] != 'function') { | |
throw new TypeError(FUNC_ERROR_TEXT); | |
} | |
return [toIteratee(pair[0]), pair[1]]; | |
}); | |
return baseRest(function(args) { | |
var index = -1; | |
while (++index < length) { | |
var pair = pairs[index]; | |
if (apply(pair[0], this, args)) { | |
return apply(pair[1], this, args); | |
} | |
} | |
}); | |
} | |
/** | |
* Creates a function that invokes the predicate properties of `source` with | |
* the corresponding property values of a given object, returning `true` if | |
* all predicates return truthy, else `false`. | |
* | |
* **Note:** The created function is equivalent to `_.conformsTo` with | |
* `source` partially applied. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Util | |
* @param {Object} source The object of property predicates to conform to. | |
* @returns {Function} Returns the new spec function. | |
* @example | |
* | |
* var objects = [ | |
* { 'a': 2, 'b': 1 }, | |
* { 'a': 1, 'b': 2 } | |
* ]; | |
* | |
* _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } })); | |
* // => [{ 'a': 1, 'b': 2 }] | |
*/ | |
function conforms(source) { | |
return baseConforms(baseClone(source, true)); | |
} | |
/** | |
* Creates a function that returns `value`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.4.0 | |
* @category Util | |
* @param {*} value The value to return from the new function. | |
* @returns {Function} Returns the new constant function. | |
* @example | |
* | |
* var objects = _.times(2, _.constant({ 'a': 1 })); | |
* | |
* console.log(objects); | |
* // => [{ 'a': 1 }, { 'a': 1 }] | |
* | |
* console.log(objects[0] === objects[1]); | |
* // => true | |
*/ | |
function constant(value) { | |
return function() { | |
return value; | |
}; | |
} | |
/** | |
* Checks `value` to determine whether a default value should be returned in | |
* its place. The `defaultValue` is returned if `value` is `NaN`, `null`, | |
* or `undefined`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.14.0 | |
* @category Util | |
* @param {*} value The value to check. | |
* @param {*} defaultValue The default value. | |
* @returns {*} Returns the resolved value. | |
* @example | |
* | |
* _.defaultTo(1, 10); | |
* // => 1 | |
* | |
* _.defaultTo(undefined, 10); | |
* // => 10 | |
*/ | |
function defaultTo(value, defaultValue) { | |
return (value == null || value !== value) ? defaultValue : value; | |
} | |
/** | |
* Creates a function that returns the result of invoking the given functions | |
* with the `this` binding of the created function, where each successive | |
* invocation is supplied the return value of the previous. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Util | |
* @param {...(Function|Function[])} [funcs] The functions to invoke. | |
* @returns {Function} Returns the new composite function. | |
* @see _.flowRight | |
* @example | |
* | |
* function square(n) { | |
* return n * n; | |
* } | |
* | |
* var addSquare = _.flow([_.add, square]); | |
* addSquare(1, 2); | |
* // => 9 | |
*/ | |
var flow = createFlow(); | |
/** | |
* This method is like `_.flow` except that it creates a function that | |
* invokes the given functions from right to left. | |
* | |
* @static | |
* @since 3.0.0 | |
* @memberOf _ | |
* @category Util | |
* @param {...(Function|Function[])} [funcs] The functions to invoke. | |
* @returns {Function} Returns the new composite function. | |
* @see _.flow | |
* @example | |
* | |
* function square(n) { | |
* return n * n; | |
* } | |
* | |
* var addSquare = _.flowRight([square, _.add]); | |
* addSquare(1, 2); | |
* // => 9 | |
*/ | |
var flowRight = createFlow(true); | |
/** | |
* This method returns the first argument it receives. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Util | |
* @param {*} value Any value. | |
* @returns {*} Returns `value`. | |
* @example | |
* | |
* var object = { 'a': 1 }; | |
* | |
* console.log(_.identity(object) === object); | |
* // => true | |
*/ | |
function identity(value) { | |
return value; | |
} | |
/** | |
* Creates a function that invokes `func` with the arguments of the created | |
* function. If `func` is a property name, the created function returns the | |
* property value for a given element. If `func` is an array or object, the | |
* created function returns `true` for elements that contain the equivalent | |
* source properties, otherwise it returns `false`. | |
* | |
* @static | |
* @since 4.0.0 | |
* @memberOf _ | |
* @category Util | |
* @param {*} [func=_.identity] The value to convert to a callback. | |
* @returns {Function} Returns the callback. | |
* @example | |
* | |
* var users = [ | |
* { 'user': 'barney', 'age': 36, 'active': true }, | |
* { 'user': 'fred', 'age': 40, 'active': false } | |
* ]; | |
* | |
* // The `_.matches` iteratee shorthand. | |
* _.filter(users, _.iteratee({ 'user': 'barney', 'active': true })); | |
* // => [{ 'user': 'barney', 'age': 36, 'active': true }] | |
* | |
* // The `_.matchesProperty` iteratee shorthand. | |
* _.filter(users, _.iteratee(['user', 'fred'])); | |
* // => [{ 'user': 'fred', 'age': 40 }] | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.map(users, _.iteratee('user')); | |
* // => ['barney', 'fred'] | |
* | |
* // Create custom iteratee shorthands. | |
* _.iteratee = _.wrap(_.iteratee, function(iteratee, func) { | |
* return !_.isRegExp(func) ? iteratee(func) : function(string) { | |
* return func.test(string); | |
* }; | |
* }); | |
* | |
* _.filter(['abc', 'def'], /ef/); | |
* // => ['def'] | |
*/ | |
function iteratee(func) { | |
return baseIteratee(typeof func == 'function' ? func : baseClone(func, true)); | |
} | |
/** | |
* Creates a function that performs a partial deep comparison between a given | |
* object and `source`, returning `true` if the given object has equivalent | |
* property values, else `false`. | |
* | |
* **Note:** The created function is equivalent to `_.isMatch` with `source` | |
* partially applied. | |
* | |
* Partial comparisons will match empty array and empty object `source` | |
* values against any array or object value, respectively. See `_.isEqual` | |
* for a list of supported value comparisons. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Util | |
* @param {Object} source The object of property values to match. | |
* @returns {Function} Returns the new spec function. | |
* @example | |
* | |
* var objects = [ | |
* { 'a': 1, 'b': 2, 'c': 3 }, | |
* { 'a': 4, 'b': 5, 'c': 6 } | |
* ]; | |
* | |
* _.filter(objects, _.matches({ 'a': 4, 'c': 6 })); | |
* // => [{ 'a': 4, 'b': 5, 'c': 6 }] | |
*/ | |
function matches(source) { | |
return baseMatches(baseClone(source, true)); | |
} | |
/** | |
* Creates a function that performs a partial deep comparison between the | |
* value at `path` of a given object to `srcValue`, returning `true` if the | |
* object value is equivalent, else `false`. | |
* | |
* **Note:** Partial comparisons will match empty array and empty object | |
* `srcValue` values against any array or object value, respectively. See | |
* `_.isEqual` for a list of supported value comparisons. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.2.0 | |
* @category Util | |
* @param {Array|string} path The path of the property to get. | |
* @param {*} srcValue The value to match. | |
* @returns {Function} Returns the new spec function. | |
* @example | |
* | |
* var objects = [ | |
* { 'a': 1, 'b': 2, 'c': 3 }, | |
* { 'a': 4, 'b': 5, 'c': 6 } | |
* ]; | |
* | |
* _.find(objects, _.matchesProperty('a', 4)); | |
* // => { 'a': 4, 'b': 5, 'c': 6 } | |
*/ | |
function matchesProperty(path, srcValue) { | |
return baseMatchesProperty(path, baseClone(srcValue, true)); | |
} | |
/** | |
* Creates a function that invokes the method at `path` of a given object. | |
* Any additional arguments are provided to the invoked method. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.7.0 | |
* @category Util | |
* @param {Array|string} path The path of the method to invoke. | |
* @param {...*} [args] The arguments to invoke the method with. | |
* @returns {Function} Returns the new invoker function. | |
* @example | |
* | |
* var objects = [ | |
* { 'a': { 'b': _.constant(2) } }, | |
* { 'a': { 'b': _.constant(1) } } | |
* ]; | |
* | |
* _.map(objects, _.method('a.b')); | |
* // => [2, 1] | |
* | |
* _.map(objects, _.method(['a', 'b'])); | |
* // => [2, 1] | |
*/ | |
var method = baseRest(function(path, args) { | |
return function(object) { | |
return baseInvoke(object, path, args); | |
}; | |
}); | |
/** | |
* The opposite of `_.method`; this method creates a function that invokes | |
* the method at a given path of `object`. Any additional arguments are | |
* provided to the invoked method. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.7.0 | |
* @category Util | |
* @param {Object} object The object to query. | |
* @param {...*} [args] The arguments to invoke the method with. | |
* @returns {Function} Returns the new invoker 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 = baseRest(function(object, args) { | |
return function(path) { | |
return baseInvoke(object, path, args); | |
}; | |
}); | |
/** | |
* Adds all own enumerable string keyed 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 | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Util | |
* @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 mixins are chainable. | |
* @returns {Function|Object} Returns `object`. | |
* @example | |
* | |
* function vowels(string) { | |
* return _.filter(string, function(v) { | |
* return /[aeiou]/i.test(v); | |
* }); | |
* } | |
* | |
* _.mixin({ 'vowels': vowels }); | |
* _.vowels('fred'); | |
* // => ['e'] | |
* | |
* _('fred').vowels().value(); | |
* // => ['e'] | |
* | |
* _.mixin({ 'vowels': vowels }, { 'chain': false }); | |
* _('fred').vowels(); | |
* // => ['e'] | |
*/ | |
function mixin(object, source, options) { | |
var props = keys(source), | |
methodNames = baseFunctions(source, props); | |
if (options == null && | |
!(isObject(source) && (methodNames.length || !props.length))) { | |
options = source; | |
source = object; | |
object = this; | |
methodNames = baseFunctions(source, keys(source)); | |
} | |
var chain = !(isObject(options) && 'chain' in options) || !!options.chain, | |
isFunc = isFunction(object); | |
arrayEach(methodNames, function(methodName) { | |
var func = source[methodName]; | |
object[methodName] = func; | |
if (isFunc) { | |
object.prototype[methodName] = function() { | |
var chainAll = this.__chain__; | |
if (chain || chainAll) { | |
var result = object(this.__wrapped__), | |
actions = result.__actions__ = copyArray(this.__actions__); | |
actions.push({ 'func': func, 'args': arguments, 'thisArg': object }); | |
result.__chain__ = chainAll; | |
return result; | |
} | |
return func.apply(object, arrayPush([this.value()], arguments)); | |
}; | |
} | |
}); | |
return object; | |
} | |
/** | |
* Reverts the `_` variable to its previous value and returns a reference to | |
* the `lodash` function. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Util | |
* @returns {Function} Returns the `lodash` function. | |
* @example | |
* | |
* var lodash = _.noConflict(); | |
*/ | |
function noConflict() { | |
if (root._ === this) { | |
root._ = oldDash; | |
} | |
return this; | |
} | |
/** | |
* This method returns `undefined`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.3.0 | |
* @category Util | |
* @example | |
* | |
* _.times(2, _.noop); | |
* // => [undefined, undefined] | |
*/ | |
function noop() { | |
// No operation performed. | |
} | |
/** | |
* Creates a function that gets the argument at index `n`. If `n` is negative, | |
* the nth argument from the end is returned. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Util | |
* @param {number} [n=0] The index of the argument to return. | |
* @returns {Function} Returns the new pass-thru function. | |
* @example | |
* | |
* var func = _.nthArg(1); | |
* func('a', 'b', 'c', 'd'); | |
* // => 'b' | |
* | |
* var func = _.nthArg(-2); | |
* func('a', 'b', 'c', 'd'); | |
* // => 'c' | |
*/ | |
function nthArg(n) { | |
n = toInteger(n); | |
return baseRest(function(args) { | |
return baseNth(args, n); | |
}); | |
} | |
/** | |
* Creates a function that invokes `iteratees` with the arguments it receives | |
* and returns their results. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Util | |
* @param {...(Function|Function[])} [iteratees=[_.identity]] | |
* The iteratees to invoke. | |
* @returns {Function} Returns the new function. | |
* @example | |
* | |
* var func = _.over([Math.max, Math.min]); | |
* | |
* func(1, 2, 3, 4); | |
* // => [4, 1] | |
*/ | |
var over = createOver(arrayMap); | |
/** | |
* Creates a function that checks if **all** of the `predicates` return | |
* truthy when invoked with the arguments it receives. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Util | |
* @param {...(Function|Function[])} [predicates=[_.identity]] | |
* The predicates to check. | |
* @returns {Function} Returns the new function. | |
* @example | |
* | |
* var func = _.overEvery([Boolean, isFinite]); | |
* | |
* func('1'); | |
* // => true | |
* | |
* func(null); | |
* // => false | |
* | |
* func(NaN); | |
* // => false | |
*/ | |
var overEvery = createOver(arrayEvery); | |
/** | |
* Creates a function that checks if **any** of the `predicates` return | |
* truthy when invoked with the arguments it receives. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Util | |
* @param {...(Function|Function[])} [predicates=[_.identity]] | |
* The predicates to check. | |
* @returns {Function} Returns the new function. | |
* @example | |
* | |
* var func = _.overSome([Boolean, isFinite]); | |
* | |
* func('1'); | |
* // => true | |
* | |
* func(null); | |
* // => true | |
* | |
* func(NaN); | |
* // => false | |
*/ | |
var overSome = createOver(arraySome); | |
/** | |
* Creates a function that returns the value at `path` of a given object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 2.4.0 | |
* @category Util | |
* @param {Array|string} path The path of the property to get. | |
* @returns {Function} Returns the new accessor function. | |
* @example | |
* | |
* var objects = [ | |
* { 'a': { 'b': 2 } }, | |
* { 'a': { 'b': 1 } } | |
* ]; | |
* | |
* _.map(objects, _.property('a.b')); | |
* // => [2, 1] | |
* | |
* _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b'); | |
* // => [1, 2] | |
*/ | |
function property(path) { | |
return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path); | |
} | |
/** | |
* The opposite of `_.property`; this method creates a function that returns | |
* the value at a given path of `object`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.0.0 | |
* @category Util | |
* @param {Object} object The object to query. | |
* @returns {Function} Returns the new accessor 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 object == null ? undefined : baseGet(object, path); | |
}; | |
} | |
/** | |
* Creates an array of numbers (positive and/or negative) progressing from | |
* `start` up to, but not including, `end`. A step of `-1` is used if a negative | |
* `start` is specified without an `end` or `step`. If `end` is not specified, | |
* it's set to `start` with `start` then set to `0`. | |
* | |
* **Note:** JavaScript follows the IEEE-754 standard for resolving | |
* floating-point values which can produce unexpected results. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Util | |
* @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 range of numbers. | |
* @see _.inRange, _.rangeRight | |
* @example | |
* | |
* _.range(4); | |
* // => [0, 1, 2, 3] | |
* | |
* _.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); | |
* // => [] | |
*/ | |
var range = createRange(); | |
/** | |
* This method is like `_.range` except that it populates values in | |
* descending order. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Util | |
* @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 range of numbers. | |
* @see _.inRange, _.range | |
* @example | |
* | |
* _.rangeRight(4); | |
* // => [3, 2, 1, 0] | |
* | |
* _.rangeRight(-4); | |
* // => [-3, -2, -1, 0] | |
* | |
* _.rangeRight(1, 5); | |
* // => [4, 3, 2, 1] | |
* | |
* _.rangeRight(0, 20, 5); | |
* // => [15, 10, 5, 0] | |
* | |
* _.rangeRight(0, -4, -1); | |
* // => [-3, -2, -1, 0] | |
* | |
* _.rangeRight(1, 4, 0); | |
* // => [1, 1, 1] | |
* | |
* _.rangeRight(0); | |
* // => [] | |
*/ | |
var rangeRight = createRange(true); | |
/** | |
* This method returns a new empty array. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.13.0 | |
* @category Util | |
* @returns {Array} Returns the new empty array. | |
* @example | |
* | |
* var arrays = _.times(2, _.stubArray); | |
* | |
* console.log(arrays); | |
* // => [[], []] | |
* | |
* console.log(arrays[0] === arrays[1]); | |
* // => false | |
*/ | |
function stubArray() { | |
return []; | |
} | |
/** | |
* This method returns `false`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.13.0 | |
* @category Util | |
* @returns {boolean} Returns `false`. | |
* @example | |
* | |
* _.times(2, _.stubFalse); | |
* // => [false, false] | |
*/ | |
function stubFalse() { | |
return false; | |
} | |
/** | |
* This method returns a new empty object. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.13.0 | |
* @category Util | |
* @returns {Object} Returns the new empty object. | |
* @example | |
* | |
* var objects = _.times(2, _.stubObject); | |
* | |
* console.log(objects); | |
* // => [{}, {}] | |
* | |
* console.log(objects[0] === objects[1]); | |
* // => false | |
*/ | |
function stubObject() { | |
return {}; | |
} | |
/** | |
* This method returns an empty string. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.13.0 | |
* @category Util | |
* @returns {string} Returns the empty string. | |
* @example | |
* | |
* _.times(2, _.stubString); | |
* // => ['', ''] | |
*/ | |
function stubString() { | |
return ''; | |
} | |
/** | |
* This method returns `true`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.13.0 | |
* @category Util | |
* @returns {boolean} Returns `true`. | |
* @example | |
* | |
* _.times(2, _.stubTrue); | |
* // => [true, true] | |
*/ | |
function stubTrue() { | |
return true; | |
} | |
/** | |
* Invokes the iteratee `n` times, returning an array of the results of | |
* each invocation. The iteratee is invoked with one argument; (index). | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Util | |
* @param {number} n The number of times to invoke `iteratee`. | |
* @param {Function} [iteratee=_.identity] The function invoked per iteration. | |
* @returns {Array} Returns the array of results. | |
* @example | |
* | |
* _.times(3, String); | |
* // => ['0', '1', '2'] | |
* | |
* _.times(4, _.constant(0)); | |
* // => [0, 0, 0, 0] | |
*/ | |
function times(n, iteratee) { | |
n = toInteger(n); | |
if (n < 1 || n > MAX_SAFE_INTEGER) { | |
return []; | |
} | |
var index = MAX_ARRAY_LENGTH, | |
length = nativeMin(n, MAX_ARRAY_LENGTH); | |
iteratee = getIteratee(iteratee); | |
n -= MAX_ARRAY_LENGTH; | |
var result = baseTimes(length, iteratee); | |
while (++index < n) { | |
iteratee(index); | |
} | |
return result; | |
} | |
/** | |
* Converts `value` to a property path array. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Util | |
* @param {*} value The value to convert. | |
* @returns {Array} Returns the new property path array. | |
* @example | |
* | |
* _.toPath('a.b.c'); | |
* // => ['a', 'b', 'c'] | |
* | |
* _.toPath('a[0].b.c'); | |
* // => ['a', '0', 'b', 'c'] | |
*/ | |
function toPath(value) { | |
if (isArray(value)) { | |
return arrayMap(value, toKey); | |
} | |
return isSymbol(value) ? [value] : copyArray(stringToPath(value)); | |
} | |
/** | |
* Generates a unique ID. If `prefix` is given, the ID is appended to it. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Util | |
* @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 toString(prefix) + id; | |
} | |
/*------------------------------------------------------------------------*/ | |
/** | |
* Adds two numbers. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.4.0 | |
* @category Math | |
* @param {number} augend The first number in an addition. | |
* @param {number} addend The second number in an addition. | |
* @returns {number} Returns the total. | |
* @example | |
* | |
* _.add(6, 4); | |
* // => 10 | |
*/ | |
var add = createMathOperation(function(augend, addend) { | |
return augend + addend; | |
}, 0); | |
/** | |
* Computes `number` rounded up to `precision`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.10.0 | |
* @category Math | |
* @param {number} number The number to round up. | |
* @param {number} [precision=0] The precision to round up to. | |
* @returns {number} Returns the rounded up number. | |
* @example | |
* | |
* _.ceil(4.006); | |
* // => 5 | |
* | |
* _.ceil(6.004, 2); | |
* // => 6.01 | |
* | |
* _.ceil(6040, -2); | |
* // => 6100 | |
*/ | |
var ceil = createRound('ceil'); | |
/** | |
* Divide two numbers. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.7.0 | |
* @category Math | |
* @param {number} dividend The first number in a division. | |
* @param {number} divisor The second number in a division. | |
* @returns {number} Returns the quotient. | |
* @example | |
* | |
* _.divide(6, 4); | |
* // => 1.5 | |
*/ | |
var divide = createMathOperation(function(dividend, divisor) { | |
return dividend / divisor; | |
}, 1); | |
/** | |
* Computes `number` rounded down to `precision`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.10.0 | |
* @category Math | |
* @param {number} number The number to round down. | |
* @param {number} [precision=0] The precision to round down to. | |
* @returns {number} Returns the rounded down number. | |
* @example | |
* | |
* _.floor(4.006); | |
* // => 4 | |
* | |
* _.floor(0.046, 2); | |
* // => 0.04 | |
* | |
* _.floor(4060, -2); | |
* // => 4000 | |
*/ | |
var floor = createRound('floor'); | |
/** | |
* Computes the maximum value of `array`. If `array` is empty or falsey, | |
* `undefined` is returned. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Math | |
* @param {Array} array The array to iterate over. | |
* @returns {*} Returns the maximum value. | |
* @example | |
* | |
* _.max([4, 2, 8, 6]); | |
* // => 8 | |
* | |
* _.max([]); | |
* // => undefined | |
*/ | |
function max(array) { | |
return (array && array.length) | |
? baseExtremum(array, identity, baseGt) | |
: undefined; | |
} | |
/** | |
* This method is like `_.max` except that it accepts `iteratee` which is | |
* invoked for each element in `array` to generate the criterion by which | |
* the value is ranked. The iteratee is invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Math | |
* @param {Array} array The array to iterate over. | |
* @param {Function} [iteratee=_.identity] The iteratee invoked per element. | |
* @returns {*} Returns the maximum value. | |
* @example | |
* | |
* var objects = [{ 'n': 1 }, { 'n': 2 }]; | |
* | |
* _.maxBy(objects, function(o) { return o.n; }); | |
* // => { 'n': 2 } | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.maxBy(objects, 'n'); | |
* // => { 'n': 2 } | |
*/ | |
function maxBy(array, iteratee) { | |
return (array && array.length) | |
? baseExtremum(array, getIteratee(iteratee, 2), baseGt) | |
: undefined; | |
} | |
/** | |
* Computes the mean of the values in `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Math | |
* @param {Array} array The array to iterate over. | |
* @returns {number} Returns the mean. | |
* @example | |
* | |
* _.mean([4, 2, 8, 6]); | |
* // => 5 | |
*/ | |
function mean(array) { | |
return baseMean(array, identity); | |
} | |
/** | |
* This method is like `_.mean` except that it accepts `iteratee` which is | |
* invoked for each element in `array` to generate the value to be averaged. | |
* The iteratee is invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.7.0 | |
* @category Math | |
* @param {Array} array The array to iterate over. | |
* @param {Function} [iteratee=_.identity] The iteratee invoked per element. | |
* @returns {number} Returns the mean. | |
* @example | |
* | |
* var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }]; | |
* | |
* _.meanBy(objects, function(o) { return o.n; }); | |
* // => 5 | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.meanBy(objects, 'n'); | |
* // => 5 | |
*/ | |
function meanBy(array, iteratee) { | |
return baseMean(array, getIteratee(iteratee, 2)); | |
} | |
/** | |
* Computes the minimum value of `array`. If `array` is empty or falsey, | |
* `undefined` is returned. | |
* | |
* @static | |
* @since 0.1.0 | |
* @memberOf _ | |
* @category Math | |
* @param {Array} array The array to iterate over. | |
* @returns {*} Returns the minimum value. | |
* @example | |
* | |
* _.min([4, 2, 8, 6]); | |
* // => 2 | |
* | |
* _.min([]); | |
* // => undefined | |
*/ | |
function min(array) { | |
return (array && array.length) | |
? baseExtremum(array, identity, baseLt) | |
: undefined; | |
} | |
/** | |
* This method is like `_.min` except that it accepts `iteratee` which is | |
* invoked for each element in `array` to generate the criterion by which | |
* the value is ranked. The iteratee is invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Math | |
* @param {Array} array The array to iterate over. | |
* @param {Function} [iteratee=_.identity] The iteratee invoked per element. | |
* @returns {*} Returns the minimum value. | |
* @example | |
* | |
* var objects = [{ 'n': 1 }, { 'n': 2 }]; | |
* | |
* _.minBy(objects, function(o) { return o.n; }); | |
* // => { 'n': 1 } | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.minBy(objects, 'n'); | |
* // => { 'n': 1 } | |
*/ | |
function minBy(array, iteratee) { | |
return (array && array.length) | |
? baseExtremum(array, getIteratee(iteratee, 2), baseLt) | |
: undefined; | |
} | |
/** | |
* Multiply two numbers. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.7.0 | |
* @category Math | |
* @param {number} multiplier The first number in a multiplication. | |
* @param {number} multiplicand The second number in a multiplication. | |
* @returns {number} Returns the product. | |
* @example | |
* | |
* _.multiply(6, 4); | |
* // => 24 | |
*/ | |
var multiply = createMathOperation(function(multiplier, multiplicand) { | |
return multiplier * multiplicand; | |
}, 1); | |
/** | |
* Computes `number` rounded to `precision`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.10.0 | |
* @category Math | |
* @param {number} number The number to round. | |
* @param {number} [precision=0] The precision to round to. | |
* @returns {number} Returns the rounded number. | |
* @example | |
* | |
* _.round(4.006); | |
* // => 4 | |
* | |
* _.round(4.006, 2); | |
* // => 4.01 | |
* | |
* _.round(4060, -2); | |
* // => 4100 | |
*/ | |
var round = createRound('round'); | |
/** | |
* Subtract two numbers. | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Math | |
* @param {number} minuend The first number in a subtraction. | |
* @param {number} subtrahend The second number in a subtraction. | |
* @returns {number} Returns the difference. | |
* @example | |
* | |
* _.subtract(6, 4); | |
* // => 2 | |
*/ | |
var subtract = createMathOperation(function(minuend, subtrahend) { | |
return minuend - subtrahend; | |
}, 0); | |
/** | |
* Computes the sum of the values in `array`. | |
* | |
* @static | |
* @memberOf _ | |
* @since 3.4.0 | |
* @category Math | |
* @param {Array} array The array to iterate over. | |
* @returns {number} Returns the sum. | |
* @example | |
* | |
* _.sum([4, 2, 8, 6]); | |
* // => 20 | |
*/ | |
function sum(array) { | |
return (array && array.length) | |
? baseSum(array, identity) | |
: 0; | |
} | |
/** | |
* This method is like `_.sum` except that it accepts `iteratee` which is | |
* invoked for each element in `array` to generate the value to be summed. | |
* The iteratee is invoked with one argument: (value). | |
* | |
* @static | |
* @memberOf _ | |
* @since 4.0.0 | |
* @category Math | |
* @param {Array} array The array to iterate over. | |
* @param {Function} [iteratee=_.identity] The iteratee invoked per element. | |
* @returns {number} Returns the sum. | |
* @example | |
* | |
* var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }]; | |
* | |
* _.sumBy(objects, function(o) { return o.n; }); | |
* // => 20 | |
* | |
* // The `_.property` iteratee shorthand. | |
* _.sumBy(objects, 'n'); | |
* // => 20 | |
*/ | |
function sumBy(array, iteratee) { | |
return (array && array.length) | |
? baseSum(array, getIteratee(iteratee, 2)) | |
: 0; | |
} | |
/*------------------------------------------------------------------------*/ | |
// Add methods that return wrapped values in chain sequences. | |
lodash.after = after; | |
lodash.ary = ary; | |
lodash.assign = assign; | |
lodash.assignIn = assignIn; | |
lodash.assignInWith = assignInWith; | |
lodash.assignWith = assignWith; | |
lodash.at = at; | |
lodash.before = before; | |
lodash.bind = bind; | |
lodash.bindAll = bindAll; | |
lodash.bindKey = bindKey; | |
lodash.castArray = castArray; | |
lodash.chain = chain; | |
lodash.chunk = chunk; | |
lodash.compact = compact; | |
lodash.concat = concat; | |
lodash.cond = cond; | |
lodash.conforms = conforms; | |
lodash.constant = constant; | |
lodash.countBy = countBy; | |
lodash.create = create; | |
lodash.curry = curry; | |
lodash.curryRight = curryRight; | |
lodash.debounce = debounce; | |
lodash.defaults = defaults; | |
lodash.defaultsDeep = defaultsDeep; | |
lodash.defer = defer; | |
lodash.delay = delay; | |
lodash.difference = difference; | |
lodash.differenceBy = differenceBy; | |
lodash.differenceWith = differenceWith; | |
lodash.drop = drop; | |
lodash.dropRight = dropRight; | |
lodash.dropRightWhile = dropRightWhile; | |
lodash.dropWhile = dropWhile; | |
lodash.fill = fill; | |
lodash.filter = filter; | |
lodash.flatMap = flatMap; | |
lodash.flatMapDeep = flatMapDeep; | |
lodash.flatMapDepth = flatMapDepth; | |
lodash.flatten = flatten; | |
lodash.flattenDeep = flattenDeep; | |
lodash.flattenDepth = flattenDepth; | |
lodash.flip = flip; | |
lodash.flow = flow; | |
lodash.flowRight = flowRight; | |
lodash.fromPairs = fromPairs; | |
lodash.functions = functions; | |
lodash.functionsIn = functionsIn; | |
lodash.groupBy = groupBy; | |
lodash.initial = initial; | |
lodash.intersection = intersection; | |
lodash.intersectionBy = intersectionBy; | |
lodash.intersectionWith = intersectionWith; | |
lodash.invert = invert; | |
lodash.invertBy = invertBy; | |
lodash.invokeMap = invokeMap; | |
lodash.iteratee = iteratee; | |
lodash.keyBy = keyBy; | |
lodash.keys = keys; | |
lodash.keysIn = keysIn; | |
lodash.map = map; | |
lodash.mapKeys = mapKeys; | |
lodash.mapValues = mapValues; | |
lodash.matches = matches; | |
lodash.matchesProperty = matchesProperty; | |
lodash.memoize = memoize; | |
lodash.merge = merge; | |
lodash.mergeWith = mergeWith; | |
lodash.method = method; | |
lodash.methodOf = methodOf; | |
lodash.mixin = mixin; | |
lodash.negate = negate; | |
lodash.nthArg = nthArg; | |
lodash.omit = omit; | |
lodash.omitBy = omitBy; | |
lodash.once = once; | |
lodash.orderBy = orderBy; | |
lodash.over = over; | |
lodash.overArgs = overArgs; | |
lodash.overEvery = overEvery; | |
lodash.overSome = overSome; | |
lodash.partial = partial; | |
lodash.partialRight = partialRight; | |
lodash.partition = partition; | |
lodash.pick = pick; | |
lodash.pickBy = pickBy; | |
lodash.property = property; | |
lodash.propertyOf = propertyOf; | |
lodash.pull = pull; | |
lodash.pullAll = pullAll; | |
lodash.pullAllBy = pullAllBy; | |
lodash.pullAllWith = pullAllWith; | |
lodash.pullAt = pullAt; | |
lodash.range = range; | |
lodash.rangeRight = rangeRight; | |
lodash.rearg = rearg; | |
lodash.reject = reject; | |
lodash.remove = remove; | |
lodash.rest = rest; | |
lodash.reverse = reverse; | |
lodash.sampleSize = sampleSize; | |
lodash.set = set; | |
lodash.setWith = setWith; | |
lodash.shuffle = shuffle; | |
lodash.slice = slice; | |
lodash.sortBy = sortBy; | |
lodash.sortedUniq = sortedUniq; | |
lodash.sortedUniqBy = sortedUniqBy; | |
lodash.split = split; | |
lodash.spread = spread; | |
lodash.tail = tail; | |
lodash.take = take; | |
lodash.takeRight = takeRight; | |
lodash.takeRightWhile = takeRightWhile; | |
lodash.takeWhile = takeWhile; | |
lodash.tap = tap; | |
lodash.throttle = throttle; | |
lodash.thru = thru; | |
lodash.toArray = toArray; | |
lodash.toPairs = toPairs; | |
lodash.toPairsIn = toPairsIn; | |
lodash.toPath = toPath; | |
lodash.toPlainObject = toPlainObject; | |
lodash.transform = transform; | |
lodash.unary = unary; | |
lodash.union = union; | |
lodash.unionBy = unionBy; | |
lodash.unionWith = unionWith; | |
lodash.uniq = uniq; | |
lodash.uniqBy = uniqBy; | |
lodash.uniqWith = uniqWith; | |
lodash.unset = unset; | |
lodash.unzip = unzip; | |
lodash.unzipWith = unzipWith; | |
lodash.update = update; | |
lodash.updateWith = updateWith; | |
lodash.values = values; | |
lodash.valuesIn = valuesIn; | |
lodash.without = without; | |
lodash.words = words; | |
lodash.wrap = wrap; | |
lodash.xor = xor; | |
lodash.xorBy = xorBy; | |
lodash.xorWith = xorWith; | |
lodash.zip = zip; | |
lodash.zipObject = zipObject; | |
lodash.zipObjectDeep = zipObjectDeep; | |
lodash.zipWith = zipWith; | |
// Add aliases. | |
lodash.entries = toPairs; | |
lodash.entriesIn = toPairsIn; | |
lodash.extend = assignIn; | |
lodash.extendWith = assignInWith; | |
// Add methods to `lodash.prototype`. | |
mixin(lodash, lodash); | |
/*------------------------------------------------------------------------*/ | |
// Add methods that return unwrapped values in chain sequences. | |
lodash.add = add; | |
lodash.attempt = attempt; | |
lodash.camelCase = camelCase; | |
lodash.capitalize = capitalize; | |
lodash.ceil = ceil; | |
lodash.clamp = clamp; | |
lodash.clone = clone; | |
lodash.cloneDeep = cloneDeep; | |
lodash.cloneDeepWith = cloneDeepWith; | |
lodash.cloneWith = cloneWith; | |
lodash.conformsTo = conformsTo; | |
lodash.deburr = deburr; | |
lodash.defaultTo = defaultTo; | |
lodash.divide = divide; | |
lodash.endsWith = endsWith; | |
lodash.eq = eq; | |
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.floor = floor; | |
lodash.forEach = forEach; | |
lodash.forEachRight = forEachRight; | |
lodash.forIn = forIn; | |
lodash.forInRight = forInRight; | |
lodash.forOwn = forOwn; | |
lodash.forOwnRight = forOwnRight; | |
lodash.get = get; | |
lodash.gt = gt; | |
lodash.gte = gte; | |
lodash.has = has; | |
lodash.hasIn = hasIn; | |
lodash.head = head; | |
lodash.identity = identity; | |
lodash.includes = includes; | |
lodash.indexOf = indexOf; | |
lodash.inRange = inRange; | |
lodash.invoke = invoke; | |
lodash.isArguments = isArguments; | |
lodash.isArray = isArray; | |
lodash.isArrayBuffer = isArrayBuffer; | |
lodash.isArrayLike = isArrayLike; | |
lodash.isArrayLikeObject = isArrayLikeObject; | |
lodash.isBoolean = isBoolean; | |
lodash.isBuffer = isBuffer; | |
lodash.isDate = isDate; | |
lodash.isElement = isElement; | |
lodash.isEmpty = isEmpty; | |
lodash.isEqual = isEqual; | |
lodash.isEqualWith = isEqualWith; | |
lodash.isError = isError; | |
lodash.isFinite = isFinite; | |
lodash.isFunction = isFunction; | |
lodash.isInteger = isInteger; | |
lodash.isLength = isLength; | |
lodash.isMap = isMap; | |
lodash.isMatch = isMatch; | |
lodash.isMatchWith = isMatchWith; | |
lodash.isNaN = isNaN; | |
lodash.isNative = isNative; | |
lodash.isNil = isNil; | |
lodash.isNull = isNull; | |
lodash.isNumber = isNumber; | |
lodash.isObject = isObject; | |
lodash.isObjectLike = isObjectLike; | |
lodash.isPlainObject = isPlainObject; | |
lodash.isRegExp = isRegExp; | |
lodash.isSafeInteger = isSafeInteger; | |
lodash.isSet = isSet; | |
lodash.isString = isString; | |
lodash.isSymbol = isSymbol; | |
lodash.isTypedArray = isTypedArray; | |
lodash.isUndefined = isUndefined; | |
lodash.isWeakMap = isWeakMap; | |
lodash.isWeakSet = isWeakSet; | |
lodash.join = join; | |
lodash.kebabCase = kebabCase; | |
lodash.last = last; | |
lodash.lastIndexOf = lastIndexOf; | |
lodash.lowerCase = lowerCase; | |
lodash.lowerFirst = lowerFirst; | |
lodash.lt = lt; | |
lodash.lte = lte; | |
lodash.max = max; | |
lodash.maxBy = maxBy; | |
lodash.mean = mean; | |
lodash.meanBy = meanBy; | |
lodash.min = min; | |
lodash.minBy = minBy; | |
lodash.stubArray = stubArray; | |
lodash.stubFalse = stubFalse; | |
lodash.stubObject = stubObject; | |
lodash.stubString = stubString; | |
lodash.stubTrue = stubTrue; | |
lodash.multiply = multiply; | |
lodash.nth = nth; | |
lodash.noConflict = noConflict; | |
lodash.noop = noop; | |
lodash.now = now; | |
lodash.pad = pad; | |
lodash.padEnd = padEnd; | |
lodash.padStart = padStart; | |
lodash.parseInt = parseInt; | |
lodash.random = random; | |
lodash.reduce = reduce; | |
lodash.reduceRight = reduceRight; | |
lodash.repeat = repeat; | |
lodash.replace = replace; | |
lodash.result = result; | |
lodash.round = round; | |
lodash.runInContext = runInContext; | |
lodash.sample = sample; | |
lodash.size = size; | |
lodash.snakeCase = snakeCase; | |
lodash.some = some; | |
lodash.sortedIndex = sortedIndex; | |
lodash.sortedIndexBy = sortedIndexBy; | |
lodash.sortedIndexOf = sortedIndexOf; | |
lodash.sortedLastIndex = sortedLastIndex; | |
lodash.sortedLastIndexBy = sortedLastIndexBy; | |
lodash.sortedLastIndexOf = sortedLastIndexOf; | |
lodash.startCase = startCase; | |
lodash.startsWith = startsWith; | |
lodash.subtract = subtract; | |
lodash.sum = sum; | |
lodash.sumBy = sumBy; | |
lodash.template = template; | |
lodash.times = times; | |
lodash.toFinite = toFinite; | |
lodash.toInteger = toInteger; | |
lodash.toLength = toLength; | |
lodash.toLower = toLower; | |
lodash.toNumber = toNumber; | |
lodash.toSafeInteger = toSafeInteger; | |
lodash.toString = toString; | |
lodash.toUpper = toUpper; | |
lodash.trim = trim; | |
lodash.trimEnd = trimEnd; | |
lodash.trimStart = trimStart; | |
lodash.truncate = truncate; | |
lodash.unescape = unescape; | |
lodash.uniqueId = uniqueId; | |
lodash.upperCase = upperCase; | |
lodash.upperFirst = upperFirst; | |
// Add aliases. | |
lodash.each = forEach; | |
lodash.eachRight = forEachRight; | |
lodash.first = head; | |
mixin(lodash, (function() { | |
var source = {}; | |
baseForOwn(lodash, function(func, methodName) { | |
if (!hasOwnProperty.call(lodash.prototype, methodName)) { | |
source[methodName] = func; | |
} | |
}); | |
return source; | |
}()), { 'chain': false }); | |
/*------------------------------------------------------------------------*/ | |
/** | |
* The semantic version number. | |
* | |
* @static | |
* @memberOf _ | |
* @type {string} | |
*/ | |
lodash.VERSION = VERSION; | |
// Assign default placeholders. | |
arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) { | |
lodash[methodName].placeholder = lodash; | |
}); | |
// Add `LazyWrapper` methods for `_.drop` and `_.take` variants. | |
arrayEach(['drop', 'take'], function(methodName, index) { | |
LazyWrapper.prototype[methodName] = function(n) { | |
var filtered = this.__filtered__; | |
if (filtered && !index) { | |
return new LazyWrapper(this); | |
} | |
n = n === undefined ? 1 : nativeMax(toInteger(n), 0); | |
var result = this.clone(); | |
if (filtered) { | |
result.__takeCount__ = nativeMin(n, result.__takeCount__); | |
} else { | |
result.__views__.push({ | |
'size': nativeMin(n, MAX_ARRAY_LENGTH), | |
'type': methodName + (result.__dir__ < 0 ? 'Right' : '') | |
}); | |
} | |
return result; | |
}; | |
LazyWrapper.prototype[methodName + 'Right'] = function(n) { | |
return this.reverse()[methodName](n).reverse(); | |
}; | |
}); | |
// Add `LazyWrapper` methods that accept an `iteratee` value. | |
arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) { | |
var type = index + 1, | |
isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG; | |
LazyWrapper.prototype[methodName] = function(iteratee) { | |
var result = this.clone(); | |
result.__iteratees__.push({ | |
'iteratee': getIteratee(iteratee, 3), | |
'type': type | |
}); | |
result.__filtered__ = result.__filtered__ || isFilter; | |
return result; | |
}; | |
}); | |
// Add `LazyWrapper` methods for `_.head` and `_.last`. | |
arrayEach(['head', 'last'], function(methodName, index) { | |
var takeName = 'take' + (index ? 'Right' : ''); | |
LazyWrapper.prototype[methodName] = function() { | |
return this[takeName](1).value()[0]; | |
}; | |
}); | |
// Add `LazyWrapper` methods for `_.initial` and `_.tail`. | |
arrayEach(['initial', 'tail'], function(methodName, index) { | |
var dropName = 'drop' + (index ? '' : 'Right'); | |
LazyWrapper.prototype[methodName] = function() { | |
return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1); | |
}; | |
}); | |
LazyWrapper.prototype.compact = function() { | |
return this.filter(identity); | |
}; | |
LazyWrapper.prototype.find = function(predicate) { | |
return this.filter(predicate).head(); | |
}; | |
LazyWrapper.prototype.findLast = function(predicate) { | |
return this.reverse().find(predicate); | |
}; | |
LazyWrapper.prototype.invokeMap = baseRest(function(path, args) { | |
if (typeof path == 'function') { | |
return new LazyWrapper(this); | |
} | |
return this.map(function(value) { | |
return baseInvoke(value, path, args); | |
}); | |
}); | |
LazyWrapper.prototype.reject = function(predicate) { | |
return this.filter(negate(getIteratee(predicate))); | |
}; | |
LazyWrapper.prototype.slice = function(start, end) { | |
start = toInteger(start); | |
var result = this; | |
if (result.__filtered__ && (start > 0 || end < 0)) { | |
return new LazyWrapper(result); | |
} | |
if (start < 0) { | |
result = result.takeRight(-start); | |
} else if (start) { | |
result = result.drop(start); | |
} | |
if (end !== undefined) { | |
end = toInteger(end); | |
result = end < 0 ? result.dropRight(-end) : result.take(end - start); | |
} | |
return result; | |
}; | |
LazyWrapper.prototype.takeRightWhile = function(predicate) { | |
return this.reverse().takeWhile(predicate).reverse(); | |
}; | |
LazyWrapper.prototype.toArray = function() { | |
return this.take(MAX_ARRAY_LENGTH); | |
}; | |
// Add `LazyWrapper` methods to `lodash.prototype`. | |
baseForOwn(LazyWrapper.prototype, function(func, methodName) { | |
var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName), | |
isTaker = /^(?:head|last)$/.test(methodName), | |
lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName], | |
retUnwrapped = isTaker || /^find/.test(methodName); | |
if (!lodashFunc) { | |
return; | |
} | |
lodash.prototype[methodName] = function() { | |
var value = this.__wrapped__, | |
args = isTaker ? [1] : arguments, | |
isLazy = value instanceof LazyWrapper, | |
iteratee = args[0], | |
useLazy = isLazy || isArray(value); | |
var interceptor = function(value) { | |
var result = lodashFunc.apply(lodash, arrayPush([value], args)); | |
return (isTaker && chainAll) ? result[0] : result; | |
}; | |
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 chainAll = this.__chain__, | |
isHybrid = !!this.__actions__.length, | |
isUnwrapped = retUnwrapped && !chainAll, | |
onlyLazy = isLazy && !isHybrid; | |
if (!retUnwrapped && useLazy) { | |
value = onlyLazy ? value : new LazyWrapper(this); | |
var result = func.apply(value, args); | |
result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined }); | |
return new LodashWrapper(result, chainAll); | |
} | |
if (isUnwrapped && onlyLazy) { | |
return func.apply(this, args); | |
} | |
result = this.thru(interceptor); | |
return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result; | |
}; | |
}); | |
// Add `Array` methods to `lodash.prototype`. | |
arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) { | |
var func = arrayProto[methodName], | |
chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru', | |
retUnwrapped = /^(?:pop|shift)$/.test(methodName); | |
lodash.prototype[methodName] = function() { | |
var args = arguments; | |
if (retUnwrapped && !this.__chain__) { | |
var value = this.value(); | |
return func.apply(isArray(value) ? value : [], args); | |
} | |
return this[chainName](function(value) { | |
return func.apply(isArray(value) ? value : [], args); | |
}); | |
}; | |
}); | |
// Map minified method 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[createHybrid(undefined, BIND_KEY_FLAG).name] = [{ | |
'name': 'wrapper', | |
'func': undefined | |
}]; | |
// Add methods to `LazyWrapper`. | |
LazyWrapper.prototype.clone = lazyClone; | |
LazyWrapper.prototype.reverse = lazyReverse; | |
LazyWrapper.prototype.value = lazyValue; | |
// Add chain sequence methods to the `lodash` wrapper. | |
lodash.prototype.at = wrapperAt; | |
lodash.prototype.chain = wrapperChain; | |
lodash.prototype.commit = wrapperCommit; | |
lodash.prototype.next = wrapperNext; | |
lodash.prototype.plant = wrapperPlant; | |
lodash.prototype.reverse = wrapperReverse; | |
lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue; | |
// Add lazy aliases. | |
lodash.prototype.first = lodash.prototype.head; | |
if (iteratorSymbol) { | |
lodash.prototype[iteratorSymbol] = wrapperToIterator; | |
} | |
return lodash; | |
} | |
/*--------------------------------------------------------------------------*/ | |
// Export lodash. | |
var _ = runInContext(); | |
// Some AMD build optimizers, like r.js, check for condition patterns like: | |
if (true) { | |
// Expose Lodash on the global object to prevent errors when Lodash is | |
// loaded by a script tag in the presence of an AMD loader. | |
// See http://requirejs.org/docs/errors.html#mismatch for more details. | |
// Use `_.noConflict` to remove Lodash from the global object. | |
root._ = _; | |
// Define as an anonymous module so, through path mapping, it can be | |
// referenced as the "underscore" module. | |
!(__WEBPACK_AMD_DEFINE_RESULT__ = function() { | |
return _; | |
}.call(exports, __webpack_require__, exports, module), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__)); | |
} | |
// Check for `exports` after `define` in case a build optimizer adds it. | |
else if (freeModule) { | |
// Export for Node.js. | |
(freeModule.exports = _)._ = _; | |
// Export for CommonJS support. | |
freeExports._ = _; | |
} | |
else { | |
// Export to the global object. | |
root._ = _; | |
} | |
}.call(this)); | |
/* WEBPACK VAR INJECTION */}.call(exports, (function() { return this; }()), __webpack_require__(25)(module))) | |
/***/ }, | |
/* 96 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var _ = __webpack_require__(95), | |
$ = __webpack_require__(97), | |
utils = __webpack_require__(94), | |
isTag = utils.isTag, | |
domEach = utils.domEach, | |
hasOwn = Object.prototype.hasOwnProperty, | |
camelCase = utils.camelCase, | |
cssCase = utils.cssCase, | |
rspace = /\s+/, | |
dataAttrPrefix = 'data-', | |
// Lookup table for coercing string data-* attributes to their corresponding | |
// JavaScript primitives | |
primitives = { | |
null: null, | |
true: true, | |
false: false | |
}, | |
// Attributes that are booleans | |
rboolean = /^(?:autofocus|autoplay|async|checked|controls|defer|disabled|hidden|loop|multiple|open|readonly|required|scoped|selected)$/i, | |
// Matches strings that look like JSON objects or arrays | |
rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/; | |
var getAttr = function(elem, name) { | |
if (!elem || !isTag(elem)) return; | |
if (!elem.attribs) { | |
elem.attribs = {}; | |
} | |
// Return the entire attribs object if no attribute specified | |
if (!name) { | |
return elem.attribs; | |
} | |
if (hasOwn.call(elem.attribs, name)) { | |
// Get the (decoded) attribute | |
return rboolean.test(name) ? name : elem.attribs[name]; | |
} | |
// Mimic the DOM and return text content as value for `option's` | |
if (elem.name === 'option' && name === 'value') { | |
return $.text(elem.children); | |
} | |
}; | |
var setAttr = function(el, name, value) { | |
if (value === null) { | |
removeAttribute(el, name); | |
} else { | |
el.attribs[name] = value+''; | |
} | |
}; | |
exports.attr = function(name, value) { | |
// Set the value (with attr map support) | |
if (typeof name === 'object' || value !== undefined) { | |
if (typeof value === 'function') { | |
return domEach(this, function(i, el) { | |
setAttr(el, name, value.call(el, i, el.attribs[name])); | |
}); | |
} | |
return domEach(this, function(i, el) { | |
if (!isTag(el)) return; | |
if (typeof name === 'object') { | |
_.each(name, function(value, name) { | |
setAttr(el, name, value); | |
}); | |
} else { | |
setAttr(el, name, value); | |
} | |
}); | |
} | |
return getAttr(this[0], name); | |
}; | |
var getProp = function (el, name) { | |
return el.hasOwnProperty(name) | |
? el[name] | |
: rboolean.test(name) | |
? getAttr(el, name) !== undefined | |
: getAttr(el, name); | |
}; | |
var setProp = function (el, name, value) { | |
el[name] = rboolean.test(name) ? !!value : value; | |
}; | |
exports.prop = function (name, value) { | |
var i = 0, | |
property; | |
if (typeof name === 'string' && value === undefined) { | |
switch (name) { | |
case 'style': | |
property = this.css(); | |
_.each(property, function (v, p) { | |
property[i++] = p; | |
}); | |
property.length = i; | |
break; | |
case 'tagName': | |
case 'nodeName': | |
property = this[0].name.toUpperCase(); | |
break; | |
default: | |
property = getProp(this[0], name); | |
} | |
return property; | |
} | |
if (typeof name === 'object' || value !== undefined) { | |
if (typeof value === 'function') { | |
return domEach(this, function(i, el) { | |
setProp(el, name, value.call(el, i, getProp(el, name))); | |
}); | |
} | |
return domEach(this, function(i, el) { | |
if (!isTag(el)) return; | |
if (typeof name === 'object') { | |
_.each(name, function(val, name) { | |
setProp(el, name, val); | |
}); | |
} else { | |
setProp(el, name, value); | |
} | |
}); | |
} | |
}; | |
var setData = function(el, name, value) { | |
if (!el.data) { | |
el.data = {}; | |
} | |
if (typeof name === 'object') return _.extend(el.data, name); | |
if (typeof name === 'string' && value !== undefined) { | |
el.data[name] = value; | |
} else if (typeof name === 'object') { | |
_.exend(el.data, name); | |
} | |
}; | |
// Read the specified attribute from the equivalent HTML5 `data-*` attribute, | |
// and (if present) cache the value in the node's internal data store. If no | |
// attribute name is specified, read *all* HTML5 `data-*` attributes in this | |
// manner. | |
var readData = function(el, name) { | |
var readAll = arguments.length === 1; | |
var domNames, domName, jsNames, jsName, value, idx, length; | |
if (readAll) { | |
domNames = Object.keys(el.attribs).filter(function(attrName) { | |
return attrName.slice(0, dataAttrPrefix.length) === dataAttrPrefix; | |
}); | |
jsNames = domNames.map(function(domName) { | |
return camelCase(domName.slice(dataAttrPrefix.length)); | |
}); | |
} else { | |
domNames = [dataAttrPrefix + cssCase(name)]; | |
jsNames = [name]; | |
} | |
for (idx = 0, length = domNames.length; idx < length; ++idx) { | |
domName = domNames[idx]; | |
jsName = jsNames[idx]; | |
if (hasOwn.call(el.attribs, domName)) { | |
value = el.attribs[domName]; | |
if (hasOwn.call(primitives, value)) { | |
value = primitives[value]; | |
} else if (value === String(Number(value))) { | |
value = Number(value); | |
} else if (rbrace.test(value)) { | |
try { | |
value = JSON.parse(value); | |
} catch(e){ } | |
} | |
el.data[jsName] = value; | |
} | |
} | |
return readAll ? el.data : value; | |
}; | |
exports.data = function(name, value) { | |
var elem = this[0]; | |
if (!elem || !isTag(elem)) return; | |
if (!elem.data) { | |
elem.data = {}; | |
} | |
// Return the entire data object if no data specified | |
if (!name) { | |
return readData(elem); | |
} | |
// Set the value (with attr map support) | |
if (typeof name === 'object' || value !== undefined) { | |
domEach(this, function(i, el) { | |
setData(el, name, value); | |
}); | |
return this; | |
} else if (hasOwn.call(elem.data, name)) { | |
return elem.data[name]; | |
} | |
return readData(elem, name); | |
}; | |
/** | |
* Get the value of an element | |
*/ | |
exports.val = function(value) { | |
var querying = arguments.length === 0, | |
element = this[0]; | |
if(!element) return; | |
switch (element.name) { | |
case 'textarea': | |
return this.text(value); | |
case 'input': | |
switch (this.attr('type')) { | |
case 'radio': | |
if (querying) { | |
return this.attr('value'); | |
} else { | |
this.attr('value', value); | |
return this; | |
} | |
break; | |
default: | |
return this.attr('value', value); | |
} | |
return; | |
case 'select': | |
var option = this.find('option:selected'), | |
returnValue; | |
if (option === undefined) return undefined; | |
if (!querying) { | |
if (!this.attr().hasOwnProperty('multiple') && typeof value == 'object') { | |
return this; | |
} | |
if (typeof value != 'object') { | |
value = [value]; | |
} | |
this.find('option').removeAttr('selected'); | |
for (var i = 0; i < value.length; i++) { | |
this.find('option[value="' + value[i] + '"]').attr('selected', ''); | |
} | |
return this; | |
} | |
returnValue = option.attr('value'); | |
if (this.attr().hasOwnProperty('multiple')) { | |
returnValue = []; | |
domEach(option, function(i, el) { | |
returnValue.push(getAttr(el, 'value')); | |
}); | |
} | |
return returnValue; | |
case 'option': | |
if (!querying) { | |
this.attr('value', value); | |
return this; | |
} | |
return this.attr('value'); | |
} | |
}; | |
/** | |
* Remove an attribute | |
*/ | |
var removeAttribute = function(elem, name) { | |
if (!elem.attribs || !hasOwn.call(elem.attribs, name)) | |
return; | |
delete elem.attribs[name]; | |
}; | |
exports.removeAttr = function(name) { | |
domEach(this, function(i, elem) { | |
removeAttribute(elem, name); | |
}); | |
return this; | |
}; | |
exports.hasClass = function(className) { | |
return _.some(this, function(elem) { | |
var attrs = elem.attribs, | |
clazz = attrs && attrs['class'], | |
idx = -1, | |
end; | |
if (clazz) { | |
while ((idx = clazz.indexOf(className, idx+1)) > -1) { | |
end = idx + className.length; | |
if ((idx === 0 || rspace.test(clazz[idx-1])) | |
&& (end === clazz.length || rspace.test(clazz[end]))) { | |
return true; | |
} | |
} | |
} | |
}); | |
}; | |
exports.addClass = function(value) { | |
// Support functions | |
if (typeof value === 'function') { | |
return domEach(this, function(i, el) { | |
var className = el.attribs['class'] || ''; | |
exports.addClass.call([el], value.call(el, i, className)); | |
}); | |
} | |
// Return if no value or not a string or function | |
if (!value || typeof value !== 'string') return this; | |
var classNames = value.split(rspace), | |
numElements = this.length; | |
for (var i = 0; i < numElements; i++) { | |
// If selected element isn't a tag, move on | |
if (!isTag(this[i])) continue; | |
// If we don't already have classes | |
var className = getAttr(this[i], 'class'), | |
numClasses, | |
setClass; | |
if (!className) { | |
setAttr(this[i], 'class', classNames.join(' ').trim()); | |
} else { | |
setClass = ' ' + className + ' '; | |
numClasses = classNames.length; | |
// Check if class already exists | |
for (var j = 0; j < numClasses; j++) { | |
var appendClass = classNames[j] + ' '; | |
if (setClass.indexOf(' ' + appendClass) < 0) | |
setClass += appendClass; | |
} | |
setAttr(this[i], 'class', setClass.trim()); | |
} | |
} | |
return this; | |
}; | |
var splitClass = function(className) { | |
return className ? className.trim().split(rspace) : []; | |
}; | |
exports.removeClass = function(value) { | |
var classes, | |
numClasses, | |
removeAll; | |
// Handle if value is a function | |
if (typeof value === 'function') { | |
return domEach(this, function(i, el) { | |
exports.removeClass.call( | |
[el], value.call(el, i, el.attribs['class'] || '') | |
); | |
}); | |
} | |
classes = splitClass(value); | |
numClasses = classes.length; | |
removeAll = arguments.length === 0; | |
return domEach(this, function(i, el) { | |
if (!isTag(el)) return; | |
if (removeAll) { | |
// Short circuit the remove all case as this is the nice one | |
el.attribs.class = ''; | |
} else { | |
var elClasses = splitClass(el.attribs.class), | |
index, | |
changed; | |
for (var j = 0; j < numClasses; j++) { | |
index = elClasses.indexOf(classes[j]); | |
if (index >= 0) { | |
elClasses.splice(index, 1); | |
changed = true; | |
// We have to do another pass to ensure that there are not duplicate | |
// classes listed | |
j--; | |
} | |
} | |
if (changed) { | |
el.attribs.class = elClasses.join(' '); | |
} | |
} | |
}); | |
}; | |
exports.toggleClass = function(value, stateVal) { | |
// Support functions | |
if (typeof value === 'function') { | |
return domEach(this, function(i, el) { | |
exports.toggleClass.call( | |
[el], | |
value.call(el, i, el.attribs['class'] || '', stateVal), | |
stateVal | |
); | |
}); | |
} | |
// Return if no value or not a string or function | |
if (!value || typeof value !== 'string') return this; | |
var classNames = value.split(rspace), | |
numClasses = classNames.length, | |
state = typeof stateVal === 'boolean' ? stateVal ? 1 : -1 : 0, | |
numElements = this.length, | |
elementClasses, | |
index; | |
for (var i = 0; i < numElements; i++) { | |
// If selected element isn't a tag, move on | |
if (!isTag(this[i])) continue; | |
elementClasses = splitClass(this[i].attribs.class); | |
// Check if class already exists | |
for (var j = 0; j < numClasses; j++) { | |
// Check if the class name is currently defined | |
index = elementClasses.indexOf(classNames[j]); | |
// Add if stateValue === true or we are toggling and there is no value | |
if (state >= 0 && index < 0) { | |
elementClasses.push(classNames[j]); | |
} else if (state <= 0 && index >= 0) { | |
// Otherwise remove but only if the item exists | |
elementClasses.splice(index, 1); | |
} | |
} | |
this[i].attribs.class = elementClasses.join(' '); | |
} | |
return this; | |
}; | |
exports.is = function (selector) { | |
if (selector) { | |
return this.filter(selector).length > 0; | |
} | |
return false; | |
}; | |
/***/ }, | |
/* 97 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/** | |
* Module dependencies | |
*/ | |
var select = __webpack_require__(98), | |
parse = __webpack_require__(32), | |
serialize = __webpack_require__(78), | |
_ = __webpack_require__(95); | |
/** | |
* $.load(str) | |
*/ | |
exports.load = function(content, options) { | |
var Cheerio = __webpack_require__(31); | |
options = _.defaults(options || {}, Cheerio.prototype.options); | |
var root = parse(content, options); | |
var initialize = function(selector, context, r, opts) { | |
if (!(this instanceof initialize)) { | |
return new initialize(selector, context, r, opts); | |
} | |
opts = _.defaults(opts || {}, options); | |
return Cheerio.call(this, selector, context, r || root, opts); | |
}; | |
// Ensure that selections created by the "loaded" `initialize` function are | |
// true Cheerio instances. | |
initialize.prototype = Object.create(Cheerio.prototype); | |
initialize.prototype.constructor = initialize; | |
// Mimic jQuery's prototype alias for plugin authors. | |
initialize.fn = initialize.prototype; | |
// Keep a reference to the top-level scope so we can chain methods that implicitly | |
// resolve selectors; e.g. $("<span>").(".bar"), which otherwise loses ._root | |
initialize.prototype._originalRoot = root; | |
// Add in the static methods | |
_.merge(initialize, exports); | |
// Add in the root | |
initialize._root = root; | |
// store options | |
initialize._options = options; | |
return initialize; | |
}; | |
/* | |
* Helper function | |
*/ | |
function render(that, dom, options) { | |
if (!dom) { | |
if (that._root && that._root.children) { | |
dom = that._root.children; | |
} else { | |
return ''; | |
} | |
} else if (typeof dom === 'string') { | |
dom = select(dom, that._root, options); | |
} | |
return serialize(dom, options); | |
} | |
/** | |
* $.html([selector | dom], [options]) | |
*/ | |
exports.html = function(dom, options) { | |
var Cheerio = __webpack_require__(31); | |
// be flexible about parameters, sometimes we call html(), | |
// with options as only parameter | |
// check dom argument for dom element specific properties | |
// assume there is no 'length' or 'type' properties in the options object | |
if (Object.prototype.toString.call(dom) === '[object Object]' && !options && !('length' in dom) && !('type' in dom)) | |
{ | |
options = dom; | |
dom = undefined; | |
} | |
// sometimes $.html() used without preloading html | |
// so fallback non existing options to the default ones | |
options = _.defaults(options || {}, this._options, Cheerio.prototype.options); | |
return render(this, dom, options); | |
}; | |
/** | |
* $.xml([selector | dom]) | |
*/ | |
exports.xml = function(dom) { | |
var options = _.defaults({xmlMode: true}, this._options); | |
return render(this, dom, options); | |
}; | |
/** | |
* $.text(dom) | |
*/ | |
exports.text = function(elems) { | |
if (!elems) return ''; | |
var ret = '', | |
len = elems.length, | |
elem; | |
for (var i = 0; i < len; i++) { | |
elem = elems[i]; | |
if (elem.type === 'text') ret += elem.data; | |
else if (elem.children && elem.type !== 'comment') { | |
ret += exports.text(elem.children); | |
} | |
} | |
return ret; | |
}; | |
/** | |
* $.parseHTML(data [, context ] [, keepScripts ]) | |
* Parses a string into an array of DOM nodes. The `context` argument has no | |
* meaning for Cheerio, but it is maintained for API compatibility with jQuery. | |
*/ | |
exports.parseHTML = function(data, context, keepScripts) { | |
var parsed; | |
if (!data || typeof data !== 'string') { | |
return null; | |
} | |
if (typeof context === 'boolean') { | |
keepScripts = context; | |
} | |
parsed = this.load(data); | |
if (!keepScripts) { | |
parsed('script').remove(); | |
} | |
// The `children` array is used by Cheerio internally to group elements that | |
// share the same parents. When nodes created through `parseHTML` are | |
// inserted into previously-existing DOM structures, they will be removed | |
// from the `children` array. The results of `parseHTML` should remain | |
// constant across these operations, so a shallow copy should be returned. | |
return parsed.root()[0].children.slice(); | |
}; | |
/** | |
* $.root() | |
*/ | |
exports.root = function() { | |
return this(this._root); | |
}; | |
/** | |
* $.contains() | |
*/ | |
exports.contains = function(container, contained) { | |
// According to the jQuery API, an element does not "contain" itself | |
if (contained === container) { | |
return false; | |
} | |
// Step up the descendants, stopping when the root element is reached | |
// (signaled by `.parent` returning a reference to the same object) | |
while (contained && contained !== contained.parent) { | |
contained = contained.parent; | |
if (contained === container) { | |
return true; | |
} | |
} | |
return false; | |
}; | |
/***/ }, | |
/* 98 */ | |
/***/ function(module, exports, __webpack_require__) { | |
"use strict"; | |
module.exports = CSSselect; | |
var Pseudos = __webpack_require__(99), | |
DomUtils = __webpack_require__(76), | |
findOne = DomUtils.findOne, | |
findAll = DomUtils.findAll, | |
getChildren = DomUtils.getChildren, | |
removeSubsets = DomUtils.removeSubsets, | |
falseFunc = __webpack_require__(103).falseFunc, | |
compile = __webpack_require__(105), | |
compileUnsafe = compile.compileUnsafe, | |
compileToken = compile.compileToken; | |
function getSelectorFunc(searchFunc){ | |
return function select(query, elems, options){ | |
if(typeof query !== "function") query = compileUnsafe(query, options, elems); | |
if(!Array.isArray(elems)) elems = getChildren(elems); | |
else elems = removeSubsets(elems); | |
return searchFunc(query, elems); | |
}; | |
} | |
var selectAll = getSelectorFunc(function selectAll(query, elems){ | |
return (query === falseFunc || !elems || elems.length === 0) ? [] : findAll(query, elems); | |
}); | |
var selectOne = getSelectorFunc(function selectOne(query, elems){ | |
return (query === falseFunc || !elems || elems.length === 0) ? null : findOne(query, elems); | |
}); | |
function is(elem, query, options){ | |
return (typeof query === "function" ? query : compile(query, options))(elem); | |
} | |
/* | |
the exported interface | |
*/ | |
function CSSselect(query, elems, options){ | |
return selectAll(query, elems, options); | |
} | |
CSSselect.compile = compile; | |
CSSselect.filters = Pseudos.filters; | |
CSSselect.pseudos = Pseudos.pseudos; | |
CSSselect.selectAll = selectAll; | |
CSSselect.selectOne = selectOne; | |
CSSselect.is = is; | |
//legacy methods (might be removed) | |
CSSselect.parse = compile; | |
CSSselect.iterate = selectAll; | |
//hooks | |
CSSselect._compileUnsafe = compileUnsafe; | |
CSSselect._compileToken = compileToken; | |
/***/ }, | |
/* 99 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* | |
pseudo selectors | |
--- | |
they are available in two forms: | |
* filters called when the selector | |
is compiled and return a function | |
that needs to return next() | |
* pseudos get called on execution | |
they need to return a boolean | |
*/ | |
var DomUtils = __webpack_require__(76), | |
isTag = DomUtils.isTag, | |
getText = DomUtils.getText, | |
getParent = DomUtils.getParent, | |
getChildren = DomUtils.getChildren, | |
getSiblings = DomUtils.getSiblings, | |
hasAttrib = DomUtils.hasAttrib, | |
getName = DomUtils.getName, | |
getAttribute= DomUtils.getAttributeValue, | |
getNCheck = __webpack_require__(100), | |
checkAttrib = __webpack_require__(104).rules.equals, | |
BaseFuncs = __webpack_require__(103), | |
trueFunc = BaseFuncs.trueFunc, | |
falseFunc = BaseFuncs.falseFunc; | |
//helper methods | |
function getFirstElement(elems){ | |
for(var i = 0; elems && i < elems.length; i++){ | |
if(isTag(elems[i])) return elems[i]; | |
} | |
} | |
function getAttribFunc(name, value){ | |
var data = {name: name, value: value}; | |
return function attribFunc(next){ | |
return checkAttrib(next, data); | |
}; | |
} | |
function getChildFunc(next){ | |
return function(elem){ | |
return !!getParent(elem) && next(elem); | |
}; | |
} | |
var filters = { | |
contains: function(next, text){ | |
return function contains(elem){ | |
return next(elem) && getText(elem).indexOf(text) >= 0; | |
}; | |
}, | |
icontains: function(next, text){ | |
var itext = text.toLowerCase(); | |
return function icontains(elem){ | |
return next(elem) && | |
getText(elem).toLowerCase().indexOf(itext) >= 0; | |
}; | |
}, | |
//location specific methods | |
"nth-child": function(next, rule){ | |
var func = getNCheck(rule); | |
if(func === falseFunc) return func; | |
if(func === trueFunc) return getChildFunc(next); | |
return function nthChild(elem){ | |
var siblings = getSiblings(elem); | |
for(var i = 0, pos = 0; i < siblings.length; i++){ | |
if(isTag(siblings[i])){ | |
if(siblings[i] === elem) break; | |
else pos++; | |
} | |
} | |
return func(pos) && next(elem); | |
}; | |
}, | |
"nth-last-child": function(next, rule){ | |
var func = getNCheck(rule); | |
if(func === falseFunc) return func; | |
if(func === trueFunc) return getChildFunc(next); | |
return function nthLastChild(elem){ | |
var siblings = getSiblings(elem); | |
for(var pos = 0, i = siblings.length - 1; i >= 0; i--){ | |
if(isTag(siblings[i])){ | |
if(siblings[i] === elem) break; | |
else pos++; | |
} | |
} | |
return func(pos) && next(elem); | |
}; | |
}, | |
"nth-of-type": function(next, rule){ | |
var func = getNCheck(rule); | |
if(func === falseFunc) return func; | |
if(func === trueFunc) return getChildFunc(next); | |
return function nthOfType(elem){ | |
var siblings = getSiblings(elem); | |
for(var pos = 0, i = 0; i < siblings.length; i++){ | |
if(isTag(siblings[i])){ | |
if(siblings[i] === elem) break; | |
if(getName(siblings[i]) === getName(elem)) pos++; | |
} | |
} | |
return func(pos) && next(elem); | |
}; | |
}, | |
"nth-last-of-type": function(next, rule){ | |
var func = getNCheck(rule); | |
if(func === falseFunc) return func; | |
if(func === trueFunc) return getChildFunc(next); | |
return function nthLastOfType(elem){ | |
var siblings = getSiblings(elem); | |
for(var pos = 0, i = siblings.length - 1; i >= 0; i--){ | |
if(isTag(siblings[i])){ | |
if(siblings[i] === elem) break; | |
if(getName(siblings[i]) === getName(elem)) pos++; | |
} | |
} | |
return func(pos) && next(elem); | |
}; | |
}, | |
//TODO determine the actual root element | |
root: function(next){ | |
return function(elem){ | |
return !getParent(elem) && next(elem); | |
}; | |
}, | |
scope: function(next, rule, options, context){ | |
if(!context || context.length === 0){ | |
//equivalent to :root | |
return filters.root(next); | |
} | |
if(context.length === 1){ | |
//NOTE: can't be unpacked, as :has uses this for side-effects | |
return function(elem){ | |
return context[0] === elem && next(elem); | |
}; | |
} | |
return function(elem){ | |
return context.indexOf(elem) >= 0 && next(elem); | |
}; | |
}, | |
//jQuery extensions (others follow as pseudos) | |
checkbox: getAttribFunc("type", "checkbox"), | |
file: getAttribFunc("type", "file"), | |
password: getAttribFunc("type", "password"), | |
radio: getAttribFunc("type", "radio"), | |
reset: getAttribFunc("type", "reset"), | |
image: getAttribFunc("type", "image"), | |
submit: getAttribFunc("type", "submit") | |
}; | |
//while filters are precompiled, pseudos get called when they are needed | |
var pseudos = { | |
empty: function(elem){ | |
return !getChildren(elem).some(function(elem){ | |
return isTag(elem) || elem.type === "text"; | |
}); | |
}, | |
"first-child": function(elem){ | |
return getFirstElement(getSiblings(elem)) === elem; | |
}, | |
"last-child": function(elem){ | |
var siblings = getSiblings(elem); | |
for(var i = siblings.length - 1; i >= 0; i--){ | |
if(siblings[i] === elem) return true; | |
if(isTag(siblings[i])) break; | |
} | |
return false; | |
}, | |
"first-of-type": function(elem){ | |
var siblings = getSiblings(elem); | |
for(var i = 0; i < siblings.length; i++){ | |
if(isTag(siblings[i])){ | |
if(siblings[i] === elem) return true; | |
if(getName(siblings[i]) === getName(elem)) break; | |
} | |
} | |
return false; | |
}, | |
"last-of-type": function(elem){ | |
var siblings = getSiblings(elem); | |
for(var i = siblings.length-1; i >= 0; i--){ | |
if(isTag(siblings[i])){ | |
if(siblings[i] === elem) return true; | |
if(getName(siblings[i]) === getName(elem)) break; | |
} | |
} | |
return false; | |
}, | |
"only-of-type": function(elem){ | |
var siblings = getSiblings(elem); | |
for(var i = 0, j = siblings.length; i < j; i++){ | |
if(isTag(siblings[i])){ | |
if(siblings[i] === elem) continue; | |
if(getName(siblings[i]) === getName(elem)) return false; | |
} | |
} | |
return true; | |
}, | |
"only-child": function(elem){ | |
var siblings = getSiblings(elem); | |
for(var i = 0; i < siblings.length; i++){ | |
if(isTag(siblings[i]) && siblings[i] !== elem) return false; | |
} | |
return true; | |
}, | |
//:matches(a, area, link)[href] | |
link: function(elem){ | |
return hasAttrib(elem, "href"); | |
}, | |
visited: falseFunc, //seems to be a valid implementation | |
//TODO: :any-link once the name is finalized (as an alias of :link) | |
//forms | |
//to consider: :target | |
//:matches([selected], select:not([multiple]):not(> option[selected]) > option:first-of-type) | |
selected: function(elem){ | |
if(hasAttrib(elem, "selected")) return true; | |
else if(getName(elem) !== "option") return false; | |
//the first <option> in a <select> is also selected | |
var parent = getParent(elem); | |
if( | |
!parent || | |
getName(parent) !== "select" || | |
hasAttrib(parent, "multiple") | |
) return false; | |
var siblings = getChildren(parent), | |
sawElem = false; | |
for(var i = 0; i < siblings.length; i++){ | |
if(isTag(siblings[i])){ | |
if(siblings[i] === elem){ | |
sawElem = true; | |
} else if(!sawElem){ | |
return false; | |
} else if(hasAttrib(siblings[i], "selected")){ | |
return false; | |
} | |
} | |
} | |
return sawElem; | |
}, | |
//https://html.spec.whatwg.org/multipage/scripting.html#disabled-elements | |
//:matches( | |
// :matches(button, input, select, textarea, menuitem, optgroup, option)[disabled], | |
// optgroup[disabled] > option), | |
// fieldset[disabled] * //TODO not child of first <legend> | |
//) | |
disabled: function(elem){ | |
return hasAttrib(elem, "disabled"); | |
}, | |
enabled: function(elem){ | |
return !hasAttrib(elem, "disabled"); | |
}, | |
//:matches(:matches(:radio, :checkbox)[checked], :selected) (TODO menuitem) | |
checked: function(elem){ | |
return hasAttrib(elem, "checked") || pseudos.selected(elem); | |
}, | |
//:matches(input, select, textarea)[required] | |
required: function(elem){ | |
return hasAttrib(elem, "required"); | |
}, | |
//:matches(input, select, textarea):not([required]) | |
optional: function(elem){ | |
return !hasAttrib(elem, "required"); | |
}, | |
//jQuery extensions | |
//:not(:empty) | |
parent: function(elem){ | |
return !pseudos.empty(elem); | |
}, | |
//:matches(h1, h2, h3, h4, h5, h6) | |
header: function(elem){ | |
var name = getName(elem); | |
return name === "h1" || | |
name === "h2" || | |
name === "h3" || | |
name === "h4" || | |
name === "h5" || | |
name === "h6"; | |
}, | |
//:matches(button, input[type=button]) | |
button: function(elem){ | |
var name = getName(elem); | |
return name === "button" || | |
name === "input" && | |
getAttribute(elem, "type") === "button"; | |
}, | |
//:matches(input, textarea, select, button) | |
input: function(elem){ | |
var name = getName(elem); | |
return name === "input" || | |
name === "textarea" || | |
name === "select" || | |
name === "button"; | |
}, | |
//input:matches(:not([type!='']), [type='text' i]) | |
text: function(elem){ | |
var attr; | |
return getName(elem) === "input" && ( | |
!(attr = getAttribute(elem, "type")) || | |
attr.toLowerCase() === "text" | |
); | |
} | |
}; | |
function verifyArgs(func, name, subselect){ | |
if(subselect === null){ | |
if(func.length > 1 && name !== "scope"){ | |
throw new SyntaxError("pseudo-selector :" + name + " requires an argument"); | |
} | |
} else { | |
if(func.length === 1){ | |
throw new SyntaxError("pseudo-selector :" + name + " doesn't have any arguments"); | |
} | |
} | |
} | |
//FIXME this feels hacky | |
var re_CSS3 = /^(?:(?:nth|last|first|only)-(?:child|of-type)|root|empty|(?:en|dis)abled|checked|not)$/; | |
module.exports = { | |
compile: function(next, data, options, context){ | |
var name = data.name, | |
subselect = data.data; | |
if(options && options.strict && !re_CSS3.test(name)){ | |
throw SyntaxError(":" + name + " isn't part of CSS3"); | |
} | |
if(typeof filters[name] === "function"){ | |
verifyArgs(filters[name], name, subselect); | |
return filters[name](next, subselect, options, context); | |
} else if(typeof pseudos[name] === "function"){ | |
var func = pseudos[name]; | |
verifyArgs(func, name, subselect); | |
if(next === trueFunc) return func; | |
return function pseudoArgs(elem){ | |
return func(elem, subselect) && next(elem); | |
}; | |
} else { | |
throw new SyntaxError("unmatched pseudo-class :" + name); | |
} | |
}, | |
filters: filters, | |
pseudos: pseudos | |
}; | |
/***/ }, | |
/* 100 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var parse = __webpack_require__(101), | |
compile = __webpack_require__(102); | |
module.exports = function nthCheck(formula){ | |
return compile(parse(formula)); | |
}; | |
module.exports.parse = parse; | |
module.exports.compile = compile; | |
/***/ }, | |
/* 101 */ | |
/***/ function(module, exports) { | |
module.exports = parse; | |
//following http://www.w3.org/TR/css3-selectors/#nth-child-pseudo | |
//[ ['-'|'+']? INTEGER? {N} [ S* ['-'|'+'] S* INTEGER ]? | |
var re_nthElement = /^([+\-]?\d*n)?\s*(?:([+\-]?)\s*(\d+))?$/; | |
/* | |
parses a nth-check formula, returns an array of two numbers | |
*/ | |
function parse(formula){ | |
formula = formula.trim().toLowerCase(); | |
if(formula === "even"){ | |
return [2, 0]; | |
} else if(formula === "odd"){ | |
return [2, 1]; | |
} else { | |
var parsed = formula.match(re_nthElement); | |
if(!parsed){ | |
throw new SyntaxError("n-th rule couldn't be parsed ('" + formula + "')"); | |
} | |
var a; | |
if(parsed[1]){ | |
a = parseInt(parsed[1], 10); | |
if(isNaN(a)){ | |
if(parsed[1].charAt(0) === "-") a = -1; | |
else a = 1; | |
} | |
} else a = 0; | |
return [ | |
a, | |
parsed[3] ? parseInt((parsed[2] || "") + parsed[3], 10) : 0 | |
]; | |
} | |
} | |
/***/ }, | |
/* 102 */ | |
/***/ function(module, exports, __webpack_require__) { | |
module.exports = compile; | |
var BaseFuncs = __webpack_require__(103), | |
trueFunc = BaseFuncs.trueFunc, | |
falseFunc = BaseFuncs.falseFunc; | |
/* | |
returns a function that checks if an elements index matches the given rule | |
highly optimized to return the fastest solution | |
*/ | |
function compile(parsed){ | |
var a = parsed[0], | |
b = parsed[1] - 1; | |
//when b <= 0, a*n won't be possible for any matches when a < 0 | |
//besides, the specification says that no element is matched when a and b are 0 | |
if(b < 0 && a <= 0) return falseFunc; | |
//when a is in the range -1..1, it matches any element (so only b is checked) | |
if(a ===-1) return function(pos){ return pos <= b; }; | |
if(a === 0) return function(pos){ return pos === b; }; | |
//when b <= 0 and a === 1, they match any element | |
if(a === 1) return b < 0 ? trueFunc : function(pos){ return pos >= b; }; | |
//when a > 0, modulo can be used to check if there is a match | |
var bMod = b % a; | |
if(bMod < 0) bMod += a; | |
if(a > 1){ | |
return function(pos){ | |
return pos >= b && pos % a === bMod; | |
}; | |
} | |
a *= -1; //make `a` positive | |
return function(pos){ | |
return pos <= b && pos % a === bMod; | |
}; | |
} | |
/***/ }, | |
/* 103 */ | |
/***/ function(module, exports) { | |
module.exports = { | |
trueFunc: function trueFunc(){ | |
return true; | |
}, | |
falseFunc: function falseFunc(){ | |
return false; | |
} | |
}; | |
/***/ }, | |
/* 104 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var DomUtils = __webpack_require__(76), | |
hasAttrib = DomUtils.hasAttrib, | |
getAttributeValue = DomUtils.getAttributeValue, | |
falseFunc = __webpack_require__(103).falseFunc; | |
//https://github.com/slevithan/XRegExp/blob/master/src/xregexp.js#L469 | |
var reChars = /[-[\]{}()*+?.,\\^$|#\s]/g; | |
/* | |
attribute selectors | |
*/ | |
var attributeRules = { | |
__proto__: null, | |
equals: function(next, data){ | |
var name = data.name, | |
value = data.value; | |
if(data.ignoreCase){ | |
value = value.toLowerCase(); | |
return function equalsIC(elem){ | |
var attr = getAttributeValue(elem, name); | |
return attr != null && attr.toLowerCase() === value && next(elem); | |
}; | |
} | |
return function equals(elem){ | |
return getAttributeValue(elem, name) === value && next(elem); | |
}; | |
}, | |
hyphen: function(next, data){ | |
var name = data.name, | |
value = data.value, | |
len = value.length; | |
if(data.ignoreCase){ | |
value = value.toLowerCase(); | |
return function hyphenIC(elem){ | |
var attr = getAttributeValue(elem, name); | |
return attr != null && | |
(attr.length === len || attr.charAt(len) === "-") && | |
attr.substr(0, len).toLowerCase() === value && | |
next(elem); | |
}; | |
} | |
return function hyphen(elem){ | |
var attr = getAttributeValue(elem, name); | |
return attr != null && | |
attr.substr(0, len) === value && | |
(attr.length === len || attr.charAt(len) === "-") && | |
next(elem); | |
}; | |
}, | |
element: function(next, data){ | |
var name = data.name, | |
value = data.value; | |
if(/\s/.test(value)){ | |
return falseFunc; | |
} | |
value = value.replace(reChars, "\\$&"); | |
var pattern = "(?:^|\\s)" + value + "(?:$|\\s)", | |
flags = data.ignoreCase ? "i" : "", | |
regex = new RegExp(pattern, flags); | |
return function element(elem){ | |
var attr = getAttributeValue(elem, name); | |
return attr != null && regex.test(attr) && next(elem); | |
}; | |
}, | |
exists: function(next, data){ | |
var name = data.name; | |
return function exists(elem){ | |
return hasAttrib(elem, name) && next(elem); | |
}; | |
}, | |
start: function(next, data){ | |
var name = data.name, | |
value = data.value, | |
len = value.length; | |
if(len === 0){ | |
return falseFunc; | |
} | |
if(data.ignoreCase){ | |
value = value.toLowerCase(); | |
return function startIC(elem){ | |
var attr = getAttributeValue(elem, name); | |
return attr != null && attr.substr(0, len).toLowerCase() === value && next(elem); | |
}; | |
} | |
return function start(elem){ | |
var attr = getAttributeValue(elem, name); | |
return attr != null && attr.substr(0, len) === value && next(elem); | |
}; | |
}, | |
end: function(next, data){ | |
var name = data.name, | |
value = data.value, | |
len = -value.length; | |
if(len === 0){ | |
return falseFunc; | |
} | |
if(data.ignoreCase){ | |
value = value.toLowerCase(); | |
return function endIC(elem){ | |
var attr = getAttributeValue(elem, name); | |
return attr != null && attr.substr(len).toLowerCase() === value && next(elem); | |
}; | |
} | |
return function end(elem){ | |
var attr = getAttributeValue(elem, name); | |
return attr != null && attr.substr(len) === value && next(elem); | |
}; | |
}, | |
any: function(next, data){ | |
var name = data.name, | |
value = data.value; | |
if(value === ""){ | |
return falseFunc; | |
} | |
if(data.ignoreCase){ | |
var regex = new RegExp(value.replace(reChars, "\\$&"), "i"); | |
return function anyIC(elem){ | |
var attr = getAttributeValue(elem, name); | |
return attr != null && regex.test(attr) && next(elem); | |
}; | |
} | |
return function any(elem){ | |
var attr = getAttributeValue(elem, name); | |
return attr != null && attr.indexOf(value) >= 0 && next(elem); | |
}; | |
}, | |
not: function(next, data){ | |
var name = data.name, | |
value = data.value; | |
if(value === ""){ | |
return function notEmpty(elem){ | |
return !!getAttributeValue(elem, name) && next(elem); | |
}; | |
} else if(data.ignoreCase){ | |
value = value.toLowerCase(); | |
return function notIC(elem){ | |
var attr = getAttributeValue(elem, name); | |
return attr != null && attr.toLowerCase() !== value && next(elem); | |
}; | |
} | |
return function not(elem){ | |
return getAttributeValue(elem, name) !== value && next(elem); | |
}; | |
} | |
}; | |
module.exports = { | |
compile: function(next, data, options){ | |
if(options && options.strict && ( | |
data.ignoreCase || data.action === "not" | |
)) throw SyntaxError("Unsupported attribute selector"); | |
return attributeRules[data.action](next, data); | |
}, | |
rules: attributeRules | |
}; | |
/***/ }, | |
/* 105 */ | |
/***/ function(module, exports, __webpack_require__) { | |
/* | |
compiles a selector to an executable function | |
*/ | |
module.exports = compile; | |
module.exports.compileUnsafe = compileUnsafe; | |
module.exports.compileToken = compileToken; | |
var parse = __webpack_require__(106), | |
DomUtils = __webpack_require__(76), | |
isTag = DomUtils.isTag, | |
Rules = __webpack_require__(107), | |
sortRules = __webpack_require__(108), | |
BaseFuncs = __webpack_require__(103), | |
trueFunc = BaseFuncs.trueFunc, | |
falseFunc = BaseFuncs.falseFunc, | |
procedure = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"./procedure.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())); | |
function compile(selector, options, context){ | |
var next = compileUnsafe(selector, options, context); | |
return wrap(next); | |
} | |
function wrap(next){ | |
return function base(elem){ | |
return isTag(elem) && next(elem); | |
}; | |
} | |
function compileUnsafe(selector, options, context){ | |
var token = parse(selector, options); | |
return compileToken(token, options, context); | |
} | |
function includesScopePseudo(t){ | |
return t.type === "pseudo" && ( | |
t.name === "scope" || ( | |
Array.isArray(t.data) && | |
t.data.some(function(data){ | |
return data.some(includesScopePseudo); | |
}) | |
) | |
); | |
} | |
var DESCENDANT_TOKEN = {type: "descendant"}, | |
SCOPE_TOKEN = {type: "pseudo", name: "scope"}, | |
PLACEHOLDER_ELEMENT = {}, | |
getParent = DomUtils.getParent; | |
//CSS 4 Spec (Draft): 3.3.1. Absolutizing a Scope-relative Selector | |
//http://www.w3.org/TR/selectors4/#absolutizing | |
function absolutize(token, context){ | |
//TODO better check if context is document | |
var hasContext = !!context && !!context.length && context.every(function(e){ | |
return e === PLACEHOLDER_ELEMENT || !!getParent(e); | |
}); | |
token.forEach(function(t){ | |
if(t.length > 0 && isTraversal(t[0]) && t[0].type !== "descendant"){ | |
//don't return in else branch | |
} else if(hasContext && !includesScopePseudo(t)){ | |
t.unshift(DESCENDANT_TOKEN); | |
} else { | |
return; | |
} | |
t.unshift(SCOPE_TOKEN); | |
}); | |
} | |
function compileToken(token, options, context){ | |
token = token.filter(function(t){ return t.length > 0; }); | |
token.forEach(sortRules); | |
var isArrayContext = Array.isArray(context); | |
context = (options && options.context) || context; | |
if(context && !isArrayContext) context = [context]; | |
absolutize(token, context); | |
return token | |
.map(function(rules){ return compileRules(rules, options, context, isArrayContext); }) | |
.reduce(reduceRules, falseFunc); | |
} | |
function isTraversal(t){ | |
return procedure[t.type] < 0; | |
} | |
function compileRules(rules, options, context, isArrayContext){ | |
var acceptSelf = (isArrayContext && rules[0].name === "scope" && rules[1].type === "descendant"); | |
return rules.reduce(function(func, rule, index){ | |
if(func === falseFunc) return func; | |
return Rules[rule.type](func, rule, options, context, acceptSelf && index === 1); | |
}, options && options.rootFunc || trueFunc); | |
} | |
function reduceRules(a, b){ | |
if(b === falseFunc || a === trueFunc){ | |
return a; | |
} | |
if(a === falseFunc || b === trueFunc){ | |
return b; | |
} | |
return function combine(elem){ | |
return a(elem) || b(elem); | |
}; | |
} | |
//:not, :has and :matches have to compile selectors | |
//doing this in lib/pseudos.js would lead to circular dependencies, | |
//so we add them here | |
var Pseudos = __webpack_require__(99), | |
filters = Pseudos.filters, | |
existsOne = DomUtils.existsOne, | |
isTag = DomUtils.isTag, | |
getChildren = DomUtils.getChildren; | |
function containsTraversal(t){ | |
return t.some(isTraversal); | |
} | |
filters.not = function(next, token, options, context){ | |
var opts = { | |
xmlMode: !!(options && options.xmlMode), | |
strict: !!(options && options.strict) | |
}; | |
if(opts.strict){ | |
if(token.length > 1 || token.some(containsTraversal)){ | |
throw new SyntaxError("complex selectors in :not aren't allowed in strict mode"); | |
} | |
} | |
var func = compileToken(token, opts, context); | |
if(func === falseFunc) return next; | |
if(func === trueFunc) return falseFunc; | |
return function(elem){ | |
return !func(elem) && next(elem); | |
}; | |
}; | |
filters.has = function(next, token, options){ | |
var opts = { | |
xmlMode: !!(options && options.xmlMode), | |
strict: !!(options && options.strict) | |
}; | |
//FIXME: Uses an array as a pointer to the current element (side effects) | |
var context = token.some(containsTraversal) ? [PLACEHOLDER_ELEMENT] : null; | |
var func = compileToken(token, opts, context); | |
if(func === falseFunc) return falseFunc; | |
if(func === trueFunc) return function(elem){ | |
return getChildren(elem).some(isTag) && next(elem); | |
}; | |
func = wrap(func); | |
if(context){ | |
return function has(elem){ | |
return next(elem) && ( | |
(context[0] = elem), existsOne(func, getChildren(elem)) | |
); | |
}; | |
} | |
return function has(elem){ | |
return next(elem) && existsOne(func, getChildren(elem)); | |
}; | |
}; | |
filters.matches = function(next, token, options, context){ | |
var opts = { | |
xmlMode: !!(options && options.xmlMode), | |
strict: !!(options && options.strict), | |
rootFunc: next | |
}; | |
return compileToken(token, opts, context); | |
}; | |
/***/ }, | |
/* 106 */ | |
/***/ function(module, exports) { | |
"use strict"; | |
module.exports = parse; | |
var re_name = /^(?:\\.|[\w\-\u00c0-\uFFFF])+/, | |
re_escape = /\\([\da-f]{1,6}\s?|(\s)|.)/ig, | |
//modified version of https://github.com/jquery/sizzle/blob/master/src/sizzle.js#L87 | |
re_attr = /^\s*((?:\\.|[\w\u00c0-\uFFFF\-])+)\s*(?:(\S?)=\s*(?:(['"])(.*?)\3|(#?(?:\\.|[\w\u00c0-\uFFFF\-])*)|)|)\s*(i)?\]/; | |
var actionTypes = { | |
__proto__: null, | |
"undefined": "exists", | |
"": "equals", | |
"~": "element", | |
"^": "start", | |
"$": "end", | |
"*": "any", | |
"!": "not", | |
"|": "hyphen" | |
}; | |
var simpleSelectors = { | |
__proto__: null, | |
">": "child", | |
"<": "parent", | |
"~": "sibling", | |
"+": "adjacent" | |
}; | |
var attribSelectors = { | |
__proto__: null, | |
"#": ["id", "equals"], | |
".": ["class", "element"] | |
}; | |
//pseudos, whose data-property is parsed as well | |
var unpackPseudos = { | |
__proto__: null, | |
"has": true, | |
"not": true, | |
"matches": true | |
}; | |
var stripQuotesFromPseudos = { | |
__proto__: null, | |
"contains": true, | |
"icontains": true | |
}; | |
var quotes = { | |
__proto__: null, | |
"\"": true, | |
"'": true | |
}; | |
//unescape function taken from https://github.com/jquery/sizzle/blob/master/src/sizzle.js#L139 | |
function funescape( _, escaped, escapedWhitespace ) { | |
var high = "0x" + escaped - 0x10000; | |
// NaN means non-codepoint | |
// Support: Firefox | |
// Workaround erroneous numeric interpretation of +"0x" | |
return high !== high || escapedWhitespace ? | |
escaped : | |
// BMP codepoint | |
high < 0 ? | |
String.fromCharCode( high + 0x10000 ) : | |
// Supplemental Plane codepoint (surrogate pair) | |
String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 ); | |
} | |
function unescapeCSS(str){ | |
return str.replace(re_escape, funescape); | |
} | |
function isWhitespace(c){ | |
return c === " " || c === "\n" || c === "\t" || c === "\f" || c === "\r"; | |
} | |
function parse(selector, options){ | |
var subselects = []; | |
selector = parseSelector(subselects, selector + "", options); | |
if(selector !== ""){ | |
throw new SyntaxError("Unmatched selector: " + selector); | |
} | |
return subselects; | |
} | |
function parseSelector(subselects, selector, options){ | |
var tokens = [], | |
sawWS = false, | |
data, firstChar, name, quot; | |
function getName(){ | |
var sub = selector.match(re_name)[0]; | |
selector = selector.substr(sub.length); | |
return unescapeCSS(sub); | |
} | |
function stripWhitespace(start){ | |
while(isWhitespace(selector.charAt(start))) start++; | |
selector = selector.substr(start); | |
} | |
stripWhitespace(0); | |
while(selector !== ""){ | |
firstChar = selector.charAt(0); | |
if(isWhitespace(firstChar)){ | |
sawWS = true; | |
stripWhitespace(1); | |
} else if(firstChar in simpleSelectors){ | |
tokens.push({type: simpleSelectors[firstChar]}); | |
sawWS = false; | |
stripWhitespace(1); | |
} else if(firstChar === ","){ | |
if(tokens.length === 0){ | |
throw new SyntaxError("empty sub-selector"); | |
} | |
subselects.push(tokens); | |
tokens = []; | |
sawWS = false; | |
stripWhitespace(1); | |
} else { | |
if(sawWS){ | |
if(tokens.length > 0){ | |
tokens.push({type: "descendant"}); | |
} | |
sawWS = false; | |
} | |
if(firstChar === "*"){ | |
selector = selector.substr(1); | |
tokens.push({type: "universal"}); | |
} else if(firstChar in attribSelectors){ | |
selector = selector.substr(1); | |
tokens.push({ | |
type: "attribute", | |
name: attribSelectors[firstChar][0], | |
action: attribSelectors[firstChar][1], | |
value: getName(), | |
ignoreCase: false | |
}); | |
} else if(firstChar === "["){ | |
selector = selector.substr(1); | |
data = selector.match(re_attr); | |
if(!data){ | |
throw new SyntaxError("Malformed attribute selector: " + selector); | |
} | |
selector = selector.substr(data[0].length); | |
name = unescapeCSS(data[1]); | |
if( | |
!options || ( | |
"lowerCaseAttributeNames" in options ? | |
options.lowerCaseAttributeNames : | |
!options.xmlMode | |
) | |
){ | |
name = name.toLowerCase(); | |
} | |
tokens.push({ | |
type: "attribute", | |
name: name, | |
action: actionTypes[data[2]], | |
value: unescapeCSS(data[4] || data[5] || ""), | |
ignoreCase: !!data[6] | |
}); | |
} else if(firstChar === ":"){ | |
if(selector.charAt(1) === ":"){ | |
selector = selector.substr(2); | |
tokens.push({type: "pseudo-element", name: getName().toLowerCase()}); | |
continue; | |
} | |
selector = selector.substr(1); | |
name = getName().toLowerCase(); | |
data = null; | |
if(selector.charAt(0) === "("){ | |
if(name in unpackPseudos){ | |
quot = selector.charAt(1); | |
var quoted = quot in quotes; | |
selector = selector.substr(quoted + 1); | |
data = []; | |
selector = parseSelector(data, selector, options); | |
if(quoted){ | |
if(selector.charAt(0) !== quot){ | |
throw new SyntaxError("unmatched quotes in :" + name); | |
} else { | |
selector = selector.substr(1); | |
} | |
} | |
if(selector.charAt(0) !== ")"){ | |
throw new SyntaxError("missing closing parenthesis in :" + name + " " + selector); | |
} | |
selector = selector.substr(1); | |
} else { | |
var pos = 1, counter = 1; | |
for(; counter > 0 && pos < selector.length; pos++){ | |
if(selector.charAt(pos) === "(") counter++; | |
else if(selector.charAt(pos) === ")") counter--; | |
} | |
if(counter){ | |
throw new SyntaxError("parenthesis not matched"); | |
} | |
data = selector.substr(1, pos - 2); | |
selector = selector.substr(pos); | |
if(name in stripQuotesFromPseudos){ | |
quot = data.charAt(0); | |
if(quot === data.slice(-1) && quot in quotes){ | |
data = data.slice(1, -1); | |
} | |
data = unescapeCSS(data); | |
} | |
} | |
} | |
tokens.push({type: "pseudo", name: name, data: data}); | |
} else if(re_name.test(selector)){ | |
name = getName(); | |
if(!options || ("lowerCaseTags" in options ? options.lowerCaseTags : !options.xmlMode)){ | |
name = name.toLowerCase(); | |
} | |
tokens.push({type: "tag", name: name}); | |
} else { | |
if(tokens.length && tokens[tokens.length - 1].type === "descendant"){ | |
tokens.pop(); | |
} | |
addToken(subselects, tokens); | |
return selector; | |
} | |
} | |
} | |
addToken(subselects, tokens); | |
return selector; | |
} | |
function addToken(subselects, tokens){ | |
if(subselects.length > 0 && tokens.length === 0){ | |
throw new SyntaxError("empty sub-selector"); | |
} | |
subselects.push(tokens); | |
} | |
/***/ }, | |
/* 107 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var DomUtils = __webpack_require__(76), | |
isTag = DomUtils.isTag, | |
getParent = DomUtils.getParent, | |
getChildren = DomUtils.getChildren, | |
getSiblings = DomUtils.getSiblings, | |
getName = DomUtils.getName; | |
/* | |
all available rules | |
*/ | |
module.exports = { | |
__proto__: null, | |
attribute: __webpack_require__(104).compile, | |
pseudo: __webpack_require__(99).compile, | |
//tags | |
tag: function(next, data){ | |
var name = data.name; | |
return function tag(elem){ | |
return getName(elem) === name && next(elem); | |
}; | |
}, | |
//traversal | |
descendant: function(next, rule, options, context, acceptSelf){ | |
return function descendant(elem){ | |
if (acceptSelf && next(elem)) return true; | |
var found = false; | |
while(!found && (elem = getParent(elem))){ | |
found = next(elem); | |
} | |
return found; | |
}; | |
}, | |
parent: function(next, data, options){ | |
if(options && options.strict) throw SyntaxError("Parent selector isn't part of CSS3"); | |
return function parent(elem){ | |
return getChildren(elem).some(test); | |
}; | |
function test(elem){ | |
return isTag(elem) && next(elem); | |
} | |
}, | |
child: function(next){ | |
return function child(elem){ | |
var parent = getParent(elem); | |
return !!parent && next(parent); | |
}; | |
}, | |
sibling: function(next){ | |
return function sibling(elem){ | |
var siblings = getSiblings(elem); | |
for(var i = 0; i < siblings.length; i++){ | |
if(isTag(siblings[i])){ | |
if(siblings[i] === elem) break; | |
if(next(siblings[i])) return true; | |
} | |
} | |
return false; | |
}; | |
}, | |
adjacent: function(next){ | |
return function adjacent(elem){ | |
var siblings = getSiblings(elem), | |
lastElement; | |
for(var i = 0; i < siblings.length; i++){ | |
if(isTag(siblings[i])){ | |
if(siblings[i] === elem) break; | |
lastElement = siblings[i]; | |
} | |
} | |
return !!lastElement && next(lastElement); | |
}; | |
}, | |
universal: function(next){ | |
return next; | |
} | |
}; | |
/***/ }, | |
/* 108 */ | |
/***/ function(module, exports, __webpack_require__) { | |
module.exports = sortByProcedure; | |
/* | |
sort the parts of the passed selector, | |
as there is potential for optimization | |
(some types of selectors are faster than others) | |
*/ | |
var procedure = __webpack_require__(!(function webpackMissingModule() { var e = new Error("Cannot find module \"./procedure.json\""); e.code = 'MODULE_NOT_FOUND'; throw e; }())); | |
var attributes = { | |
__proto__: null, | |
exists: 10, | |
equals: 8, | |
not: 7, | |
start: 6, | |
end: 6, | |
any: 5, | |
hyphen: 4, | |
element: 4 | |
}; | |
function sortByProcedure(arr){ | |
var procs = arr.map(getProcedure); | |
for(var i = 1; i < arr.length; i++){ | |
var procNew = procs[i]; | |
if(procNew < 0) continue; | |
for(var j = i - 1; j >= 0 && procNew < procs[j]; j--){ | |
var token = arr[j + 1]; | |
arr[j + 1] = arr[j]; | |
arr[j] = token; | |
procs[j + 1] = procs[j]; | |
procs[j] = procNew; | |
} | |
} | |
} | |
function getProcedure(token){ | |
var proc = procedure[token.type]; | |
if(proc === procedure.attribute){ | |
proc = attributes[token.action]; | |
if(proc === attributes.equals && token.name === "id"){ | |
//prefer ID selectors (eg. #ID) | |
proc = 9; | |
} | |
if(token.ignoreCase){ | |
//ignoreCase adds some overhead, prefer "normal" token | |
//this is a binary operation, to ensure it's still an int | |
proc >>= 1; | |
} | |
} else if(proc === procedure.pseudo){ | |
if(!token.data){ | |
proc = 3; | |
} else if(token.name === "has" || token.name === "contains"){ | |
proc = 0; //expensive in any case | |
} else if(token.name === "matches" || token.name === "not"){ | |
proc = 0; | |
for(var i = 0; i < token.data.length; i++){ | |
//TODO better handling of complex selectors | |
if(token.data[i].length !== 1) continue; | |
var cur = getProcedure(token.data[i][0]); | |
//avoid executing :has or :contains | |
if(cur === 0){ | |
proc = 0; | |
break; | |
} | |
if(cur > proc) proc = cur; | |
} | |
if(token.data.length > 1 && proc > 0) proc -= 1; | |
} else { | |
proc = 1; | |
} | |
} | |
return proc; | |
} | |
/***/ }, | |
/* 109 */, | |
/* 110 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var _ = __webpack_require__(95), | |
select = __webpack_require__(98), | |
utils = __webpack_require__(94), | |
domEach = utils.domEach, | |
uniqueSort = __webpack_require__(37).DomUtils.uniqueSort, | |
isTag = utils.isTag; | |
exports.find = function(selectorOrHaystack) { | |
var elems = _.reduce(this, function(memo, elem) { | |
return memo.concat(_.filter(elem.children, isTag)); | |
}, []); | |
var contains = this.constructor.contains; | |
var haystack; | |
if (selectorOrHaystack && typeof selectorOrHaystack !== 'string') { | |
if (selectorOrHaystack.cheerio) { | |
haystack = selectorOrHaystack.get(); | |
} else { | |
haystack = [selectorOrHaystack]; | |
} | |
return this._make(haystack.filter(function(elem) { | |
var idx, len; | |
for (idx = 0, len = this.length; idx < len; ++idx) { | |
if (contains(this[idx], elem)) { | |
return true; | |
} | |
} | |
}, this)); | |
} | |
var options = {__proto__: this.options, context: this.toArray()}; | |
return this._make(select(selectorOrHaystack, elems, options)); | |
}; | |
// Get the parent of each element in the current set of matched elements, | |
// optionally filtered by a selector. | |
exports.parent = function(selector) { | |
var set = []; | |
domEach(this, function(idx, elem) { | |
var parentElem = elem.parent; | |
if (parentElem && set.indexOf(parentElem) < 0) { | |
set.push(parentElem); | |
} | |
}); | |
if (arguments.length) { | |
set = exports.filter.call(set, selector, this); | |
} | |
return this._make(set); | |
}; | |
exports.parents = function(selector) { | |
var parentNodes = []; | |
// When multiple DOM elements are in the original set, the resulting set will | |
// be in *reverse* order of the original elements as well, with duplicates | |
// removed. | |
this.get().reverse().forEach(function(elem) { | |
traverseParents(this, elem.parent, selector, Infinity) | |
.forEach(function(node) { | |
if (parentNodes.indexOf(node) === -1) { | |
parentNodes.push(node); | |
} | |
} | |
); | |
}, this); | |
return this._make(parentNodes); | |
}; | |
exports.parentsUntil = function(selector, filter) { | |
var parentNodes = [], untilNode, untilNodes; | |
if (typeof selector === 'string') { | |
untilNode = select(selector, this.parents().toArray(), this.options)[0]; | |
} else if (selector && selector.cheerio) { | |
untilNodes = selector.toArray(); | |
} else if (selector) { | |
untilNode = selector; | |
} | |
// When multiple DOM elements are in the original set, the resulting set will | |
// be in *reverse* order of the original elements as well, with duplicates | |
// removed. | |
this.toArray().reverse().forEach(function(elem) { | |
while ((elem = elem.parent)) { | |
if ((untilNode && elem !== untilNode) || | |
(untilNodes && untilNodes.indexOf(elem) === -1) || | |
(!untilNode && !untilNodes)) { | |
if (isTag(elem) && parentNodes.indexOf(elem) === -1) { parentNodes.push(elem); } | |
} else { | |
break; | |
} | |
} | |
}, this); | |
return this._make(filter ? select(filter, parentNodes, this.options) : parentNodes); | |
}; | |
// For each element in the set, get the first element that matches the selector | |
// by testing the element itself and traversing up through its ancestors in the | |
// DOM tree. | |
exports.closest = function(selector) { | |
var set = []; | |
if (!selector) { | |
return this._make(set); | |
} | |
domEach(this, function(idx, elem) { | |
var closestElem = traverseParents(this, elem, selector, 1)[0]; | |
// Do not add duplicate elements to the set | |
if (closestElem && set.indexOf(closestElem) < 0) { | |
set.push(closestElem); | |
} | |
}.bind(this)); | |
return this._make(set); | |
}; | |
exports.next = function(selector) { | |
if (!this[0]) { return this; } | |
var elems = []; | |
_.forEach(this, function(elem) { | |
while ((elem = elem.next)) { | |
if (isTag(elem)) { | |
elems.push(elem); | |
return; | |
} | |
} | |
}); | |
return selector ? | |
exports.filter.call(elems, selector, this) : | |
this._make(elems); | |
}; | |
exports.nextAll = function(selector) { | |
if (!this[0]) { return this; } | |
var elems = []; | |
_.forEach(this, function(elem) { | |
while ((elem = elem.next)) { | |
if (isTag(elem) && elems.indexOf(elem) === -1) { | |
elems.push(elem); | |
} | |
} | |
}); | |
return selector ? | |
exports.filter.call(elems, selector, this) : | |
this._make(elems); | |
}; | |
exports.nextUntil = function(selector, filterSelector) { | |
if (!this[0]) { return this; } | |
var elems = [], untilNode, untilNodes; | |
if (typeof selector === 'string') { | |
untilNode = select(selector, this.nextAll().get(), this.options)[0]; | |
} else if (selector && selector.cheerio) { | |
untilNodes = selector.get(); | |
} else if (selector) { | |
untilNode = selector; | |
} | |
_.forEach(this, function(elem) { | |
while ((elem = elem.next)) { | |
if ((untilNode && elem !== untilNode) || | |
(untilNodes && untilNodes.indexOf(elem) === -1) || | |
(!untilNode && !untilNodes)) { | |
if (isTag(elem) && elems.indexOf(elem) === -1) { | |
elems.push(elem); | |
} | |
} else { | |
break; | |
} | |
} | |
}); | |
return filterSelector ? | |
exports.filter.call(elems, filterSelector, this) : | |
this._make(elems); | |
}; | |
exports.prev = function(selector) { | |
if (!this[0]) { return this; } | |
var elems = []; | |
_.forEach(this, function(elem) { | |
while ((elem = elem.prev)) { | |
if (isTag(elem)) { | |
elems.push(elem); | |
return; | |
} | |
} | |
}); | |
return selector ? | |
exports.filter.call(elems, selector, this) : | |
this._make(elems); | |
}; | |
exports.prevAll = function(selector) { | |
if (!this[0]) { return this; } | |
var elems = []; | |
_.forEach(this, function(elem) { | |
while ((elem = elem.prev)) { | |
if (isTag(elem) && elems.indexOf(elem) === -1) { | |
elems.push(elem); | |
} | |
} | |
}); | |
return selector ? | |
exports.filter.call(elems, selector, this) : | |
this._make(elems); | |
}; | |
exports.prevUntil = function(selector, filterSelector) { | |
if (!this[0]) { return this; } | |
var elems = [], untilNode, untilNodes; | |
if (typeof selector === 'string') { | |
untilNode = select(selector, this.prevAll().get(), this.options)[0]; | |
} else if (selector && selector.cheerio) { | |
untilNodes = selector.get(); | |
} else if (selector) { | |
untilNode = selector; | |
} | |
_.forEach(this, function(elem) { | |
while ((elem = elem.prev)) { | |
if ((untilNode && elem !== untilNode) || | |
(untilNodes && untilNodes.indexOf(elem) === -1) || | |
(!untilNode && !untilNodes)) { | |
if (isTag(elem) && elems.indexOf(elem) === -1) { | |
elems.push(elem); | |
} | |
} else { | |
break; | |
} | |
} | |
}); | |
return filterSelector ? | |
exports.filter.call(elems, filterSelector, this) : | |
this._make(elems); | |
}; | |
exports.siblings = function(selector) { | |
var parent = this.parent(); | |
var elems = _.filter( | |
parent ? parent.children() : this.siblingsAndMe(), | |
_.bind(function(elem) { return isTag(elem) && !this.is(elem); }, this) | |
); | |
if (selector !== undefined) { | |
return exports.filter.call(elems, selector, this); | |
} else { | |
return this._make(elems); | |
} | |
}; | |
exports.children = function(selector) { | |
var elems = _.reduce(this, function(memo, elem) { | |
return memo.concat(_.filter(elem.children, isTag)); | |
}, []); | |
if (selector === undefined) return this._make(elems); | |
return exports.filter.call(elems, selector, this); | |
}; | |
exports.contents = function() { | |
return this._make(_.reduce(this, function(all, elem) { | |
all.push.apply(all, elem.children); | |
return all; | |
}, [])); | |
}; | |
exports.each = function(fn) { | |
var i = 0, len = this.length; | |
while (i < len && fn.call(this[i], i, this[i]) !== false) ++i; | |
return this; | |
}; | |
exports.map = function(fn) { | |
return this._make(_.reduce(this, function(memo, el, i) { | |
var val = fn.call(el, i, el); | |
return val == null ? memo : memo.concat(val); | |
}, [])); | |
}; | |
var makeFilterMethod = function(filterFn) { | |
return function(match, container) { | |
var testFn; | |
container = container || this; | |
if (typeof match === 'string') { | |
testFn = select.compile(match, container.options); | |
} else if (typeof match === 'function') { | |
testFn = function(el, i) { | |
return match.call(el, i, el); | |
}; | |
} else if (match.cheerio) { | |
testFn = match.is.bind(match); | |
} else { | |
testFn = function(el) { | |
return match === el; | |
}; | |
} | |
return container._make(filterFn(this, testFn)); | |
}; | |
}; | |
exports.filter = makeFilterMethod(_.filter); | |
exports.not = makeFilterMethod(_.reject); | |
exports.has = function(selectorOrHaystack) { | |
var that = this; | |
return exports.filter.call(this, function() { | |
return that._make(this).find(selectorOrHaystack).length > 0; | |
}); | |
}; | |
exports.first = function() { | |
return this.length > 1 ? this._make(this[0]) : this; | |
}; | |
exports.last = function() { | |
return this.length > 1 ? this._make(this[this.length - 1]) : this; | |
}; | |
// Reduce the set of matched elements to the one at the specified index. | |
exports.eq = function(i) { | |
i = +i; | |
// Use the first identity optimization if possible | |
if (i === 0 && this.length <= 1) return this; | |
if (i < 0) i = this.length + i; | |
return this[i] ? this._make(this[i]) : this._make([]); | |
}; | |
// Retrieve the DOM elements matched by the jQuery object. | |
exports.get = function(i) { | |
if (i == null) { | |
return Array.prototype.slice.call(this); | |
} else { | |
return this[i < 0 ? (this.length + i) : i]; | |
} | |
}; | |
// Search for a given element from among the matched elements. | |
exports.index = function(selectorOrNeedle) { | |
var $haystack, needle; | |
if (arguments.length === 0) { | |
$haystack = this.parent().children(); | |
needle = this[0]; | |
} else if (typeof selectorOrNeedle === 'string') { | |
$haystack = this._make(selectorOrNeedle); | |
needle = this[0]; | |
} else { | |
$haystack = this; | |
needle = selectorOrNeedle.cheerio ? selectorOrNeedle[0] : selectorOrNeedle; | |
} | |
return $haystack.get().indexOf(needle); | |
}; | |
exports.slice = function() { | |
return this._make([].slice.apply(this, arguments)); | |
}; | |
function traverseParents(self, elem, selector, limit) { | |
var elems = []; | |
while (elem && elems.length < limit) { | |
if (!selector || exports.filter.call([elem], selector, self).length) { | |
elems.push(elem); | |
} | |
elem = elem.parent; | |
} | |
return elems; | |
} | |
// End the most recent filtering operation in the current chain and return the | |
// set of matched elements to its previous state. | |
exports.end = function() { | |
return this.prevObject || this._make([]); | |
}; | |
exports.add = function(other, context) { | |
var selection = this._make(other, context); | |
var contents = uniqueSort(selection.get().concat(this.get())); | |
for (var i = 0; i < contents.length; ++i) { | |
selection[i] = contents[i]; | |
} | |
selection.length = contents.length; | |
return selection; | |
}; | |
// Add the previous set of elements on the stack to the current set, optionally | |
// filtered by a selector. | |
exports.addBack = function(selector) { | |
return this.add( | |
arguments.length ? this.prevObject.filter(selector) : this.prevObject | |
); | |
}; | |
/***/ }, | |
/* 111 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var _ = __webpack_require__(95), | |
parse = __webpack_require__(32), | |
$ = __webpack_require__(97), | |
updateDOM = parse.update, | |
evaluate = parse.evaluate, | |
utils = __webpack_require__(94), | |
domEach = utils.domEach, | |
cloneDom = utils.cloneDom, | |
isHtml = utils.isHtml, | |
slice = Array.prototype.slice; | |
// Create an array of nodes, recursing into arrays and parsing strings if | |
// necessary | |
exports._makeDomArray = function makeDomArray(elem, clone) { | |
if (elem == null) { | |
return []; | |
} else if (elem.cheerio) { | |
return clone ? cloneDom(elem.get(), elem.options) : elem.get(); | |
} else if (Array.isArray(elem)) { | |
return _.flatten(elem.map(function(el) { | |
return this._makeDomArray(el, clone); | |
}, this)); | |
} else if (typeof elem === 'string') { | |
return evaluate(elem, this.options); | |
} else { | |
return clone ? cloneDom([elem]) : [elem]; | |
} | |
}; | |
var _insert = function(concatenator) { | |
return function() { | |
var elems = slice.call(arguments), | |
lastIdx = this.length - 1; | |
return domEach(this, function(i, el) { | |
var dom, domSrc; | |
if (typeof elems[0] === 'function') { | |
domSrc = elems[0].call(el, i, $.html(el.children)); | |
} else { | |
domSrc = elems; | |
} | |
dom = this._makeDomArray(domSrc, i < lastIdx); | |
concatenator(dom, el.children, el); | |
}); | |
}; | |
}; | |
/* | |
* Modify an array in-place, removing some number of elements and adding new | |
* elements directly following them. | |
* | |
* @param {Array} array Target array to splice. | |
* @param {Number} spliceIdx Index at which to begin changing the array. | |
* @param {Number} spliceCount Number of elements to remove from the array. | |
* @param {Array} newElems Elements to insert into the array. | |
* | |
* @api private | |
*/ | |
var uniqueSplice = function(array, spliceIdx, spliceCount, newElems, parent) { | |
var spliceArgs = [spliceIdx, spliceCount].concat(newElems), | |
prev = array[spliceIdx - 1] || null, | |
next = array[spliceIdx] || null; | |
var idx, len, prevIdx, node, oldParent; | |
// Before splicing in new elements, ensure they do not already appear in the | |
// current array. | |
for (idx = 0, len = newElems.length; idx < len; ++idx) { | |
node = newElems[idx]; | |
oldParent = node.parent || node.root; | |
prevIdx = oldParent && oldParent.children.indexOf(newElems[idx]); | |
if (oldParent && prevIdx > -1) { | |
oldParent.children.splice(prevIdx, 1); | |
if (parent === oldParent && spliceIdx > prevIdx) { | |
spliceArgs[0]--; | |
} | |
} | |
node.root = null; | |
node.parent = parent; | |
if (node.prev) { | |
node.prev.next = node.next || null; | |
} | |
if (node.next) { | |
node.next.prev = node.prev || null; | |
} | |
node.prev = newElems[idx - 1] || prev; | |
node.next = newElems[idx + 1] || next; | |
} | |
if (prev) { | |
prev.next = newElems[0]; | |
} | |
if (next) { | |
next.prev = newElems[newElems.length - 1]; | |
} | |
return array.splice.apply(array, spliceArgs); | |
}; | |
exports.appendTo = function(target) { | |
if (!target.cheerio) { | |
target = this.constructor.call(this.constructor, target, null, this._originalRoot); | |
} | |
target.append(this); | |
return this; | |
}; | |
exports.prependTo = function(target) { | |
if (!target.cheerio) { | |
target = this.constructor.call(this.constructor, target, null, this._originalRoot); | |
} | |
target.prepend(this); | |
return this; | |
}; | |
exports.append = _insert(function(dom, children, parent) { | |
uniqueSplice(children, children.length, 0, dom, parent); | |
}); | |
exports.prepend = _insert(function(dom, children, parent) { | |
uniqueSplice(children, 0, 0, dom, parent); | |
}); | |
exports.wrap = function(wrapper) { | |
var wrapperFn = typeof wrapper === 'function' && wrapper, | |
lastIdx = this.length - 1; | |
_.forEach(this, _.bind(function(el, i) { | |
var parent = el.parent || el.root, | |
siblings = parent.children, | |
dom, index; | |
if (!parent) { | |
return; | |
} | |
if (wrapperFn) { | |
wrapper = wrapperFn.call(el, i); | |
} | |
if (typeof wrapper === 'string' && !isHtml(wrapper)) { | |
wrapper = this.parents().last().find(wrapper).clone(); | |
} | |
dom = this._makeDomArray(wrapper, i < lastIdx).slice(0, 1); | |
index = siblings.indexOf(el); | |
updateDOM([el], dom[0]); | |
// The previous operation removed the current element from the `siblings` | |
// array, so the `dom` array can be inserted without removing any | |
// additional elements. | |
uniqueSplice(siblings, index, 0, dom, parent); | |
}, this)); | |
return this; | |
}; | |
exports.after = function() { | |
var elems = slice.call(arguments), | |
lastIdx = this.length - 1; | |
domEach(this, function(i, el) { | |
var parent = el.parent || el.root; | |
if (!parent) { | |
return; | |
} | |
var siblings = parent.children, | |
index = siblings.indexOf(el), | |
domSrc, dom; | |
// If not found, move on | |
if (index < 0) return; | |
if (typeof elems[0] === 'function') { | |
domSrc = elems[0].call(el, i, $.html(el.children)); | |
} else { | |
domSrc = elems; | |
} | |
dom = this._makeDomArray(domSrc, i < lastIdx); | |
// Add element after `this` element | |
uniqueSplice(siblings, index + 1, 0, dom, parent); | |
}); | |
return this; | |
}; | |
exports.insertAfter = function(target) { | |
var clones = [], | |
self = this; | |
if (typeof target === 'string') { | |
target = this.constructor.call(this.constructor, target, null, this._originalRoot); | |
} | |
target = this._makeDomArray(target); | |
self.remove(); | |
domEach(target, function(i, el) { | |
var clonedSelf = self._makeDomArray(self.clone()); | |
var parent = el.parent || el.root; | |
if (!parent) { | |
return; | |
} | |
var siblings = parent.children, | |
index = siblings.indexOf(el); | |
// If not found, move on | |
if (index < 0) return; | |
// Add cloned `this` element(s) after target element | |
uniqueSplice(siblings, index + 1, 0, clonedSelf, parent); | |
clones.push(clonedSelf); | |
}); | |
return this.constructor.call(this.constructor, this._makeDomArray(clones)); | |
}; | |
exports.before = function() { | |
var elems = slice.call(arguments), | |
lastIdx = this.length - 1; | |
domEach(this, function(i, el) { | |
var parent = el.parent || el.root; | |
if (!parent) { | |
return; | |
} | |
var siblings = parent.children, | |
index = siblings.indexOf(el), | |
domSrc, dom; | |
// If not found, move on | |
if (index < 0) return; | |
if (typeof elems[0] === 'function') { | |
domSrc = elems[0].call(el, i, $.html(el.children)); | |
} else { | |
domSrc = elems; | |
} | |
dom = this._makeDomArray(domSrc, i < lastIdx); | |
// Add element before `el` element | |
uniqueSplice(siblings, index, 0, dom, parent); | |
}); | |
return this; | |
}; | |
exports.insertBefore = function(target) { | |
var clones = [], | |
self = this; | |
if (typeof target === 'string') { | |
target = this.constructor.call(this.constructor, target, null, this._originalRoot); | |
} | |
target = this._makeDomArray(target); | |
self.remove(); | |
domEach(target, function(i, el) { | |
var clonedSelf = self._makeDomArray(self.clone()); | |
var parent = el.parent || el.root; | |
if (!parent) { | |
return; | |
} | |
var siblings = parent.children, | |
index = siblings.indexOf(el); | |
// If not found, move on | |
if (index < 0) return; | |
// Add cloned `this` element(s) after target element | |
uniqueSplice(siblings, index, 0, clonedSelf, parent); | |
clones.push(clonedSelf); | |
}); | |
return this.constructor.call(this.constructor, this._makeDomArray(clones)); | |
}; | |
/* | |
remove([selector]) | |
*/ | |
exports.remove = function(selector) { | |
var elems = this; | |
// Filter if we have selector | |
if (selector) | |
elems = elems.filter(selector); | |
domEach(elems, function(i, el) { | |
var parent = el.parent || el.root; | |
if (!parent) { | |
return; | |
} | |
var siblings = parent.children, | |
index = siblings.indexOf(el); | |
if (index < 0) return; | |
siblings.splice(index, 1); | |
if (el.prev) { | |
el.prev.next = el.next; | |
} | |
if (el.next) { | |
el.next.prev = el.prev; | |
} | |
el.prev = el.next = el.parent = el.root = null; | |
}); | |
return this; | |
}; | |
exports.replaceWith = function(content) { | |
var self = this; | |
domEach(this, function(i, el) { | |
var parent = el.parent || el.root; | |
if (!parent) { | |
return; | |
} | |
var siblings = parent.children, | |
dom = self._makeDomArray(typeof content === 'function' ? content.call(el, i, el) : content), | |
index; | |
// In the case that `dom` contains nodes that already exist in other | |
// structures, ensure those nodes are properly removed. | |
updateDOM(dom, null); | |
index = siblings.indexOf(el); | |
// Completely remove old element | |
uniqueSplice(siblings, index, 1, dom, parent); | |
el.parent = el.prev = el.next = el.root = null; | |
}); | |
return this; | |
}; | |
exports.empty = function() { | |
domEach(this, function(i, el) { | |
_.each(el.children, function(el) { | |
el.next = el.prev = el.parent = null; | |
}); | |
el.children.length = 0; | |
}); | |
return this; | |
}; | |
/** | |
* Set/Get the HTML | |
*/ | |
exports.html = function(str) { | |
if (str === undefined) { | |
if (!this[0] || !this[0].children) return null; | |
return $.html(this[0].children, this.options); | |
} | |
var opts = this.options; | |
domEach(this, function(i, el) { | |
_.each(el.children, function(el) { | |
el.next = el.prev = el.parent = null; | |
}); | |
var content = str.cheerio ? str.clone().get() : evaluate('' + str, opts); | |
updateDOM(content, el); | |
}); | |
return this; | |
}; | |
exports.toString = function() { | |
return $.html(this, this.options); | |
}; | |
exports.text = function(str) { | |
// If `str` is undefined, act as a "getter" | |
if (str === undefined) { | |
return $.text(this); | |
} else if (typeof str === 'function') { | |
// Function support | |
return domEach(this, function(i, el) { | |
var $el = [el]; | |
return exports.text.call($el, str.call(el, i, $.text($el))); | |
}); | |
} | |
// Append text node to each selected elements | |
domEach(this, function(i, el) { | |
_.each(el.children, function(el) { | |
el.next = el.prev = el.parent = null; | |
}); | |
var elem = { | |
data: '' + str, | |
type: 'text', | |
parent: el, | |
prev: null, | |
next: null, | |
children: [] | |
}; | |
updateDOM(elem, el); | |
}); | |
return this; | |
}; | |
exports.clone = function() { | |
return this._make(cloneDom(this.get(), this.options)); | |
}; | |
/***/ }, | |
/* 112 */ | |
/***/ function(module, exports, __webpack_require__) { | |
var _ = __webpack_require__(95), | |
domEach = __webpack_require__(94).domEach; | |
var toString = Object.prototype.toString; | |
/** | |
* Set / Get css. | |
* | |
* @param {String|Object} prop | |
* @param {String} val | |
* @return {self} | |
* @api public | |
*/ | |
exports.css = function(prop, val) { | |
if (arguments.length === 2 || | |
// When `prop` is a "plain" object | |
(toString.call(prop) === '[object Object]')) { | |
return domEach(this, function(idx, el) { | |
setCss(el, prop, val, idx); | |
}); | |
} else { | |
return getCss(this[0], prop); | |
} | |
}; | |
/** | |
* Set styles of all elements. | |
* | |
* @param {String|Object} prop | |
* @param {String} val | |
* @param {Number} idx - optional index within the selection | |
* @return {self} | |
* @api private | |
*/ | |
function setCss(el, prop, val, idx) { | |
if ('string' == typeof prop) { | |
var styles = getCss(el); | |
if (typeof val === 'function') { | |
val = val.call(el, idx, styles[prop]); | |
} | |
if (val === '') { | |
delete styles[prop]; | |
} else if (val != null) { | |
styles[prop] = val; | |
} | |
el.attribs.style = stringify(styles); | |
} else if ('object' == typeof prop) { | |
Object.keys(prop).forEach(function(k){ | |
setCss(el, k, prop[k]); | |
}); | |
} | |
} | |
/** | |
* Get parsed styles of the first element. | |
* | |
* @param {String} prop | |
* @return {Object} | |
* @api private | |
*/ | |
function getCss(el, prop) { | |
var styles = parse(el.attribs.style); | |
if (typeof prop === 'string') { | |
return styles[prop]; | |
} else if (Array.isArray(prop)) { | |
return _.pick(styles, prop); | |
} else { | |
return styles; | |
} | |
} | |
/** | |
* Stringify `obj` to styles. | |
* | |
* @param {Object} obj | |
* @return {Object} | |
* @api private | |
*/ | |
function stringify(obj) { | |
return Object.keys(obj || {}) | |
.reduce(function(str, prop){ | |
return str += '' | |
+ (str ? ' ' : '') | |
+ prop | |
+ ': ' | |
+ obj[prop] | |
+ ';'; | |
}, ''); | |
} | |
/** | |
* Parse `styles`. | |
* | |
* @param {String} styles | |
* @return {Object} | |
* @api private | |
*/ | |
function parse(styles) { | |
styles = (styles || '').trim(); | |
if (!styles) return {}; | |
return styles | |
.split(';') | |
.reduce(function(obj, str){ | |
var n = str.indexOf(':'); | |
// skip if there is no :, or if it is the first/last character | |
if (n < 1 || n === str.length-1) return obj; | |
obj[str.slice(0,n).trim()] = str.slice(n+1).trim(); | |
return obj; | |
}, {}); | |
} | |
/***/ }, | |
/* 113 */ | |
/***/ function(module, exports, __webpack_require__) { | |
// https://github.com/jquery/jquery/blob/2.1.3/src/manipulation/var/rcheckableType.js | |
// https://github.com/jquery/jquery/blob/2.1.3/src/serialize.js | |
var _ = __webpack_require__(95), | |
submittableSelector = 'input,select,textarea,keygen', | |
rCRLF = /\r?\n/g; | |
exports.serializeArray = function() { | |
// Resolve all form elements from either forms or collections of form elements | |
var Cheerio = this.constructor; | |
return this.map(function() { | |
var elem = this; | |
var $elem = Cheerio(elem); | |
if (elem.name === 'form') { | |
return $elem.find(submittableSelector).toArray(); | |
} else { | |
return $elem.filter(submittableSelector).toArray(); | |
} | |
}).filter( | |
// Verify elements have a name (`attr.name`) and are not disabled (`:disabled`) | |
'[name!=""]:not(:disabled)' | |
// and cannot be clicked (`[type=submit]`) or are used in `x-www-form-urlencoded` (`[type=file]`) | |
+ ':not(:submit, :button, :image, :reset, :file)' | |
// and are either checked/don't have a checkable state | |
+ ':matches([checked], :not(:checkbox, :radio))' | |
// Convert each of the elements to its value(s) | |
).map(function(i, elem) { | |
var $elem = Cheerio(elem); | |
var name = $elem.attr('name'); | |
var val = $elem.val(); | |
// If there is no value set (e.g. `undefined`, `null`), then return nothing | |
if (val |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment