1001

bundle.js (756297B)

---

 (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){
 /* DOM */
 window.morph     = require('nanomorph')
 window.html      = require('nanohtml')
 window.raw       = require('nanohtml/raw')
 window.Component = require('nanocomponent')
 
 /* State */
 window.bus   = require('nanobus')
 window.state = require('nanostate')
 
 /* Router */
 window.wayfarer      = require('wayfarer')
 window.wayfarer.walk = require('wayfarer/walk')
 window.router        = require('nanorouter')
 
 /* Other */
 window.create_debug = require('debug')
 window.query  = (href = window.location.href) => require('nanoquery')(href)
 window.hash   = (hash = window.location.hash) => require('hash-match')(hash)
 
 /* Utilities */
 window._ = require('lodash')
 window.S = require('s-js')
 window.he = require('he')
 window.title = require('title')
 
 },{"debug":4,"hash-match":8,"he":9,"lodash":13,"nanobus":16,"nanocomponent":17,"nanohtml":20,"nanohtml/raw":22,"nanomorph":24,"nanoquery":27,"nanorouter":28,"nanostate":30,"s-js":36,"title":37,"wayfarer":42,"wayfarer/walk":44}],2:[function(require,module,exports){
 (function (global){
 'use strict';
 
 // compare and isBuffer taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js
 // original notice:
 
 /*!
  * The buffer module from node.js, for the browser.
  *
  * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
  * @license  MIT
  */
 function compare(a, b) {
   if (a === b) {
     return 0;
   }
 
   var x = a.length;
   var y = b.length;
 
   for (var i = 0, len = Math.min(x, y); i < len; ++i) {
     if (a[i] !== b[i]) {
       x = a[i];
       y = b[i];
       break;
     }
   }
 
   if (x < y) {
     return -1;
   }
   if (y < x) {
     return 1;
   }
   return 0;
 }
 function isBuffer(b) {
   if (global.Buffer && typeof global.Buffer.isBuffer === 'function') {
     return global.Buffer.isBuffer(b);
   }
   return !!(b != null && b._isBuffer);
 }
 
 // based on node assert, original notice:
 
 // http://wiki.commonjs.org/wiki/Unit_Testing/1.0
 //
 // THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8!
 //
 // Originally from narwhal.js (http://narwhaljs.org)
 // Copyright (c) 2009 Thomas Robinson <280north.com>
 //
 // 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 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 util = require('util/');
 var hasOwn = Object.prototype.hasOwnProperty;
 var pSlice = Array.prototype.slice;
 var functionsHaveNames = (function () {
   return function foo() {}.name === 'foo';
 }());
 function pToString (obj) {
   return Object.prototype.toString.call(obj);
 }
 function isView(arrbuf) {
   if (isBuffer(arrbuf)) {
     return false;
   }
   if (typeof global.ArrayBuffer !== 'function') {
     return false;
   }
   if (typeof ArrayBuffer.isView === 'function') {
     return ArrayBuffer.isView(arrbuf);
   }
   if (!arrbuf) {
     return false;
   }
   if (arrbuf instanceof DataView) {
     return true;
   }
   if (arrbuf.buffer && arrbuf.buffer instanceof ArrayBuffer) {
     return true;
   }
   return false;
 }
 // 1. The assert module provides functions that throw
 // AssertionError's when particular conditions are not met. The
 // assert module must conform to the following interface.
 
 var assert = module.exports = ok;
 
 // 2. The AssertionError is defined in assert.
 // new assert.AssertionError({ message: message,
 //                             actual: actual,
 //                             expected: expected })
 
 var regex = /\s*function\s+([^\(\s]*)\s*/;
 // based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js
 function getName(func) {
   if (!util.isFunction(func)) {
     return;
   }
   if (functionsHaveNames) {
     return func.name;
   }
   var str = func.toString();
   var match = str.match(regex);
   return match && match[1];
 }
 assert.AssertionError = function AssertionError(options) {
   this.name = 'AssertionError';
   this.actual = options.actual;
   this.expected = options.expected;
   this.operator = options.operator;
   if (options.message) {
     this.message = options.message;
     this.generatedMessage = false;
   } else {
     this.message = getMessage(this);
     this.generatedMessage = true;
   }
   var stackStartFunction = options.stackStartFunction || fail;
   if (Error.captureStackTrace) {
     Error.captureStackTrace(this, stackStartFunction);
   } else {
     // non v8 browsers so we can have a stacktrace
     var err = new Error();
     if (err.stack) {
       var out = err.stack;
 
       // try to strip useless frames
       var fn_name = getName(stackStartFunction);
       var idx = out.indexOf('\n' + fn_name);
       if (idx >= 0) {
         // once we have located the function frame
         // we need to strip out everything before it (and its line)
         var next_line = out.indexOf('\n', idx + 1);
         out = out.substring(next_line + 1);
       }
 
       this.stack = out;
     }
   }
 };
 
 // assert.AssertionError instanceof Error
 util.inherits(assert.AssertionError, Error);
 
 function truncate(s, n) {
   if (typeof s === 'string') {
     return s.length < n ? s : s.slice(0, n);
   } else {
     return s;
   }
 }
 function inspect(something) {
   if (functionsHaveNames || !util.isFunction(something)) {
     return util.inspect(something);
   }
   var rawname = getName(something);
   var name = rawname ? ': ' + rawname : '';
   return '[Function' +  name + ']';
 }
 function getMessage(self) {
   return truncate(inspect(self.actual), 128) + ' ' +
          self.operator + ' ' +
          truncate(inspect(self.expected), 128);
 }
 
 // At present only the three keys mentioned above are used and
 // understood by the spec. Implementations or sub modules can pass
 // other keys to the AssertionError's constructor - they will be
 // ignored.
 
 // 3. All of the following functions must throw an AssertionError
 // when a corresponding condition is not met, with a message that
 // may be undefined if not provided.  All assertion methods provide
 // both the actual and expected values to the assertion error for
 // display purposes.
 
 function fail(actual, expected, message, operator, stackStartFunction) {
   throw new assert.AssertionError({
     message: message,
     actual: actual,
     expected: expected,
     operator: operator,
     stackStartFunction: stackStartFunction
   });
 }
 
 // EXTENSION! allows for well behaved errors defined elsewhere.
 assert.fail = fail;
 
 // 4. Pure assertion tests whether a value is truthy, as determined
 // by !!guard.
 // assert.ok(guard, message_opt);
 // This statement is equivalent to assert.equal(true, !!guard,
 // message_opt);. To test strictly for the value true, use
 // assert.strictEqual(true, guard, message_opt);.
 
 function ok(value, message) {
   if (!value) fail(value, true, message, '==', assert.ok);
 }
 assert.ok = ok;
 
 // 5. The equality assertion tests shallow, coercive equality with
 // ==.
 // assert.equal(actual, expected, message_opt);
 
 assert.equal = function equal(actual, expected, message) {
   if (actual != expected) fail(actual, expected, message, '==', assert.equal);
 };
 
 // 6. The non-equality assertion tests for whether two objects are not equal
 // with != assert.notEqual(actual, expected, message_opt);
 
 assert.notEqual = function notEqual(actual, expected, message) {
   if (actual == expected) {
     fail(actual, expected, message, '!=', assert.notEqual);
   }
 };
 
 // 7. The equivalence assertion tests a deep equality relation.
 // assert.deepEqual(actual, expected, message_opt);
 
 assert.deepEqual = function deepEqual(actual, expected, message) {
   if (!_deepEqual(actual, expected, false)) {
     fail(actual, expected, message, 'deepEqual', assert.deepEqual);
   }
 };
 
 assert.deepStrictEqual = function deepStrictEqual(actual, expected, message) {
   if (!_deepEqual(actual, expected, true)) {
     fail(actual, expected, message, 'deepStrictEqual', assert.deepStrictEqual);
   }
 };
 
 function _deepEqual(actual, expected, strict, memos) {
   // 7.1. All identical values are equivalent, as determined by ===.
   if (actual === expected) {
     return true;
   } else if (isBuffer(actual) && isBuffer(expected)) {
     return compare(actual, expected) === 0;
 
   // 7.2. If the expected value is a Date object, the actual value is
   // equivalent if it is also a Date object that refers to the same time.
   } else if (util.isDate(actual) && util.isDate(expected)) {
     return actual.getTime() === expected.getTime();
 
   // 7.3 If the expected value is a RegExp object, the actual value is
   // equivalent if it is also a RegExp object with the same source and
   // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).
   } else if (util.isRegExp(actual) && util.isRegExp(expected)) {
     return actual.source === expected.source &&
            actual.global === expected.global &&
            actual.multiline === expected.multiline &&
            actual.lastIndex === expected.lastIndex &&
            actual.ignoreCase === expected.ignoreCase;
 
   // 7.4. Other pairs that do not both pass typeof value == 'object',
   // equivalence is determined by ==.
   } else if ((actual === null || typeof actual !== 'object') &&
              (expected === null || typeof expected !== 'object')) {
     return strict ? actual === expected : actual == expected;
 
   // If both values are instances of typed arrays, wrap their underlying
   // ArrayBuffers in a Buffer each to increase performance
   // This optimization requires the arrays to have the same type as checked by
   // Object.prototype.toString (aka pToString). Never perform binary
   // comparisons for Float*Arrays, though, since e.g. +0 === -0 but their
   // bit patterns are not identical.
   } else if (isView(actual) && isView(expected) &&
              pToString(actual) === pToString(expected) &&
              !(actual instanceof Float32Array ||
                actual instanceof Float64Array)) {
     return compare(new Uint8Array(actual.buffer),
                    new Uint8Array(expected.buffer)) === 0;
 
   // 7.5 For all other Object pairs, including Array objects, equivalence is
   // determined by having the same number of owned properties (as verified
   // with Object.prototype.hasOwnProperty.call), the same set of keys
   // (although not necessarily the same order), equivalent values for every
   // corresponding key, and an identical 'prototype' property. Note: this
   // accounts for both named and indexed properties on Arrays.
   } else if (isBuffer(actual) !== isBuffer(expected)) {
     return false;
   } else {
     memos = memos || {actual: [], expected: []};
 
     var actualIndex = memos.actual.indexOf(actual);
     if (actualIndex !== -1) {
       if (actualIndex === memos.expected.indexOf(expected)) {
         return true;
       }
     }
 
     memos.actual.push(actual);
     memos.expected.push(expected);
 
     return objEquiv(actual, expected, strict, memos);
   }
 }
 
 function isArguments(object) {
   return Object.prototype.toString.call(object) == '[object Arguments]';
 }
 
 function objEquiv(a, b, strict, actualVisitedObjects) {
   if (a === null || a === undefined || b === null || b === undefined)
     return false;
   // if one is a primitive, the other must be same
   if (util.isPrimitive(a) || util.isPrimitive(b))
     return a === b;
   if (strict && Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))
     return false;
   var aIsArgs = isArguments(a);
   var bIsArgs = isArguments(b);
   if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))
     return false;
   if (aIsArgs) {
     a = pSlice.call(a);
     b = pSlice.call(b);
     return _deepEqual(a, b, strict);
   }
   var ka = objectKeys(a);
   var kb = objectKeys(b);
   var key, i;
   // having the same number of owned properties (keys incorporates
   // hasOwnProperty)
   if (ka.length !== kb.length)
     return false;
   //the same set of keys (although not necessarily the same order),
   ka.sort();
   kb.sort();
   //~~~cheap key test
   for (i = ka.length - 1; i >= 0; i--) {
     if (ka[i] !== kb[i])
       return false;
   }
   //equivalent values for every corresponding key, and
   //~~~possibly expensive deep test
   for (i = ka.length - 1; i >= 0; i--) {
     key = ka[i];
     if (!_deepEqual(a[key], b[key], strict, actualVisitedObjects))
       return false;
   }
   return true;
 }
 
 // 8. The non-equivalence assertion tests for any deep inequality.
 // assert.notDeepEqual(actual, expected, message_opt);
 
 assert.notDeepEqual = function notDeepEqual(actual, expected, message) {
   if (_deepEqual(actual, expected, false)) {
     fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual);
   }
 };
 
 assert.notDeepStrictEqual = notDeepStrictEqual;
 function notDeepStrictEqual(actual, expected, message) {
   if (_deepEqual(actual, expected, true)) {
     fail(actual, expected, message, 'notDeepStrictEqual', notDeepStrictEqual);
   }
 }
 
 
 // 9. The strict equality assertion tests strict equality, as determined by ===.
 // assert.strictEqual(actual, expected, message_opt);
 
 assert.strictEqual = function strictEqual(actual, expected, message) {
   if (actual !== expected) {
     fail(actual, expected, message, '===', assert.strictEqual);
   }
 };
 
 // 10. The strict non-equality assertion tests for strict inequality, as
 // determined by !==.  assert.notStrictEqual(actual, expected, message_opt);
 
 assert.notStrictEqual = function notStrictEqual(actual, expected, message) {
   if (actual === expected) {
     fail(actual, expected, message, '!==', assert.notStrictEqual);
   }
 };
 
 function expectedException(actual, expected) {
   if (!actual || !expected) {
     return false;
   }
 
   if (Object.prototype.toString.call(expected) == '[object RegExp]') {
     return expected.test(actual);
   }
 
   try {
     if (actual instanceof expected) {
       return true;
     }
   } catch (e) {
     // Ignore.  The instanceof check doesn't work for arrow functions.
   }
 
   if (Error.isPrototypeOf(expected)) {
     return false;
   }
 
   return expected.call({}, actual) === true;
 }
 
 function _tryBlock(block) {
   var error;
   try {
     block();
   } catch (e) {
     error = e;
   }
   return error;
 }
 
 function _throws(shouldThrow, block, expected, message) {
   var actual;
 
   if (typeof block !== 'function') {
     throw new TypeError('"block" argument must be a function');
   }
 
   if (typeof expected === 'string') {
     message = expected;
     expected = null;
   }
 
   actual = _tryBlock(block);
 
   message = (expected && expected.name ? ' (' + expected.name + ').' : '.') +
             (message ? ' ' + message : '.');
 
   if (shouldThrow && !actual) {
     fail(actual, expected, 'Missing expected exception' + message);
   }
 
   var userProvidedMessage = typeof message === 'string';
   var isUnwantedException = !shouldThrow && util.isError(actual);
   var isUnexpectedException = !shouldThrow && actual && !expected;
 
   if ((isUnwantedException &&
       userProvidedMessage &&
       expectedException(actual, expected)) ||
       isUnexpectedException) {
     fail(actual, expected, 'Got unwanted exception' + message);
   }
 
   if ((shouldThrow && actual && expected &&
       !expectedException(actual, expected)) || (!shouldThrow && actual)) {
     throw actual;
   }
 }
 
 // 11. Expected to throw an error:
 // assert.throws(block, Error_opt, message_opt);
 
 assert.throws = function(block, /*optional*/error, /*optional*/message) {
   _throws(true, block, error, message);
 };
 
 // EXTENSION! This is annoying to write outside this module.
 assert.doesNotThrow = function(block, /*optional*/error, /*optional*/message) {
   _throws(false, block, error, message);
 };
 
 assert.ifError = function(err) { if (err) throw err; };
 
 var objectKeys = Object.keys || function (obj) {
   var keys = [];
   for (var key in obj) {
     if (hasOwn.call(obj, key)) keys.push(key);
   }
   return keys;
 };
 
 }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
 },{"util/":41}],3:[function(require,module,exports){
 
 },{}],4:[function(require,module,exports){
 (function (process){
 /**
  * This is the web browser implementation of `debug()`.
  *
  * Expose `debug()` as the module.
  */
 
 exports = module.exports = require('./debug');
 exports.log = log;
 exports.formatArgs = formatArgs;
 exports.save = save;
 exports.load = load;
 exports.useColors = useColors;
 exports.storage = 'undefined' != typeof chrome
                && 'undefined' != typeof chrome.storage
                   ? chrome.storage.local
                   : localstorage();
 
 /**
  * Colors.
  */
 
 exports.colors = [
   '#0000CC', '#0000FF', '#0033CC', '#0033FF', '#0066CC', '#0066FF', '#0099CC',
   '#0099FF', '#00CC00', '#00CC33', '#00CC66', '#00CC99', '#00CCCC', '#00CCFF',
   '#3300CC', '#3300FF', '#3333CC', '#3333FF', '#3366CC', '#3366FF', '#3399CC',
   '#3399FF', '#33CC00', '#33CC33', '#33CC66', '#33CC99', '#33CCCC', '#33CCFF',
   '#6600CC', '#6600FF', '#6633CC', '#6633FF', '#66CC00', '#66CC33', '#9900CC',
   '#9900FF', '#9933CC', '#9933FF', '#99CC00', '#99CC33', '#CC0000', '#CC0033',
   '#CC0066', '#CC0099', '#CC00CC', '#CC00FF', '#CC3300', '#CC3333', '#CC3366',
   '#CC3399', '#CC33CC', '#CC33FF', '#CC6600', '#CC6633', '#CC9900', '#CC9933',
   '#CCCC00', '#CCCC33', '#FF0000', '#FF0033', '#FF0066', '#FF0099', '#FF00CC',
   '#FF00FF', '#FF3300', '#FF3333', '#FF3366', '#FF3399', '#FF33CC', '#FF33FF',
   '#FF6600', '#FF6633', '#FF9900', '#FF9933', '#FFCC00', '#FFCC33'
 ];
 
 /**
  * Currently only WebKit-based Web Inspectors, Firefox >= v31,
  * and the Firebug extension (any Firefox version) are known
  * to support "%c" CSS customizations.
  *
  * TODO: add a `localStorage` variable to explicitly enable/disable colors
  */
 
 function useColors() {
   // NB: In an Electron preload script, document will be defined but not fully
   // initialized. Since we know we're in Chrome, we'll just detect this case
   // explicitly
   if (typeof window !== 'undefined' && window.process && window.process.type === 'renderer') {
     return true;
   }
 
   // Internet Explorer and Edge do not support colors.
   if (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\/(\d+)/)) {
     return false;
   }
 
   // is webkit? http://stackoverflow.com/a/16459606/376773
   // document is undefined in react-native: https://github.com/facebook/react-native/pull/1632
   return (typeof document !== 'undefined' && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance) ||
     // is firebug? http://stackoverflow.com/a/398120/376773
     (typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||
     // is firefox >= v31?
     // https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages
     (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/) && parseInt(RegExp.$1, 10) >= 31) ||
     // double check webkit in userAgent just in case we are in a worker
     (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\/(\d+)/));
 }
 
 /**
  * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.
  */
 
 exports.formatters.j = function(v) {
   try {
     return JSON.stringify(v);
   } catch (err) {
     return '[UnexpectedJSONParseError]: ' + err.message;
   }
 };
 
 
 /**
  * Colorize log arguments if enabled.
  *
  * @api public
  */
 
 function formatArgs(args) {
   var useColors = this.useColors;
 
   args[0] = (useColors ? '%c' : '')
     + this.namespace
     + (useColors ? ' %c' : ' ')
     + args[0]
     + (useColors ? '%c ' : ' ')
     + '+' + exports.humanize(this.diff);
 
   if (!useColors) return;
 
   var c = 'color: ' + this.color;
   args.splice(1, 0, c, 'color: inherit')
 
   // the final "%c" is somewhat tricky, because there could be other
   // arguments passed either before or after the %c, so we need to
   // figure out the correct index to insert the CSS into
   var index = 0;
   var lastC = 0;
   args[0].replace(/%[a-zA-Z%]/g, function(match) {
     if ('%%' === match) return;
     index++;
     if ('%c' === match) {
       // we only are interested in the *last* %c
       // (the user may have provided their own)
       lastC = index;
     }
   });
 
   args.splice(lastC, 0, c);
 }
 
 /**
  * Invokes `console.log()` when available.
  * No-op when `console.log` is not a "function".
  *
  * @api public
  */
 
 function log() {
   // this hackery is required for IE8/9, where
   // the `console.log` function doesn't have 'apply'
   return 'object' === typeof console
     && console.log
     && Function.prototype.apply.call(console.log, console, arguments);
 }
 
 /**
  * Save `namespaces`.
  *
  * @param {String} namespaces
  * @api private
  */
 
 function save(namespaces) {
   try {
     if (null == namespaces) {
       exports.storage.removeItem('debug');
     } else {
       exports.storage.debug = namespaces;
     }
   } catch(e) {}
 }
 
 /**
  * Load `namespaces`.
  *
  * @return {String} returns the previously persisted debug modes
  * @api private
  */
 
 function load() {
   var r;
   try {
     r = exports.storage.debug;
   } catch(e) {}
 
   // If debug isn't set in LS, and we're in Electron, try to load $DEBUG
   if (!r && typeof process !== 'undefined' && 'env' in process) {
     r = process.env.DEBUG;
   }
 
   return r;
 }
 
 /**
  * Enable namespaces listed in `localStorage.debug` initially.
  */
 
 exports.enable(load());
 
 /**
  * Localstorage attempts to return the localstorage.
  *
  * This is necessary because safari throws
  * when a user disables cookies/localstorage
  * and you attempt to access it.
  *
  * @return {LocalStorage}
  * @api private
  */
 
 function localstorage() {
   try {
     return window.localStorage;
   } catch (e) {}
 }
 
 }).call(this,require('_process'))
 },{"./debug":5,"_process":34}],5:[function(require,module,exports){
 
 /**
  * This is the common logic for both the Node.js and web browser
  * implementations of `debug()`.
  *
  * Expose `debug()` as the module.
  */
 
 exports = module.exports = createDebug.debug = createDebug['default'] = createDebug;
 exports.coerce = coerce;
 exports.disable = disable;
 exports.enable = enable;
 exports.enabled = enabled;
 exports.humanize = require('ms');
 
 /**
  * Active `debug` instances.
  */
 exports.instances = [];
 
 /**
  * The currently active debug mode names, and names to skip.
  */
 
 exports.names = [];
 exports.skips = [];
 
 /**
  * Map of special "%n" handling functions, for the debug "format" argument.
  *
  * Valid key names are a single, lower or upper-case letter, i.e. "n" and "N".
  */
 
 exports.formatters = {};
 
 /**
  * Select a color.
  * @param {String} namespace
  * @return {Number}
  * @api private
  */
 
 function selectColor(namespace) {
   var hash = 0, i;
 
   for (i in namespace) {
     hash  = ((hash << 5) - hash) + namespace.charCodeAt(i);
     hash |= 0; // Convert to 32bit integer
   }
 
   return exports.colors[Math.abs(hash) % exports.colors.length];
 }
 
 /**
  * Create a debugger with the given `namespace`.
  *
  * @param {String} namespace
  * @return {Function}
  * @api public
  */
 
 function createDebug(namespace) {
 
   var prevTime;
 
   function debug() {
     // disabled?
     if (!debug.enabled) return;
 
     var self = debug;
 
     // set `diff` timestamp
     var curr = +new Date();
     var ms = curr - (prevTime || curr);
     self.diff = ms;
     self.prev = prevTime;
     self.curr = curr;
     prevTime = curr;
 
     // turn the `arguments` into a proper Array
     var args = new Array(arguments.length);
     for (var i = 0; i < args.length; i++) {
       args[i] = arguments[i];
     }
 
     args[0] = exports.coerce(args[0]);
 
     if ('string' !== typeof args[0]) {
       // anything else let's inspect with %O
       args.unshift('%O');
     }
 
     // apply any `formatters` transformations
     var index = 0;
     args[0] = args[0].replace(/%([a-zA-Z%])/g, function(match, format) {
       // if we encounter an escaped % then don't increase the array index
       if (match === '%%') return match;
       index++;
       var formatter = exports.formatters[format];
       if ('function' === typeof formatter) {
         var val = args[index];
         match = formatter.call(self, val);
 
         // now we need to remove `args[index]` since it's inlined in the `format`
         args.splice(index, 1);
         index--;
       }
       return match;
     });
 
     // apply env-specific formatting (colors, etc.)
     exports.formatArgs.call(self, args);
 
     var logFn = debug.log || exports.log || console.log.bind(console);
     logFn.apply(self, args);
   }
 
   debug.namespace = namespace;
   debug.enabled = exports.enabled(namespace);
   debug.useColors = exports.useColors();
   debug.color = selectColor(namespace);
   debug.destroy = destroy;
 
   // env-specific initialization logic for debug instances
   if ('function' === typeof exports.init) {
     exports.init(debug);
   }
 
   exports.instances.push(debug);
 
   return debug;
 }
 
 function destroy () {
   var index = exports.instances.indexOf(this);
   if (index !== -1) {
     exports.instances.splice(index, 1);
     return true;
   } else {
     return false;
   }
 }
 
 /**
  * Enables a debug mode by namespaces. This can include modes
  * separated by a colon and wildcards.
  *
  * @param {String} namespaces
  * @api public
  */
 
 function enable(namespaces) {
   exports.save(namespaces);
 
   exports.names = [];
   exports.skips = [];
 
   var i;
   var split = (typeof namespaces === 'string' ? namespaces : '').split(/[\s,]+/);
   var len = split.length;
 
   for (i = 0; i < len; i++) {
     if (!split[i]) continue; // ignore empty strings
     namespaces = split[i].replace(/\*/g, '.*?');
     if (namespaces[0] === '-') {
       exports.skips.push(new RegExp('^' + namespaces.substr(1) + '$'));
     } else {
       exports.names.push(new RegExp('^' + namespaces + '$'));
     }
   }
 
   for (i = 0; i < exports.instances.length; i++) {
     var instance = exports.instances[i];
     instance.enabled = exports.enabled(instance.namespace);
   }
 }
 
 /**
  * Disable debug output.
  *
  * @api public
  */
 
 function disable() {
   exports.enable('');
 }
 
 /**
  * Returns true if the given mode name is enabled, false otherwise.
  *
  * @param {String} name
  * @return {Boolean}
  * @api public
  */
 
 function enabled(name) {
   if (name[name.length - 1] === '*') {
     return true;
   }
   var i, len;
   for (i = 0, len = exports.skips.length; i < len; i++) {
     if (exports.skips[i].test(name)) {
       return false;
     }
   }
   for (i = 0, len = exports.names.length; i < len; i++) {
     if (exports.names[i].test(name)) {
       return true;
     }
   }
   return false;
 }
 
 /**
  * Coerce `val`.
  *
  * @param {Mixed} val
  * @return {Mixed}
  * @api private
  */
 
 function coerce(val) {
   if (val instanceof Error) return val.stack || val.message;
   return val;
 }
 
 },{"ms":14}],6:[function(require,module,exports){
 (function (global){
 var topLevel = typeof global !== 'undefined' ? global :
     typeof window !== 'undefined' ? window : {}
 var minDoc = require('min-document');
 
 var doccy;
 
 if (typeof document !== 'undefined') {
     doccy = document;
 } else {
     doccy = topLevel['__GLOBAL_DOCUMENT_CACHE@4'];
 
     if (!doccy) {
         doccy = topLevel['__GLOBAL_DOCUMENT_CACHE@4'] = minDoc;
     }
 }
 
 module.exports = doccy;
 
 }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
 },{"min-document":3}],7:[function(require,module,exports){
 (function (global){
 var win;
 
 if (typeof window !== "undefined") {
     win = window;
 } else if (typeof global !== "undefined") {
     win = global;
 } else if (typeof self !== "undefined"){
     win = self;
 } else {
     win = {};
 }
 
 module.exports = win;
 
 }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
 },{}],8:[function(require,module,exports){
 module.exports = function hashMatch (hash, prefix) {
   var pre = prefix || '/';
   if (hash.length === 0) return pre;
   hash = hash.replace('#', '');
   hash = hash.replace(/\/$/, '')
   if (hash.indexOf('/') != 0) hash = '/' + hash;
   if (pre == '/') return hash;
   else return hash.replace(pre, '');
 }
 
 },{}],9:[function(require,module,exports){
 (function (global){
 /*! https://mths.be/he v1.1.1 by @mathias | MIT license */
 ;(function(root) {
 
 	// Detect free variables `exports`.
 	var freeExports = typeof exports == 'object' && exports;
 
 	// Detect free variable `module`.
 	var freeModule = typeof module == 'object' && module &&
 		module.exports == freeExports && module;
 
 	// Detect free variable `global`, from Node.js or Browserified code,
 	// and use it as `root`.
 	var freeGlobal = typeof global == 'object' && global;
 	if (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal) {
 		root = freeGlobal;
 	}
 
 	/*--------------------------------------------------------------------------*/
 
 	// All astral symbols.
 	var regexAstralSymbols = /[\uD800-\uDBFF][\uDC00-\uDFFF]/g;
 	// All ASCII symbols (not just printable ASCII) except those listed in the
 	// first column of the overrides table.
 	// https://html.spec.whatwg.org/multipage/syntax.html#table-charref-overrides
 	var regexAsciiWhitelist = /[\x01-\x7F]/g;
 	// All BMP symbols that are not ASCII newlines, printable ASCII symbols, or
 	// code points listed in the first column of the overrides table on
 	// https://html.spec.whatwg.org/multipage/syntax.html#table-charref-overrides.
 	var regexBmpWhitelist = /[\x01-\t\x0B\f\x0E-\x1F\x7F\x81\x8D\x8F\x90\x9D\xA0-\uFFFF]/g;
 
 	var regexEncodeNonAscii = /<\u20D2|=\u20E5|>\u20D2|\u205F\u200A|\u219D\u0338|\u2202\u0338|\u2220\u20D2|\u2229\uFE00|\u222A\uFE00|\u223C\u20D2|\u223D\u0331|\u223E\u0333|\u2242\u0338|\u224B\u0338|\u224D\u20D2|\u224E\u0338|\u224F\u0338|\u2250\u0338|\u2261\u20E5|\u2264\u20D2|\u2265\u20D2|\u2266\u0338|\u2267\u0338|\u2268\uFE00|\u2269\uFE00|\u226A\u0338|\u226A\u20D2|\u226B\u0338|\u226B\u20D2|\u227F\u0338|\u2282\u20D2|\u2283\u20D2|\u228A\uFE00|\u228B\uFE00|\u228F\u0338|\u2290\u0338|\u2293\uFE00|\u2294\uFE00|\u22B4\u20D2|\u22B5\u20D2|\u22D8\u0338|\u22D9\u0338|\u22DA\uFE00|\u22DB\uFE00|\u22F5\u0338|\u22F9\u0338|\u2933\u0338|\u29CF\u0338|\u29D0\u0338|\u2A6D\u0338|\u2A70\u0338|\u2A7D\u0338|\u2A7E\u0338|\u2AA1\u0338|\u2AA2\u0338|\u2AAC\uFE00|\u2AAD\uFE00|\u2AAF\u0338|\u2AB0\u0338|\u2AC5\u0338|\u2AC6\u0338|\u2ACB\uFE00|\u2ACC\uFE00|\u2AFD\u20E5|[\xA0-\u0113\u0116-\u0122\u0124-\u012B\u012E-\u014D\u0150-\u017E\u0192\u01B5\u01F5\u0237\u02C6\u02C7\u02D8-\u02DD\u0311\u0391-\u03A1\u03A3-\u03A9\u03B1-\u03C9\u03D1\u03D2\u03D5\u03D6\u03DC\u03DD\u03F0\u03F1\u03F5\u03F6\u0401-\u040C\u040E-\u044F\u0451-\u045C\u045E\u045F\u2002-\u2005\u2007-\u2010\u2013-\u2016\u2018-\u201A\u201C-\u201E\u2020-\u2022\u2025\u2026\u2030-\u2035\u2039\u203A\u203E\u2041\u2043\u2044\u204F\u2057\u205F-\u2063\u20AC\u20DB\u20DC\u2102\u2105\u210A-\u2113\u2115-\u211E\u2122\u2124\u2127-\u2129\u212C\u212D\u212F-\u2131\u2133-\u2138\u2145-\u2148\u2153-\u215E\u2190-\u219B\u219D-\u21A7\u21A9-\u21AE\u21B0-\u21B3\u21B5-\u21B7\u21BA-\u21DB\u21DD\u21E4\u21E5\u21F5\u21FD-\u2205\u2207-\u2209\u220B\u220C\u220F-\u2214\u2216-\u2218\u221A\u221D-\u2238\u223A-\u2257\u2259\u225A\u225C\u225F-\u2262\u2264-\u228B\u228D-\u229B\u229D-\u22A5\u22A7-\u22B0\u22B2-\u22BB\u22BD-\u22DB\u22DE-\u22E3\u22E6-\u22F7\u22F9-\u22FE\u2305\u2306\u2308-\u2310\u2312\u2313\u2315\u2316\u231C-\u231F\u2322\u2323\u232D\u232E\u2336\u233D\u233F\u237C\u23B0\u23B1\u23B4-\u23B6\u23DC-\u23DF\u23E2\u23E7\u2423\u24C8\u2500\u2502\u250C\u2510\u2514\u2518\u251C\u2524\u252C\u2534\u253C\u2550-\u256C\u2580\u2584\u2588\u2591-\u2593\u25A1\u25AA\u25AB\u25AD\u25AE\u25B1\u25B3-\u25B5\u25B8\u25B9\u25BD-\u25BF\u25C2\u25C3\u25CA\u25CB\u25EC\u25EF\u25F8-\u25FC\u2605\u2606\u260E\u2640\u2642\u2660\u2663\u2665\u2666\u266A\u266D-\u266F\u2713\u2717\u2720\u2736\u2758\u2772\u2773\u27C8\u27C9\u27E6-\u27ED\u27F5-\u27FA\u27FC\u27FF\u2902-\u2905\u290C-\u2913\u2916\u2919-\u2920\u2923-\u292A\u2933\u2935-\u2939\u293C\u293D\u2945\u2948-\u294B\u294E-\u2976\u2978\u2979\u297B-\u297F\u2985\u2986\u298B-\u2996\u299A\u299C\u299D\u29A4-\u29B7\u29B9\u29BB\u29BC\u29BE-\u29C5\u29C9\u29CD-\u29D0\u29DC-\u29DE\u29E3-\u29E5\u29EB\u29F4\u29F6\u2A00-\u2A02\u2A04\u2A06\u2A0C\u2A0D\u2A10-\u2A17\u2A22-\u2A27\u2A29\u2A2A\u2A2D-\u2A31\u2A33-\u2A3C\u2A3F\u2A40\u2A42-\u2A4D\u2A50\u2A53-\u2A58\u2A5A-\u2A5D\u2A5F\u2A66\u2A6A\u2A6D-\u2A75\u2A77-\u2A9A\u2A9D-\u2AA2\u2AA4-\u2AB0\u2AB3-\u2AC8\u2ACB\u2ACC\u2ACF-\u2ADB\u2AE4\u2AE6-\u2AE9\u2AEB-\u2AF3\u2AFD\uFB00-\uFB04]|\uD835[\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDCCF\uDD04\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDD6B]/g;
 	var encodeMap = {'\xAD':'shy','\u200C':'zwnj','\u200D':'zwj','\u200E':'lrm','\u2063':'ic','\u2062':'it','\u2061':'af','\u200F':'rlm','\u200B':'ZeroWidthSpace','\u2060':'NoBreak','\u0311':'DownBreve','\u20DB':'tdot','\u20DC':'DotDot','\t':'Tab','\n':'NewLine','\u2008':'puncsp','\u205F':'MediumSpace','\u2009':'thinsp','\u200A':'hairsp','\u2004':'emsp13','\u2002':'ensp','\u2005':'emsp14','\u2003':'emsp','\u2007':'numsp','\xA0':'nbsp','\u205F\u200A':'ThickSpace','\u203E':'oline','_':'lowbar','\u2010':'dash','\u2013':'ndash','\u2014':'mdash','\u2015':'horbar',',':'comma',';':'semi','\u204F':'bsemi',':':'colon','\u2A74':'Colone','!':'excl','\xA1':'iexcl','?':'quest','\xBF':'iquest','.':'period','\u2025':'nldr','\u2026':'mldr','\xB7':'middot','\'':'apos','\u2018':'lsquo','\u2019':'rsquo','\u201A':'sbquo','\u2039':'lsaquo','\u203A':'rsaquo','"':'quot','\u201C':'ldquo','\u201D':'rdquo','\u201E':'bdquo','\xAB':'laquo','\xBB':'raquo','(':'lpar',')':'rpar','[':'lsqb',']':'rsqb','{':'lcub','}':'rcub','\u2308':'lceil','\u2309':'rceil','\u230A':'lfloor','\u230B':'rfloor','\u2985':'lopar','\u2986':'ropar','\u298B':'lbrke','\u298C':'rbrke','\u298D':'lbrkslu','\u298E':'rbrksld','\u298F':'lbrksld','\u2990':'rbrkslu','\u2991':'langd','\u2992':'rangd','\u2993':'lparlt','\u2994':'rpargt','\u2995':'gtlPar','\u2996':'ltrPar','\u27E6':'lobrk','\u27E7':'robrk','\u27E8':'lang','\u27E9':'rang','\u27EA':'Lang','\u27EB':'Rang','\u27EC':'loang','\u27ED':'roang','\u2772':'lbbrk','\u2773':'rbbrk','\u2016':'Vert','\xA7':'sect','\xB6':'para','@':'commat','*':'ast','/':'sol','undefined':null,'&':'amp','#':'num','%':'percnt','\u2030':'permil','\u2031':'pertenk','\u2020':'dagger','\u2021':'Dagger','\u2022':'bull','\u2043':'hybull','\u2032':'prime','\u2033':'Prime','\u2034':'tprime','\u2057':'qprime','\u2035':'bprime','\u2041':'caret','`':'grave','\xB4':'acute','\u02DC':'tilde','^':'Hat','\xAF':'macr','\u02D8':'breve','\u02D9':'dot','\xA8':'die','\u02DA':'ring','\u02DD':'dblac','\xB8':'cedil','\u02DB':'ogon','\u02C6':'circ','\u02C7':'caron','\xB0':'deg','\xA9':'copy','\xAE':'reg','\u2117':'copysr','\u2118':'wp','\u211E':'rx','\u2127':'mho','\u2129':'iiota','\u2190':'larr','\u219A':'nlarr','\u2192':'rarr','\u219B':'nrarr','\u2191':'uarr','\u2193':'darr','\u2194':'harr','\u21AE':'nharr','\u2195':'varr','\u2196':'nwarr','\u2197':'nearr','\u2198':'searr','\u2199':'swarr','\u219D':'rarrw','\u219D\u0338':'nrarrw','\u219E':'Larr','\u219F':'Uarr','\u21A0':'Rarr','\u21A1':'Darr','\u21A2':'larrtl','\u21A3':'rarrtl','\u21A4':'mapstoleft','\u21A5':'mapstoup','\u21A6':'map','\u21A7':'mapstodown','\u21A9':'larrhk','\u21AA':'rarrhk','\u21AB':'larrlp','\u21AC':'rarrlp','\u21AD':'harrw','\u21B0':'lsh','\u21B1':'rsh','\u21B2':'ldsh','\u21B3':'rdsh','\u21B5':'crarr','\u21B6':'cularr','\u21B7':'curarr','\u21BA':'olarr','\u21BB':'orarr','\u21BC':'lharu','\u21BD':'lhard','\u21BE':'uharr','\u21BF':'uharl','\u21C0':'rharu','\u21C1':'rhard','\u21C2':'dharr','\u21C3':'dharl','\u21C4':'rlarr','\u21C5':'udarr','\u21C6':'lrarr','\u21C7':'llarr','\u21C8':'uuarr','\u21C9':'rrarr','\u21CA':'ddarr','\u21CB':'lrhar','\u21CC':'rlhar','\u21D0':'lArr','\u21CD':'nlArr','\u21D1':'uArr','\u21D2':'rArr','\u21CF':'nrArr','\u21D3':'dArr','\u21D4':'iff','\u21CE':'nhArr','\u21D5':'vArr','\u21D6':'nwArr','\u21D7':'neArr','\u21D8':'seArr','\u21D9':'swArr','\u21DA':'lAarr','\u21DB':'rAarr','\u21DD':'zigrarr','\u21E4':'larrb','\u21E5':'rarrb','\u21F5':'duarr','\u21FD':'loarr','\u21FE':'roarr','\u21FF':'hoarr','\u2200':'forall','\u2201':'comp','\u2202':'part','\u2202\u0338':'npart','\u2203':'exist','\u2204':'nexist','\u2205':'empty','\u2207':'Del','\u2208':'in','\u2209':'notin','\u220B':'ni','\u220C':'notni','\u03F6':'bepsi','\u220F':'prod','\u2210':'coprod','\u2211':'sum','+':'plus','\xB1':'pm','\xF7':'div','\xD7':'times','<':'lt','\u226E':'nlt','<\u20D2':'nvlt','=':'equals','\u2260':'ne','=\u20E5':'bne','\u2A75':'Equal','>':'gt','\u226F':'ngt','>\u20D2':'nvgt','\xAC':'not','|':'vert','\xA6':'brvbar','\u2212':'minus','\u2213':'mp','\u2214':'plusdo','\u2044':'frasl','\u2216':'setmn','\u2217':'lowast','\u2218':'compfn','\u221A':'Sqrt','\u221D':'prop','\u221E':'infin','\u221F':'angrt','\u2220':'ang','\u2220\u20D2':'nang','\u2221':'angmsd','\u2222':'angsph','\u2223':'mid','\u2224':'nmid','\u2225':'par','\u2226':'npar','\u2227':'and','\u2228':'or','\u2229':'cap','\u2229\uFE00':'caps','\u222A':'cup','\u222A\uFE00':'cups','\u222B':'int','\u222C':'Int','\u222D':'tint','\u2A0C':'qint','\u222E':'oint','\u222F':'Conint','\u2230':'Cconint','\u2231':'cwint','\u2232':'cwconint','\u2233':'awconint','\u2234':'there4','\u2235':'becaus','\u2236':'ratio','\u2237':'Colon','\u2238':'minusd','\u223A':'mDDot','\u223B':'homtht','\u223C':'sim','\u2241':'nsim','\u223C\u20D2':'nvsim','\u223D':'bsim','\u223D\u0331':'race','\u223E':'ac','\u223E\u0333':'acE','\u223F':'acd','\u2240':'wr','\u2242':'esim','\u2242\u0338':'nesim','\u2243':'sime','\u2244':'nsime','\u2245':'cong','\u2247':'ncong','\u2246':'simne','\u2248':'ap','\u2249':'nap','\u224A':'ape','\u224B':'apid','\u224B\u0338':'napid','\u224C':'bcong','\u224D':'CupCap','\u226D':'NotCupCap','\u224D\u20D2':'nvap','\u224E':'bump','\u224E\u0338':'nbump','\u224F':'bumpe','\u224F\u0338':'nbumpe','\u2250':'doteq','\u2250\u0338':'nedot','\u2251':'eDot','\u2252':'efDot','\u2253':'erDot','\u2254':'colone','\u2255':'ecolon','\u2256':'ecir','\u2257':'cire','\u2259':'wedgeq','\u225A':'veeeq','\u225C':'trie','\u225F':'equest','\u2261':'equiv','\u2262':'nequiv','\u2261\u20E5':'bnequiv','\u2264':'le','\u2270':'nle','\u2264\u20D2':'nvle','\u2265':'ge','\u2271':'nge','\u2265\u20D2':'nvge','\u2266':'lE','\u2266\u0338':'nlE','\u2267':'gE','\u2267\u0338':'ngE','\u2268\uFE00':'lvnE','\u2268':'lnE','\u2269':'gnE','\u2269\uFE00':'gvnE','\u226A':'ll','\u226A\u0338':'nLtv','\u226A\u20D2':'nLt','\u226B':'gg','\u226B\u0338':'nGtv','\u226B\u20D2':'nGt','\u226C':'twixt','\u2272':'lsim','\u2274':'nlsim','\u2273':'gsim','\u2275':'ngsim','\u2276':'lg','\u2278':'ntlg','\u2277':'gl','\u2279':'ntgl','\u227A':'pr','\u2280':'npr','\u227B':'sc','\u2281':'nsc','\u227C':'prcue','\u22E0':'nprcue','\u227D':'sccue','\u22E1':'nsccue','\u227E':'prsim','\u227F':'scsim','\u227F\u0338':'NotSucceedsTilde','\u2282':'sub','\u2284':'nsub','\u2282\u20D2':'vnsub','\u2283':'sup','\u2285':'nsup','\u2283\u20D2':'vnsup','\u2286':'sube','\u2288':'nsube','\u2287':'supe','\u2289':'nsupe','\u228A\uFE00':'vsubne','\u228A':'subne','\u228B\uFE00':'vsupne','\u228B':'supne','\u228D':'cupdot','\u228E':'uplus','\u228F':'sqsub','\u228F\u0338':'NotSquareSubset','\u2290':'sqsup','\u2290\u0338':'NotSquareSuperset','\u2291':'sqsube','\u22E2':'nsqsube','\u2292':'sqsupe','\u22E3':'nsqsupe','\u2293':'sqcap','\u2293\uFE00':'sqcaps','\u2294':'sqcup','\u2294\uFE00':'sqcups','\u2295':'oplus','\u2296':'ominus','\u2297':'otimes','\u2298':'osol','\u2299':'odot','\u229A':'ocir','\u229B':'oast','\u229D':'odash','\u229E':'plusb','\u229F':'minusb','\u22A0':'timesb','\u22A1':'sdotb','\u22A2':'vdash','\u22AC':'nvdash','\u22A3':'dashv','\u22A4':'top','\u22A5':'bot','\u22A7':'models','\u22A8':'vDash','\u22AD':'nvDash','\u22A9':'Vdash','\u22AE':'nVdash','\u22AA':'Vvdash','\u22AB':'VDash','\u22AF':'nVDash','\u22B0':'prurel','\u22B2':'vltri','\u22EA':'nltri','\u22B3':'vrtri','\u22EB':'nrtri','\u22B4':'ltrie','\u22EC':'nltrie','\u22B4\u20D2':'nvltrie','\u22B5':'rtrie','\u22ED':'nrtrie','\u22B5\u20D2':'nvrtrie','\u22B6':'origof','\u22B7':'imof','\u22B8':'mumap','\u22B9':'hercon','\u22BA':'intcal','\u22BB':'veebar','\u22BD':'barvee','\u22BE':'angrtvb','\u22BF':'lrtri','\u22C0':'Wedge','\u22C1':'Vee','\u22C2':'xcap','\u22C3':'xcup','\u22C4':'diam','\u22C5':'sdot','\u22C6':'Star','\u22C7':'divonx','\u22C8':'bowtie','\u22C9':'ltimes','\u22CA':'rtimes','\u22CB':'lthree','\u22CC':'rthree','\u22CD':'bsime','\u22CE':'cuvee','\u22CF':'cuwed','\u22D0':'Sub','\u22D1':'Sup','\u22D2':'Cap','\u22D3':'Cup','\u22D4':'fork','\u22D5':'epar','\u22D6':'ltdot','\u22D7':'gtdot','\u22D8':'Ll','\u22D8\u0338':'nLl','\u22D9':'Gg','\u22D9\u0338':'nGg','\u22DA\uFE00':'lesg','\u22DA':'leg','\u22DB':'gel','\u22DB\uFE00':'gesl','\u22DE':'cuepr','\u22DF':'cuesc','\u22E6':'lnsim','\u22E7':'gnsim','\u22E8':'prnsim','\u22E9':'scnsim','\u22EE':'vellip','\u22EF':'ctdot','\u22F0':'utdot','\u22F1':'dtdot','\u22F2':'disin','\u22F3':'isinsv','\u22F4':'isins','\u22F5':'isindot','\u22F5\u0338':'notindot','\u22F6':'notinvc','\u22F7':'notinvb','\u22F9':'isinE','\u22F9\u0338':'notinE','\u22FA':'nisd','\u22FB':'xnis','\u22FC':'nis','\u22FD':'notnivc','\u22FE':'notnivb','\u2305':'barwed','\u2306':'Barwed','\u230C':'drcrop','\u230D':'dlcrop','\u230E':'urcrop','\u230F':'ulcrop','\u2310':'bnot','\u2312':'profline','\u2313':'profsurf','\u2315':'telrec','\u2316':'target','\u231C':'ulcorn','\u231D':'urcorn','\u231E':'dlcorn','\u231F':'drcorn','\u2322':'frown','\u2323':'smile','\u232D':'cylcty','\u232E':'profalar','\u2336':'topbot','\u233D':'ovbar','\u233F':'solbar','\u237C':'angzarr','\u23B0':'lmoust','\u23B1':'rmoust','\u23B4':'tbrk','\u23B5':'bbrk','\u23B6':'bbrktbrk','\u23DC':'OverParenthesis','\u23DD':'UnderParenthesis','\u23DE':'OverBrace','\u23DF':'UnderBrace','\u23E2':'trpezium','\u23E7':'elinters','\u2423':'blank','\u2500':'boxh','\u2502':'boxv','\u250C':'boxdr','\u2510':'boxdl','\u2514':'boxur','\u2518':'boxul','\u251C':'boxvr','\u2524':'boxvl','\u252C':'boxhd','\u2534':'boxhu','\u253C':'boxvh','\u2550':'boxH','\u2551':'boxV','\u2552':'boxdR','\u2553':'boxDr','\u2554':'boxDR','\u2555':'boxdL','\u2556':'boxDl','\u2557':'boxDL','\u2558':'boxuR','\u2559':'boxUr','\u255A':'boxUR','\u255B':'boxuL','\u255C':'boxUl','\u255D':'boxUL','\u255E':'boxvR','\u255F':'boxVr','\u2560':'boxVR','\u2561':'boxvL','\u2562':'boxVl','\u2563':'boxVL','\u2564':'boxHd','\u2565':'boxhD','\u2566':'boxHD','\u2567':'boxHu','\u2568':'boxhU','\u2569':'boxHU','\u256A':'boxvH','\u256B':'boxVh','\u256C':'boxVH','\u2580':'uhblk','\u2584':'lhblk','\u2588':'block','\u2591':'blk14','\u2592':'blk12','\u2593':'blk34','\u25A1':'squ','\u25AA':'squf','\u25AB':'EmptyVerySmallSquare','\u25AD':'rect','\u25AE':'marker','\u25B1':'fltns','\u25B3':'xutri','\u25B4':'utrif','\u25B5':'utri','\u25B8':'rtrif','\u25B9':'rtri','\u25BD':'xdtri','\u25BE':'dtrif','\u25BF':'dtri','\u25C2':'ltrif','\u25C3':'ltri','\u25CA':'loz','\u25CB':'cir','\u25EC':'tridot','\u25EF':'xcirc','\u25F8':'ultri','\u25F9':'urtri','\u25FA':'lltri','\u25FB':'EmptySmallSquare','\u25FC':'FilledSmallSquare','\u2605':'starf','\u2606':'star','\u260E':'phone','\u2640':'female','\u2642':'male','\u2660':'spades','\u2663':'clubs','\u2665':'hearts','\u2666':'diams','\u266A':'sung','\u2713':'check','\u2717':'cross','\u2720':'malt','\u2736':'sext','\u2758':'VerticalSeparator','\u27C8':'bsolhsub','\u27C9':'suphsol','\u27F5':'xlarr','\u27F6':'xrarr','\u27F7':'xharr','\u27F8':'xlArr','\u27F9':'xrArr','\u27FA':'xhArr','\u27FC':'xmap','\u27FF':'dzigrarr','\u2902':'nvlArr','\u2903':'nvrArr','\u2904':'nvHarr','\u2905':'Map','\u290C':'lbarr','\u290D':'rbarr','\u290E':'lBarr','\u290F':'rBarr','\u2910':'RBarr','\u2911':'DDotrahd','\u2912':'UpArrowBar','\u2913':'DownArrowBar','\u2916':'Rarrtl','\u2919':'latail','\u291A':'ratail','\u291B':'lAtail','\u291C':'rAtail','\u291D':'larrfs','\u291E':'rarrfs','\u291F':'larrbfs','\u2920':'rarrbfs','\u2923':'nwarhk','\u2924':'nearhk','\u2925':'searhk','\u2926':'swarhk','\u2927':'nwnear','\u2928':'toea','\u2929':'tosa','\u292A':'swnwar','\u2933':'rarrc','\u2933\u0338':'nrarrc','\u2935':'cudarrr','\u2936':'ldca','\u2937':'rdca','\u2938':'cudarrl','\u2939':'larrpl','\u293C':'curarrm','\u293D':'cularrp','\u2945':'rarrpl','\u2948':'harrcir','\u2949':'Uarrocir','\u294A':'lurdshar','\u294B':'ldrushar','\u294E':'LeftRightVector','\u294F':'RightUpDownVector','\u2950':'DownLeftRightVector','\u2951':'LeftUpDownVector','\u2952':'LeftVectorBar','\u2953':'RightVectorBar','\u2954':'RightUpVectorBar','\u2955':'RightDownVectorBar','\u2956':'DownLeftVectorBar','\u2957':'DownRightVectorBar','\u2958':'LeftUpVectorBar','\u2959':'LeftDownVectorBar','\u295A':'LeftTeeVector','\u295B':'RightTeeVector','\u295C':'RightUpTeeVector','\u295D':'RightDownTeeVector','\u295E':'DownLeftTeeVector','\u295F':'DownRightTeeVector','\u2960':'LeftUpTeeVector','\u2961':'LeftDownTeeVector','\u2962':'lHar','\u2963':'uHar','\u2964':'rHar','\u2965':'dHar','\u2966':'luruhar','\u2967':'ldrdhar','\u2968':'ruluhar','\u2969':'rdldhar','\u296A':'lharul','\u296B':'llhard','\u296C':'rharul','\u296D':'lrhard','\u296E':'udhar','\u296F':'duhar','\u2970':'RoundImplies','\u2971':'erarr','\u2972':'simrarr','\u2973':'larrsim','\u2974':'rarrsim','\u2975':'rarrap','\u2976':'ltlarr','\u2978':'gtrarr','\u2979':'subrarr','\u297B':'suplarr','\u297C':'lfisht','\u297D':'rfisht','\u297E':'ufisht','\u297F':'dfisht','\u299A':'vzigzag','\u299C':'vangrt','\u299D':'angrtvbd','\u29A4':'ange','\u29A5':'range','\u29A6':'dwangle','\u29A7':'uwangle','\u29A8':'angmsdaa','\u29A9':'angmsdab','\u29AA':'angmsdac','\u29AB':'angmsdad','\u29AC':'angmsdae','\u29AD':'angmsdaf','\u29AE':'angmsdag','\u29AF':'angmsdah','\u29B0':'bemptyv','\u29B1':'demptyv','\u29B2':'cemptyv','\u29B3':'raemptyv','\u29B4':'laemptyv','\u29B5':'ohbar','\u29B6':'omid','\u29B7':'opar','\u29B9':'operp','\u29BB':'olcross','\u29BC':'odsold','\u29BE':'olcir','\u29BF':'ofcir','\u29C0':'olt','\u29C1':'ogt','\u29C2':'cirscir','\u29C3':'cirE','\u29C4':'solb','\u29C5':'bsolb','\u29C9':'boxbox','\u29CD':'trisb','\u29CE':'rtriltri','\u29CF':'LeftTriangleBar','\u29CF\u0338':'NotLeftTriangleBar','\u29D0':'RightTriangleBar','\u29D0\u0338':'NotRightTriangleBar','\u29DC':'iinfin','\u29DD':'infintie','\u29DE':'nvinfin','\u29E3':'eparsl','\u29E4':'smeparsl','\u29E5':'eqvparsl','\u29EB':'lozf','\u29F4':'RuleDelayed','\u29F6':'dsol','\u2A00':'xodot','\u2A01':'xoplus','\u2A02':'xotime','\u2A04':'xuplus','\u2A06':'xsqcup','\u2A0D':'fpartint','\u2A10':'cirfnint','\u2A11':'awint','\u2A12':'rppolint','\u2A13':'scpolint','\u2A14':'npolint','\u2A15':'pointint','\u2A16':'quatint','\u2A17':'intlarhk','\u2A22':'pluscir','\u2A23':'plusacir','\u2A24':'simplus','\u2A25':'plusdu','\u2A26':'plussim','\u2A27':'plustwo','\u2A29':'mcomma','\u2A2A':'minusdu','\u2A2D':'loplus','\u2A2E':'roplus','\u2A2F':'Cross','\u2A30':'timesd','\u2A31':'timesbar','\u2A33':'smashp','\u2A34':'lotimes','\u2A35':'rotimes','\u2A36':'otimesas','\u2A37':'Otimes','\u2A38':'odiv','\u2A39':'triplus','\u2A3A':'triminus','\u2A3B':'tritime','\u2A3C':'iprod','\u2A3F':'amalg','\u2A40':'capdot','\u2A42':'ncup','\u2A43':'ncap','\u2A44':'capand','\u2A45':'cupor','\u2A46':'cupcap','\u2A47':'capcup','\u2A48':'cupbrcap','\u2A49':'capbrcup','\u2A4A':'cupcup','\u2A4B':'capcap','\u2A4C':'ccups','\u2A4D':'ccaps','\u2A50':'ccupssm','\u2A53':'And','\u2A54':'Or','\u2A55':'andand','\u2A56':'oror','\u2A57':'orslope','\u2A58':'andslope','\u2A5A':'andv','\u2A5B':'orv','\u2A5C':'andd','\u2A5D':'ord','\u2A5F':'wedbar','\u2A66':'sdote','\u2A6A':'simdot','\u2A6D':'congdot','\u2A6D\u0338':'ncongdot','\u2A6E':'easter','\u2A6F':'apacir','\u2A70':'apE','\u2A70\u0338':'napE','\u2A71':'eplus','\u2A72':'pluse','\u2A73':'Esim','\u2A77':'eDDot','\u2A78':'equivDD','\u2A79':'ltcir','\u2A7A':'gtcir','\u2A7B':'ltquest','\u2A7C':'gtquest','\u2A7D':'les','\u2A7D\u0338':'nles','\u2A7E':'ges','\u2A7E\u0338':'nges','\u2A7F':'lesdot','\u2A80':'gesdot','\u2A81':'lesdoto','\u2A82':'gesdoto','\u2A83':'lesdotor','\u2A84':'gesdotol','\u2A85':'lap','\u2A86':'gap','\u2A87':'lne','\u2A88':'gne','\u2A89':'lnap','\u2A8A':'gnap','\u2A8B':'lEg','\u2A8C':'gEl','\u2A8D':'lsime','\u2A8E':'gsime','\u2A8F':'lsimg','\u2A90':'gsiml','\u2A91':'lgE','\u2A92':'glE','\u2A93':'lesges','\u2A94':'gesles','\u2A95':'els','\u2A96':'egs','\u2A97':'elsdot','\u2A98':'egsdot','\u2A99':'el','\u2A9A':'eg','\u2A9D':'siml','\u2A9E':'simg','\u2A9F':'simlE','\u2AA0':'simgE','\u2AA1':'LessLess','\u2AA1\u0338':'NotNestedLessLess','\u2AA2':'GreaterGreater','\u2AA2\u0338':'NotNestedGreaterGreater','\u2AA4':'glj','\u2AA5':'gla','\u2AA6':'ltcc','\u2AA7':'gtcc','\u2AA8':'lescc','\u2AA9':'gescc','\u2AAA':'smt','\u2AAB':'lat','\u2AAC':'smte','\u2AAC\uFE00':'smtes','\u2AAD':'late','\u2AAD\uFE00':'lates','\u2AAE':'bumpE','\u2AAF':'pre','\u2AAF\u0338':'npre','\u2AB0':'sce','\u2AB0\u0338':'nsce','\u2AB3':'prE','\u2AB4':'scE','\u2AB5':'prnE','\u2AB6':'scnE','\u2AB7':'prap','\u2AB8':'scap','\u2AB9':'prnap','\u2ABA':'scnap','\u2ABB':'Pr','\u2ABC':'Sc','\u2ABD':'subdot','\u2ABE':'supdot','\u2ABF':'subplus','\u2AC0':'supplus','\u2AC1':'submult','\u2AC2':'supmult','\u2AC3':'subedot','\u2AC4':'supedot','\u2AC5':'subE','\u2AC5\u0338':'nsubE','\u2AC6':'supE','\u2AC6\u0338':'nsupE','\u2AC7':'subsim','\u2AC8':'supsim','\u2ACB\uFE00':'vsubnE','\u2ACB':'subnE','\u2ACC\uFE00':'vsupnE','\u2ACC':'supnE','\u2ACF':'csub','\u2AD0':'csup','\u2AD1':'csube','\u2AD2':'csupe','\u2AD3':'subsup','\u2AD4':'supsub','\u2AD5':'subsub','\u2AD6':'supsup','\u2AD7':'suphsub','\u2AD8':'supdsub','\u2AD9':'forkv','\u2ADA':'topfork','\u2ADB':'mlcp','\u2AE4':'Dashv','\u2AE6':'Vdashl','\u2AE7':'Barv','\u2AE8':'vBar','\u2AE9':'vBarv','\u2AEB':'Vbar','\u2AEC':'Not','\u2AED':'bNot','\u2AEE':'rnmid','\u2AEF':'cirmid','\u2AF0':'midcir','\u2AF1':'topcir','\u2AF2':'nhpar','\u2AF3':'parsim','\u2AFD':'parsl','\u2AFD\u20E5':'nparsl','\u266D':'flat','\u266E':'natur','\u266F':'sharp','\xA4':'curren','\xA2':'cent','$':'dollar','\xA3':'pound','\xA5':'yen','\u20AC':'euro','\xB9':'sup1','\xBD':'half','\u2153':'frac13','\xBC':'frac14','\u2155':'frac15','\u2159':'frac16','\u215B':'frac18','\xB2':'sup2','\u2154':'frac23','\u2156':'frac25','\xB3':'sup3','\xBE':'frac34','\u2157':'frac35','\u215C':'frac38','\u2158':'frac45','\u215A':'frac56','\u215D':'frac58','\u215E':'frac78','\uD835\uDCB6':'ascr','\uD835\uDD52':'aopf','\uD835\uDD1E':'afr','\uD835\uDD38':'Aopf','\uD835\uDD04':'Afr','\uD835\uDC9C':'Ascr','\xAA':'ordf','\xE1':'aacute','\xC1':'Aacute','\xE0':'agrave','\xC0':'Agrave','\u0103':'abreve','\u0102':'Abreve','\xE2':'acirc','\xC2':'Acirc','\xE5':'aring','\xC5':'angst','\xE4':'auml','\xC4':'Auml','\xE3':'atilde','\xC3':'Atilde','\u0105':'aogon','\u0104':'Aogon','\u0101':'amacr','\u0100':'Amacr','\xE6':'aelig','\xC6':'AElig','\uD835\uDCB7':'bscr','\uD835\uDD53':'bopf','\uD835\uDD1F':'bfr','\uD835\uDD39':'Bopf','\u212C':'Bscr','\uD835\uDD05':'Bfr','\uD835\uDD20':'cfr','\uD835\uDCB8':'cscr','\uD835\uDD54':'copf','\u212D':'Cfr','\uD835\uDC9E':'Cscr','\u2102':'Copf','\u0107':'cacute','\u0106':'Cacute','\u0109':'ccirc','\u0108':'Ccirc','\u010D':'ccaron','\u010C':'Ccaron','\u010B':'cdot','\u010A':'Cdot','\xE7':'ccedil','\xC7':'Ccedil','\u2105':'incare','\uD835\uDD21':'dfr','\u2146':'dd','\uD835\uDD55':'dopf','\uD835\uDCB9':'dscr','\uD835\uDC9F':'Dscr','\uD835\uDD07':'Dfr','\u2145':'DD','\uD835\uDD3B':'Dopf','\u010F':'dcaron','\u010E':'Dcaron','\u0111':'dstrok','\u0110':'Dstrok','\xF0':'eth','\xD0':'ETH','\u2147':'ee','\u212F':'escr','\uD835\uDD22':'efr','\uD835\uDD56':'eopf','\u2130':'Escr','\uD835\uDD08':'Efr','\uD835\uDD3C':'Eopf','\xE9':'eacute','\xC9':'Eacute','\xE8':'egrave','\xC8':'Egrave','\xEA':'ecirc','\xCA':'Ecirc','\u011B':'ecaron','\u011A':'Ecaron','\xEB':'euml','\xCB':'Euml','\u0117':'edot','\u0116':'Edot','\u0119':'eogon','\u0118':'Eogon','\u0113':'emacr','\u0112':'Emacr','\uD835\uDD23':'ffr','\uD835\uDD57':'fopf','\uD835\uDCBB':'fscr','\uD835\uDD09':'Ffr','\uD835\uDD3D':'Fopf','\u2131':'Fscr','\uFB00':'fflig','\uFB03':'ffilig','\uFB04':'ffllig','\uFB01':'filig','fj':'fjlig','\uFB02':'fllig','\u0192':'fnof','\u210A':'gscr','\uD835\uDD58':'gopf','\uD835\uDD24':'gfr','\uD835\uDCA2':'Gscr','\uD835\uDD3E':'Gopf','\uD835\uDD0A':'Gfr','\u01F5':'gacute','\u011F':'gbreve','\u011E':'Gbreve','\u011D':'gcirc','\u011C':'Gcirc','\u0121':'gdot','\u0120':'Gdot','\u0122':'Gcedil','\uD835\uDD25':'hfr','\u210E':'planckh','\uD835\uDCBD':'hscr','\uD835\uDD59':'hopf','\u210B':'Hscr','\u210C':'Hfr','\u210D':'Hopf','\u0125':'hcirc','\u0124':'Hcirc','\u210F':'hbar','\u0127':'hstrok','\u0126':'Hstrok','\uD835\uDD5A':'iopf','\uD835\uDD26':'ifr','\uD835\uDCBE':'iscr','\u2148':'ii','\uD835\uDD40':'Iopf','\u2110':'Iscr','\u2111':'Im','\xED':'iacute','\xCD':'Iacute','\xEC':'igrave','\xCC':'Igrave','\xEE':'icirc','\xCE':'Icirc','\xEF':'iuml','\xCF':'Iuml','\u0129':'itilde','\u0128':'Itilde','\u0130':'Idot','\u012F':'iogon','\u012E':'Iogon','\u012B':'imacr','\u012A':'Imacr','\u0133':'ijlig','\u0132':'IJlig','\u0131':'imath','\uD835\uDCBF':'jscr','\uD835\uDD5B':'jopf','\uD835\uDD27':'jfr','\uD835\uDCA5':'Jscr','\uD835\uDD0D':'Jfr','\uD835\uDD41':'Jopf','\u0135':'jcirc','\u0134':'Jcirc','\u0237':'jmath','\uD835\uDD5C':'kopf','\uD835\uDCC0':'kscr','\uD835\uDD28':'kfr','\uD835\uDCA6':'Kscr','\uD835\uDD42':'Kopf','\uD835\uDD0E':'Kfr','\u0137':'kcedil','\u0136':'Kcedil','\uD835\uDD29':'lfr','\uD835\uDCC1':'lscr','\u2113':'ell','\uD835\uDD5D':'lopf','\u2112':'Lscr','\uD835\uDD0F':'Lfr','\uD835\uDD43':'Lopf','\u013A':'lacute','\u0139':'Lacute','\u013E':'lcaron','\u013D':'Lcaron','\u013C':'lcedil','\u013B':'Lcedil','\u0142':'lstrok','\u0141':'Lstrok','\u0140':'lmidot','\u013F':'Lmidot','\uD835\uDD2A':'mfr','\uD835\uDD5E':'mopf','\uD835\uDCC2':'mscr','\uD835\uDD10':'Mfr','\uD835\uDD44':'Mopf','\u2133':'Mscr','\uD835\uDD2B':'nfr','\uD835\uDD5F':'nopf','\uD835\uDCC3':'nscr','\u2115':'Nopf','\uD835\uDCA9':'Nscr','\uD835\uDD11':'Nfr','\u0144':'nacute','\u0143':'Nacute','\u0148':'ncaron','\u0147':'Ncaron','\xF1':'ntilde','\xD1':'Ntilde','\u0146':'ncedil','\u0145':'Ncedil','\u2116':'numero','\u014B':'eng','\u014A':'ENG','\uD835\uDD60':'oopf','\uD835\uDD2C':'ofr','\u2134':'oscr','\uD835\uDCAA':'Oscr','\uD835\uDD12':'Ofr','\uD835\uDD46':'Oopf','\xBA':'ordm','\xF3':'oacute','\xD3':'Oacute','\xF2':'ograve','\xD2':'Ograve','\xF4':'ocirc','\xD4':'Ocirc','\xF6':'ouml','\xD6':'Ouml','\u0151':'odblac','\u0150':'Odblac','\xF5':'otilde','\xD5':'Otilde','\xF8':'oslash','\xD8':'Oslash','\u014D':'omacr','\u014C':'Omacr','\u0153':'oelig','\u0152':'OElig','\uD835\uDD2D':'pfr','\uD835\uDCC5':'pscr','\uD835\uDD61':'popf','\u2119':'Popf','\uD835\uDD13':'Pfr','\uD835\uDCAB':'Pscr','\uD835\uDD62':'qopf','\uD835\uDD2E':'qfr','\uD835\uDCC6':'qscr','\uD835\uDCAC':'Qscr','\uD835\uDD14':'Qfr','\u211A':'Qopf','\u0138':'kgreen','\uD835\uDD2F':'rfr','\uD835\uDD63':'ropf','\uD835\uDCC7':'rscr','\u211B':'Rscr','\u211C':'Re','\u211D':'Ropf','\u0155':'racute','\u0154':'Racute','\u0159':'rcaron','\u0158':'Rcaron','\u0157':'rcedil','\u0156':'Rcedil','\uD835\uDD64':'sopf','\uD835\uDCC8':'sscr','\uD835\uDD30':'sfr','\uD835\uDD4A':'Sopf','\uD835\uDD16':'Sfr','\uD835\uDCAE':'Sscr','\u24C8':'oS','\u015B':'sacute','\u015A':'Sacute','\u015D':'scirc','\u015C':'Scirc','\u0161':'scaron','\u0160':'Scaron','\u015F':'scedil','\u015E':'Scedil','\xDF':'szlig','\uD835\uDD31':'tfr','\uD835\uDCC9':'tscr','\uD835\uDD65':'topf','\uD835\uDCAF':'Tscr','\uD835\uDD17':'Tfr','\uD835\uDD4B':'Topf','\u0165':'tcaron','\u0164':'Tcaron','\u0163':'tcedil','\u0162':'Tcedil','\u2122':'trade','\u0167':'tstrok','\u0166':'Tstrok','\uD835\uDCCA':'uscr','\uD835\uDD66':'uopf','\uD835\uDD32':'ufr','\uD835\uDD4C':'Uopf','\uD835\uDD18':'Ufr','\uD835\uDCB0':'Uscr','\xFA':'uacute','\xDA':'Uacute','\xF9':'ugrave','\xD9':'Ugrave','\u016D':'ubreve','\u016C':'Ubreve','\xFB':'ucirc','\xDB':'Ucirc','\u016F':'uring','\u016E':'Uring','\xFC':'uuml','\xDC':'Uuml','\u0171':'udblac','\u0170':'Udblac','\u0169':'utilde','\u0168':'Utilde','\u0173':'uogon','\u0172':'Uogon','\u016B':'umacr','\u016A':'Umacr','\uD835\uDD33':'vfr','\uD835\uDD67':'vopf','\uD835\uDCCB':'vscr','\uD835\uDD19':'Vfr','\uD835\uDD4D':'Vopf','\uD835\uDCB1':'Vscr','\uD835\uDD68':'wopf','\uD835\uDCCC':'wscr','\uD835\uDD34':'wfr','\uD835\uDCB2':'Wscr','\uD835\uDD4E':'Wopf','\uD835\uDD1A':'Wfr','\u0175':'wcirc','\u0174':'Wcirc','\uD835\uDD35':'xfr','\uD835\uDCCD':'xscr','\uD835\uDD69':'xopf','\uD835\uDD4F':'Xopf','\uD835\uDD1B':'Xfr','\uD835\uDCB3':'Xscr','\uD835\uDD36':'yfr','\uD835\uDCCE':'yscr','\uD835\uDD6A':'yopf','\uD835\uDCB4':'Yscr','\uD835\uDD1C':'Yfr','\uD835\uDD50':'Yopf','\xFD':'yacute','\xDD':'Yacute','\u0177':'ycirc','\u0176':'Ycirc','\xFF':'yuml','\u0178':'Yuml','\uD835\uDCCF':'zscr','\uD835\uDD37':'zfr','\uD835\uDD6B':'zopf','\u2128':'Zfr','\u2124':'Zopf','\uD835\uDCB5':'Zscr','\u017A':'zacute','\u0179':'Zacute','\u017E':'zcaron','\u017D':'Zcaron','\u017C':'zdot','\u017B':'Zdot','\u01B5':'imped','\xFE':'thorn','\xDE':'THORN','\u0149':'napos','\u03B1':'alpha','\u0391':'Alpha','\u03B2':'beta','\u0392':'Beta','\u03B3':'gamma','\u0393':'Gamma','\u03B4':'delta','\u0394':'Delta','\u03B5':'epsi','\u03F5':'epsiv','\u0395':'Epsilon','\u03DD':'gammad','\u03DC':'Gammad','\u03B6':'zeta','\u0396':'Zeta','\u03B7':'eta','\u0397':'Eta','\u03B8':'theta','\u03D1':'thetav','\u0398':'Theta','\u03B9':'iota','\u0399':'Iota','\u03BA':'kappa','\u03F0':'kappav','\u039A':'Kappa','\u03BB':'lambda','\u039B':'Lambda','\u03BC':'mu','\xB5':'micro','\u039C':'Mu','\u03BD':'nu','\u039D':'Nu','\u03BE':'xi','\u039E':'Xi','\u03BF':'omicron','\u039F':'Omicron','\u03C0':'pi','\u03D6':'piv','\u03A0':'Pi','\u03C1':'rho','\u03F1':'rhov','\u03A1':'Rho','\u03C3':'sigma','\u03A3':'Sigma','\u03C2':'sigmaf','\u03C4':'tau','\u03A4':'Tau','\u03C5':'upsi','\u03A5':'Upsilon','\u03D2':'Upsi','\u03C6':'phi','\u03D5':'phiv','\u03A6':'Phi','\u03C7':'chi','\u03A7':'Chi','\u03C8':'psi','\u03A8':'Psi','\u03C9':'omega','\u03A9':'ohm','\u0430':'acy','\u0410':'Acy','\u0431':'bcy','\u0411':'Bcy','\u0432':'vcy','\u0412':'Vcy','\u0433':'gcy','\u0413':'Gcy','\u0453':'gjcy','\u0403':'GJcy','\u0434':'dcy','\u0414':'Dcy','\u0452':'djcy','\u0402':'DJcy','\u0435':'iecy','\u0415':'IEcy','\u0451':'iocy','\u0401':'IOcy','\u0454':'jukcy','\u0404':'Jukcy','\u0436':'zhcy','\u0416':'ZHcy','\u0437':'zcy','\u0417':'Zcy','\u0455':'dscy','\u0405':'DScy','\u0438':'icy','\u0418':'Icy','\u0456':'iukcy','\u0406':'Iukcy','\u0457':'yicy','\u0407':'YIcy','\u0439':'jcy','\u0419':'Jcy','\u0458':'jsercy','\u0408':'Jsercy','\u043A':'kcy','\u041A':'Kcy','\u045C':'kjcy','\u040C':'KJcy','\u043B':'lcy','\u041B':'Lcy','\u0459':'ljcy','\u0409':'LJcy','\u043C':'mcy','\u041C':'Mcy','\u043D':'ncy','\u041D':'Ncy','\u045A':'njcy','\u040A':'NJcy','\u043E':'ocy','\u041E':'Ocy','\u043F':'pcy','\u041F':'Pcy','\u0440':'rcy','\u0420':'Rcy','\u0441':'scy','\u0421':'Scy','\u0442':'tcy','\u0422':'Tcy','\u045B':'tshcy','\u040B':'TSHcy','\u0443':'ucy','\u0423':'Ucy','\u045E':'ubrcy','\u040E':'Ubrcy','\u0444':'fcy','\u0424':'Fcy','\u0445':'khcy','\u0425':'KHcy','\u0446':'tscy','\u0426':'TScy','\u0447':'chcy','\u0427':'CHcy','\u045F':'dzcy','\u040F':'DZcy','\u0448':'shcy','\u0428':'SHcy','\u0449':'shchcy','\u0429':'SHCHcy','\u044A':'hardcy','\u042A':'HARDcy','\u044B':'ycy','\u042B':'Ycy','\u044C':'softcy','\u042C':'SOFTcy','\u044D':'ecy','\u042D':'Ecy','\u044E':'yucy','\u042E':'YUcy','\u044F':'yacy','\u042F':'YAcy','\u2135':'aleph','\u2136':'beth','\u2137':'gimel','\u2138':'daleth'};
 
 	var regexEscape = /["&'<>`]/g;
 	var escapeMap = {
 		'"': '&quot;',
 		'&': '&amp;',
 		'\'': '&#x27;',
 		'<': '&lt;',
 		// See https://mathiasbynens.be/notes/ambiguous-ampersands: in HTML, the
 		// following is not strictly necessary unless it’s part of a tag or an
 		// unquoted attribute value. We’re only escaping it to support those
 		// situations, and for XML support.
 		'>': '&gt;',
 		// In Internet Explorer ≤ 8, the backtick character can be used
 		// to break out of (un)quoted attribute values or HTML comments.
 		// See http://html5sec.org/#102, http://html5sec.org/#108, and
 		// http://html5sec.org/#133.
 		'`': '&#x60;'
 	};
 
 	var regexInvalidEntity = /&#(?:[xX][^a-fA-F0-9]|[^0-9xX])/;
 	var regexInvalidRawCodePoint = /[\0-\x08\x0B\x0E-\x1F\x7F-\x9F\uFDD0-\uFDEF\uFFFE\uFFFF]|[\uD83F\uD87F\uD8BF\uD8FF\uD93F\uD97F\uD9BF\uD9FF\uDA3F\uDA7F\uDABF\uDAFF\uDB3F\uDB7F\uDBBF\uDBFF][\uDFFE\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF]/;
 	var regexDecode = /&#([0-9]+)(;?)|&#[xX]([a-fA-F0-9]+)(;?)|&([0-9a-zA-Z]+);|&(Aacute|Agrave|Atilde|Ccedil|Eacute|Egrave|Iacute|Igrave|Ntilde|Oacute|Ograve|Oslash|Otilde|Uacute|Ugrave|Yacute|aacute|agrave|atilde|brvbar|ccedil|curren|divide|eacute|egrave|frac12|frac14|frac34|iacute|igrave|iquest|middot|ntilde|oacute|ograve|oslash|otilde|plusmn|uacute|ugrave|yacute|AElig|Acirc|Aring|Ecirc|Icirc|Ocirc|THORN|Ucirc|acirc|acute|aelig|aring|cedil|ecirc|icirc|iexcl|laquo|micro|ocirc|pound|raquo|szlig|thorn|times|ucirc|Auml|COPY|Euml|Iuml|Ouml|QUOT|Uuml|auml|cent|copy|euml|iuml|macr|nbsp|ordf|ordm|ouml|para|quot|sect|sup1|sup2|sup3|uuml|yuml|AMP|ETH|REG|amp|deg|eth|not|reg|shy|uml|yen|GT|LT|gt|lt)([=a-zA-Z0-9])?/g;
 	var decodeMap = {'aacute':'\xE1','Aacute':'\xC1','abreve':'\u0103','Abreve':'\u0102','ac':'\u223E','acd':'\u223F','acE':'\u223E\u0333','acirc':'\xE2','Acirc':'\xC2','acute':'\xB4','acy':'\u0430','Acy':'\u0410','aelig':'\xE6','AElig':'\xC6','af':'\u2061','afr':'\uD835\uDD1E','Afr':'\uD835\uDD04','agrave':'\xE0','Agrave':'\xC0','alefsym':'\u2135','aleph':'\u2135','alpha':'\u03B1','Alpha':'\u0391','amacr':'\u0101','Amacr':'\u0100','amalg':'\u2A3F','amp':'&','AMP':'&','and':'\u2227','And':'\u2A53','andand':'\u2A55','andd':'\u2A5C','andslope':'\u2A58','andv':'\u2A5A','ang':'\u2220','ange':'\u29A4','angle':'\u2220','angmsd':'\u2221','angmsdaa':'\u29A8','angmsdab':'\u29A9','angmsdac':'\u29AA','angmsdad':'\u29AB','angmsdae':'\u29AC','angmsdaf':'\u29AD','angmsdag':'\u29AE','angmsdah':'\u29AF','angrt':'\u221F','angrtvb':'\u22BE','angrtvbd':'\u299D','angsph':'\u2222','angst':'\xC5','angzarr':'\u237C','aogon':'\u0105','Aogon':'\u0104','aopf':'\uD835\uDD52','Aopf':'\uD835\uDD38','ap':'\u2248','apacir':'\u2A6F','ape':'\u224A','apE':'\u2A70','apid':'\u224B','apos':'\'','ApplyFunction':'\u2061','approx':'\u2248','approxeq':'\u224A','aring':'\xE5','Aring':'\xC5','ascr':'\uD835\uDCB6','Ascr':'\uD835\uDC9C','Assign':'\u2254','ast':'*','asymp':'\u2248','asympeq':'\u224D','atilde':'\xE3','Atilde':'\xC3','auml':'\xE4','Auml':'\xC4','awconint':'\u2233','awint':'\u2A11','backcong':'\u224C','backepsilon':'\u03F6','backprime':'\u2035','backsim':'\u223D','backsimeq':'\u22CD','Backslash':'\u2216','Barv':'\u2AE7','barvee':'\u22BD','barwed':'\u2305','Barwed':'\u2306','barwedge':'\u2305','bbrk':'\u23B5','bbrktbrk':'\u23B6','bcong':'\u224C','bcy':'\u0431','Bcy':'\u0411','bdquo':'\u201E','becaus':'\u2235','because':'\u2235','Because':'\u2235','bemptyv':'\u29B0','bepsi':'\u03F6','bernou':'\u212C','Bernoullis':'\u212C','beta':'\u03B2','Beta':'\u0392','beth':'\u2136','between':'\u226C','bfr':'\uD835\uDD1F','Bfr':'\uD835\uDD05','bigcap':'\u22C2','bigcirc':'\u25EF','bigcup':'\u22C3','bigodot':'\u2A00','bigoplus':'\u2A01','bigotimes':'\u2A02','bigsqcup':'\u2A06','bigstar':'\u2605','bigtriangledown':'\u25BD','bigtriangleup':'\u25B3','biguplus':'\u2A04','bigvee':'\u22C1','bigwedge':'\u22C0','bkarow':'\u290D','blacklozenge':'\u29EB','blacksquare':'\u25AA','blacktriangle':'\u25B4','blacktriangledown':'\u25BE','blacktriangleleft':'\u25C2','blacktriangleright':'\u25B8','blank':'\u2423','blk12':'\u2592','blk14':'\u2591','blk34':'\u2593','block':'\u2588','bne':'=\u20E5','bnequiv':'\u2261\u20E5','bnot':'\u2310','bNot':'\u2AED','bopf':'\uD835\uDD53','Bopf':'\uD835\uDD39','bot':'\u22A5','bottom':'\u22A5','bowtie':'\u22C8','boxbox':'\u29C9','boxdl':'\u2510','boxdL':'\u2555','boxDl':'\u2556','boxDL':'\u2557','boxdr':'\u250C','boxdR':'\u2552','boxDr':'\u2553','boxDR':'\u2554','boxh':'\u2500','boxH':'\u2550','boxhd':'\u252C','boxhD':'\u2565','boxHd':'\u2564','boxHD':'\u2566','boxhu':'\u2534','boxhU':'\u2568','boxHu':'\u2567','boxHU':'\u2569','boxminus':'\u229F','boxplus':'\u229E','boxtimes':'\u22A0','boxul':'\u2518','boxuL':'\u255B','boxUl':'\u255C','boxUL':'\u255D','boxur':'\u2514','boxuR':'\u2558','boxUr':'\u2559','boxUR':'\u255A','boxv':'\u2502','boxV':'\u2551','boxvh':'\u253C','boxvH':'\u256A','boxVh':'\u256B','boxVH':'\u256C','boxvl':'\u2524','boxvL':'\u2561','boxVl':'\u2562','boxVL':'\u2563','boxvr':'\u251C','boxvR':'\u255E','boxVr':'\u255F','boxVR':'\u2560','bprime':'\u2035','breve':'\u02D8','Breve':'\u02D8','brvbar':'\xA6','bscr':'\uD835\uDCB7','Bscr':'\u212C','bsemi':'\u204F','bsim':'\u223D','bsime':'\u22CD','bsol':'\\','bsolb':'\u29C5','bsolhsub':'\u27C8','bull':'\u2022','bullet':'\u2022','bump':'\u224E','bumpe':'\u224F','bumpE':'\u2AAE','bumpeq':'\u224F','Bumpeq':'\u224E','cacute':'\u0107','Cacute':'\u0106','cap':'\u2229','Cap':'\u22D2','capand':'\u2A44','capbrcup':'\u2A49','capcap':'\u2A4B','capcup':'\u2A47','capdot':'\u2A40','CapitalDifferentialD':'\u2145','caps':'\u2229\uFE00','caret':'\u2041','caron':'\u02C7','Cayleys':'\u212D','ccaps':'\u2A4D','ccaron':'\u010D','Ccaron':'\u010C','ccedil':'\xE7','Ccedil':'\xC7','ccirc':'\u0109','Ccirc':'\u0108','Cconint':'\u2230','ccups':'\u2A4C','ccupssm':'\u2A50','cdot':'\u010B','Cdot':'\u010A','cedil':'\xB8','Cedilla':'\xB8','cemptyv':'\u29B2','cent':'\xA2','centerdot':'\xB7','CenterDot':'\xB7','cfr':'\uD835\uDD20','Cfr':'\u212D','chcy':'\u0447','CHcy':'\u0427','check':'\u2713','checkmark':'\u2713','chi':'\u03C7','Chi':'\u03A7','cir':'\u25CB','circ':'\u02C6','circeq':'\u2257','circlearrowleft':'\u21BA','circlearrowright':'\u21BB','circledast':'\u229B','circledcirc':'\u229A','circleddash':'\u229D','CircleDot':'\u2299','circledR':'\xAE','circledS':'\u24C8','CircleMinus':'\u2296','CirclePlus':'\u2295','CircleTimes':'\u2297','cire':'\u2257','cirE':'\u29C3','cirfnint':'\u2A10','cirmid':'\u2AEF','cirscir':'\u29C2','ClockwiseContourIntegral':'\u2232','CloseCurlyDoubleQuote':'\u201D','CloseCurlyQuote':'\u2019','clubs':'\u2663','clubsuit':'\u2663','colon':':','Colon':'\u2237','colone':'\u2254','Colone':'\u2A74','coloneq':'\u2254','comma':',','commat':'@','comp':'\u2201','compfn':'\u2218','complement':'\u2201','complexes':'\u2102','cong':'\u2245','congdot':'\u2A6D','Congruent':'\u2261','conint':'\u222E','Conint':'\u222F','ContourIntegral':'\u222E','copf':'\uD835\uDD54','Copf':'\u2102','coprod':'\u2210','Coproduct':'\u2210','copy':'\xA9','COPY':'\xA9','copysr':'\u2117','CounterClockwiseContourIntegral':'\u2233','crarr':'\u21B5','cross':'\u2717','Cross':'\u2A2F','cscr':'\uD835\uDCB8','Cscr':'\uD835\uDC9E','csub':'\u2ACF','csube':'\u2AD1','csup':'\u2AD0','csupe':'\u2AD2','ctdot':'\u22EF','cudarrl':'\u2938','cudarrr':'\u2935','cuepr':'\u22DE','cuesc':'\u22DF','cularr':'\u21B6','cularrp':'\u293D','cup':'\u222A','Cup':'\u22D3','cupbrcap':'\u2A48','cupcap':'\u2A46','CupCap':'\u224D','cupcup':'\u2A4A','cupdot':'\u228D','cupor':'\u2A45','cups':'\u222A\uFE00','curarr':'\u21B7','curarrm':'\u293C','curlyeqprec':'\u22DE','curlyeqsucc':'\u22DF','curlyvee':'\u22CE','curlywedge':'\u22CF','curren':'\xA4','curvearrowleft':'\u21B6','curvearrowright':'\u21B7','cuvee':'\u22CE','cuwed':'\u22CF','cwconint':'\u2232','cwint':'\u2231','cylcty':'\u232D','dagger':'\u2020','Dagger':'\u2021','daleth':'\u2138','darr':'\u2193','dArr':'\u21D3','Darr':'\u21A1','dash':'\u2010','dashv':'\u22A3','Dashv':'\u2AE4','dbkarow':'\u290F','dblac':'\u02DD','dcaron':'\u010F','Dcaron':'\u010E','dcy':'\u0434','Dcy':'\u0414','dd':'\u2146','DD':'\u2145','ddagger':'\u2021','ddarr':'\u21CA','DDotrahd':'\u2911','ddotseq':'\u2A77','deg':'\xB0','Del':'\u2207','delta':'\u03B4','Delta':'\u0394','demptyv':'\u29B1','dfisht':'\u297F','dfr':'\uD835\uDD21','Dfr':'\uD835\uDD07','dHar':'\u2965','dharl':'\u21C3','dharr':'\u21C2','DiacriticalAcute':'\xB4','DiacriticalDot':'\u02D9','DiacriticalDoubleAcute':'\u02DD','DiacriticalGrave':'`','DiacriticalTilde':'\u02DC','diam':'\u22C4','diamond':'\u22C4','Diamond':'\u22C4','diamondsuit':'\u2666','diams':'\u2666','die':'\xA8','DifferentialD':'\u2146','digamma':'\u03DD','disin':'\u22F2','div':'\xF7','divide':'\xF7','divideontimes':'\u22C7','divonx':'\u22C7','djcy':'\u0452','DJcy':'\u0402','dlcorn':'\u231E','dlcrop':'\u230D','dollar':'$','dopf':'\uD835\uDD55','Dopf':'\uD835\uDD3B','dot':'\u02D9','Dot':'\xA8','DotDot':'\u20DC','doteq':'\u2250','doteqdot':'\u2251','DotEqual':'\u2250','dotminus':'\u2238','dotplus':'\u2214','dotsquare':'\u22A1','doublebarwedge':'\u2306','DoubleContourIntegral':'\u222F','DoubleDot':'\xA8','DoubleDownArrow':'\u21D3','DoubleLeftArrow':'\u21D0','DoubleLeftRightArrow':'\u21D4','DoubleLeftTee':'\u2AE4','DoubleLongLeftArrow':'\u27F8','DoubleLongLeftRightArrow':'\u27FA','DoubleLongRightArrow':'\u27F9','DoubleRightArrow':'\u21D2','DoubleRightTee':'\u22A8','DoubleUpArrow':'\u21D1','DoubleUpDownArrow':'\u21D5','DoubleVerticalBar':'\u2225','downarrow':'\u2193','Downarrow':'\u21D3','DownArrow':'\u2193','DownArrowBar':'\u2913','DownArrowUpArrow':'\u21F5','DownBreve':'\u0311','downdownarrows':'\u21CA','downharpoonleft':'\u21C3','downharpoonright':'\u21C2','DownLeftRightVector':'\u2950','DownLeftTeeVector':'\u295E','DownLeftVector':'\u21BD','DownLeftVectorBar':'\u2956','DownRightTeeVector':'\u295F','DownRightVector':'\u21C1','DownRightVectorBar':'\u2957','DownTee':'\u22A4','DownTeeArrow':'\u21A7','drbkarow':'\u2910','drcorn':'\u231F','drcrop':'\u230C','dscr':'\uD835\uDCB9','Dscr':'\uD835\uDC9F','dscy':'\u0455','DScy':'\u0405','dsol':'\u29F6','dstrok':'\u0111','Dstrok':'\u0110','dtdot':'\u22F1','dtri':'\u25BF','dtrif':'\u25BE','duarr':'\u21F5','duhar':'\u296F','dwangle':'\u29A6','dzcy':'\u045F','DZcy':'\u040F','dzigrarr':'\u27FF','eacute':'\xE9','Eacute':'\xC9','easter':'\u2A6E','ecaron':'\u011B','Ecaron':'\u011A','ecir':'\u2256','ecirc':'\xEA','Ecirc':'\xCA','ecolon':'\u2255','ecy':'\u044D','Ecy':'\u042D','eDDot':'\u2A77','edot':'\u0117','eDot':'\u2251','Edot':'\u0116','ee':'\u2147','efDot':'\u2252','efr':'\uD835\uDD22','Efr':'\uD835\uDD08','eg':'\u2A9A','egrave':'\xE8','Egrave':'\xC8','egs':'\u2A96','egsdot':'\u2A98','el':'\u2A99','Element':'\u2208','elinters':'\u23E7','ell':'\u2113','els':'\u2A95','elsdot':'\u2A97','emacr':'\u0113','Emacr':'\u0112','empty':'\u2205','emptyset':'\u2205','EmptySmallSquare':'\u25FB','emptyv':'\u2205','EmptyVerySmallSquare':'\u25AB','emsp':'\u2003','emsp13':'\u2004','emsp14':'\u2005','eng':'\u014B','ENG':'\u014A','ensp':'\u2002','eogon':'\u0119','Eogon':'\u0118','eopf':'\uD835\uDD56','Eopf':'\uD835\uDD3C','epar':'\u22D5','eparsl':'\u29E3','eplus':'\u2A71','epsi':'\u03B5','epsilon':'\u03B5','Epsilon':'\u0395','epsiv':'\u03F5','eqcirc':'\u2256','eqcolon':'\u2255','eqsim':'\u2242','eqslantgtr':'\u2A96','eqslantless':'\u2A95','Equal':'\u2A75','equals':'=','EqualTilde':'\u2242','equest':'\u225F','Equilibrium':'\u21CC','equiv':'\u2261','equivDD':'\u2A78','eqvparsl':'\u29E5','erarr':'\u2971','erDot':'\u2253','escr':'\u212F','Escr':'\u2130','esdot':'\u2250','esim':'\u2242','Esim':'\u2A73','eta':'\u03B7','Eta':'\u0397','eth':'\xF0','ETH':'\xD0','euml':'\xEB','Euml':'\xCB','euro':'\u20AC','excl':'!','exist':'\u2203','Exists':'\u2203','expectation':'\u2130','exponentiale':'\u2147','ExponentialE':'\u2147','fallingdotseq':'\u2252','fcy':'\u0444','Fcy':'\u0424','female':'\u2640','ffilig':'\uFB03','fflig':'\uFB00','ffllig':'\uFB04','ffr':'\uD835\uDD23','Ffr':'\uD835\uDD09','filig':'\uFB01','FilledSmallSquare':'\u25FC','FilledVerySmallSquare':'\u25AA','fjlig':'fj','flat':'\u266D','fllig':'\uFB02','fltns':'\u25B1','fnof':'\u0192','fopf':'\uD835\uDD57','Fopf':'\uD835\uDD3D','forall':'\u2200','ForAll':'\u2200','fork':'\u22D4','forkv':'\u2AD9','Fouriertrf':'\u2131','fpartint':'\u2A0D','frac12':'\xBD','frac13':'\u2153','frac14':'\xBC','frac15':'\u2155','frac16':'\u2159','frac18':'\u215B','frac23':'\u2154','frac25':'\u2156','frac34':'\xBE','frac35':'\u2157','frac38':'\u215C','frac45':'\u2158','frac56':'\u215A','frac58':'\u215D','frac78':'\u215E','frasl':'\u2044','frown':'\u2322','fscr':'\uD835\uDCBB','Fscr':'\u2131','gacute':'\u01F5','gamma':'\u03B3','Gamma':'\u0393','gammad':'\u03DD','Gammad':'\u03DC','gap':'\u2A86','gbreve':'\u011F','Gbreve':'\u011E','Gcedil':'\u0122','gcirc':'\u011D','Gcirc':'\u011C','gcy':'\u0433','Gcy':'\u0413','gdot':'\u0121','Gdot':'\u0120','ge':'\u2265','gE':'\u2267','gel':'\u22DB','gEl':'\u2A8C','geq':'\u2265','geqq':'\u2267','geqslant':'\u2A7E','ges':'\u2A7E','gescc':'\u2AA9','gesdot':'\u2A80','gesdoto':'\u2A82','gesdotol':'\u2A84','gesl':'\u22DB\uFE00','gesles':'\u2A94','gfr':'\uD835\uDD24','Gfr':'\uD835\uDD0A','gg':'\u226B','Gg':'\u22D9','ggg':'\u22D9','gimel':'\u2137','gjcy':'\u0453','GJcy':'\u0403','gl':'\u2277','gla':'\u2AA5','glE':'\u2A92','glj':'\u2AA4','gnap':'\u2A8A','gnapprox':'\u2A8A','gne':'\u2A88','gnE':'\u2269','gneq':'\u2A88','gneqq':'\u2269','gnsim':'\u22E7','gopf':'\uD835\uDD58','Gopf':'\uD835\uDD3E','grave':'`','GreaterEqual':'\u2265','GreaterEqualLess':'\u22DB','GreaterFullEqual':'\u2267','GreaterGreater':'\u2AA2','GreaterLess':'\u2277','GreaterSlantEqual':'\u2A7E','GreaterTilde':'\u2273','gscr':'\u210A','Gscr':'\uD835\uDCA2','gsim':'\u2273','gsime':'\u2A8E','gsiml':'\u2A90','gt':'>','Gt':'\u226B','GT':'>','gtcc':'\u2AA7','gtcir':'\u2A7A','gtdot':'\u22D7','gtlPar':'\u2995','gtquest':'\u2A7C','gtrapprox':'\u2A86','gtrarr':'\u2978','gtrdot':'\u22D7','gtreqless':'\u22DB','gtreqqless':'\u2A8C','gtrless':'\u2277','gtrsim':'\u2273','gvertneqq':'\u2269\uFE00','gvnE':'\u2269\uFE00','Hacek':'\u02C7','hairsp':'\u200A','half':'\xBD','hamilt':'\u210B','hardcy':'\u044A','HARDcy':'\u042A','harr':'\u2194','hArr':'\u21D4','harrcir':'\u2948','harrw':'\u21AD','Hat':'^','hbar':'\u210F','hcirc':'\u0125','Hcirc':'\u0124','hearts':'\u2665','heartsuit':'\u2665','hellip':'\u2026','hercon':'\u22B9','hfr':'\uD835\uDD25','Hfr':'\u210C','HilbertSpace':'\u210B','hksearow':'\u2925','hkswarow':'\u2926','hoarr':'\u21FF','homtht':'\u223B','hookleftarrow':'\u21A9','hookrightarrow':'\u21AA','hopf':'\uD835\uDD59','Hopf':'\u210D','horbar':'\u2015','HorizontalLine':'\u2500','hscr':'\uD835\uDCBD','Hscr':'\u210B','hslash':'\u210F','hstrok':'\u0127','Hstrok':'\u0126','HumpDownHump':'\u224E','HumpEqual':'\u224F','hybull':'\u2043','hyphen':'\u2010','iacute':'\xED','Iacute':'\xCD','ic':'\u2063','icirc':'\xEE','Icirc':'\xCE','icy':'\u0438','Icy':'\u0418','Idot':'\u0130','iecy':'\u0435','IEcy':'\u0415','iexcl':'\xA1','iff':'\u21D4','ifr':'\uD835\uDD26','Ifr':'\u2111','igrave':'\xEC','Igrave':'\xCC','ii':'\u2148','iiiint':'\u2A0C','iiint':'\u222D','iinfin':'\u29DC','iiota':'\u2129','ijlig':'\u0133','IJlig':'\u0132','Im':'\u2111','imacr':'\u012B','Imacr':'\u012A','image':'\u2111','ImaginaryI':'\u2148','imagline':'\u2110','imagpart':'\u2111','imath':'\u0131','imof':'\u22B7','imped':'\u01B5','Implies':'\u21D2','in':'\u2208','incare':'\u2105','infin':'\u221E','infintie':'\u29DD','inodot':'\u0131','int':'\u222B','Int':'\u222C','intcal':'\u22BA','integers':'\u2124','Integral':'\u222B','intercal':'\u22BA','Intersection':'\u22C2','intlarhk':'\u2A17','intprod':'\u2A3C','InvisibleComma':'\u2063','InvisibleTimes':'\u2062','iocy':'\u0451','IOcy':'\u0401','iogon':'\u012F','Iogon':'\u012E','iopf':'\uD835\uDD5A','Iopf':'\uD835\uDD40','iota':'\u03B9','Iota':'\u0399','iprod':'\u2A3C','iquest':'\xBF','iscr':'\uD835\uDCBE','Iscr':'\u2110','isin':'\u2208','isindot':'\u22F5','isinE':'\u22F9','isins':'\u22F4','isinsv':'\u22F3','isinv':'\u2208','it':'\u2062','itilde':'\u0129','Itilde':'\u0128','iukcy':'\u0456','Iukcy':'\u0406','iuml':'\xEF','Iuml':'\xCF','jcirc':'\u0135','Jcirc':'\u0134','jcy':'\u0439','Jcy':'\u0419','jfr':'\uD835\uDD27','Jfr':'\uD835\uDD0D','jmath':'\u0237','jopf':'\uD835\uDD5B','Jopf':'\uD835\uDD41','jscr':'\uD835\uDCBF','Jscr':'\uD835\uDCA5','jsercy':'\u0458','Jsercy':'\u0408','jukcy':'\u0454','Jukcy':'\u0404','kappa':'\u03BA','Kappa':'\u039A','kappav':'\u03F0','kcedil':'\u0137','Kcedil':'\u0136','kcy':'\u043A','Kcy':'\u041A','kfr':'\uD835\uDD28','Kfr':'\uD835\uDD0E','kgreen':'\u0138','khcy':'\u0445','KHcy':'\u0425','kjcy':'\u045C','KJcy':'\u040C','kopf':'\uD835\uDD5C','Kopf':'\uD835\uDD42','kscr':'\uD835\uDCC0','Kscr':'\uD835\uDCA6','lAarr':'\u21DA','lacute':'\u013A','Lacute':'\u0139','laemptyv':'\u29B4','lagran':'\u2112','lambda':'\u03BB','Lambda':'\u039B','lang':'\u27E8','Lang':'\u27EA','langd':'\u2991','langle':'\u27E8','lap':'\u2A85','Laplacetrf':'\u2112','laquo':'\xAB','larr':'\u2190','lArr':'\u21D0','Larr':'\u219E','larrb':'\u21E4','larrbfs':'\u291F','larrfs':'\u291D','larrhk':'\u21A9','larrlp':'\u21AB','larrpl':'\u2939','larrsim':'\u2973','larrtl':'\u21A2','lat':'\u2AAB','latail':'\u2919','lAtail':'\u291B','late':'\u2AAD','lates':'\u2AAD\uFE00','lbarr':'\u290C','lBarr':'\u290E','lbbrk':'\u2772','lbrace':'{','lbrack':'[','lbrke':'\u298B','lbrksld':'\u298F','lbrkslu':'\u298D','lcaron':'\u013E','Lcaron':'\u013D','lcedil':'\u013C','Lcedil':'\u013B','lceil':'\u2308','lcub':'{','lcy':'\u043B','Lcy':'\u041B','ldca':'\u2936','ldquo':'\u201C','ldquor':'\u201E','ldrdhar':'\u2967','ldrushar':'\u294B','ldsh':'\u21B2','le':'\u2264','lE':'\u2266','LeftAngleBracket':'\u27E8','leftarrow':'\u2190','Leftarrow':'\u21D0','LeftArrow':'\u2190','LeftArrowBar':'\u21E4','LeftArrowRightArrow':'\u21C6','leftarrowtail':'\u21A2','LeftCeiling':'\u2308','LeftDoubleBracket':'\u27E6','LeftDownTeeVector':'\u2961','LeftDownVector':'\u21C3','LeftDownVectorBar':'\u2959','LeftFloor':'\u230A','leftharpoondown':'\u21BD','leftharpoonup':'\u21BC','leftleftarrows':'\u21C7','leftrightarrow':'\u2194','Leftrightarrow':'\u21D4','LeftRightArrow':'\u2194','leftrightarrows':'\u21C6','leftrightharpoons':'\u21CB','leftrightsquigarrow':'\u21AD','LeftRightVector':'\u294E','LeftTee':'\u22A3','LeftTeeArrow':'\u21A4','LeftTeeVector':'\u295A','leftthreetimes':'\u22CB','LeftTriangle':'\u22B2','LeftTriangleBar':'\u29CF','LeftTriangleEqual':'\u22B4','LeftUpDownVector':'\u2951','LeftUpTeeVector':'\u2960','LeftUpVector':'\u21BF','LeftUpVectorBar':'\u2958','LeftVector':'\u21BC','LeftVectorBar':'\u2952','leg':'\u22DA','lEg':'\u2A8B','leq':'\u2264','leqq':'\u2266','leqslant':'\u2A7D','les':'\u2A7D','lescc':'\u2AA8','lesdot':'\u2A7F','lesdoto':'\u2A81','lesdotor':'\u2A83','lesg':'\u22DA\uFE00','lesges':'\u2A93','lessapprox':'\u2A85','lessdot':'\u22D6','lesseqgtr':'\u22DA','lesseqqgtr':'\u2A8B','LessEqualGreater':'\u22DA','LessFullEqual':'\u2266','LessGreater':'\u2276','lessgtr':'\u2276','LessLess':'\u2AA1','lesssim':'\u2272','LessSlantEqual':'\u2A7D','LessTilde':'\u2272','lfisht':'\u297C','lfloor':'\u230A','lfr':'\uD835\uDD29','Lfr':'\uD835\uDD0F','lg':'\u2276','lgE':'\u2A91','lHar':'\u2962','lhard':'\u21BD','lharu':'\u21BC','lharul':'\u296A','lhblk':'\u2584','ljcy':'\u0459','LJcy':'\u0409','ll':'\u226A','Ll':'\u22D8','llarr':'\u21C7','llcorner':'\u231E','Lleftarrow':'\u21DA','llhard':'\u296B','lltri':'\u25FA','lmidot':'\u0140','Lmidot':'\u013F','lmoust':'\u23B0','lmoustache':'\u23B0','lnap':'\u2A89','lnapprox':'\u2A89','lne':'\u2A87','lnE':'\u2268','lneq':'\u2A87','lneqq':'\u2268','lnsim':'\u22E6','loang':'\u27EC','loarr':'\u21FD','lobrk':'\u27E6','longleftarrow':'\u27F5','Longleftarrow':'\u27F8','LongLeftArrow':'\u27F5','longleftrightarrow':'\u27F7','Longleftrightarrow':'\u27FA','LongLeftRightArrow':'\u27F7','longmapsto':'\u27FC','longrightarrow':'\u27F6','Longrightarrow':'\u27F9','LongRightArrow':'\u27F6','looparrowleft':'\u21AB','looparrowright':'\u21AC','lopar':'\u2985','lopf':'\uD835\uDD5D','Lopf':'\uD835\uDD43','loplus':'\u2A2D','lotimes':'\u2A34','lowast':'\u2217','lowbar':'_','LowerLeftArrow':'\u2199','LowerRightArrow':'\u2198','loz':'\u25CA','lozenge':'\u25CA','lozf':'\u29EB','lpar':'(','lparlt':'\u2993','lrarr':'\u21C6','lrcorner':'\u231F','lrhar':'\u21CB','lrhard':'\u296D','lrm':'\u200E','lrtri':'\u22BF','lsaquo':'\u2039','lscr':'\uD835\uDCC1','Lscr':'\u2112','lsh':'\u21B0','Lsh':'\u21B0','lsim':'\u2272','lsime':'\u2A8D','lsimg':'\u2A8F','lsqb':'[','lsquo':'\u2018','lsquor':'\u201A','lstrok':'\u0142','Lstrok':'\u0141','lt':'<','Lt':'\u226A','LT':'<','ltcc':'\u2AA6','ltcir':'\u2A79','ltdot':'\u22D6','lthree':'\u22CB','ltimes':'\u22C9','ltlarr':'\u2976','ltquest':'\u2A7B','ltri':'\u25C3','ltrie':'\u22B4','ltrif':'\u25C2','ltrPar':'\u2996','lurdshar':'\u294A','luruhar':'\u2966','lvertneqq':'\u2268\uFE00','lvnE':'\u2268\uFE00','macr':'\xAF','male':'\u2642','malt':'\u2720','maltese':'\u2720','map':'\u21A6','Map':'\u2905','mapsto':'\u21A6','mapstodown':'\u21A7','mapstoleft':'\u21A4','mapstoup':'\u21A5','marker':'\u25AE','mcomma':'\u2A29','mcy':'\u043C','Mcy':'\u041C','mdash':'\u2014','mDDot':'\u223A','measuredangle':'\u2221','MediumSpace':'\u205F','Mellintrf':'\u2133','mfr':'\uD835\uDD2A','Mfr':'\uD835\uDD10','mho':'\u2127','micro':'\xB5','mid':'\u2223','midast':'*','midcir':'\u2AF0','middot':'\xB7','minus':'\u2212','minusb':'\u229F','minusd':'\u2238','minusdu':'\u2A2A','MinusPlus':'\u2213','mlcp':'\u2ADB','mldr':'\u2026','mnplus':'\u2213','models':'\u22A7','mopf':'\uD835\uDD5E','Mopf':'\uD835\uDD44','mp':'\u2213','mscr':'\uD835\uDCC2','Mscr':'\u2133','mstpos':'\u223E','mu':'\u03BC','Mu':'\u039C','multimap':'\u22B8','mumap':'\u22B8','nabla':'\u2207','nacute':'\u0144','Nacute':'\u0143','nang':'\u2220\u20D2','nap':'\u2249','napE':'\u2A70\u0338','napid':'\u224B\u0338','napos':'\u0149','napprox':'\u2249','natur':'\u266E','natural':'\u266E','naturals':'\u2115','nbsp':'\xA0','nbump':'\u224E\u0338','nbumpe':'\u224F\u0338','ncap':'\u2A43','ncaron':'\u0148','Ncaron':'\u0147','ncedil':'\u0146','Ncedil':'\u0145','ncong':'\u2247','ncongdot':'\u2A6D\u0338','ncup':'\u2A42','ncy':'\u043D','Ncy':'\u041D','ndash':'\u2013','ne':'\u2260','nearhk':'\u2924','nearr':'\u2197','neArr':'\u21D7','nearrow':'\u2197','nedot':'\u2250\u0338','NegativeMediumSpace':'\u200B','NegativeThickSpace':'\u200B','NegativeThinSpace':'\u200B','NegativeVeryThinSpace':'\u200B','nequiv':'\u2262','nesear':'\u2928','nesim':'\u2242\u0338','NestedGreaterGreater':'\u226B','NestedLessLess':'\u226A','NewLine':'\n','nexist':'\u2204','nexists':'\u2204','nfr':'\uD835\uDD2B','Nfr':'\uD835\uDD11','nge':'\u2271','ngE':'\u2267\u0338','ngeq':'\u2271','ngeqq':'\u2267\u0338','ngeqslant':'\u2A7E\u0338','nges':'\u2A7E\u0338','nGg':'\u22D9\u0338','ngsim':'\u2275','ngt':'\u226F','nGt':'\u226B\u20D2','ngtr':'\u226F','nGtv':'\u226B\u0338','nharr':'\u21AE','nhArr':'\u21CE','nhpar':'\u2AF2','ni':'\u220B','nis':'\u22FC','nisd':'\u22FA','niv':'\u220B','njcy':'\u045A','NJcy':'\u040A','nlarr':'\u219A','nlArr':'\u21CD','nldr':'\u2025','nle':'\u2270','nlE':'\u2266\u0338','nleftarrow':'\u219A','nLeftarrow':'\u21CD','nleftrightarrow':'\u21AE','nLeftrightarrow':'\u21CE','nleq':'\u2270','nleqq':'\u2266\u0338','nleqslant':'\u2A7D\u0338','nles':'\u2A7D\u0338','nless':'\u226E','nLl':'\u22D8\u0338','nlsim':'\u2274','nlt':'\u226E','nLt':'\u226A\u20D2','nltri':'\u22EA','nltrie':'\u22EC','nLtv':'\u226A\u0338','nmid':'\u2224','NoBreak':'\u2060','NonBreakingSpace':'\xA0','nopf':'\uD835\uDD5F','Nopf':'\u2115','not':'\xAC','Not':'\u2AEC','NotCongruent':'\u2262','NotCupCap':'\u226D','NotDoubleVerticalBar':'\u2226','NotElement':'\u2209','NotEqual':'\u2260','NotEqualTilde':'\u2242\u0338','NotExists':'\u2204','NotGreater':'\u226F','NotGreaterEqual':'\u2271','NotGreaterFullEqual':'\u2267\u0338','NotGreaterGreater':'\u226B\u0338','NotGreaterLess':'\u2279','NotGreaterSlantEqual':'\u2A7E\u0338','NotGreaterTilde':'\u2275','NotHumpDownHump':'\u224E\u0338','NotHumpEqual':'\u224F\u0338','notin':'\u2209','notindot':'\u22F5\u0338','notinE':'\u22F9\u0338','notinva':'\u2209','notinvb':'\u22F7','notinvc':'\u22F6','NotLeftTriangle':'\u22EA','NotLeftTriangleBar':'\u29CF\u0338','NotLeftTriangleEqual':'\u22EC','NotLess':'\u226E','NotLessEqual':'\u2270','NotLessGreater':'\u2278','NotLessLess':'\u226A\u0338','NotLessSlantEqual':'\u2A7D\u0338','NotLessTilde':'\u2274','NotNestedGreaterGreater':'\u2AA2\u0338','NotNestedLessLess':'\u2AA1\u0338','notni':'\u220C','notniva':'\u220C','notnivb':'\u22FE','notnivc':'\u22FD','NotPrecedes':'\u2280','NotPrecedesEqual':'\u2AAF\u0338','NotPrecedesSlantEqual':'\u22E0','NotReverseElement':'\u220C','NotRightTriangle':'\u22EB','NotRightTriangleBar':'\u29D0\u0338','NotRightTriangleEqual':'\u22ED','NotSquareSubset':'\u228F\u0338','NotSquareSubsetEqual':'\u22E2','NotSquareSuperset':'\u2290\u0338','NotSquareSupersetEqual':'\u22E3','NotSubset':'\u2282\u20D2','NotSubsetEqual':'\u2288','NotSucceeds':'\u2281','NotSucceedsEqual':'\u2AB0\u0338','NotSucceedsSlantEqual':'\u22E1','NotSucceedsTilde':'\u227F\u0338','NotSuperset':'\u2283\u20D2','NotSupersetEqual':'\u2289','NotTilde':'\u2241','NotTildeEqual':'\u2244','NotTildeFullEqual':'\u2247','NotTildeTilde':'\u2249','NotVerticalBar':'\u2224','npar':'\u2226','nparallel':'\u2226','nparsl':'\u2AFD\u20E5','npart':'\u2202\u0338','npolint':'\u2A14','npr':'\u2280','nprcue':'\u22E0','npre':'\u2AAF\u0338','nprec':'\u2280','npreceq':'\u2AAF\u0338','nrarr':'\u219B','nrArr':'\u21CF','nrarrc':'\u2933\u0338','nrarrw':'\u219D\u0338','nrightarrow':'\u219B','nRightarrow':'\u21CF','nrtri':'\u22EB','nrtrie':'\u22ED','nsc':'\u2281','nsccue':'\u22E1','nsce':'\u2AB0\u0338','nscr':'\uD835\uDCC3','Nscr':'\uD835\uDCA9','nshortmid':'\u2224','nshortparallel':'\u2226','nsim':'\u2241','nsime':'\u2244','nsimeq':'\u2244','nsmid':'\u2224','nspar':'\u2226','nsqsube':'\u22E2','nsqsupe':'\u22E3','nsub':'\u2284','nsube':'\u2288','nsubE':'\u2AC5\u0338','nsubset':'\u2282\u20D2','nsubseteq':'\u2288','nsubseteqq':'\u2AC5\u0338','nsucc':'\u2281','nsucceq':'\u2AB0\u0338','nsup':'\u2285','nsupe':'\u2289','nsupE':'\u2AC6\u0338','nsupset':'\u2283\u20D2','nsupseteq':'\u2289','nsupseteqq':'\u2AC6\u0338','ntgl':'\u2279','ntilde':'\xF1','Ntilde':'\xD1','ntlg':'\u2278','ntriangleleft':'\u22EA','ntrianglelefteq':'\u22EC','ntriangleright':'\u22EB','ntrianglerighteq':'\u22ED','nu':'\u03BD','Nu':'\u039D','num':'#','numero':'\u2116','numsp':'\u2007','nvap':'\u224D\u20D2','nvdash':'\u22AC','nvDash':'\u22AD','nVdash':'\u22AE','nVDash':'\u22AF','nvge':'\u2265\u20D2','nvgt':'>\u20D2','nvHarr':'\u2904','nvinfin':'\u29DE','nvlArr':'\u2902','nvle':'\u2264\u20D2','nvlt':'<\u20D2','nvltrie':'\u22B4\u20D2','nvrArr':'\u2903','nvrtrie':'\u22B5\u20D2','nvsim':'\u223C\u20D2','nwarhk':'\u2923','nwarr':'\u2196','nwArr':'\u21D6','nwarrow':'\u2196','nwnear':'\u2927','oacute':'\xF3','Oacute':'\xD3','oast':'\u229B','ocir':'\u229A','ocirc':'\xF4','Ocirc':'\xD4','ocy':'\u043E','Ocy':'\u041E','odash':'\u229D','odblac':'\u0151','Odblac':'\u0150','odiv':'\u2A38','odot':'\u2299','odsold':'\u29BC','oelig':'\u0153','OElig':'\u0152','ofcir':'\u29BF','ofr':'\uD835\uDD2C','Ofr':'\uD835\uDD12','ogon':'\u02DB','ograve':'\xF2','Ograve':'\xD2','ogt':'\u29C1','ohbar':'\u29B5','ohm':'\u03A9','oint':'\u222E','olarr':'\u21BA','olcir':'\u29BE','olcross':'\u29BB','oline':'\u203E','olt':'\u29C0','omacr':'\u014D','Omacr':'\u014C','omega':'\u03C9','Omega':'\u03A9','omicron':'\u03BF','Omicron':'\u039F','omid':'\u29B6','ominus':'\u2296','oopf':'\uD835\uDD60','Oopf':'\uD835\uDD46','opar':'\u29B7','OpenCurlyDoubleQuote':'\u201C','OpenCurlyQuote':'\u2018','operp':'\u29B9','oplus':'\u2295','or':'\u2228','Or':'\u2A54','orarr':'\u21BB','ord':'\u2A5D','order':'\u2134','orderof':'\u2134','ordf':'\xAA','ordm':'\xBA','origof':'\u22B6','oror':'\u2A56','orslope':'\u2A57','orv':'\u2A5B','oS':'\u24C8','oscr':'\u2134','Oscr':'\uD835\uDCAA','oslash':'\xF8','Oslash':'\xD8','osol':'\u2298','otilde':'\xF5','Otilde':'\xD5','otimes':'\u2297','Otimes':'\u2A37','otimesas':'\u2A36','ouml':'\xF6','Ouml':'\xD6','ovbar':'\u233D','OverBar':'\u203E','OverBrace':'\u23DE','OverBracket':'\u23B4','OverParenthesis':'\u23DC','par':'\u2225','para':'\xB6','parallel':'\u2225','parsim':'\u2AF3','parsl':'\u2AFD','part':'\u2202','PartialD':'\u2202','pcy':'\u043F','Pcy':'\u041F','percnt':'%','period':'.','permil':'\u2030','perp':'\u22A5','pertenk':'\u2031','pfr':'\uD835\uDD2D','Pfr':'\uD835\uDD13','phi':'\u03C6','Phi':'\u03A6','phiv':'\u03D5','phmmat':'\u2133','phone':'\u260E','pi':'\u03C0','Pi':'\u03A0','pitchfork':'\u22D4','piv':'\u03D6','planck':'\u210F','planckh':'\u210E','plankv':'\u210F','plus':'+','plusacir':'\u2A23','plusb':'\u229E','pluscir':'\u2A22','plusdo':'\u2214','plusdu':'\u2A25','pluse':'\u2A72','PlusMinus':'\xB1','plusmn':'\xB1','plussim':'\u2A26','plustwo':'\u2A27','pm':'\xB1','Poincareplane':'\u210C','pointint':'\u2A15','popf':'\uD835\uDD61','Popf':'\u2119','pound':'\xA3','pr':'\u227A','Pr':'\u2ABB','prap':'\u2AB7','prcue':'\u227C','pre':'\u2AAF','prE':'\u2AB3','prec':'\u227A','precapprox':'\u2AB7','preccurlyeq':'\u227C','Precedes':'\u227A','PrecedesEqual':'\u2AAF','PrecedesSlantEqual':'\u227C','PrecedesTilde':'\u227E','preceq':'\u2AAF','precnapprox':'\u2AB9','precneqq':'\u2AB5','precnsim':'\u22E8','precsim':'\u227E','prime':'\u2032','Prime':'\u2033','primes':'\u2119','prnap':'\u2AB9','prnE':'\u2AB5','prnsim':'\u22E8','prod':'\u220F','Product':'\u220F','profalar':'\u232E','profline':'\u2312','profsurf':'\u2313','prop':'\u221D','Proportion':'\u2237','Proportional':'\u221D','propto':'\u221D','prsim':'\u227E','prurel':'\u22B0','pscr':'\uD835\uDCC5','Pscr':'\uD835\uDCAB','psi':'\u03C8','Psi':'\u03A8','puncsp':'\u2008','qfr':'\uD835\uDD2E','Qfr':'\uD835\uDD14','qint':'\u2A0C','qopf':'\uD835\uDD62','Qopf':'\u211A','qprime':'\u2057','qscr':'\uD835\uDCC6','Qscr':'\uD835\uDCAC','quaternions':'\u210D','quatint':'\u2A16','quest':'?','questeq':'\u225F','quot':'"','QUOT':'"','rAarr':'\u21DB','race':'\u223D\u0331','racute':'\u0155','Racute':'\u0154','radic':'\u221A','raemptyv':'\u29B3','rang':'\u27E9','Rang':'\u27EB','rangd':'\u2992','range':'\u29A5','rangle':'\u27E9','raquo':'\xBB','rarr':'\u2192','rArr':'\u21D2','Rarr':'\u21A0','rarrap':'\u2975','rarrb':'\u21E5','rarrbfs':'\u2920','rarrc':'\u2933','rarrfs':'\u291E','rarrhk':'\u21AA','rarrlp':'\u21AC','rarrpl':'\u2945','rarrsim':'\u2974','rarrtl':'\u21A3','Rarrtl':'\u2916','rarrw':'\u219D','ratail':'\u291A','rAtail':'\u291C','ratio':'\u2236','rationals':'\u211A','rbarr':'\u290D','rBarr':'\u290F','RBarr':'\u2910','rbbrk':'\u2773','rbrace':'}','rbrack':']','rbrke':'\u298C','rbrksld':'\u298E','rbrkslu':'\u2990','rcaron':'\u0159','Rcaron':'\u0158','rcedil':'\u0157','Rcedil':'\u0156','rceil':'\u2309','rcub':'}','rcy':'\u0440','Rcy':'\u0420','rdca':'\u2937','rdldhar':'\u2969','rdquo':'\u201D','rdquor':'\u201D','rdsh':'\u21B3','Re':'\u211C','real':'\u211C','realine':'\u211B','realpart':'\u211C','reals':'\u211D','rect':'\u25AD','reg':'\xAE','REG':'\xAE','ReverseElement':'\u220B','ReverseEquilibrium':'\u21CB','ReverseUpEquilibrium':'\u296F','rfisht':'\u297D','rfloor':'\u230B','rfr':'\uD835\uDD2F','Rfr':'\u211C','rHar':'\u2964','rhard':'\u21C1','rharu':'\u21C0','rharul':'\u296C','rho':'\u03C1','Rho':'\u03A1','rhov':'\u03F1','RightAngleBracket':'\u27E9','rightarrow':'\u2192','Rightarrow':'\u21D2','RightArrow':'\u2192','RightArrowBar':'\u21E5','RightArrowLeftArrow':'\u21C4','rightarrowtail':'\u21A3','RightCeiling':'\u2309','RightDoubleBracket':'\u27E7','RightDownTeeVector':'\u295D','RightDownVector':'\u21C2','RightDownVectorBar':'\u2955','RightFloor':'\u230B','rightharpoondown':'\u21C1','rightharpoonup':'\u21C0','rightleftarrows':'\u21C4','rightleftharpoons':'\u21CC','rightrightarrows':'\u21C9','rightsquigarrow':'\u219D','RightTee':'\u22A2','RightTeeArrow':'\u21A6','RightTeeVector':'\u295B','rightthreetimes':'\u22CC','RightTriangle':'\u22B3','RightTriangleBar':'\u29D0','RightTriangleEqual':'\u22B5','RightUpDownVector':'\u294F','RightUpTeeVector':'\u295C','RightUpVector':'\u21BE','RightUpVectorBar':'\u2954','RightVector':'\u21C0','RightVectorBar':'\u2953','ring':'\u02DA','risingdotseq':'\u2253','rlarr':'\u21C4','rlhar':'\u21CC','rlm':'\u200F','rmoust':'\u23B1','rmoustache':'\u23B1','rnmid':'\u2AEE','roang':'\u27ED','roarr':'\u21FE','robrk':'\u27E7','ropar':'\u2986','ropf':'\uD835\uDD63','Ropf':'\u211D','roplus':'\u2A2E','rotimes':'\u2A35','RoundImplies':'\u2970','rpar':')','rpargt':'\u2994','rppolint':'\u2A12','rrarr':'\u21C9','Rrightarrow':'\u21DB','rsaquo':'\u203A','rscr':'\uD835\uDCC7','Rscr':'\u211B','rsh':'\u21B1','Rsh':'\u21B1','rsqb':']','rsquo':'\u2019','rsquor':'\u2019','rthree':'\u22CC','rtimes':'\u22CA','rtri':'\u25B9','rtrie':'\u22B5','rtrif':'\u25B8','rtriltri':'\u29CE','RuleDelayed':'\u29F4','ruluhar':'\u2968','rx':'\u211E','sacute':'\u015B','Sacute':'\u015A','sbquo':'\u201A','sc':'\u227B','Sc':'\u2ABC','scap':'\u2AB8','scaron':'\u0161','Scaron':'\u0160','sccue':'\u227D','sce':'\u2AB0','scE':'\u2AB4','scedil':'\u015F','Scedil':'\u015E','scirc':'\u015D','Scirc':'\u015C','scnap':'\u2ABA','scnE':'\u2AB6','scnsim':'\u22E9','scpolint':'\u2A13','scsim':'\u227F','scy':'\u0441','Scy':'\u0421','sdot':'\u22C5','sdotb':'\u22A1','sdote':'\u2A66','searhk':'\u2925','searr':'\u2198','seArr':'\u21D8','searrow':'\u2198','sect':'\xA7','semi':';','seswar':'\u2929','setminus':'\u2216','setmn':'\u2216','sext':'\u2736','sfr':'\uD835\uDD30','Sfr':'\uD835\uDD16','sfrown':'\u2322','sharp':'\u266F','shchcy':'\u0449','SHCHcy':'\u0429','shcy':'\u0448','SHcy':'\u0428','ShortDownArrow':'\u2193','ShortLeftArrow':'\u2190','shortmid':'\u2223','shortparallel':'\u2225','ShortRightArrow':'\u2192','ShortUpArrow':'\u2191','shy':'\xAD','sigma':'\u03C3','Sigma':'\u03A3','sigmaf':'\u03C2','sigmav':'\u03C2','sim':'\u223C','simdot':'\u2A6A','sime':'\u2243','simeq':'\u2243','simg':'\u2A9E','simgE':'\u2AA0','siml':'\u2A9D','simlE':'\u2A9F','simne':'\u2246','simplus':'\u2A24','simrarr':'\u2972','slarr':'\u2190','SmallCircle':'\u2218','smallsetminus':'\u2216','smashp':'\u2A33','smeparsl':'\u29E4','smid':'\u2223','smile':'\u2323','smt':'\u2AAA','smte':'\u2AAC','smtes':'\u2AAC\uFE00','softcy':'\u044C','SOFTcy':'\u042C','sol':'/','solb':'\u29C4','solbar':'\u233F','sopf':'\uD835\uDD64','Sopf':'\uD835\uDD4A','spades':'\u2660','spadesuit':'\u2660','spar':'\u2225','sqcap':'\u2293','sqcaps':'\u2293\uFE00','sqcup':'\u2294','sqcups':'\u2294\uFE00','Sqrt':'\u221A','sqsub':'\u228F','sqsube':'\u2291','sqsubset':'\u228F','sqsubseteq':'\u2291','sqsup':'\u2290','sqsupe':'\u2292','sqsupset':'\u2290','sqsupseteq':'\u2292','squ':'\u25A1','square':'\u25A1','Square':'\u25A1','SquareIntersection':'\u2293','SquareSubset':'\u228F','SquareSubsetEqual':'\u2291','SquareSuperset':'\u2290','SquareSupersetEqual':'\u2292','SquareUnion':'\u2294','squarf':'\u25AA','squf':'\u25AA','srarr':'\u2192','sscr':'\uD835\uDCC8','Sscr':'\uD835\uDCAE','ssetmn':'\u2216','ssmile':'\u2323','sstarf':'\u22C6','star':'\u2606','Star':'\u22C6','starf':'\u2605','straightepsilon':'\u03F5','straightphi':'\u03D5','strns':'\xAF','sub':'\u2282','Sub':'\u22D0','subdot':'\u2ABD','sube':'\u2286','subE':'\u2AC5','subedot':'\u2AC3','submult':'\u2AC1','subne':'\u228A','subnE':'\u2ACB','subplus':'\u2ABF','subrarr':'\u2979','subset':'\u2282','Subset':'\u22D0','subseteq':'\u2286','subseteqq':'\u2AC5','SubsetEqual':'\u2286','subsetneq':'\u228A','subsetneqq':'\u2ACB','subsim':'\u2AC7','subsub':'\u2AD5','subsup':'\u2AD3','succ':'\u227B','succapprox':'\u2AB8','succcurlyeq':'\u227D','Succeeds':'\u227B','SucceedsEqual':'\u2AB0','SucceedsSlantEqual':'\u227D','SucceedsTilde':'\u227F','succeq':'\u2AB0','succnapprox':'\u2ABA','succneqq':'\u2AB6','succnsim':'\u22E9','succsim':'\u227F','SuchThat':'\u220B','sum':'\u2211','Sum':'\u2211','sung':'\u266A','sup':'\u2283','Sup':'\u22D1','sup1':'\xB9','sup2':'\xB2','sup3':'\xB3','supdot':'\u2ABE','supdsub':'\u2AD8','supe':'\u2287','supE':'\u2AC6','supedot':'\u2AC4','Superset':'\u2283','SupersetEqual':'\u2287','suphsol':'\u27C9','suphsub':'\u2AD7','suplarr':'\u297B','supmult':'\u2AC2','supne':'\u228B','supnE':'\u2ACC','supplus':'\u2AC0','supset':'\u2283','Supset':'\u22D1','supseteq':'\u2287','supseteqq':'\u2AC6','supsetneq':'\u228B','supsetneqq':'\u2ACC','supsim':'\u2AC8','supsub':'\u2AD4','supsup':'\u2AD6','swarhk':'\u2926','swarr':'\u2199','swArr':'\u21D9','swarrow':'\u2199','swnwar':'\u292A','szlig':'\xDF','Tab':'\t','target':'\u2316','tau':'\u03C4','Tau':'\u03A4','tbrk':'\u23B4','tcaron':'\u0165','Tcaron':'\u0164','tcedil':'\u0163','Tcedil':'\u0162','tcy':'\u0442','Tcy':'\u0422','tdot':'\u20DB','telrec':'\u2315','tfr':'\uD835\uDD31','Tfr':'\uD835\uDD17','there4':'\u2234','therefore':'\u2234','Therefore':'\u2234','theta':'\u03B8','Theta':'\u0398','thetasym':'\u03D1','thetav':'\u03D1','thickapprox':'\u2248','thicksim':'\u223C','ThickSpace':'\u205F\u200A','thinsp':'\u2009','ThinSpace':'\u2009','thkap':'\u2248','thksim':'\u223C','thorn':'\xFE','THORN':'\xDE','tilde':'\u02DC','Tilde':'\u223C','TildeEqual':'\u2243','TildeFullEqual':'\u2245','TildeTilde':'\u2248','times':'\xD7','timesb':'\u22A0','timesbar':'\u2A31','timesd':'\u2A30','tint':'\u222D','toea':'\u2928','top':'\u22A4','topbot':'\u2336','topcir':'\u2AF1','topf':'\uD835\uDD65','Topf':'\uD835\uDD4B','topfork':'\u2ADA','tosa':'\u2929','tprime':'\u2034','trade':'\u2122','TRADE':'\u2122','triangle':'\u25B5','triangledown':'\u25BF','triangleleft':'\u25C3','trianglelefteq':'\u22B4','triangleq':'\u225C','triangleright':'\u25B9','trianglerighteq':'\u22B5','tridot':'\u25EC','trie':'\u225C','triminus':'\u2A3A','TripleDot':'\u20DB','triplus':'\u2A39','trisb':'\u29CD','tritime':'\u2A3B','trpezium':'\u23E2','tscr':'\uD835\uDCC9','Tscr':'\uD835\uDCAF','tscy':'\u0446','TScy':'\u0426','tshcy':'\u045B','TSHcy':'\u040B','tstrok':'\u0167','Tstrok':'\u0166','twixt':'\u226C','twoheadleftarrow':'\u219E','twoheadrightarrow':'\u21A0','uacute':'\xFA','Uacute':'\xDA','uarr':'\u2191','uArr':'\u21D1','Uarr':'\u219F','Uarrocir':'\u2949','ubrcy':'\u045E','Ubrcy':'\u040E','ubreve':'\u016D','Ubreve':'\u016C','ucirc':'\xFB','Ucirc':'\xDB','ucy':'\u0443','Ucy':'\u0423','udarr':'\u21C5','udblac':'\u0171','Udblac':'\u0170','udhar':'\u296E','ufisht':'\u297E','ufr':'\uD835\uDD32','Ufr':'\uD835\uDD18','ugrave':'\xF9','Ugrave':'\xD9','uHar':'\u2963','uharl':'\u21BF','uharr':'\u21BE','uhblk':'\u2580','ulcorn':'\u231C','ulcorner':'\u231C','ulcrop':'\u230F','ultri':'\u25F8','umacr':'\u016B','Umacr':'\u016A','uml':'\xA8','UnderBar':'_','UnderBrace':'\u23DF','UnderBracket':'\u23B5','UnderParenthesis':'\u23DD','Union':'\u22C3','UnionPlus':'\u228E','uogon':'\u0173','Uogon':'\u0172','uopf':'\uD835\uDD66','Uopf':'\uD835\uDD4C','uparrow':'\u2191','Uparrow':'\u21D1','UpArrow':'\u2191','UpArrowBar':'\u2912','UpArrowDownArrow':'\u21C5','updownarrow':'\u2195','Updownarrow':'\u21D5','UpDownArrow':'\u2195','UpEquilibrium':'\u296E','upharpoonleft':'\u21BF','upharpoonright':'\u21BE','uplus':'\u228E','UpperLeftArrow':'\u2196','UpperRightArrow':'\u2197','upsi':'\u03C5','Upsi':'\u03D2','upsih':'\u03D2','upsilon':'\u03C5','Upsilon':'\u03A5','UpTee':'\u22A5','UpTeeArrow':'\u21A5','upuparrows':'\u21C8','urcorn':'\u231D','urcorner':'\u231D','urcrop':'\u230E','uring':'\u016F','Uring':'\u016E','urtri':'\u25F9','uscr':'\uD835\uDCCA','Uscr':'\uD835\uDCB0','utdot':'\u22F0','utilde':'\u0169','Utilde':'\u0168','utri':'\u25B5','utrif':'\u25B4','uuarr':'\u21C8','uuml':'\xFC','Uuml':'\xDC','uwangle':'\u29A7','vangrt':'\u299C','varepsilon':'\u03F5','varkappa':'\u03F0','varnothing':'\u2205','varphi':'\u03D5','varpi':'\u03D6','varpropto':'\u221D','varr':'\u2195','vArr':'\u21D5','varrho':'\u03F1','varsigma':'\u03C2','varsubsetneq':'\u228A\uFE00','varsubsetneqq':'\u2ACB\uFE00','varsupsetneq':'\u228B\uFE00','varsupsetneqq':'\u2ACC\uFE00','vartheta':'\u03D1','vartriangleleft':'\u22B2','vartriangleright':'\u22B3','vBar':'\u2AE8','Vbar':'\u2AEB','vBarv':'\u2AE9','vcy':'\u0432','Vcy':'\u0412','vdash':'\u22A2','vDash':'\u22A8','Vdash':'\u22A9','VDash':'\u22AB','Vdashl':'\u2AE6','vee':'\u2228','Vee':'\u22C1','veebar':'\u22BB','veeeq':'\u225A','vellip':'\u22EE','verbar':'|','Verbar':'\u2016','vert':'|','Vert':'\u2016','VerticalBar':'\u2223','VerticalLine':'|','VerticalSeparator':'\u2758','VerticalTilde':'\u2240','VeryThinSpace':'\u200A','vfr':'\uD835\uDD33','Vfr':'\uD835\uDD19','vltri':'\u22B2','vnsub':'\u2282\u20D2','vnsup':'\u2283\u20D2','vopf':'\uD835\uDD67','Vopf':'\uD835\uDD4D','vprop':'\u221D','vrtri':'\u22B3','vscr':'\uD835\uDCCB','Vscr':'\uD835\uDCB1','vsubne':'\u228A\uFE00','vsubnE':'\u2ACB\uFE00','vsupne':'\u228B\uFE00','vsupnE':'\u2ACC\uFE00','Vvdash':'\u22AA','vzigzag':'\u299A','wcirc':'\u0175','Wcirc':'\u0174','wedbar':'\u2A5F','wedge':'\u2227','Wedge':'\u22C0','wedgeq':'\u2259','weierp':'\u2118','wfr':'\uD835\uDD34','Wfr':'\uD835\uDD1A','wopf':'\uD835\uDD68','Wopf':'\uD835\uDD4E','wp':'\u2118','wr':'\u2240','wreath':'\u2240','wscr':'\uD835\uDCCC','Wscr':'\uD835\uDCB2','xcap':'\u22C2','xcirc':'\u25EF','xcup':'\u22C3','xdtri':'\u25BD','xfr':'\uD835\uDD35','Xfr':'\uD835\uDD1B','xharr':'\u27F7','xhArr':'\u27FA','xi':'\u03BE','Xi':'\u039E','xlarr':'\u27F5','xlArr':'\u27F8','xmap':'\u27FC','xnis':'\u22FB','xodot':'\u2A00','xopf':'\uD835\uDD69','Xopf':'\uD835\uDD4F','xoplus':'\u2A01','xotime':'\u2A02','xrarr':'\u27F6','xrArr':'\u27F9','xscr':'\uD835\uDCCD','Xscr':'\uD835\uDCB3','xsqcup':'\u2A06','xuplus':'\u2A04','xutri':'\u25B3','xvee':'\u22C1','xwedge':'\u22C0','yacute':'\xFD','Yacute':'\xDD','yacy':'\u044F','YAcy':'\u042F','ycirc':'\u0177','Ycirc':'\u0176','ycy':'\u044B','Ycy':'\u042B','yen':'\xA5','yfr':'\uD835\uDD36','Yfr':'\uD835\uDD1C','yicy':'\u0457','YIcy':'\u0407','yopf':'\uD835\uDD6A','Yopf':'\uD835\uDD50','yscr':'\uD835\uDCCE','Yscr':'\uD835\uDCB4','yucy':'\u044E','YUcy':'\u042E','yuml':'\xFF','Yuml':'\u0178','zacute':'\u017A','Zacute':'\u0179','zcaron':'\u017E','Zcaron':'\u017D','zcy':'\u0437','Zcy':'\u0417','zdot':'\u017C','Zdot':'\u017B','zeetrf':'\u2128','ZeroWidthSpace':'\u200B','zeta':'\u03B6','Zeta':'\u0396','zfr':'\uD835\uDD37','Zfr':'\u2128','zhcy':'\u0436','ZHcy':'\u0416','zigrarr':'\u21DD','zopf':'\uD835\uDD6B','Zopf':'\u2124','zscr':'\uD835\uDCCF','Zscr':'\uD835\uDCB5','zwj':'\u200D','zwnj':'\u200C'};
 	var decodeMapLegacy = {'aacute':'\xE1','Aacute':'\xC1','acirc':'\xE2','Acirc':'\xC2','acute':'\xB4','aelig':'\xE6','AElig':'\xC6','agrave':'\xE0','Agrave':'\xC0','amp':'&','AMP':'&','aring':'\xE5','Aring':'\xC5','atilde':'\xE3','Atilde':'\xC3','auml':'\xE4','Auml':'\xC4','brvbar':'\xA6','ccedil':'\xE7','Ccedil':'\xC7','cedil':'\xB8','cent':'\xA2','copy':'\xA9','COPY':'\xA9','curren':'\xA4','deg':'\xB0','divide':'\xF7','eacute':'\xE9','Eacute':'\xC9','ecirc':'\xEA','Ecirc':'\xCA','egrave':'\xE8','Egrave':'\xC8','eth':'\xF0','ETH':'\xD0','euml':'\xEB','Euml':'\xCB','frac12':'\xBD','frac14':'\xBC','frac34':'\xBE','gt':'>','GT':'>','iacute':'\xED','Iacute':'\xCD','icirc':'\xEE','Icirc':'\xCE','iexcl':'\xA1','igrave':'\xEC','Igrave':'\xCC','iquest':'\xBF','iuml':'\xEF','Iuml':'\xCF','laquo':'\xAB','lt':'<','LT':'<','macr':'\xAF','micro':'\xB5','middot':'\xB7','nbsp':'\xA0','not':'\xAC','ntilde':'\xF1','Ntilde':'\xD1','oacute':'\xF3','Oacute':'\xD3','ocirc':'\xF4','Ocirc':'\xD4','ograve':'\xF2','Ograve':'\xD2','ordf':'\xAA','ordm':'\xBA','oslash':'\xF8','Oslash':'\xD8','otilde':'\xF5','Otilde':'\xD5','ouml':'\xF6','Ouml':'\xD6','para':'\xB6','plusmn':'\xB1','pound':'\xA3','quot':'"','QUOT':'"','raquo':'\xBB','reg':'\xAE','REG':'\xAE','sect':'\xA7','shy':'\xAD','sup1':'\xB9','sup2':'\xB2','sup3':'\xB3','szlig':'\xDF','thorn':'\xFE','THORN':'\xDE','times':'\xD7','uacute':'\xFA','Uacute':'\xDA','ucirc':'\xFB','Ucirc':'\xDB','ugrave':'\xF9','Ugrave':'\xD9','uml':'\xA8','uuml':'\xFC','Uuml':'\xDC','yacute':'\xFD','Yacute':'\xDD','yen':'\xA5','yuml':'\xFF'};
 	var decodeMapNumeric = {'0':'\uFFFD','128':'\u20AC','130':'\u201A','131':'\u0192','132':'\u201E','133':'\u2026','134':'\u2020','135':'\u2021','136':'\u02C6','137':'\u2030','138':'\u0160','139':'\u2039','140':'\u0152','142':'\u017D','145':'\u2018','146':'\u2019','147':'\u201C','148':'\u201D','149':'\u2022','150':'\u2013','151':'\u2014','152':'\u02DC','153':'\u2122','154':'\u0161','155':'\u203A','156':'\u0153','158':'\u017E','159':'\u0178'};
 	var invalidReferenceCodePoints = [1,2,3,4,5,6,7,8,11,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,64976,64977,64978,64979,64980,64981,64982,64983,64984,64985,64986,64987,64988,64989,64990,64991,64992,64993,64994,64995,64996,64997,64998,64999,65000,65001,65002,65003,65004,65005,65006,65007,65534,65535,131070,131071,196606,196607,262142,262143,327678,327679,393214,393215,458750,458751,524286,524287,589822,589823,655358,655359,720894,720895,786430,786431,851966,851967,917502,917503,983038,983039,1048574,1048575,1114110,1114111];
 
 	/*--------------------------------------------------------------------------*/
 
 	var stringFromCharCode = String.fromCharCode;
 
 	var object = {};
 	var hasOwnProperty = object.hasOwnProperty;
 	var has = function(object, propertyName) {
 		return hasOwnProperty.call(object, propertyName);
 	};
 
 	var contains = function(array, value) {
 		var index = -1;
 		var length = array.length;
 		while (++index < length) {
 			if (array[index] == value) {
 				return true;
 			}
 		}
 		return false;
 	};
 
 	var merge = function(options, defaults) {
 		if (!options) {
 			return defaults;
 		}
 		var result = {};
 		var key;
 		for (key in defaults) {
 			// A `hasOwnProperty` check is not needed here, since only recognized
 			// option names are used anyway. Any others are ignored.
 			result[key] = has(options, key) ? options[key] : defaults[key];
 		}
 		return result;
 	};
 
 	// Modified version of `ucs2encode`; see https://mths.be/punycode.
 	var codePointToSymbol = function(codePoint, strict) {
 		var output = '';
 		if ((codePoint >= 0xD800 && codePoint <= 0xDFFF) || codePoint > 0x10FFFF) {
 			// See issue #4:
 			// “Otherwise, if the number is in the range 0xD800 to 0xDFFF or is
 			// greater than 0x10FFFF, then this is a parse error. Return a U+FFFD
 			// REPLACEMENT CHARACTER.”
 			if (strict) {
 				parseError('character reference outside the permissible Unicode range');
 			}
 			return '\uFFFD';
 		}
 		if (has(decodeMapNumeric, codePoint)) {
 			if (strict) {
 				parseError('disallowed character reference');
 			}
 			return decodeMapNumeric[codePoint];
 		}
 		if (strict && contains(invalidReferenceCodePoints, codePoint)) {
 			parseError('disallowed character reference');
 		}
 		if (codePoint > 0xFFFF) {
 			codePoint -= 0x10000;
 			output += stringFromCharCode(codePoint >>> 10 & 0x3FF | 0xD800);
 			codePoint = 0xDC00 | codePoint & 0x3FF;
 		}
 		output += stringFromCharCode(codePoint);
 		return output;
 	};
 
 	var hexEscape = function(codePoint) {
 		return '&#x' + codePoint.toString(16).toUpperCase() + ';';
 	};
 
 	var decEscape = function(codePoint) {
 		return '&#' + codePoint + ';';
 	};
 
 	var parseError = function(message) {
 		throw Error('Parse error: ' + message);
 	};
 
 	/*--------------------------------------------------------------------------*/
 
 	var encode = function(string, options) {
 		options = merge(options, encode.options);
 		var strict = options.strict;
 		if (strict && regexInvalidRawCodePoint.test(string)) {
 			parseError('forbidden code point');
 		}
 		var encodeEverything = options.encodeEverything;
 		var useNamedReferences = options.useNamedReferences;
 		var allowUnsafeSymbols = options.allowUnsafeSymbols;
 		var escapeCodePoint = options.decimal ? decEscape : hexEscape;
 
 		var escapeBmpSymbol = function(symbol) {
 			return escapeCodePoint(symbol.charCodeAt(0));
 		};
 
 		if (encodeEverything) {
 			// Encode ASCII symbols.
 			string = string.replace(regexAsciiWhitelist, function(symbol) {
 				// Use named references if requested & possible.
 				if (useNamedReferences && has(encodeMap, symbol)) {
 					return '&' + encodeMap[symbol] + ';';
 				}
 				return escapeBmpSymbol(symbol);
 			});
 			// Shorten a few escapes that represent two symbols, of which at least one
 			// is within the ASCII range.
 			if (useNamedReferences) {
 				string = string
 					.replace(/&gt;\u20D2/g, '&nvgt;')
 					.replace(/&lt;\u20D2/g, '&nvlt;')
 					.replace(/&#x66;&#x6A;/g, '&fjlig;');
 			}
 			// Encode non-ASCII symbols.
 			if (useNamedReferences) {
 				// Encode non-ASCII symbols that can be replaced with a named reference.
 				string = string.replace(regexEncodeNonAscii, function(string) {
 					// Note: there is no need to check `has(encodeMap, string)` here.
 					return '&' + encodeMap[string] + ';';
 				});
 			}
 			// Note: any remaining non-ASCII symbols are handled outside of the `if`.
 		} else if (useNamedReferences) {
 			// Apply named character references.
 			// Encode `<>"'&` using named character references.
 			if (!allowUnsafeSymbols) {
 				string = string.replace(regexEscape, function(string) {
 					return '&' + encodeMap[string] + ';'; // no need to check `has()` here
 				});
 			}
 			// Shorten escapes that represent two symbols, of which at least one is
 			// `<>"'&`.
 			string = string
 				.replace(/&gt;\u20D2/g, '&nvgt;')
 				.replace(/&lt;\u20D2/g, '&nvlt;');
 			// Encode non-ASCII symbols that can be replaced with a named reference.
 			string = string.replace(regexEncodeNonAscii, function(string) {
 				// Note: there is no need to check `has(encodeMap, string)` here.
 				return '&' + encodeMap[string] + ';';
 			});
 		} else if (!allowUnsafeSymbols) {
 			// Encode `<>"'&` using hexadecimal escapes, now that they’re not handled
 			// using named character references.
 			string = string.replace(regexEscape, escapeBmpSymbol);
 		}
 		return string
 			// Encode astral symbols.
 			.replace(regexAstralSymbols, function($0) {
 				// https://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
 				var high = $0.charCodeAt(0);
 				var low = $0.charCodeAt(1);
 				var codePoint = (high - 0xD800) * 0x400 + low - 0xDC00 + 0x10000;
 				return escapeCodePoint(codePoint);
 			})
 			// Encode any remaining BMP symbols that are not printable ASCII symbols
 			// using a hexadecimal escape.
 			.replace(regexBmpWhitelist, escapeBmpSymbol);
 	};
 	// Expose default options (so they can be overridden globally).
 	encode.options = {
 		'allowUnsafeSymbols': false,
 		'encodeEverything': false,
 		'strict': false,
 		'useNamedReferences': false,
 		'decimal' : false
 	};
 
 	var decode = function(html, options) {
 		options = merge(options, decode.options);
 		var strict = options.strict;
 		if (strict && regexInvalidEntity.test(html)) {
 			parseError('malformed character reference');
 		}
 		return html.replace(regexDecode, function($0, $1, $2, $3, $4, $5, $6, $7) {
 			var codePoint;
 			var semicolon;
 			var decDigits;
 			var hexDigits;
 			var reference;
 			var next;
 			if ($1) {
 				// Decode decimal escapes, e.g. `&#119558;`.
 				decDigits = $1;
 				semicolon = $2;
 				if (strict && !semicolon) {
 					parseError('character reference was not terminated by a semicolon');
 				}
 				codePoint = parseInt(decDigits, 10);
 				return codePointToSymbol(codePoint, strict);
 			}
 			if ($3) {
 				// Decode hexadecimal escapes, e.g. `&#x1D306;`.
 				hexDigits = $3;
 				semicolon = $4;
 				if (strict && !semicolon) {
 					parseError('character reference was not terminated by a semicolon');
 				}
 				codePoint = parseInt(hexDigits, 16);
 				return codePointToSymbol(codePoint, strict);
 			}
 			if ($5) {
 				// Decode named character references with trailing `;`, e.g. `&copy;`.
 				reference = $5;
 				if (has(decodeMap, reference)) {
 					return decodeMap[reference];
 				} else {
 					// Ambiguous ampersand. https://mths.be/notes/ambiguous-ampersands
 					if (strict) {
 						parseError(
 							'named character reference was not terminated by a semicolon'
 						);
 					}
 					return $0;
 				}
 			}
 			// If we’re still here, it’s a legacy reference for sure. No need for an
 			// extra `if` check.
 			// Decode named character references without trailing `;`, e.g. `&amp`
 			// This is only a parse error if it gets converted to `&`, or if it is
 			// followed by `=` in an attribute context.
 			reference = $6;
 			next = $7;
 			if (next && options.isAttributeValue) {
 				if (strict && next == '=') {
 					parseError('`&` did not start a character reference');
 				}
 				return $0;
 			} else {
 				if (strict) {
 					parseError(
 						'named character reference was not terminated by a semicolon'
 					);
 				}
 				// Note: there is no need to check `has(decodeMapLegacy, reference)`.
 				return decodeMapLegacy[reference] + (next || '');
 			}
 		});
 	};
 	// Expose default options (so they can be overridden globally).
 	decode.options = {
 		'isAttributeValue': false,
 		'strict': false
 	};
 
 	var escape = function(string) {
 		return string.replace(regexEscape, function($0) {
 			// Note: there is no need to check `has(escapeMap, $0)` here.
 			return escapeMap[$0];
 		});
 	};
 
 	/*--------------------------------------------------------------------------*/
 
 	var he = {
 		'version': '1.1.1',
 		'encode': encode,
 		'decode': decode,
 		'escape': escape,
 		'unescape': decode
 	};
 
 	// Some AMD build optimizers, like r.js, check for specific condition patterns
 	// like the following:
 	if (
 		typeof define == 'function' &&
 		typeof define.amd == 'object' &&
 		define.amd
 	) {
 		define(function() {
 			return he;
 		});
 	}	else if (freeExports && !freeExports.nodeType) {
 		if (freeModule) { // in Node.js, io.js, or RingoJS v0.8.0+
 			freeModule.exports = he;
 		} else { // in Narwhal or RingoJS v0.7.0-
 			for (var key in he) {
 				has(he, key) && (freeExports[key] = he[key]);
 			}
 		}
 	} else { // in Rhino or a web browser
 		root.he = he;
 	}
 
 }(this));
 
 }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
 },{}],10:[function(require,module,exports){
 module.exports = attributeToProperty
 
 var transform = {
   'class': 'className',
   'for': 'htmlFor',
   'http-equiv': 'httpEquiv'
 }
 
 function attributeToProperty (h) {
   return function (tagName, attrs, children) {
     for (var attr in attrs) {
       if (attr in transform) {
         attrs[transform[attr]] = attrs[attr]
         delete attrs[attr]
       }
     }
     return h(tagName, attrs, children)
   }
 }
 
 },{}],11:[function(require,module,exports){
 var attrToProp = require('hyperscript-attribute-to-property')
 
 var VAR = 0, TEXT = 1, OPEN = 2, CLOSE = 3, ATTR = 4
 var ATTR_KEY = 5, ATTR_KEY_W = 6
 var ATTR_VALUE_W = 7, ATTR_VALUE = 8
 var ATTR_VALUE_SQ = 9, ATTR_VALUE_DQ = 10
 var ATTR_EQ = 11, ATTR_BREAK = 12
 var COMMENT = 13
 
 module.exports = function (h, opts) {
   if (!opts) opts = {}
   var concat = opts.concat || function (a, b) {
     return String(a) + String(b)
   }
   if (opts.attrToProp !== false) {
     h = attrToProp(h)
   }
 
   return function (strings) {
     var state = TEXT, reg = ''
     var arglen = arguments.length
     var parts = []
 
     for (var i = 0; i < strings.length; i++) {
       if (i < arglen - 1) {
         var arg = arguments[i+1]
         var p = parse(strings[i])
         var xstate = state
         if (xstate === ATTR_VALUE_DQ) xstate = ATTR_VALUE
         if (xstate === ATTR_VALUE_SQ) xstate = ATTR_VALUE
         if (xstate === ATTR_VALUE_W) xstate = ATTR_VALUE
         if (xstate === ATTR) xstate = ATTR_KEY
         if (xstate === OPEN) {
           if (reg === '/') {
             p.push([ OPEN, '/', arg ])
             reg = ''
           } else {
             p.push([ OPEN, arg ])
           }
         } else {
           p.push([ VAR, xstate, arg ])
         }
         parts.push.apply(parts, p)
       } else parts.push.apply(parts, parse(strings[i]))
     }
 
     var tree = [null,{},[]]
     var stack = [[tree,-1]]
     for (var i = 0; i < parts.length; i++) {
       var cur = stack[stack.length-1][0]
       var p = parts[i], s = p[0]
       if (s === OPEN && /^\//.test(p[1])) {
         var ix = stack[stack.length-1][1]
         if (stack.length > 1) {
           stack.pop()
           stack[stack.length-1][0][2][ix] = h(
             cur[0], cur[1], cur[2].length ? cur[2] : undefined
           )
         }
       } else if (s === OPEN) {
         var c = [p[1],{},[]]
         cur[2].push(c)
         stack.push([c,cur[2].length-1])
       } else if (s === ATTR_KEY || (s === VAR && p[1] === ATTR_KEY)) {
         var key = ''
         var copyKey
         for (; i < parts.length; i++) {
           if (parts[i][0] === ATTR_KEY) {
             key = concat(key, parts[i][1])
           } else if (parts[i][0] === VAR && parts[i][1] === ATTR_KEY) {
             if (typeof parts[i][2] === 'object' && !key) {
               for (copyKey in parts[i][2]) {
                 if (parts[i][2].hasOwnProperty(copyKey) && !cur[1][copyKey]) {
                   cur[1][copyKey] = parts[i][2][copyKey]
                 }
               }
             } else {
               key = concat(key, parts[i][2])
             }
           } else break
         }
         if (parts[i][0] === ATTR_EQ) i++
         var j = i
         for (; i < parts.length; i++) {
           if (parts[i][0] === ATTR_VALUE || parts[i][0] === ATTR_KEY) {
             if (!cur[1][key]) cur[1][key] = strfn(parts[i][1])
             else parts[i][1]==="" || (cur[1][key] = concat(cur[1][key], parts[i][1]));
           } else if (parts[i][0] === VAR
           && (parts[i][1] === ATTR_VALUE || parts[i][1] === ATTR_KEY)) {
             if (!cur[1][key]) cur[1][key] = strfn(parts[i][2])
             else parts[i][2]==="" || (cur[1][key] = concat(cur[1][key], parts[i][2]));
           } else {
             if (key.length && !cur[1][key] && i === j
             && (parts[i][0] === CLOSE || parts[i][0] === ATTR_BREAK)) {
               // https://html.spec.whatwg.org/multipage/infrastructure.html#boolean-attributes
               // empty string is falsy, not well behaved value in browser
               cur[1][key] = key.toLowerCase()
             }
             if (parts[i][0] === CLOSE) {
               i--
             }
             break
           }
         }
       } else if (s === ATTR_KEY) {
         cur[1][p[1]] = true
       } else if (s === VAR && p[1] === ATTR_KEY) {
         cur[1][p[2]] = true
       } else if (s === CLOSE) {
         if (selfClosing(cur[0]) && stack.length) {
           var ix = stack[stack.length-1][1]
           stack.pop()
           stack[stack.length-1][0][2][ix] = h(
             cur[0], cur[1], cur[2].length ? cur[2] : undefined
           )
         }
       } else if (s === VAR && p[1] === TEXT) {
         if (p[2] === undefined || p[2] === null) p[2] = ''
         else if (!p[2]) p[2] = concat('', p[2])
         if (Array.isArray(p[2][0])) {
           cur[2].push.apply(cur[2], p[2])
         } else {
           cur[2].push(p[2])
         }
       } else if (s === TEXT) {
         cur[2].push(p[1])
       } else if (s === ATTR_EQ || s === ATTR_BREAK) {
         // no-op
       } else {
         throw new Error('unhandled: ' + s)
       }
     }
 
     if (tree[2].length > 1 && /^\s*$/.test(tree[2][0])) {
       tree[2].shift()
     }
 
     if (tree[2].length > 2
     || (tree[2].length === 2 && /\S/.test(tree[2][1]))) {
       throw new Error(
         'multiple root elements must be wrapped in an enclosing tag'
       )
     }
     if (Array.isArray(tree[2][0]) && typeof tree[2][0][0] === 'string'
     && Array.isArray(tree[2][0][2])) {
       tree[2][0] = h(tree[2][0][0], tree[2][0][1], tree[2][0][2])
     }
     return tree[2][0]
 
     function parse (str) {
       var res = []
       if (state === ATTR_VALUE_W) state = ATTR
       for (var i = 0; i < str.length; i++) {
         var c = str.charAt(i)
         if (state === TEXT && c === '<') {
           if (reg.length) res.push([TEXT, reg])
           reg = ''
           state = OPEN
         } else if (c === '>' && !quot(state) && state !== COMMENT) {
           if (state === OPEN && reg.length) {
             res.push([OPEN,reg])
           } else if (state === ATTR_KEY) {
             res.push([ATTR_KEY,reg])
           } else if (state === ATTR_VALUE && reg.length) {
             res.push([ATTR_VALUE,reg])
           }
           res.push([CLOSE])
           reg = ''
           state = TEXT
         } else if (state === COMMENT && /-$/.test(reg) && c === '-') {
           if (opts.comments) {
             res.push([ATTR_VALUE,reg.substr(0, reg.length - 1)],[CLOSE])
           }
           reg = ''
           state = TEXT
         } else if (state === OPEN && /^!--$/.test(reg)) {
           if (opts.comments) {
             res.push([OPEN, reg],[ATTR_KEY,'comment'],[ATTR_EQ])
           }
           reg = c
           state = COMMENT
         } else if (state === TEXT || state === COMMENT) {
           reg += c
         } else if (state === OPEN && c === '/' && reg.length) {
           // no-op, self closing tag without a space <br/>
         } else if (state === OPEN && /\s/.test(c)) {
           if (reg.length) {
             res.push([OPEN, reg])
           }
           reg = ''
           state = ATTR
         } else if (state === OPEN) {
           reg += c
         } else if (state === ATTR && /[^\s"'=/]/.test(c)) {
           state = ATTR_KEY
           reg = c
         } else if (state === ATTR && /\s/.test(c)) {
           if (reg.length) res.push([ATTR_KEY,reg])
           res.push([ATTR_BREAK])
         } else if (state === ATTR_KEY && /\s/.test(c)) {
           res.push([ATTR_KEY,reg])
           reg = ''
           state = ATTR_KEY_W
         } else if (state === ATTR_KEY && c === '=') {
           res.push([ATTR_KEY,reg],[ATTR_EQ])
           reg = ''
           state = ATTR_VALUE_W
         } else if (state === ATTR_KEY) {
           reg += c
         } else if ((state === ATTR_KEY_W || state === ATTR) && c === '=') {
           res.push([ATTR_EQ])
           state = ATTR_VALUE_W
         } else if ((state === ATTR_KEY_W || state === ATTR) && !/\s/.test(c)) {
           res.push([ATTR_BREAK])
           if (/[\w-]/.test(c)) {
             reg += c
             state = ATTR_KEY
           } else state = ATTR
         } else if (state === ATTR_VALUE_W && c === '"') {
           state = ATTR_VALUE_DQ
         } else if (state === ATTR_VALUE_W && c === "'") {
           state = ATTR_VALUE_SQ
         } else if (state === ATTR_VALUE_DQ && c === '"') {
           res.push([ATTR_VALUE,reg],[ATTR_BREAK])
           reg = ''
           state = ATTR
         } else if (state === ATTR_VALUE_SQ && c === "'") {
           res.push([ATTR_VALUE,reg],[ATTR_BREAK])
           reg = ''
           state = ATTR
         } else if (state === ATTR_VALUE_W && !/\s/.test(c)) {
           state = ATTR_VALUE
           i--
         } else if (state === ATTR_VALUE && /\s/.test(c)) {
           res.push([ATTR_VALUE,reg],[ATTR_BREAK])
           reg = ''
           state = ATTR
         } else if (state === ATTR_VALUE || state === ATTR_VALUE_SQ
         || state === ATTR_VALUE_DQ) {
           reg += c
         }
       }
       if (state === TEXT && reg.length) {
         res.push([TEXT,reg])
         reg = ''
       } else if (state === ATTR_VALUE && reg.length) {
         res.push([ATTR_VALUE,reg])
         reg = ''
       } else if (state === ATTR_VALUE_DQ && reg.length) {
         res.push([ATTR_VALUE,reg])
         reg = ''
       } else if (state === ATTR_VALUE_SQ && reg.length) {
         res.push([ATTR_VALUE,reg])
         reg = ''
       } else if (state === ATTR_KEY) {
         res.push([ATTR_KEY,reg])
         reg = ''
       }
       return res
     }
   }
 
   function strfn (x) {
     if (typeof x === 'function') return x
     else if (typeof x === 'string') return x
     else if (x && typeof x === 'object') return x
     else return concat('', x)
   }
 }
 
 function quot (state) {
   return state === ATTR_VALUE_SQ || state === ATTR_VALUE_DQ
 }
 
 var hasOwn = Object.prototype.hasOwnProperty
 function has (obj, key) { return hasOwn.call(obj, key) }
 
 var closeRE = RegExp('^(' + [
   'area', 'base', 'basefont', 'bgsound', 'br', 'col', 'command', 'embed',
   'frame', 'hr', 'img', 'input', 'isindex', 'keygen', 'link', 'meta', 'param',
   'source', 'track', 'wbr', '!--',
   // SVG TAGS
   'animate', 'animateTransform', 'circle', 'cursor', 'desc', 'ellipse',
   'feBlend', 'feColorMatrix', 'feComposite',
   'feConvolveMatrix', 'feDiffuseLighting', 'feDisplacementMap',
   'feDistantLight', 'feFlood', 'feFuncA', 'feFuncB', 'feFuncG', 'feFuncR',
   'feGaussianBlur', 'feImage', 'feMergeNode', 'feMorphology',
   'feOffset', 'fePointLight', 'feSpecularLighting', 'feSpotLight', 'feTile',
   'feTurbulence', 'font-face-format', 'font-face-name', 'font-face-uri',
   'glyph', 'glyphRef', 'hkern', 'image', 'line', 'missing-glyph', 'mpath',
   'path', 'polygon', 'polyline', 'rect', 'set', 'stop', 'tref', 'use', 'view',
   'vkern'
 ].join('|') + ')(?:[\.#][a-zA-Z0-9\u007F-\uFFFF_:-]+)*$')
 function selfClosing (tag) { return closeRE.test(tag) }
 
 },{"hyperscript-attribute-to-property":10}],12:[function(require,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
   }
 }
 
 },{}],13:[function(require,module,exports){
 (function (global){
 /**
  * @license
  * Lodash <https://lodash.com/>
  * Copyright JS Foundation and other contributors <https://js.foundation/>
  * 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.17.10';
 
   /** Used as the size to enable large array optimizations. */
   var LARGE_ARRAY_SIZE = 200;
 
   /** Error message constants. */
   var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',
       FUNC_ERROR_TEXT = 'Expected a function';
 
   /** Used to stand-in for `undefined` hash values. */
   var HASH_UNDEFINED = '__lodash_hash_undefined__';
 
   /** Used as the maximum memoize cache size. */
   var MAX_MEMOIZE_SIZE = 500;
 
   /** Used as the internal argument placeholder. */
   var PLACEHOLDER = '__lodash_placeholder__';
 
   /** Used to compose bitmasks for cloning. */
   var CLONE_DEEP_FLAG = 1,
       CLONE_FLAT_FLAG = 2,
       CLONE_SYMBOLS_FLAG = 4;
 
   /** Used to compose bitmasks for value comparisons. */
   var COMPARE_PARTIAL_FLAG = 1,
       COMPARE_UNORDERED_FLAG = 2;
 
   /** Used to compose bitmasks for function metadata. */
   var WRAP_BIND_FLAG = 1,
       WRAP_BIND_KEY_FLAG = 2,
       WRAP_CURRY_BOUND_FLAG = 4,
       WRAP_CURRY_FLAG = 8,
       WRAP_CURRY_RIGHT_FLAG = 16,
       WRAP_PARTIAL_FLAG = 32,
       WRAP_PARTIAL_RIGHT_FLAG = 64,
       WRAP_ARY_FLAG = 128,
       WRAP_REARG_FLAG = 256,
       WRAP_FLIP_FLAG = 512;
 
   /** 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 = 800,
       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', WRAP_ARY_FLAG],
     ['bind', WRAP_BIND_FLAG],
     ['bindKey', WRAP_BIND_KEY_FLAG],
     ['curry', WRAP_CURRY_FLAG],
     ['curryRight', WRAP_CURRY_RIGHT_FLAG],
     ['flip', WRAP_FLIP_FLAG],
     ['partial', WRAP_PARTIAL_FLAG],
     ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],
     ['rearg', WRAP_REARG_FLAG]
   ];
 
   /** `Object#toString` result references. */
   var argsTag = '[object Arguments]',
       arrayTag = '[object Array]',
       asyncTag = '[object AsyncFunction]',
       boolTag = '[object Boolean]',
       dateTag = '[object Date]',
       domExcTag = '[object DOMException]',
       errorTag = '[object Error]',
       funcTag = '[object Function]',
       genTag = '[object GeneratorFunction]',
       mapTag = '[object Map]',
       numberTag = '[object Number]',
       nullTag = '[object Null]',
       objectTag = '[object Object]',
       promiseTag = '[object Promise]',
       proxyTag = '[object Proxy]',
       regexpTag = '[object RegExp]',
       setTag = '[object Set]',
       stringTag = '[object String]',
       symbolTag = '[object Symbol]',
       undefinedTag = '[object Undefined]',
       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);/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*$/,
       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 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',
       reComboHalfMarksRange = '\\ufe20-\\ufe2f',
       rsComboSymbolsRange = '\\u20d0-\\u20ff',
       rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,
       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 = '[' + rsComboRange + ']',
       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 rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',
       rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',
       rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',
       rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',
       reOptMod = rsModifier + '?',
       rsOptVar = '[' + rsVarRange + ']?',
       rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',
       rsOrdLower = '\\d*(?:1st|2nd|3rd|(?![123])\\dth)(?=\\b|[A-Z_])',
       rsOrdUpper = '\\d*(?:1ST|2ND|3RD|(?![123])\\dTH)(?=\\b|[a-z_])',
       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 + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',
     rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',
     rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,
     rsUpper + '+' + rsOptContrUpper,
     rsOrdUpper,
     rsOrdLower,
     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  + rsComboRange + 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': 's'
   };
 
   /** Used to map characters to HTML entities. */
   var htmlEscapes = {
     '&': '&amp;',
     '<': '&lt;',
     '>': '&gt;',
     '"': '&quot;',
     "'": '&#39;'
   };
 
   /** Used to map HTML entities to characters. */
   var htmlUnescapes = {
     '&amp;': '&',
     '&lt;': '<',
     '&gt;': '>',
     '&quot;': '"',
     '&#39;': "'"
   };
 
   /** 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 {
       // Use `util.types` for Node.js 10+.
       var types = freeModule && freeModule.require && freeModule.require('util').types;
 
       if (types) {
         return types;
       }
 
       // Legacy `process.binding('util')` for Node.js < 10.
       return freeProcess && freeProcess.binding && 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;
 
   /*--------------------------------------------------------------------------*/
 
   /**
    * 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 == null ? 0 : array.length;
 
     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 == null ? 0 : array.length;
 
     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 == null ? 0 : array.length;
 
     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 == null ? 0 : array.length;
 
     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 == null ? 0 : array.length,
         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 == null ? 0 : array.length;
     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 == null ? 0 : array.length;
 
     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 == null ? 0 : array.length,
         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 == null ? 0 : array.length;
 
     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 == null ? 0 : array.length;
     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 == null ? 0 : array.length;
 
     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) {
     return value === value
       ? strictIndexOf(array, value, fromIndex)
       : baseFindIndex(array, baseIsNaN, fromIndex);
   }
 
   /**
    * 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 == null ? 0 : array.length;
     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);
   }
 
   /**
    * 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;
   }
 
   /**
    * Gets the value at `key`, unless `key` is "__proto__".
    *
    * @private
    * @param {Object} object The object to query.
    * @param {string} key The key of the property to get.
    * @returns {*} Returns the property value.
    */
   function safeGet(object, key) {
     return key == '__proto__'
       ? undefined
       : object[key];
   }
 
   /**
    * 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;
   }
 
   /**
    * A specialized version of `_.indexOf` which performs strict equality
    * comparisons of values, i.e. `===`.
    *
    * @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 strictIndexOf(array, value, fromIndex) {
     var index = fromIndex - 1,
         length = array.length;
 
     while (++index < length) {
       if (array[index] === value) {
         return index;
       }
     }
     return -1;
   }
 
   /**
    * A specialized version of `_.lastIndexOf` which performs strict equality
    * comparisons of values, i.e. `===`.
    *
    * @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 strictLastIndexOf(array, value, fromIndex) {
     var index = fromIndex + 1;
     while (index--) {
       if (array[index] === value) {
         return index;
       }
     }
     return index;
   }
 
   /**
    * 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
    *
    * // Create a suped-up `defer` in Node.js.
    * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;
    */
   var runInContext = (function runInContext(context) {
     context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));
 
     /** 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 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 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
      * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
      * of values.
      */
     var nativeObjectToString = objectProto.toString;
 
     /** Used to infer the `Object` constructor. */
     var objectCtorString = funcToString.call(Object);
 
     /** 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,
         allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,
         getPrototype = overArg(Object.getPrototypeOf, Object),
         objectCreate = Object.create,
         propertyIsEnumerable = objectProto.propertyIsEnumerable,
         splice = arrayProto.splice,
         spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,
         symIterator = Symbol ? Symbol.iterator : undefined,
         symToStringTag = Symbol ? Symbol.toStringTag : undefined;
 
     var defineProperty = (function() {
       try {
         var func = getNative(Object, 'defineProperty');
         func({}, '', {});
         return func;
       } catch (e) {}
     }());
 
     /** 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,
         nativeNow = Date.now,
         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 store function metadata. */
     var metaMap = WeakMap && new WeakMap;
 
     /** 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 and 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 base implementation of `_.create` without support for assigning
      * properties to the created object.
      *
      * @private
      * @param {Object} proto The object to inherit from.
      * @returns {Object} Returns the new object.
      */
     var baseCreate = (function() {
       function object() {}
       return function(proto) {
         if (!isObject(proto)) {
           return {};
         }
         if (objectCreate) {
           return objectCreate(proto);
         }
         object.prototype = proto;
         var result = new object;
         object.prototype = undefined;
         return result;
       };
     }());
 
     /**
      * 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) as well as ES2015 template strings. 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 || (!isRight && 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 == null ? 0 : entries.length;
 
       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) : {};
       this.size = 0;
     }
 
     /**
      * 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) {
       var result = this.has(key) && delete this.__data__[key];
       this.size -= result ? 1 : 0;
       return result;
     }
 
     /**
      * 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__;
       this.size += this.has(key) ? 0 : 1;
       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 == null ? 0 : entries.length;
 
       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__ = [];
       this.size = 0;
     }
 
     /**
      * 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);
       }
       --this.size;
       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) {
         ++this.size;
         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 == null ? 0 : entries.length;
 
       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.size = 0;
       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) {
       var result = getMapData(this, key)['delete'](key);
       this.size -= result ? 1 : 0;
       return result;
     }
 
     /**
      * 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) {
       var data = getMapData(this, key),
           size = data.size;
 
       data.set(key, value);
       this.size += data.size == size ? 0 : 1;
       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 == null ? 0 : values.length;
 
       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) {
       var data = this.__data__ = new ListCache(entries);
       this.size = data.size;
     }
 
     /**
      * Removes all key-value entries from the stack.
      *
      * @private
      * @name clear
      * @memberOf Stack
      */
     function stackClear() {
       this.__data__ = new ListCache;
       this.size = 0;
     }
 
     /**
      * 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) {
       var data = this.__data__,
           result = data['delete'](key);
 
       this.size = data.size;
       return result;
     }
 
     /**
      * 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 data = this.__data__;
       if (data instanceof ListCache) {
         var pairs = data.__data__;
         if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {
           pairs.push([key, value]);
           this.size = ++data.size;
           return this;
         }
         data = this.__data__ = new MapCache(pairs);
       }
       data.set(key, value);
       this.size = data.size;
       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) {
       var isArr = isArray(value),
           isArg = !isArr && isArguments(value),
           isBuff = !isArr && !isArg && isBuffer(value),
           isType = !isArr && !isArg && !isBuff && isTypedArray(value),
           skipIndexes = isArr || isArg || isBuff || isType,
           result = skipIndexes ? baseTimes(value.length, String) : [],
           length = result.length;
 
       for (var key in value) {
         if ((inherited || hasOwnProperty.call(value, key)) &&
             !(skipIndexes && (
                // Safari 9 has enumerable `arguments.length` in strict mode.
                key == 'length' ||
                // Node.js 0.10 has enumerable non-index properties on buffers.
                (isBuff && (key == 'offset' || key == 'parent')) ||
                // PhantomJS 2 has enumerable non-index properties on typed arrays.
                (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||
                // Skip index properties.
                isIndex(key, length)
             ))) {
           result.push(key);
         }
       }
       return result;
     }
 
     /**
      * A specialized version of `_.sample` for arrays.
      *
      * @private
      * @param {Array} array The array to sample.
      * @returns {*} Returns the random element.
      */
     function arraySample(array) {
       var length = array.length;
       return length ? array[baseRandom(0, length - 1)] : undefined;
     }
 
     /**
      * A specialized version of `_.sampleSize` for arrays.
      *
      * @private
      * @param {Array} array The array to sample.
      * @param {number} n The number of elements to sample.
      * @returns {Array} Returns the random elements.
      */
     function arraySampleSize(array, n) {
       return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));
     }
 
     /**
      * A specialized version of `_.shuffle` for arrays.
      *
      * @private
      * @param {Array} array The array to shuffle.
      * @returns {Array} Returns the new shuffled array.
      */
     function arrayShuffle(array) {
       return shuffleSelf(copyArray(array));
     }
 
     /**
      * 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)) ||
           (value === undefined && !(key in object))) {
         baseAssignValue(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))) {
         baseAssignValue(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 `_.assignIn` 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 baseAssignIn(object, source) {
       return object && copyObject(source, keysIn(source), object);
     }
 
     /**
      * The base implementation of `assignValue` and `assignMergeValue` without
      * value checks.
      *
      * @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 baseAssignValue(object, key, value) {
       if (key == '__proto__' && defineProperty) {
         defineProperty(object, key, {
           'configurable': true,
           'enumerable': true,
           'value': value,
           'writable': true
         });
       } else {
         object[key] = value;
       }
     }
 
     /**
      * 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 to pick.
      * @returns {Array} Returns the picked elements.
      */
     function baseAt(object, paths) {
       var index = -1,
           length = paths.length,
           result = Array(length),
           skip = object == null;
 
       while (++index < length) {
         result[index] = skip ? 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} bitmask The bitmask flags.
      *  1 - Deep clone
      *  2 - Flatten inherited properties
      *  4 - Clone 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, bitmask, customizer, key, object, stack) {
       var result,
           isDeep = bitmask & CLONE_DEEP_FLAG,
           isFlat = bitmask & CLONE_FLAT_FLAG,
           isFull = bitmask & CLONE_SYMBOLS_FLAG;
 
       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)) {
           result = (isFlat || isFunc) ? {} : initCloneObject(value);
           if (!isDeep) {
             return isFlat
               ? copySymbolsIn(value, baseAssignIn(result, value))
               : copySymbols(value, baseAssign(result, value));
           }
         } else {
           if (!cloneableTags[tag]) {
             return object ? value : {};
           }
           result = initCloneByTag(value, tag, 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 (isSet(value)) {
         value.forEach(function(subValue) {
           result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));
         });
 
         return result;
       }
 
       if (isMap(value)) {
         value.forEach(function(subValue, key) {
           result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));
         });
 
         return result;
       }
 
       var keysFunc = isFull
         ? (isFlat ? getAllKeysIn : getAllKeys)
         : (isFlat ? keysIn : keys);
 
       var props = isArr ? undefined : keysFunc(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, bitmask, 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 `_.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 == null ? value : iteratee(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 = castPath(path, object);
 
       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` without fallbacks for buggy environments.
      *
      * @private
      * @param {*} value The value to query.
      * @returns {string} Returns the `toStringTag`.
      */
     function baseGetTag(value) {
       if (value == null) {
         return value === undefined ? undefinedTag : nullTag;
       }
       return (symToStringTag && symToStringTag in Object(value))
         ? getRawTag(value)
         : objectToString(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) {
       path = castPath(path, object);
       object = parent(object, path);
       var func = object == null ? object : object[toKey(last(path))];
       return func == null ? undefined : apply(func, object, args);
     }
 
     /**
      * The base implementation of `_.isArguments`.
      *
      * @private
      * @param {*} value The value to check.
      * @returns {boolean} Returns `true` if `value` is an `arguments` object,
      */
     function baseIsArguments(value) {
       return isObjectLike(value) && baseGetTag(value) == argsTag;
     }
 
     /**
      * 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) && baseGetTag(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) && baseGetTag(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 {boolean} bitmask The bitmask flags.
      *  1 - Unordered comparison
      *  2 - Partial comparison
      * @param {Function} [customizer] The function to customize comparisons.
      * @param {Object} [stack] Tracks traversed `value` and `other` objects.
      * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
      */
     function baseIsEqual(value, other, bitmask, customizer, stack) {
       if (value === other) {
         return true;
       }
       if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {
         return value !== value && other !== other;
       }
       return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, 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 {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
      * @param {Function} customizer The function to customize comparisons.
      * @param {Function} equalFunc The function to determine equivalents of values.
      * @param {Object} [stack] Tracks traversed `object` and `other` objects.
      * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
      */
     function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {
       var objIsArr = isArray(object),
           othIsArr = isArray(other),
           objTag = objIsArr ? arrayTag : getTag(object),
           othTag = othIsArr ? arrayTag : getTag(other);
 
       objTag = objTag == argsTag ? objectTag : objTag;
       othTag = othTag == argsTag ? objectTag : othTag;
 
       var objIsObj = objTag == objectTag,
           othIsObj = othTag == objectTag,
           isSameTag = objTag == othTag;
 
       if (isSameTag && isBuffer(object)) {
         if (!isBuffer(other)) {
           return false;
         }
         objIsArr = true;
         objIsObj = false;
       }
       if (isSameTag && !objIsObj) {
         stack || (stack = new Stack);
         return (objIsArr || isTypedArray(object))
           ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)
           : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);
       }
       if (!(bitmask & COMPARE_PARTIAL_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, bitmask, customizer, stack);
         }
       }
       if (!isSameTag) {
         return false;
       }
       stack || (stack = new Stack);
       return equalObjects(object, other, bitmask, customizer, equalFunc, 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, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, 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) ? 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 isObjectLike(value) && baseGetTag(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[baseGetTag(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, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_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;
       }
       baseFor(source, function(srcValue, key) {
         if (isObject(srcValue)) {
           stack || (stack = new Stack);
           baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);
         }
         else {
           var newValue = customizer
             ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)
             : undefined;
 
           if (newValue === undefined) {
             newValue = srcValue;
           }
           assignMergeValue(object, key, newValue);
         }
       }, keysIn);
     }
 
     /**
      * 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 = safeGet(object, key),
           srcValue = safeGet(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) {
         var isArr = isArray(srcValue),
             isBuff = !isArr && isBuffer(srcValue),
             isTyped = !isArr && !isBuff && isTypedArray(srcValue);
 
         newValue = srcValue;
         if (isArr || isBuff || isTyped) {
           if (isArray(objValue)) {
             newValue = objValue;
           }
           else if (isArrayLikeObject(objValue)) {
             newValue = copyArray(objValue);
           }
           else if (isBuff) {
             isCommon = false;
             newValue = cloneBuffer(srcValue, true);
           }
           else if (isTyped) {
             isCommon = false;
             newValue = cloneTypedArray(srcValue, true);
           }
           else {
             newValue = [];
           }
         }
         else if (isPlainObject(srcValue) || isArguments(srcValue)) {
           newValue = objValue;
           if (isArguments(objValue)) {
             newValue = toPlainObject(objValue);
           }
           else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) {
             newValue = initCloneObject(srcValue);
           }
         }
         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[]} paths The property paths to pick.
      * @returns {Object} Returns the new object.
      */
     function basePick(object, paths) {
       return basePickBy(object, paths, function(value, path) {
         return hasIn(object, path);
       });
     }
 
     /**
      * The base implementation of  `_.pickBy` without support for iteratee shorthands.
      *
      * @private
      * @param {Object} object The source object.
      * @param {string[]} paths The property paths to pick.
      * @param {Function} predicate The function invoked per property.
      * @returns {Object} Returns the new object.
      */
     function basePickBy(object, paths, predicate) {
       var index = -1,
           length = paths.length,
           result = {};
 
       while (++index < length) {
         var path = paths[index],
             value = baseGet(object, path);
 
         if (predicate(value, path)) {
           baseSet(result, castPath(path, object), 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 {
             baseUnset(array, 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) {
       return setToString(overRest(func, start, identity), func + '');
     }
 
     /**
      * The base implementation of `_.sample`.
      *
      * @private
      * @param {Array|Object} collection The collection to sample.
      * @returns {*} Returns the random element.
      */
     function baseSample(collection) {
       return arraySample(values(collection));
     }
 
     /**
      * The base implementation of `_.sampleSize` without param guards.
      *
      * @private
      * @param {Array|Object} collection The collection to sample.
      * @param {number} n The number of elements to sample.
      * @returns {Array} Returns the random elements.
      */
     function baseSampleSize(collection, n) {
       var array = values(collection);
       return shuffleSelf(array, baseClamp(n, 0, array.length));
     }
 
     /**
      * 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 = castPath(path, object);
 
       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 shorting.
      *
      * @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 `setToString` without support for hot loop shorting.
      *
      * @private
      * @param {Function} func The function to modify.
      * @param {Function} string The `toString` result.
      * @returns {Function} Returns `func`.
      */
     var baseSetToString = !defineProperty ? identity : function(func, string) {
       return defineProperty(func, 'toString', {
         'configurable': true,
         'enumerable': false,
         'value': constant(string),
         'writable': true
       });
     };
 
     /**
      * The base implementation of `_.shuffle`.
      *
      * @private
      * @param {Array|Object} collection The collection to shuffle.
      * @returns {Array} Returns the new shuffled array.
      */
     function baseShuffle(collection) {
       return shuffleSelf(values(collection));
     }
 
     /**
      * 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 == null ? low : array.length;
 
       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 == null ? 0 : array.length,
           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 (isArray(value)) {
         // Recursively convert values (susceptible to call stack limits).
         return arrayMap(value, baseToString) + '';
       }
       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 property path to unset.
      * @returns {boolean} Returns `true` if the property is deleted, else `false`.
      */
     function baseUnset(object, path) {
       path = castPath(path, object);
       object = parent(object, path);
       return object == null || delete object[toKey(last(path))];
     }
 
     /**
      * 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 length = arrays.length;
       if (length < 2) {
         return length ? baseUniq(arrays[0]) : [];
       }
       var index = -1,
           result = Array(length);
 
       while (++index < length) {
         var array = arrays[index],
             othIndex = -1;
 
         while (++othIndex < length) {
           if (othIndex != index) {
             result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);
           }
         }
       }
       return baseUniq(baseFlatten(result, 1), 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.
      * @param {Object} [object] The object to query keys on.
      * @returns {Array} Returns the cast property path array.
      */
     function castPath(value, object) {
       if (isArray(value)) {
         return value;
       }
       return isKey(value, object) ? [value] : stringToPath(toString(value));
     }
 
     /**
      * A `baseRest` alias which can be replaced with `identity` by module
      * replacement plugins.
      *
      * @private
      * @type {Function}
      * @param {Function} func The function to apply a rest parameter to.
      * @returns {Function} Returns the new function.
      */
     var castRest = baseRest;
 
     /**
      * 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 length = buffer.length,
           result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(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 `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 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) {
       var isNew = !object;
       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;
 
         if (newValue === undefined) {
           newValue = source[key];
         }
         if (isNew) {
           baseAssignValue(object, key, newValue);
         } else {
           assignValue(object, key, newValue);
         }
       }
       return object;
     }
 
     /**
      * Copies own symbols 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);
     }
 
     /**
      * Copies own and inherited symbols 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 copySymbolsIn(source, object) {
       return copyObject(source, getSymbolsIn(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 & WRAP_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 flatRest(function(funcs) {
         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] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_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)) {
             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 & WRAP_ARY_FLAG,
           isBind = bitmask & WRAP_BIND_FLAG,
           isBindKey = bitmask & WRAP_BIND_KEY_FLAG,
           isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),
           isFlip = bitmask & WRAP_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 flatRest(function(iteratees) {
         iteratees = arrayMap(iteratees, 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 & WRAP_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 & WRAP_CURRY_FLAG,
           newHolders = isCurry ? holders : undefined,
           newHoldersRight = isCurry ? undefined : holders,
           newPartials = isCurry ? partials : undefined,
           newPartialsRight = isCurry ? undefined : partials;
 
       bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);
       bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);
 
       if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {
         bitmask &= ~(WRAP_BIND_FLAG | WRAP_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 = precision == null ? 0 : 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.
      *    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 & WRAP_BIND_KEY_FLAG;
       if (!isBindKey && typeof func != 'function') {
         throw new TypeError(FUNC_ERROR_TEXT);
       }
       var length = partials ? partials.length : 0;
       if (!length) {
         bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_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 & WRAP_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] === undefined
         ? (isBindKey ? 0 : func.length)
         : nativeMax(newData[9] - length, 0);
 
       if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {
         bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);
       }
       if (!bitmask || bitmask == WRAP_BIND_FLAG) {
         var result = createBind(func, bitmask, thisArg);
       } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {
         result = createCurry(func, bitmask, arity);
       } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_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);
     }
 
     /**
      * Used by `_.defaults` to customize its `_.assignIn` use to assign properties
      * of source objects to the destination object for all destination properties
      * that resolve to `undefined`.
      *
      * @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 customDefaultsAssignIn(objValue, srcValue, key, object) {
       if (objValue === undefined ||
           (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {
         return srcValue;
       }
       return objValue;
     }
 
     /**
      * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source
      * objects into destination objects that are passed thru.
      *
      * @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 customDefaultsMerge(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, customDefaultsMerge, stack);
         stack['delete'](srcValue);
       }
       return objValue;
     }
 
     /**
      * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain
      * objects.
      *
      * @private
      * @param {*} value The value to inspect.
      * @param {string} key The key of the property to inspect.
      * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.
      */
     function customOmitClone(value) {
       return isPlainObject(value) ? undefined : value;
     }
 
     /**
      * 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 {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
      * @param {Function} customizer The function to customize comparisons.
      * @param {Function} equalFunc The function to determine equivalents of values.
      * @param {Object} stack Tracks traversed `array` and `other` objects.
      * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
      */
     function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {
       var isPartial = bitmask & COMPARE_PARTIAL_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 & COMPARE_UNORDERED_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 (!cacheHas(seen, othIndex) &&
                     (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
                   return seen.push(othIndex);
                 }
               })) {
             result = false;
             break;
           }
         } else if (!(
               arrValue === othValue ||
                 equalFunc(arrValue, othValue, bitmask, customizer, 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 {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
      * @param {Function} customizer The function to customize comparisons.
      * @param {Function} equalFunc The function to determine equivalents of values.
      * @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, bitmask, customizer, equalFunc, 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 & COMPARE_PARTIAL_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 |= COMPARE_UNORDERED_FLAG;
 
           // Recursively compare objects (susceptible to call stack limits).
           stack.set(object, other);
           var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, 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 {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
      * @param {Function} customizer The function to customize comparisons.
      * @param {Function} equalFunc The function to determine equivalents of values.
      * @param {Object} stack Tracks traversed `object` and `other` objects.
      * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
      */
     function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {
       var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
           objProps = getAllKeys(object),
           objLength = objProps.length,
           othProps = getAllKeys(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, bitmask, customizer, 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;
     }
 
     /**
      * A specialized version of `baseRest` which flattens the rest array.
      *
      * @private
      * @param {Function} func The function to apply a rest parameter to.
      * @returns {Function} Returns the new function.
      */
     function flatRest(func) {
       return setToString(overRest(func, undefined, flatten), func + '');
     }
 
     /**
      * 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;
     }
 
     /**
      * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.
      *
      * @private
      * @param {*} value The value to query.
      * @returns {string} Returns the raw `toStringTag`.
      */
     function getRawTag(value) {
       var isOwn = hasOwnProperty.call(value, symToStringTag),
           tag = value[symToStringTag];
 
       try {
         value[symToStringTag] = undefined;
         var unmasked = true;
       } catch (e) {}
 
       var result = nativeObjectToString.call(value);
       if (unmasked) {
         if (isOwn) {
           value[symToStringTag] = tag;
         } else {
           delete value[symToStringTag];
         }
       }
       return result;
     }
 
     /**
      * Creates an array of the own enumerable symbols of `object`.
      *
      * @private
      * @param {Object} object The object to query.
      * @returns {Array} Returns the array of symbols.
      */
     var getSymbols = !nativeGetSymbols ? stubArray : function(object) {
       if (object == null) {
         return [];
       }
       object = Object(object);
       return arrayFilter(nativeGetSymbols(object), function(symbol) {
         return propertyIsEnumerable.call(object, symbol);
       });
     };
 
     /**
      * Creates an array of the own and inherited enumerable symbols 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 and promises in Node.js < 6.
     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 = baseGetTag(value),
             Ctor = result == objectTag ? value.constructor : undefined,
             ctorString = Ctor ? toSource(Ctor) : '';
 
         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 = castPath(path, object);
 
       var index = -1,
           length = path.length,
           result = false;
 
       while (++index < length) {
         var key = toKey(path[index]);
         if (!(result = object != null && hasFunc(object, key))) {
           break;
         }
         object = object[key];
       }
       if (result || ++index != length) {
         return result;
       }
       length = object == null ? 0 : object.length;
       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 = new 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`, `Map`, `Number`, `RegExp`, `Set`, or `String`.
      *
      * @private
      * @param {Object} object The object to clone.
      * @param {string} tag The `toStringTag` of the object to clone.
      * @param {boolean} [isDeep] Specify a deep clone.
      * @returns {Object} Returns the initialized clone.
      */
     function initCloneByTag(object, tag, isDeep) {
       var Ctor = object.constructor;
       switch (tag) {
         case arrayBufferTag:
           return 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 new Ctor;
 
         case numberTag:
         case stringTag:
           return new Ctor(object);
 
         case regexpTag:
           return cloneRegExp(object);
 
         case setTag:
           return new Ctor;
 
         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;
       if (!length) {
         return source;
       }
       var 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) {
       var type = typeof value;
       length = length == null ? MAX_SAFE_INTEGER : length;
 
       return !!length &&
         (type == 'number' ||
           (type != 'symbol' && 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)));
       };
     }
 
     /**
      * A specialized version of `_.memoize` which clears the memoized function's
      * cache when it exceeds `MAX_MEMOIZE_SIZE`.
      *
      * @private
      * @param {Function} func The function to have its output memoized.
      * @returns {Function} Returns the new memoized function.
      */
     function memoizeCapped(func) {
       var result = memoize(func, function(key) {
         if (cache.size === MAX_MEMOIZE_SIZE) {
           cache.clear();
         }
         return key;
       });
 
       var cache = result.cache;
       return result;
     }
 
     /**
      * 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 < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);
 
       var isCombo =
         ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||
         ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||
         ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));
 
       // Exit early if metadata can't be merged.
       if (!(isCommon || isCombo)) {
         return data;
       }
       // Use source `thisArg` if available.
       if (srcBitmask & WRAP_BIND_FLAG) {
         data[2] = source[2];
         // Set when currying a bound function.
         newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_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 & WRAP_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;
     }
 
     /**
      * 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;
     }
 
     /**
      * Converts `value` to a string using `Object.prototype.toString`.
      *
      * @private
      * @param {*} value The value to convert.
      * @returns {string} Returns the converted string.
      */
     function objectToString(value) {
       return nativeObjectToString.call(value);
     }
 
     /**
      * A specialized version of `baseRest` which transforms the rest array.
      *
      * @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.
      * @param {Function} transform The rest array transform.
      * @returns {Function} Returns the new function.
      */
     function overRest(func, start, transform) {
       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] = transform(array);
         return apply(func, this, otherArgs);
       };
     }
 
     /**
      * 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 < 2 ? 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 = shortOut(baseSetData);
 
     /**
      * 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 `func` to return `string`.
      *
      * @private
      * @param {Function} func The function to modify.
      * @param {Function} string The `toString` result.
      * @returns {Function} Returns `func`.
      */
     var setToString = shortOut(baseSetToString);
 
     /**
      * 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`.
      */
     function setWrapToString(wrapper, reference, bitmask) {
       var source = (reference + '');
       return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));
     }
 
     /**
      * Creates a function that'll short out and invoke `identity` instead
      * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`
      * milliseconds.
      *
      * @private
      * @param {Function} func The function to restrict.
      * @returns {Function} Returns the new shortable function.
      */
     function shortOut(func) {
       var count = 0,
           lastCalled = 0;
 
       return function() {
         var stamp = nativeNow(),
             remaining = HOT_SPAN - (stamp - lastCalled);
 
         lastCalled = stamp;
         if (remaining > 0) {
           if (++count >= HOT_COUNT) {
             return arguments[0];
           }
         } else {
           count = 0;
         }
         return func.apply(undefined, arguments);
       };
     }
 
     /**
      * A specialized version of `_.shuffle` which mutates and sets the size of `array`.
      *
      * @private
      * @param {Array} array The array to shuffle.
      * @param {number} [size=array.length] The size of `array`.
      * @returns {Array} Returns `array`.
      */
     function shuffleSelf(array, size) {
       var index = -1,
           length = array.length,
           lastIndex = length - 1;
 
       size = size === undefined ? length : size;
       while (++index < size) {
         var rand = baseRandom(index, lastIndex),
             value = array[rand];
 
         array[rand] = array[index];
         array[index] = value;
       }
       array.length = size;
       return array;
     }
 
     /**
      * Converts `string` to a property path array.
      *
      * @private
      * @param {string} string The string to convert.
      * @returns {Array} Returns the property path array.
      */
     var stringToPath = memoizeCapped(function(string) {
       var result = [];
       if (string.charCodeAt(0) === 46 /* . */) {
         result.push('');
       }
       string.replace(rePropName, function(match, number, quote, subString) {
         result.push(quote ? subString.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 convert.
      * @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 == null ? 0 : array.length;
       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 == null ? 0 : array.length,
           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;
       if (!length) {
         return [];
       }
       var args = Array(length - 1),
           array = arguments[0],
           index = length;
 
       while (index--) {
         args[index - 1] = arguments[index];
       }
       return 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 and references of result values are
      * determined by 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. The order and references of result values are
      * determined by 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`. The order and
      * references of result values are determined by 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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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 == null ? 0 : pairs.length,
           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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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 and references of result values are
      * determined by 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. The order and references of result values are
      * determined by 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`. The order and references
      * of result values are determined by 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);
 
       comparator = typeof comparator == 'function' ? comparator : undefined;
       if (comparator) {
         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 == null ? '' : 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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       if (!length) {
         return -1;
       }
       var index = length;
       if (fromIndex !== undefined) {
         index = toInteger(fromIndex);
         index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);
       }
       return value === value
         ? strictLastIndexOf(array, value, index)
         : baseFindIndex(array, baseIsNaN, index, true);
     }
 
     /**
      * 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 = flatRest(function(array, indexes) {
       var length = array == null ? 0 : array.length,
           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 == null ? array : nativeReverse.call(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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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 == null ? 0 : array.length;
       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);
       comparator = typeof comparator == 'function' ? 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. The order of result values is determined by the order they occur
      * in the array.
      *
      * @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 order of result values is determined by the
      * order they occur in the array. 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 order of result values is
      * determined by the order they occur in the 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) {
       comparator = typeof comparator == 'function' ? comparator : undefined;
       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 order of result values is determined
      * by the order they occur in the arrays. 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 order of result values is
      * determined by the order they occur in the 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);
       comparator = typeof comparator == 'function' ? 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 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 = flatRest(function(paths) {
       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) {
       if (hasOwnProperty.call(result, key)) {
         ++result[key];
       } else {
         baseAssignValue(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
      *
      * _.forEach([1, 2], 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 {
         baseAssignValue(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',
           result = isArrayLike(collection) ? Array(collection.length) : [];
 
       baseEach(collection, function(value) {
         result[++index] = isFunc ? apply(path, 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) {
       baseAssignValue(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 func = isArray(collection) ? arraySample : baseSample;
       return func(collection);
     }
 
     /**
      * 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) {
       if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {
         n = 1;
       } else {
         n = toInteger(n);
       }
       var func = isArray(collection) ? arraySampleSize : baseSampleSize;
       return func(collection, n);
     }
 
     /**
      * 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) {
       var func = isArray(collection) ? arrayShuffle : baseShuffle;
       return func(collection);
     }
 
     /**
      * 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]]
      */
     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, WRAP_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 = WRAP_BIND_FLAG;
       if (partials.length) {
         var holders = replaceHolders(partials, getHolder(bind));
         bitmask |= WRAP_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 = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;
       if (partials.length) {
         var holders = replaceHolders(partials, getHolder(bindKey));
         bitmask |= WRAP_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, WRAP_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, WRAP_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,
             timeWaiting = wait - timeSinceLastCall;
 
         return maxing
           ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)
           : timeWaiting;
       }
 
       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 millisecond.
      */
     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, WRAP_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 `clear`, `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 != null && 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) || cache;
         return result;
       };
       memoized.cache = new (memoize.Cache || MapCache);
       return memoized;
     }
 
     // Expose `MapCache`.
     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 = castRest(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, WRAP_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, WRAP_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 = flatRest(function(func, indexes) {
       return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);
     });
 
     /**
      * Creates a function that invokes `func` with the `this` binding of the
      * created function and arguments from `start` and beyond provided as
      * an array.
      *
      * **Note:** This method is based on the
      * [rest parameter](https://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 == null ? 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, &amp; pebbles</p>'
      */
     function wrap(value, wrapper) {
       return partial(castFunction(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, CLONE_SYMBOLS_FLAG);
     }
 
     /**
      * 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) {
       customizer = typeof customizer == 'function' ? customizer : undefined;
       return baseClone(value, CLONE_SYMBOLS_FLAG, 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, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);
     }
 
     /**
      * 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) {
       customizer = typeof customizer == 'function' ? customizer : undefined;
       return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, 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
      */
     var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {
       return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&
         !propertyIsEnumerable.call(value, 'callee');
     };
 
     /**
      * 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) && baseGetTag(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 isObjectLike(value) && value.nodeType === 1 && !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 (value == null) {
         return true;
       }
       if (isArrayLike(value) &&
           (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||
             isBuffer(value) || isTypedArray(value) || isArguments(value))) {
         return !value.length;
       }
       var tag = getTag(value);
       if (tag == mapTag || tag == setTag) {
         return !value.size;
       }
       if (isPrototype(value)) {
         return !baseKeys(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 compared by strict equality, i.e. `===`.
      *
      * @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, undefined, 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;
       }
       var tag = baseGetTag(value);
       return tag == errorTag || tag == domExcTag ||
         (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));
     }
 
     /**
      * 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) {
       if (!isObject(value)) {
         return false;
       }
       // The use of `Object#toString` avoids issues with the `typeof` operator
       // in Safari 9 which returns 'object' for typed arrays and other constructors.
       var tag = baseGetTag(value);
       return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;
     }
 
     /**
      * 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 != null && (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 != null && 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(CORE_ERROR_TEXT);
       }
       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) && baseGetTag(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) || baseGetTag(value) != objectTag) {
         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) && baseGetTag(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) && baseGetTag(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) && baseGetTag(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 (symIterator && value[symIterator]) {
         return iteratorToArray(value[symIterator]());
       }
       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 value
         ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)
         : (value === 0 ? value : 0);
     }
 
     /**
      * 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 convert.
      * @returns {string} Returns the converted 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 (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 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 = flatRest(baseAt);
 
     /**
      * 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 == null ? result : baseAssign(result, properties);
     }
 
     /**
      * 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(object, sources) {
       object = Object(object);
 
       var index = -1;
       var length = sources.length;
       var guard = length > 2 ? sources[2] : undefined;
 
       if (guard && isIterateeCall(sources[0], sources[1], guard)) {
         length = 1;
       }
 
       while (++index < length) {
         var source = sources[index];
         var props = keysIn(source);
         var propsIndex = -1;
         var propsLength = props.length;
 
         while (++propsIndex < propsLength) {
           var key = props[propsIndex];
           var value = object[key];
 
           if (value === undefined ||
               (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {
             object[key] = source[key];
           }
         }
       }
 
       return object;
     });
 
     /**
      * 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, customDefaultsMerge);
       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) {
       if (value != null &&
           typeof value.toString != 'function') {
         value = nativeObjectToString.call(value);
       }
 
       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 (value != null &&
           typeof value.toString != 'function') {
         value = nativeObjectToString.call(value);
       }
 
       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) {
         baseAssignValue(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) {
         baseAssignValue(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 six 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 property paths of `object` that are not omitted.
      *
      * **Note:** This method is considerably slower than `_.pick`.
      *
      * @static
      * @since 0.1.0
      * @memberOf _
      * @category Object
      * @param {Object} object The source object.
      * @param {...(string|string[])} [paths] The property paths 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 = flatRest(function(object, paths) {
       var result = {};
       if (object == null) {
         return result;
       }
       var isDeep = false;
       paths = arrayMap(paths, function(path) {
         path = castPath(path, object);
         isDeep || (isDeep = path.length > 1);
         return path;
       });
       copyObject(object, getAllKeysIn(object), result);
       if (isDeep) {
         result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);
       }
       var length = paths.length;
       while (length--) {
         baseUnset(result, paths[length]);
       }
       return result;
     });
 
     /**
      * 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[])} [paths] The property paths 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 = flatRest(function(object, paths) {
       return object == null ? {} : basePick(object, paths);
     });
 
     /**
      * 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) {
       if (object == null) {
         return {};
       }
       var props = arrayMap(getAllKeysIn(object), function(prop) {
         return [prop];
       });
       predicate = getIteratee(predicate);
       return basePickBy(object, props, function(value, path) {
         return predicate(value, path[0]);
       });
     }
 
     /**
      * 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 = castPath(path, object);
 
       var index = -1,
           length = path.length;
 
       // Ensure the loop is entered when path is empty.
       if (!length) {
         length = 1;
         object = undefined;
       }
       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),
           isArrLike = isArr || isBuffer(object) || isTypedArray(object);
 
       iteratee = getIteratee(iteratee, 4);
       if (accumulator == null) {
         var Ctor = object && object.constructor;
         if (isArrLike) {
           accumulator = isArr ? new Ctor : [];
         }
         else if (isObject(object)) {
           accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};
         }
         else {
           accumulator = {};
         }
       }
       (isArrLike ? 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 == null ? [] : 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.
      *
      * 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, &amp; 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) {
       if (guard || radix == null) {
         radix = 0;
       } else if (radix) {
         radix = +radix;
       }
       return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);
     }
 
     /**
      * 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 = position == null
         ? 0
         : 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>&lt;script&gt;</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 template literal delimiter as an "interpolate" delimiter.
      * // Disable support by replacing the "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, customDefaultsAssignIn);
 
       var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),
           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
      * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` 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, &amp; 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 = flatRest(function(object, methodNames) {
       arrayEach(methodNames, function(key) {
         key = toKey(key);
         baseAssignValue(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 == null ? 0 : pairs.length,
           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, CLONE_DEEP_FLAG));
     }
 
     /**
      * 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, CLONE_DEEP_FLAG));
     }
 
     /**
      * 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, CLONE_DEEP_FLAG));
     }
 
     /**
      * 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, CLONE_DEEP_FLAG));
     }
 
     /**
      * 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(toString(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) {
         n = n === undefined ? 1 : nativeMax(toInteger(n), 0);
 
         var result = (this.__filtered__ && !index)
           ? new LazyWrapper(this)
           : this.clone();
 
         if (result.__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, WRAP_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 (symIterator) {
       lodash.prototype[symIterator] = wrapperToIterator;
     }
     return lodash;
   });
 
   /*--------------------------------------------------------------------------*/
 
   // Export lodash.
   var _ = runInContext();
 
   // Some AMD build optimizers, like r.js, check for condition patterns like:
   if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {
     // 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.
     define(function() {
       return _;
     });
   }
   // 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));
 
 }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
 },{}],14:[function(require,module,exports){
 /**
  * Helpers.
  */
 
 var s = 1000;
 var m = s * 60;
 var h = m * 60;
 var d = h * 24;
 var y = d * 365.25;
 
 /**
  * Parse or format the given `val`.
  *
  * Options:
  *
  *  - `long` verbose formatting [false]
  *
  * @param {String|Number} val
  * @param {Object} [options]
  * @throws {Error} throw an error if val is not a non-empty string or a number
  * @return {String|Number}
  * @api public
  */
 
 module.exports = function(val, options) {
   options = options || {};
   var type = typeof val;
   if (type === 'string' && val.length > 0) {
     return parse(val);
   } else if (type === 'number' && isNaN(val) === false) {
     return options.long ? fmtLong(val) : fmtShort(val);
   }
   throw new Error(
     'val is not a non-empty string or a valid number. val=' +
       JSON.stringify(val)
   );
 };
 
 /**
  * Parse the given `str` and return milliseconds.
  *
  * @param {String} str
  * @return {Number}
  * @api private
  */
 
 function parse(str) {
   str = String(str);
   if (str.length > 100) {
     return;
   }
   var match = /^((?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|years?|yrs?|y)?$/i.exec(
     str
   );
   if (!match) {
     return;
   }
   var n = parseFloat(match[1]);
   var type = (match[2] || 'ms').toLowerCase();
   switch (type) {
     case 'years':
     case 'year':
     case 'yrs':
     case 'yr':
     case 'y':
       return n * y;
     case 'days':
     case 'day':
     case 'd':
       return n * d;
     case 'hours':
     case 'hour':
     case 'hrs':
     case 'hr':
     case 'h':
       return n * h;
     case 'minutes':
     case 'minute':
     case 'mins':
     case 'min':
     case 'm':
       return n * m;
     case 'seconds':
     case 'second':
     case 'secs':
     case 'sec':
     case 's':
       return n * s;
     case 'milliseconds':
     case 'millisecond':
     case 'msecs':
     case 'msec':
     case 'ms':
       return n;
     default:
       return undefined;
   }
 }
 
 /**
  * Short format for `ms`.
  *
  * @param {Number} ms
  * @return {String}
  * @api private
  */
 
 function fmtShort(ms) {
   if (ms >= d) {
     return Math.round(ms / d) + 'd';
   }
   if (ms >= h) {
     return Math.round(ms / h) + 'h';
   }
   if (ms >= m) {
     return Math.round(ms / m) + 'm';
   }
   if (ms >= s) {
     return Math.round(ms / s) + 's';
   }
   return ms + 'ms';
 }
 
 /**
  * Long format for `ms`.
  *
  * @param {Number} ms
  * @return {String}
  * @api private
  */
 
 function fmtLong(ms) {
   return plural(ms, d, 'day') ||
     plural(ms, h, 'hour') ||
     plural(ms, m, 'minute') ||
     plural(ms, s, 'second') ||
     ms + ' ms';
 }
 
 /**
  * Pluralization helper.
  */
 
 function plural(ms, n, name) {
   if (ms < n) {
     return;
   }
   if (ms < n * 1.5) {
     return Math.floor(ms / n) + ' ' + name;
   }
   return Math.ceil(ms / n) + ' ' + name + 's';
 }
 
 },{}],15:[function(require,module,exports){
 assert.notEqual = notEqual
 assert.notOk = notOk
 assert.equal = equal
 assert.ok = assert
 
 module.exports = assert
 
 function equal (a, b, m) {
   assert(a == b, m) // eslint-disable-line eqeqeq
 }
 
 function notEqual (a, b, m) {
   assert(a != b, m) // eslint-disable-line eqeqeq
 }
 
 function notOk (t, m) {
   assert(!t, m)
 }
 
 function assert (t, m) {
   if (!t) throw new Error(m || 'AssertionError')
 }
 
 },{}],16:[function(require,module,exports){
 var splice = require('remove-array-items')
 var nanotiming = require('nanotiming')
 var assert = require('assert')
 
 module.exports = Nanobus
 
 function Nanobus (name) {
   if (!(this instanceof Nanobus)) return new Nanobus(name)
 
   this._name = name || 'nanobus'
   this._starListeners = []
   this._listeners = {}
 }
 
 Nanobus.prototype.emit = function (eventName) {
   assert.equal(typeof eventName, 'string', 'nanobus.emit: eventName should be type string')
 
   var data = []
   for (var i = 1, len = arguments.length; i < len; i++) {
     data.push(arguments[i])
   }
 
   var emitTiming = nanotiming(this._name + "('" + eventName + "')")
   var listeners = this._listeners[eventName]
   if (listeners && listeners.length > 0) {
     this._emit(this._listeners[eventName], data)
   }
 
   if (this._starListeners.length > 0) {
     this._emit(this._starListeners, eventName, data, emitTiming.uuid)
   }
   emitTiming()
 
   return this
 }
 
 Nanobus.prototype.on = Nanobus.prototype.addListener = function (eventName, listener) {
   assert.equal(typeof eventName, 'string', 'nanobus.on: eventName should be type string')
   assert.equal(typeof listener, 'function', 'nanobus.on: listener should be type function')
 
   if (eventName === '*') {
     this._starListeners.push(listener)
   } else {
     if (!this._listeners[eventName]) this._listeners[eventName] = []
     this._listeners[eventName].push(listener)
   }
   return this
 }
 
 Nanobus.prototype.prependListener = function (eventName, listener) {
   assert.equal(typeof eventName, 'string', 'nanobus.prependListener: eventName should be type string')
   assert.equal(typeof listener, 'function', 'nanobus.prependListener: listener should be type function')
 
   if (eventName === '*') {
     this._starListeners.unshift(listener)
   } else {
     if (!this._listeners[eventName]) this._listeners[eventName] = []
     this._listeners[eventName].unshift(listener)
   }
   return this
 }
 
 Nanobus.prototype.once = function (eventName, listener) {
   assert.equal(typeof eventName, 'string', 'nanobus.once: eventName should be type string')
   assert.equal(typeof listener, 'function', 'nanobus.once: listener should be type function')
 
   var self = this
   this.on(eventName, once)
   function once () {
     listener.apply(self, arguments)
     self.removeListener(eventName, once)
   }
   return this
 }
 
 Nanobus.prototype.prependOnceListener = function (eventName, listener) {
   assert.equal(typeof eventName, 'string', 'nanobus.prependOnceListener: eventName should be type string')
   assert.equal(typeof listener, 'function', 'nanobus.prependOnceListener: listener should be type function')
 
   var self = this
   this.prependListener(eventName, once)
   function once () {
     listener.apply(self, arguments)
     self.removeListener(eventName, once)
   }
   return this
 }
 
 Nanobus.prototype.removeListener = function (eventName, listener) {
   assert.equal(typeof eventName, 'string', 'nanobus.removeListener: eventName should be type string')
   assert.equal(typeof listener, 'function', 'nanobus.removeListener: listener should be type function')
 
   if (eventName === '*') {
     this._starListeners = this._starListeners.slice()
     return remove(this._starListeners, listener)
   } else {
     if (typeof this._listeners[eventName] !== 'undefined') {
       this._listeners[eventName] = this._listeners[eventName].slice()
     }
 
     return remove(this._listeners[eventName], listener)
   }
 
   function remove (arr, listener) {
     if (!arr) return
     var index = arr.indexOf(listener)
     if (index !== -1) {
       splice(arr, index, 1)
       return true
     }
   }
 }
 
 Nanobus.prototype.removeAllListeners = function (eventName) {
   if (eventName) {
     if (eventName === '*') {
       this._starListeners = []
     } else {
       this._listeners[eventName] = []
     }
   } else {
     this._starListeners = []
     this._listeners = {}
   }
   return this
 }
 
 Nanobus.prototype.listeners = function (eventName) {
   var listeners = eventName !== '*'
     ? this._listeners[eventName]
     : this._starListeners
 
   var ret = []
   if (listeners) {
     var ilength = listeners.length
     for (var i = 0; i < ilength; i++) ret.push(listeners[i])
   }
   return ret
 }
 
 Nanobus.prototype._emit = function (arr, eventName, data, uuid) {
   if (typeof arr === 'undefined') return
   if (arr.length === 0) return
   if (data === undefined) {
     data = eventName
     eventName = null
   }
 
   if (eventName) {
     if (uuid !== undefined) {
       data = [eventName].concat(data, uuid)
     } else {
       data = [eventName].concat(data)
     }
   }
 
   var length = arr.length
   for (var i = 0; i < length; i++) {
     var listener = arr[i]
     listener.apply(listener, data)
   }
 }
 
 },{"assert":2,"nanotiming":32,"remove-array-items":35}],17:[function(require,module,exports){
 var document = require('global/document')
 var nanotiming = require('nanotiming')
 var morph = require('nanomorph')
 var onload = require('on-load')
 var OL_KEY_ID = onload.KEY_ID
 var OL_ATTR_ID = onload.KEY_ATTR
 var assert = require('assert')
 
 module.exports = Nanocomponent
 
 function makeID () {
   return 'ncid-' + Math.floor((1 + Math.random()) * 0x10000).toString(16).substring(1)
 }
 
 function Nanocomponent (name) {
   this._hasWindow = typeof window !== 'undefined'
   this._id = null // represents the id of the root node
   this._ncID = null // internal nanocomponent id
   this._olID = null
   this._proxy = null
   this._loaded = false // Used to debounce on-load when child-reordering
   this._rootNodeName = null
   this._name = name || 'nanocomponent'
   this._rerender = false
 
   this._handleLoad = this._handleLoad.bind(this)
   this._handleUnload = this._handleUnload.bind(this)
 
   this._arguments = []
 
   var self = this
 
   Object.defineProperty(this, 'element', {
     get: function () {
       var el = document.getElementById(self._id)
       if (el) return el.dataset.nanocomponent === self._ncID ? el : undefined
     }
   })
 }
 
 Nanocomponent.prototype.render = function () {
   var renderTiming = nanotiming(this._name + '.render')
   var self = this
   var args = new Array(arguments.length)
   var el
   for (var i = 0; i < arguments.length; i++) args[i] = arguments[i]
   if (!this._hasWindow) {
     var createTiming = nanotiming(this._name + '.create')
     el = this.createElement.apply(this, args)
     createTiming()
     renderTiming()
     return el
   } else if (this.element) {
     el = this.element // retain reference, as the ID might change on render
     var updateTiming = nanotiming(this._name + '.update')
     var shouldUpdate = this._rerender || this.update.apply(this, args)
     updateTiming()
     if (this._rerender) this._rerender = false
     if (shouldUpdate) {
       var desiredHtml = this._handleRender(args)
       var morphTiming = nanotiming(this._name + '.morph')
       morph(el, desiredHtml)
       morphTiming()
       if (this.afterupdate) this.afterupdate(el)
     }
     if (!this._proxy) { this._proxy = this._createProxy() }
     renderTiming()
     return this._proxy
   } else {
     this._reset()
     el = this._handleRender(args)
     if (this.beforerender) this.beforerender(el)
     if (this.load || this.unload || this.afterreorder) {
       onload(el, self._handleLoad, self._handleUnload, self._ncID)
       this._olID = el.dataset[OL_KEY_ID]
     }
     renderTiming()
     return el
   }
 }
 
 Nanocomponent.prototype.rerender = function () {
   assert(this.element, 'nanocomponent: cant rerender on an unmounted dom node')
   this._rerender = true
   this.render.apply(this, this._arguments)
 }
 
 Nanocomponent.prototype._handleRender = function (args) {
   var createElementTiming = nanotiming(this._name + '.createElement')
   var el = this.createElement.apply(this, args)
   createElementTiming()
   if (!this._rootNodeName) this._rootNodeName = el.nodeName
   assert(el instanceof window.Element, 'nanocomponent: createElement should return a DOM node')
   assert.equal(this._rootNodeName, el.nodeName, 'nanocomponent: root node types cannot differ between re-renders')
   this._arguments = args
   return this._brandNode(this._ensureID(el))
 }
 
 Nanocomponent.prototype._createProxy = function () {
   var proxy = document.createElement(this._rootNodeName)
   var self = this
   this._brandNode(proxy)
   proxy.id = this._id
   proxy.setAttribute('data-proxy', '')
   proxy.isSameNode = function (el) {
     return (el && el.dataset.nanocomponent === self._ncID)
   }
   return proxy
 }
 
 Nanocomponent.prototype._reset = function () {
   this._ncID = makeID()
   this._olID = null
   this._id = null
   this._proxy = null
   this._rootNodeName = null
 }
 
 Nanocomponent.prototype._brandNode = function (node) {
   node.setAttribute('data-nanocomponent', this._ncID)
   if (this._olID) node.setAttribute(OL_ATTR_ID, this._olID)
   return node
 }
 
 Nanocomponent.prototype._ensureID = function (node) {
   if (node.id) this._id = node.id
   else node.id = this._id = this._ncID
   // Update proxy node ID if it changed
   if (this._proxy && this._proxy.id !== this._id) this._proxy.id = this._id
   return node
 }
 
 Nanocomponent.prototype._handleLoad = function (el) {
   if (this._loaded) {
     if (this.afterreorder) this.afterreorder(el)
     return // Debounce child-reorders
   }
   this._loaded = true
   if (this.load) this.load(el)
 }
 
 Nanocomponent.prototype._handleUnload = function (el) {
   if (this.element) return // Debounce child-reorders
   this._loaded = false
   if (this.unload) this.unload(el)
 }
 
 Nanocomponent.prototype.createElement = function () {
   throw new Error('nanocomponent: createElement should be implemented!')
 }
 
 Nanocomponent.prototype.update = function () {
   throw new Error('nanocomponent: update should be implemented!')
 }
 
 },{"assert":15,"global/document":6,"nanomorph":24,"nanotiming":32,"on-load":33}],18:[function(require,module,exports){
 var trailingNewlineRegex = /\n[\s]+$/
 var leadingNewlineRegex = /^\n[\s]+/
 var trailingSpaceRegex = /[\s]+$/
 var leadingSpaceRegex = /^[\s]+/
 var multiSpaceRegex = /[\n\s]+/g
 
 var TEXT_TAGS = [
   'a', 'abbr', 'b', 'bdi', 'bdo', 'br', 'cite', 'data', 'dfn', 'em', 'i',
   'kbd', 'mark', 'q', 'rp', 'rt', 'rtc', 'ruby', 's', 'amp', 'small', 'span',
   'strong', 'sub', 'sup', 'time', 'u', 'var', 'wbr'
 ]
 
 var VERBATIM_TAGS = [
   'code', 'pre', 'textarea'
 ]
 
 module.exports = function appendChild (el, childs) {
   if (!Array.isArray(childs)) return
 
   var nodeName = el.nodeName.toLowerCase()
 
   var hadText = false
   var value, leader
 
   for (var i = 0, len = childs.length; i < len; i++) {
     var node = childs[i]
     if (Array.isArray(node)) {
       appendChild(el, node)
       continue
     }
 
     if (typeof node === 'number' ||
       typeof node === 'boolean' ||
       typeof node === 'function' ||
       node instanceof Date ||
       node instanceof RegExp) {
       node = node.toString()
     }
 
     var lastChild = el.childNodes[el.childNodes.length - 1]
 
     // Iterate over text nodes
     if (typeof node === 'string') {
       hadText = true
 
       // If we already had text, append to the existing text
       if (lastChild && lastChild.nodeName === '#text') {
         lastChild.nodeValue += node
 
       // We didn't have a text node yet, create one
       } else {
         node = document.createTextNode(node)
         el.appendChild(node)
         lastChild = node
       }
 
       // If this is the last of the child nodes, make sure we close it out
       // right
       if (i === len - 1) {
         hadText = false
         // Trim the child text nodes if the current node isn't a
         // node where whitespace matters.
         if (TEXT_TAGS.indexOf(nodeName) === -1 &&
           VERBATIM_TAGS.indexOf(nodeName) === -1) {
           value = lastChild.nodeValue
             .replace(leadingNewlineRegex, '')
             .replace(trailingSpaceRegex, '')
             .replace(trailingNewlineRegex, '')
             .replace(multiSpaceRegex, ' ')
           if (value === '') {
             el.removeChild(lastChild)
           } else {
             lastChild.nodeValue = value
           }
         } else if (VERBATIM_TAGS.indexOf(nodeName) === -1) {
           // The very first node in the list should not have leading
           // whitespace. Sibling text nodes should have whitespace if there
           // was any.
           leader = i === 0 ? '' : ' '
           value = lastChild.nodeValue
             .replace(leadingNewlineRegex, leader)
             .replace(leadingSpaceRegex, ' ')
             .replace(trailingSpaceRegex, '')
             .replace(trailingNewlineRegex, '')
             .replace(multiSpaceRegex, ' ')
           lastChild.nodeValue = value
         }
       }
 
     // Iterate over DOM nodes
     } else if (node && node.nodeType) {
       // If the last node was a text node, make sure it is properly closed out
       if (hadText) {
         hadText = false
 
         // Trim the child text nodes if the current node isn't a
         // text node or a code node
         if (TEXT_TAGS.indexOf(nodeName) === -1 &&
           VERBATIM_TAGS.indexOf(nodeName) === -1) {
           value = lastChild.nodeValue
             .replace(leadingNewlineRegex, '')
             .replace(trailingNewlineRegex, '')
             .replace(multiSpaceRegex, ' ')
 
           // Remove empty text nodes, append otherwise
           if (value === '') {
             el.removeChild(lastChild)
           } else {
             lastChild.nodeValue = value
           }
         // Trim the child nodes if the current node is not a node
         // where all whitespace must be preserved
         } else if (VERBATIM_TAGS.indexOf(nodeName) === -1) {
           value = lastChild.nodeValue
             .replace(leadingSpaceRegex, ' ')
             .replace(leadingNewlineRegex, '')
             .replace(trailingNewlineRegex, '')
             .replace(multiSpaceRegex, ' ')
           lastChild.nodeValue = value
         }
       }
 
       // Store the last nodename
       var _nodeName = node.nodeName
       if (_nodeName) nodeName = _nodeName.toLowerCase()
 
       // Append the node to the DOM
       el.appendChild(node)
     }
   }
 }
 
 },{}],19:[function(require,module,exports){
 module.exports = [
   'autofocus', 'checked', 'defaultchecked', 'disabled', 'formnovalidate',
   'indeterminate', 'readonly', 'required', 'selected', 'willvalidate'
 ]
 
 },{}],20:[function(require,module,exports){
 var hyperx = require('hyperx')
 var appendChild = require('./append-child')
 var SVG_TAGS = require('./svg-tags')
 var BOOL_PROPS = require('./bool-props')
 // Props that need to be set directly rather than with el.setAttribute()
 var DIRECT_PROPS = require('./direct-props')
 
 var SVGNS = 'http://www.w3.org/2000/svg'
 var XLINKNS = 'http://www.w3.org/1999/xlink'
 
 var COMMENT_TAG = '!--'
 
 function nanoHtmlCreateElement (tag, props, children) {
   var el
 
   // If an svg tag, it needs a namespace
   if (SVG_TAGS.indexOf(tag) !== -1) {
     props.namespace = SVGNS
   }
 
   // If we are using a namespace
   var ns = false
   if (props.namespace) {
     ns = props.namespace
     delete props.namespace
   }
 
   // Create the element
   if (ns) {
     el = document.createElementNS(ns, tag)
   } else if (tag === COMMENT_TAG) {
     return document.createComment(props.comment)
   } else {
     el = document.createElement(tag)
   }
 
   // Create the properties
   for (var p in props) {
     if (props.hasOwnProperty(p)) {
       var key = p.toLowerCase()
       var val = props[p]
       // Normalize className
       if (key === 'classname') {
         key = 'class'
         p = 'class'
       }
       // The for attribute gets transformed to htmlFor, but we just set as for
       if (p === 'htmlFor') {
         p = 'for'
       }
       // If a property is boolean, set itself to the key
       if (BOOL_PROPS.indexOf(key) !== -1) {
         if (val === 'true') val = key
         else if (val === 'false') continue
       }
       // If a property prefers being set directly vs setAttribute
       if (key.slice(0, 2) === 'on' || DIRECT_PROPS.indexOf(key) !== -1) {
         el[p] = val
       } else {
         if (ns) {
           if (p === 'xlink:href') {
             el.setAttributeNS(XLINKNS, p, val)
           } else if (/^xmlns($|:)/i.test(p)) {
             // skip xmlns definitions
           } else {
             el.setAttributeNS(null, p, val)
           }
         } else {
           el.setAttribute(p, val)
         }
       }
     }
   }
 
   appendChild(el, children)
   return el
 }
 
 module.exports = hyperx(nanoHtmlCreateElement, {comments: true})
 module.exports.default = module.exports
 module.exports.createElement = nanoHtmlCreateElement
 
 },{"./append-child":18,"./bool-props":19,"./direct-props":21,"./svg-tags":23,"hyperx":11}],21:[function(require,module,exports){
 module.exports = [
   'indeterminate'
 ]
 
 },{}],22:[function(require,module,exports){
 function nanohtmlRawBrowser (tag) {
   var el = document.createElement('div')
   el.innerHTML = tag
   return toArray(el.childNodes)
 }
 
 function toArray (arr) {
   return Array.isArray(arr) ? arr : [].slice.call(arr)
 }
 
 module.exports = nanohtmlRawBrowser
 
 },{}],23:[function(require,module,exports){
 module.exports = [
   'svg', 'altGlyph', 'altGlyphDef', 'altGlyphItem', 'animate', 'animateColor',
   'animateMotion', 'animateTransform', 'circle', 'clipPath', 'color-profile',
   'cursor', 'defs', 'desc', 'ellipse', 'feBlend', 'feColorMatrix',
   'feComponentTransfer', 'feComposite', 'feConvolveMatrix',
   'feDiffuseLighting', 'feDisplacementMap', 'feDistantLight', 'feFlood',
   'feFuncA', 'feFuncB', 'feFuncG', 'feFuncR', 'feGaussianBlur', 'feImage',
   'feMerge', 'feMergeNode', 'feMorphology', 'feOffset', 'fePointLight',
   'feSpecularLighting', 'feSpotLight', 'feTile', 'feTurbulence', 'filter',
   'font', 'font-face', 'font-face-format', 'font-face-name', 'font-face-src',
   'font-face-uri', 'foreignObject', 'g', 'glyph', 'glyphRef', 'hkern', 'image',
   'line', 'linearGradient', 'marker', 'mask', 'metadata', 'missing-glyph',
   'mpath', 'path', 'pattern', 'polygon', 'polyline', 'radialGradient', 'rect',
   'set', 'stop', 'switch', 'symbol', 'text', 'textPath', 'title', 'tref',
   'tspan', 'use', 'view', 'vkern'
 ]
 
 },{}],24:[function(require,module,exports){
 var assert = require('assert')
 var morph = require('./lib/morph')
 
 var TEXT_NODE = 3
 // var DEBUG = false
 
 module.exports = nanomorph
 
 // Morph one tree into another tree
 //
 // no parent
 //   -> same: diff and walk children
 //   -> not same: replace and return
 // old node doesn't exist
 //   -> insert new node
 // new node doesn't exist
 //   -> delete old node
 // nodes are not the same
 //   -> diff nodes and apply patch to old node
 // nodes are the same
 //   -> walk all child nodes and append to old node
 function nanomorph (oldTree, newTree) {
   // if (DEBUG) {
   //   console.log(
   //   'nanomorph\nold\n  %s\nnew\n  %s',
   //   oldTree && oldTree.outerHTML,
   //   newTree && newTree.outerHTML
   // )
   // }
   assert.equal(typeof oldTree, 'object', 'nanomorph: oldTree should be an object')
   assert.equal(typeof newTree, 'object', 'nanomorph: newTree should be an object')
   var tree = walk(newTree, oldTree)
   // if (DEBUG) console.log('=> morphed\n  %s', tree.outerHTML)
   return tree
 }
 
 // Walk and morph a dom tree
 function walk (newNode, oldNode) {
   // if (DEBUG) {
   //   console.log(
   //   'walk\nold\n  %s\nnew\n  %s',
   //   oldNode && oldNode.outerHTML,
   //   newNode && newNode.outerHTML
   // )
   // }
   if (!oldNode) {
     return newNode
   } else if (!newNode) {
     return null
   } else if (newNode.isSameNode && newNode.isSameNode(oldNode)) {
     return oldNode
   } else if (newNode.tagName !== oldNode.tagName) {
     return newNode
   } else {
     morph(newNode, oldNode)
     updateChildren(newNode, oldNode)
     return oldNode
   }
 }
 
 // Update the children of elements
 // (obj, obj) -> null
 function updateChildren (newNode, oldNode) {
   // if (DEBUG) {
   //   console.log(
   //   'updateChildren\nold\n  %s\nnew\n  %s',
   //   oldNode && oldNode.outerHTML,
   //   newNode && newNode.outerHTML
   // )
   // }
   var oldChild, newChild, morphed, oldMatch
 
   // The offset is only ever increased, and used for [i - offset] in the loop
   var offset = 0
 
   for (var i = 0; ; i++) {
     oldChild = oldNode.childNodes[i]
     newChild = newNode.childNodes[i - offset]
     // if (DEBUG) {
     //   console.log(
     //   '===\n- old\n  %s\n- new\n  %s',
     //   oldChild && oldChild.outerHTML,
     //   newChild && newChild.outerHTML
     // )
     // }
     // Both nodes are empty, do nothing
     if (!oldChild && !newChild) {
       break
 
     // There is no new child, remove old
     } else if (!newChild) {
       oldNode.removeChild(oldChild)
       i--
 
     // There is no old child, add new
     } else if (!oldChild) {
       oldNode.appendChild(newChild)
       offset++
 
     // Both nodes are the same, morph
     } else if (same(newChild, oldChild)) {
       morphed = walk(newChild, oldChild)
       if (morphed !== oldChild) {
         oldNode.replaceChild(morphed, oldChild)
         offset++
       }
 
     // Both nodes do not share an ID or a placeholder, try reorder
     } else {
       oldMatch = null
 
       // Try and find a similar node somewhere in the tree
       for (var j = i; j < oldNode.childNodes.length; j++) {
         if (same(oldNode.childNodes[j], newChild)) {
           oldMatch = oldNode.childNodes[j]
           break
         }
       }
 
       // If there was a node with the same ID or placeholder in the old list
       if (oldMatch) {
         morphed = walk(newChild, oldMatch)
         if (morphed !== oldMatch) offset++
         oldNode.insertBefore(morphed, oldChild)
 
       // It's safe to morph two nodes in-place if neither has an ID
       } else if (!newChild.id && !oldChild.id) {
         morphed = walk(newChild, oldChild)
         if (morphed !== oldChild) {
           oldNode.replaceChild(morphed, oldChild)
           offset++
         }
 
       // Insert the node at the index if we couldn't morph or find a matching node
       } else {
         oldNode.insertBefore(newChild, oldChild)
         offset++
       }
     }
   }
 }
 
 function same (a, b) {
   if (a.id) return a.id === b.id
   if (a.isSameNode) return a.isSameNode(b)
   if (a.tagName !== b.tagName) return false
   if (a.type === TEXT_NODE) return a.nodeValue === b.nodeValue
   return false
 }
 
 },{"./lib/morph":26,"assert":15}],25:[function(require,module,exports){
 module.exports = [
   // attribute events (can be set with attributes)
   'onclick',
   'ondblclick',
   'onmousedown',
   'onmouseup',
   'onmouseover',
   'onmousemove',
   'onmouseout',
   'onmouseenter',
   'onmouseleave',
   'ontouchcancel',
   'ontouchend',
   'ontouchmove',
   'ontouchstart',
   'ondragstart',
   'ondrag',
   'ondragenter',
   'ondragleave',
   'ondragover',
   'ondrop',
   'ondragend',
   'onkeydown',
   'onkeypress',
   'onkeyup',
   'onunload',
   'onabort',
   'onerror',
   'onresize',
   'onscroll',
   'onselect',
   'onchange',
   'onsubmit',
   'onreset',
   'onfocus',
   'onblur',
   'oninput',
   // other common events
   'oncontextmenu',
   'onfocusin',
   'onfocusout'
 ]
 
 },{}],26:[function(require,module,exports){
 var events = require('./events')
 var eventsLength = events.length
 
 var ELEMENT_NODE = 1
 var TEXT_NODE = 3
 var COMMENT_NODE = 8
 
 module.exports = morph
 
 // diff elements and apply the resulting patch to the old node
 // (obj, obj) -> null
 function morph (newNode, oldNode) {
   var nodeType = newNode.nodeType
   var nodeName = newNode.nodeName
 
   if (nodeType === ELEMENT_NODE) {
     copyAttrs(newNode, oldNode)
   }
 
   if (nodeType === TEXT_NODE || nodeType === COMMENT_NODE) {
     if (oldNode.nodeValue !== newNode.nodeValue) {
       oldNode.nodeValue = newNode.nodeValue
     }
   }
 
   // Some DOM nodes are weird
   // https://github.com/patrick-steele-idem/morphdom/blob/master/src/specialElHandlers.js
   if (nodeName === 'INPUT') updateInput(newNode, oldNode)
   else if (nodeName === 'OPTION') updateOption(newNode, oldNode)
   else if (nodeName === 'TEXTAREA') updateTextarea(newNode, oldNode)
 
   copyEvents(newNode, oldNode)
 }
 
 function copyAttrs (newNode, oldNode) {
   var oldAttrs = oldNode.attributes
   var newAttrs = newNode.attributes
   var attrNamespaceURI = null
   var attrValue = null
   var fromValue = null
   var attrName = null
   var attr = null
 
   for (var i = newAttrs.length - 1; i >= 0; --i) {
     attr = newAttrs[i]
     attrName = attr.name
     attrNamespaceURI = attr.namespaceURI
     attrValue = attr.value
     if (attrNamespaceURI) {
       attrName = attr.localName || attrName
       fromValue = oldNode.getAttributeNS(attrNamespaceURI, attrName)
       if (fromValue !== attrValue) {
         oldNode.setAttributeNS(attrNamespaceURI, attrName, attrValue)
       }
     } else {
       if (!oldNode.hasAttribute(attrName)) {
         oldNode.setAttribute(attrName, attrValue)
       } else {
         fromValue = oldNode.getAttribute(attrName)
         if (fromValue !== attrValue) {
           // apparently values are always cast to strings, ah well
           if (attrValue === 'null' || attrValue === 'undefined') {
             oldNode.removeAttribute(attrName)
           } else {
             oldNode.setAttribute(attrName, attrValue)
           }
         }
       }
     }
   }
 
   // Remove any extra attributes found on the original DOM element that
   // weren't found on the target element.
   for (var j = oldAttrs.length - 1; j >= 0; --j) {
     attr = oldAttrs[j]
     if (attr.specified !== false) {
       attrName = attr.name
       attrNamespaceURI = attr.namespaceURI
 
       if (attrNamespaceURI) {
         attrName = attr.localName || attrName
         if (!newNode.hasAttributeNS(attrNamespaceURI, attrName)) {
           oldNode.removeAttributeNS(attrNamespaceURI, attrName)
         }
       } else {
         if (!newNode.hasAttributeNS(null, attrName)) {
           oldNode.removeAttribute(attrName)
         }
       }
     }
   }
 }
 
 function copyEvents (newNode, oldNode) {
   for (var i = 0; i < eventsLength; i++) {
     var ev = events[i]
     if (newNode[ev]) {           // if new element has a whitelisted attribute
       oldNode[ev] = newNode[ev]  // update existing element
     } else if (oldNode[ev]) {    // if existing element has it and new one doesnt
       oldNode[ev] = undefined    // remove it from existing element
     }
   }
 }
 
 function updateOption (newNode, oldNode) {
   updateAttribute(newNode, oldNode, 'selected')
 }
 
 // The "value" attribute is special for the <input> element since it sets the
 // initial value. Changing the "value" attribute without changing the "value"
 // property will have no effect since it is only used to the set the initial
 // value. Similar for the "checked" attribute, and "disabled".
 function updateInput (newNode, oldNode) {
   var newValue = newNode.value
   var oldValue = oldNode.value
 
   updateAttribute(newNode, oldNode, 'checked')
   updateAttribute(newNode, oldNode, 'disabled')
 
   if (newValue !== oldValue) {
     oldNode.setAttribute('value', newValue)
     oldNode.value = newValue
   }
 
   if (newValue === 'null') {
     oldNode.value = ''
     oldNode.removeAttribute('value')
   }
 
   if (!newNode.hasAttributeNS(null, 'value')) {
     oldNode.removeAttribute('value')
   } else if (oldNode.type === 'range') {
     // this is so elements like slider move their UI thingy
     oldNode.value = newValue
   }
 }
 
 function updateTextarea (newNode, oldNode) {
   var newValue = newNode.value
   if (newValue !== oldNode.value) {
     oldNode.value = newValue
   }
 
   if (oldNode.firstChild && oldNode.firstChild.nodeValue !== newValue) {
     // Needed for IE. Apparently IE sets the placeholder as the
     // node value and vise versa. This ignores an empty update.
     if (newValue === '' && oldNode.firstChild.nodeValue === oldNode.placeholder) {
       return
     }
 
     oldNode.firstChild.nodeValue = newValue
   }
 }
 
 function updateAttribute (newNode, oldNode, name) {
   if (newNode[name] !== oldNode[name]) {
     oldNode[name] = newNode[name]
     if (newNode[name]) {
       oldNode.setAttribute(name, '')
     } else {
       oldNode.removeAttribute(name)
     }
   }
 }
 
 },{"./events":25}],27:[function(require,module,exports){
 var reg = /([^?=&]+)(=([^&]*))?/g
 var assert = require('assert')
 
 module.exports = qs
 
 function qs (url) {
   assert.equal(typeof url, 'string', 'nanoquery: url should be type string')
 
   var obj = {}
   url.replace(/^.*\?/, '').replace(reg, function (a0, a1, a2, a3) {
     obj[decodeURIComponent(a1)] = decodeURIComponent(a3)
   })
 
   return obj
 }
 
 },{"assert":15}],28:[function(require,module,exports){
 var assert = require('assert')
 var wayfarer = require('wayfarer')
 
 // electron support
 var isLocalFile = (/file:\/\//.test(
   typeof window === 'object' &&
   window.location &&
   window.location.origin
 ))
 
 /* eslint-disable no-useless-escape */
 var electron = '^(file:\/\/|\/)(.*\.html?\/?)?'
 var protocol = '^(http(s)?(:\/\/))?(www\.)?'
 var domain = '[a-zA-Z0-9-_\.]+(:[0-9]{1,5})?(\/{1})?'
 var qs = '[\?].*$'
 /* eslint-enable no-useless-escape */
 
 var stripElectron = new RegExp(electron)
 var prefix = new RegExp(protocol + domain)
 var normalize = new RegExp('#')
 var suffix = new RegExp(qs)
 
 module.exports = Nanorouter
 
 function Nanorouter (opts) {
   if (!(this instanceof Nanorouter)) return new Nanorouter(opts)
   opts = opts || {}
   this.router = wayfarer(opts.default || '/404')
 }
 
 Nanorouter.prototype.on = function (routename, listener) {
   assert.equal(typeof routename, 'string')
   routename = routename.replace(/^[#/]/, '')
   this.router.on(routename, listener)
 }
 
 Nanorouter.prototype.emit = function (routename) {
   assert.equal(typeof routename, 'string')
   routename = pathname(routename, isLocalFile)
   return this.router.emit(routename)
 }
 
 Nanorouter.prototype.match = function (routename) {
   assert.equal(typeof routename, 'string')
   routename = pathname(routename, isLocalFile)
   return this.router.match(routename)
 }
 
 // replace everything in a route but the pathname and hash
 function pathname (routename, isElectron) {
   if (isElectron) routename = routename.replace(stripElectron, '')
   else routename = routename.replace(prefix, '')
   return decodeURI(routename.replace(suffix, '').replace(normalize, '/'))
 }
 
 },{"assert":15,"wayfarer":42}],29:[function(require,module,exports){
 var assert = require('assert')
 
 var hasWindow = typeof window !== 'undefined'
 
 function createScheduler () {
   var scheduler
   if (hasWindow) {
     if (!window._nanoScheduler) window._nanoScheduler = new NanoScheduler(true)
     scheduler = window._nanoScheduler
   } else {
     scheduler = new NanoScheduler()
   }
   return scheduler
 }
 
 function NanoScheduler (hasWindow) {
   this.hasWindow = hasWindow
   this.hasIdle = this.hasWindow && window.requestIdleCallback
   this.method = this.hasIdle ? window.requestIdleCallback.bind(window) : this.setTimeout
   this.scheduled = false
   this.queue = []
 }
 
 NanoScheduler.prototype.push = function (cb) {
   assert.equal(typeof cb, 'function', 'nanoscheduler.push: cb should be type function')
 
   this.queue.push(cb)
   this.schedule()
 }
 
 NanoScheduler.prototype.schedule = function () {
   if (this.scheduled) return
 
   this.scheduled = true
   var self = this
   this.method(function (idleDeadline) {
     var cb
     while (self.queue.length && idleDeadline.timeRemaining() > 0) {
       cb = self.queue.shift()
       cb(idleDeadline)
     }
     self.scheduled = false
     if (self.queue.length) self.schedule()
   })
 }
 
 NanoScheduler.prototype.setTimeout = function (cb) {
   setTimeout(cb, 0, {
     timeRemaining: function () {
       return 1
     }
   })
 }
 
 module.exports = createScheduler
 
 },{"assert":15}],30:[function(require,module,exports){
 var Nanobus = require('nanobus')
 var assert = require('assert')
 var Parallelstate = require('./parallel-state')
 
 module.exports = Nanostate
 
 function Nanostate (initialState, transitions) {
   if (!(this instanceof Nanostate)) return new Nanostate(initialState, transitions)
   assert.equal(typeof initialState, 'string', 'nanostate: initialState should be type string')
   assert.equal(typeof transitions, 'object', 'nanostate: transitions should be type object')
 
   this.transitions = transitions
   this.state = initialState
   this.submachines = {}
   this._submachine = null
 
   Nanobus.call(this)
 }
 
 Nanostate.prototype = Object.create(Nanobus.prototype)
 
 Nanostate.prototype.constructor = Nanostate
 
 Nanostate.prototype.emit = function (eventName) {
   var nextState = this._next(eventName)
   assert.ok(nextState, `nanostate.emit: invalid transition ${this.state} -> ${eventName}`)
 
   if (this._submachine && Object.keys(this.transitions).indexOf(nextState) !== -1) {
     this._unregister()
   }
 
   this.state = nextState
   Nanobus.prototype.emit.call(this, nextState)
 }
 
 Nanostate.prototype.event = function (eventName, machine) {
   this.submachines[eventName] = machine
 }
 
 Nanostate.parallel = function (transitions) {
   return new Parallelstate(transitions)
 }
 
 Nanostate.prototype._unregister = function () {
   if (this._submachine) {
     this._submachine._unregister()
     this._submachine = null
   }
 }
 
 Nanostate.prototype._next = function (eventName) {
   if (this._submachine) {
     var nextState = this._submachine._next(eventName)
     if (nextState) {
       return nextState
     }
   }
 
   var submachine = this.submachines[eventName]
   if (submachine) {
     this._submachine = submachine
     return submachine.state
   }
 
   return this.transitions[this.state][eventName]
 }
 
 },{"./parallel-state":31,"assert":15,"nanobus":16}],31:[function(require,module,exports){
 var Nanobus = require('nanobus')
 var assert = require('assert')
 
 module.exports = Parallelstate
 
 function Parallelstate (transitions) {
   assert.equal(typeof transitions, 'object', 'nanostate: transitions should be type object')
 
   this.scopes = Object.keys(transitions)
   this.transitions = transitions
 
   Object.defineProperty(this, 'state', {
     get: function () {
       return this.scopes.reduce(function (state, scope) {
         state[scope] = transitions[scope].state
         return state
       }, {})
     }
   })
 
   Nanobus.call(this)
 }
 
 Parallelstate.prototype = Object.create(Nanobus.prototype)
 
 Parallelstate.prototype.emit = function (eventName) {
   var hasColon = eventName.indexOf(':') >= 0
   assert.ok(hasColon, `nanostate.emit: invalid transition ${this.state} -> ${eventName}. For parallel nanostate eventName must have a colon ":"`)
 
   var eventNameSplitted = eventName.split(':')
   var scope = eventNameSplitted[0]
   var event = eventNameSplitted[1]
   assert.ok(scope, `nanostate.emit: invalid scope ${scope} for parallel emitting`)
 
   this.transitions[scope].emit(event)
 
   Nanobus.prototype.emit.call(this, eventName)
 }
 
 },{"assert":15,"nanobus":16}],32:[function(require,module,exports){
 var scheduler = require('nanoscheduler')()
 var assert = require('assert')
 
 var perf
 nanotiming.disabled = true
 try {
   perf = window.performance
   nanotiming.disabled = window.localStorage.DISABLE_NANOTIMING === 'true' || !perf.mark
 } catch (e) { }
 
 module.exports = nanotiming
 
 function nanotiming (name) {
   assert.equal(typeof name, 'string', 'nanotiming: name should be type string')
 
   if (nanotiming.disabled) return noop
 
   var uuid = (perf.now() * 10000).toFixed() % Number.MAX_SAFE_INTEGER
   var startName = 'start-' + uuid + '-' + name
   perf.mark(startName)
 
   function end (cb) {
     var endName = 'end-' + uuid + '-' + name
     perf.mark(endName)
 
     scheduler.push(function () {
       var err = null
       try {
         var measureName = name + ' [' + uuid + ']'
         perf.measure(measureName, startName, endName)
         perf.clearMarks(startName)
         perf.clearMarks(endName)
       } catch (e) { err = e }
       if (cb) cb(err, name)
     })
   }
 
   end.uuid = uuid
   return end
 }
 
 function noop (cb) {
   if (cb) {
     scheduler.push(function () {
       cb(new Error('nanotiming: performance API unavailable'))
     })
   }
 }
 
 },{"assert":15,"nanoscheduler":29}],33:[function(require,module,exports){
 /* global MutationObserver */
 var document = require('global/document')
 var window = require('global/window')
 var assert = require('assert')
 var watch = Object.create(null)
 var KEY_ID = 'onloadid' + (new Date() % 9e6).toString(36)
 var KEY_ATTR = 'data-' + KEY_ID
 var INDEX = 0
 
 if (window && window.MutationObserver) {
   var observer = new MutationObserver(function (mutations) {
     if (Object.keys(watch).length < 1) return
     for (var i = 0; i < mutations.length; i++) {
       if (mutations[i].attributeName === KEY_ATTR) {
         eachAttr(mutations[i], turnon, turnoff)
         continue
       }
       eachMutation(mutations[i].removedNodes, turnoff)
       eachMutation(mutations[i].addedNodes, turnon)
     }
   })
   if (document.body) {
     beginObserve(observer)
   } else {
     document.addEventListener('DOMContentLoaded', function (event) {
       beginObserve(observer)
     })
   }
 }
 
 function beginObserve (observer) {
   observer.observe(document.documentElement, {
     childList: true,
     subtree: true,
     attributes: true,
     attributeOldValue: true,
     attributeFilter: [KEY_ATTR]
   })
 }
 
 module.exports = function onload (el, on, off, caller) {
   assert(document.body, 'on-load: will not work prior to DOMContentLoaded')
   on = on || function () {}
   off = off || function () {}
   el.setAttribute(KEY_ATTR, 'o' + INDEX)
   watch['o' + INDEX] = [on, off, 0, caller || onload.caller]
   INDEX += 1
   return el
 }
 
 module.exports.KEY_ATTR = KEY_ATTR
 module.exports.KEY_ID = KEY_ID
 
 function turnon (index, el) {
   if (watch[index][0] && watch[index][2] === 0) {
     watch[index][0](el)
     watch[index][2] = 1
   }
 }
 
 function turnoff (index, el) {
   if (watch[index][1] && watch[index][2] === 1) {
     watch[index][1](el)
     watch[index][2] = 0
   }
 }
 
 function eachAttr (mutation, on, off) {
   var newValue = mutation.target.getAttribute(KEY_ATTR)
   if (sameOrigin(mutation.oldValue, newValue)) {
     watch[newValue] = watch[mutation.oldValue]
     return
   }
   if (watch[mutation.oldValue]) {
     off(mutation.oldValue, mutation.target)
   }
   if (watch[newValue]) {
     on(newValue, mutation.target)
   }
 }
 
 function sameOrigin (oldValue, newValue) {
   if (!oldValue || !newValue) return false
   return watch[oldValue][3] === watch[newValue][3]
 }
 
 function eachMutation (nodes, fn) {
   var keys = Object.keys(watch)
   for (var i = 0; i < nodes.length; i++) {
     if (nodes[i] && nodes[i].getAttribute && nodes[i].getAttribute(KEY_ATTR)) {
       var onloadid = nodes[i].getAttribute(KEY_ATTR)
       keys.forEach(function (k) {
         if (onloadid === k) {
           fn(k, nodes[i])
         }
       })
     }
     if (nodes[i].childNodes.length > 0) {
       eachMutation(nodes[i].childNodes, fn)
     }
   }
 }
 
 },{"assert":15,"global/document":6,"global/window":7}],34:[function(require,module,exports){
 // shim for using process in browser
 var process = module.exports = {};
 
 // cached from whatever global is present so that test runners that stub it
 // don't break things.  But we need to wrap it in a try catch in case it is
 // wrapped in strict mode code which doesn't define any globals.  It's inside a
 // function because try/catches deoptimize in certain engines.
 
 var cachedSetTimeout;
 var cachedClearTimeout;
 
 function defaultSetTimout() {
     throw new Error('setTimeout has not been defined');
 }
 function defaultClearTimeout () {
     throw new Error('clearTimeout has not been defined');
 }
 (function () {
     try {
         if (typeof setTimeout === 'function') {
             cachedSetTimeout = setTimeout;
         } else {
             cachedSetTimeout = defaultSetTimout;
         }
     } catch (e) {
         cachedSetTimeout = defaultSetTimout;
     }
     try {
         if (typeof clearTimeout === 'function') {
             cachedClearTimeout = clearTimeout;
         } else {
             cachedClearTimeout = defaultClearTimeout;
         }
     } catch (e) {
         cachedClearTimeout = defaultClearTimeout;
     }
 } ())
 function runTimeout(fun) {
     if (cachedSetTimeout === setTimeout) {
         //normal enviroments in sane situations
         return setTimeout(fun, 0);
     }
     // if setTimeout wasn't available but was latter defined
     if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {
         cachedSetTimeout = setTimeout;
         return setTimeout(fun, 0);
     }
     try {
         // when when somebody has screwed with setTimeout but no I.E. maddness
         return cachedSetTimeout(fun, 0);
     } catch(e){
         try {
             // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally
             return cachedSetTimeout.call(null, fun, 0);
         } catch(e){
             // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error
             return cachedSetTimeout.call(this, fun, 0);
         }
     }
 
 
 }
 function runClearTimeout(marker) {
     if (cachedClearTimeout === clearTimeout) {
         //normal enviroments in sane situations
         return clearTimeout(marker);
     }
     // if clearTimeout wasn't available but was latter defined
     if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {
         cachedClearTimeout = clearTimeout;
         return clearTimeout(marker);
     }
     try {
         // when when somebody has screwed with setTimeout but no I.E. maddness
         return cachedClearTimeout(marker);
     } catch (e){
         try {
             // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally
             return cachedClearTimeout.call(null, marker);
         } catch (e){
             // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.
             // Some versions of I.E. have different rules for clearTimeout vs setTimeout
             return cachedClearTimeout.call(this, marker);
         }
     }
 
 
 
 }
 var queue = [];
 var draining = false;
 var currentQueue;
 var queueIndex = -1;
 
 function cleanUpNextTick() {
     if (!draining || !currentQueue) {
         return;
     }
     draining = false;
     if (currentQueue.length) {
         queue = currentQueue.concat(queue);
     } else {
         queueIndex = -1;
     }
     if (queue.length) {
         drainQueue();
     }
 }
 
 function drainQueue() {
     if (draining) {
         return;
     }
     var timeout = runTimeout(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;
     runClearTimeout(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) {
         runTimeout(drainQueue);
     }
 };
 
 // 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.prependListener = noop;
 process.prependOnceListener = noop;
 
 process.listeners = function (name) { return [] }
 
 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; };
 
 },{}],35:[function(require,module,exports){
 'use strict'
 
 /**
  * Remove a range of items from an array
  *
  * @function removeItems
  * @param {Array<*>} arr The target array
  * @param {number} startIdx The index to begin removing from (inclusive)
  * @param {number} removeCount How many items to remove
  */
 module.exports = function removeItems(arr, startIdx, removeCount)
 {
   var i, length = arr.length
 
   if (startIdx >= length || removeCount === 0) {
     return
   }
 
   removeCount = (startIdx + removeCount > length ? length - startIdx : removeCount)
 
   var len = length - removeCount
 
   for (i = startIdx; i < len; ++i) {
     arr[i] = arr[i + removeCount]
   }
 
   arr.length = len
 }
 
 },{}],36:[function(require,module,exports){
 (function (global, factory) {
     typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
     typeof define === 'function' && define.amd ? define(factory) :
     (global.S = factory());
 }(this, (function () { 'use strict';
 
     // Public interface
     var S = function S(fn, value) {
         var node = new ComputationNode(fn, value);
         return function computation() {
             return node.current();
         };
     };
     // compatibility with commonjs systems that expect default export to be at require('s.js').default rather than just require('s-js')
     Object.defineProperty(S, 'default', { value: S });
     S.root = function root(fn) {
         var owner = Owner, root = fn.length === 0 ? UNOWNED : new ComputationNode(null, null), result = undefined, disposer = fn.length === 0 ? null : function _dispose() {
             if (RunningClock !== null) {
                 RootClock.disposes.add(root);
             }
             else {
                 dispose(root);
             }
         };
         Owner = root;
         if (RunningClock === null) {
             result = topLevelRoot(fn, disposer, owner);
         }
         else {
             result = disposer === null ? fn() : fn(disposer);
             Owner = owner;
         }
         return result;
     };
     function topLevelRoot(fn, disposer, owner) {
         try {
             return disposer === null ? fn() : fn(disposer);
         }
         finally {
             Owner = owner;
         }
     }
     S.on = function on(ev, fn, seed, onchanges) {
         if (Array.isArray(ev))
             ev = callAll(ev);
         onchanges = !!onchanges;
         return S(on, seed);
         function on(value) {
             var running = RunningNode;
             ev();
             if (onchanges)
                 onchanges = false;
             else {
                 RunningNode = null;
                 value = fn(value);
                 RunningNode = running;
             }
             return value;
         }
     };
     function callAll(ss) {
         return function all() {
             for (var i = 0; i < ss.length; i++)
                 ss[i]();
         };
     }
     S.effect = function effect(fn, value) {
         new ComputationNode(fn, value);
     };
     S.data = function data(value) {
         var node = new DataNode(value);
         return function data(value) {
             if (arguments.length === 0) {
                 return node.current();
             }
             else {
                 return node.next(value);
             }
         };
     };
     S.value = function value(current, eq) {
         var data = S.data(current), age = -1;
         return function value(update) {
             if (arguments.length === 0) {
                 return data();
             }
             else {
                 var same = eq ? eq(current, update) : current === update;
                 if (!same) {
                     var time = RootClock.time;
                     if (age === time)
                         throw new Error("conflicting values: " + update + " is not the same as " + current);
                     age = time;
                     current = update;
                     data(update);
                 }
                 return update;
             }
         };
     };
     S.freeze = function freeze(fn) {
         var result = undefined;
         if (RunningClock !== null) {
             result = fn();
         }
         else {
             RunningClock = RootClock;
             RunningClock.changes.reset();
             try {
                 result = fn();
                 event();
             }
             finally {
                 RunningClock = null;
             }
         }
         return result;
     };
     S.sample = function sample(fn) {
         var result, running = RunningNode;
         if (running !== null) {
             RunningNode = null;
             result = fn();
             RunningNode = running;
         }
         else {
             result = fn();
         }
         return result;
     };
     S.cleanup = function cleanup(fn) {
         if (Owner !== null) {
             if (Owner.cleanups === null)
                 Owner.cleanups = [fn];
             else
                 Owner.cleanups.push(fn);
         }
         else {
             console.warn("cleanups created without a root or parent will never be run");
         }
     };
     // experimental : exposing node constructors and some state
     S.makeDataNode = function makeDataNode(value) {
         return new DataNode(value);
     };
     S.makeComputationNode = function makeComputationNode(fn, seed) {
         return new ComputationNode(fn, seed);
     };
     S.isFrozen = function isFrozen() {
         return RunningClock !== null;
     };
     S.isListening = function isListening() {
         return RunningNode !== null;
     };
     // Internal implementation
     /// Graph classes and operations
     var Clock = /** @class */ (function () {
         function Clock() {
             this.time = 0;
             this.changes = new Queue(); // batched changes to data nodes
             this.updates = new Queue(); // computations to update
             this.disposes = new Queue(); // disposals to run after current batch of updates finishes
         }
         return Clock;
     }());
     var RootClockProxy = {
         time: function () { return RootClock.time; }
     };
     var DataNode = /** @class */ (function () {
         function DataNode(value) {
             this.value = value;
             this.pending = NOTPENDING;
             this.log = null;
         }
         DataNode.prototype.current = function () {
             if (RunningNode !== null) {
                 logDataRead(this, RunningNode);
             }
             return this.value;
         };
         DataNode.prototype.next = function (value) {
             if (RunningClock !== null) {
                 if (this.pending !== NOTPENDING) { // value has already been set once, check for conflicts
                     if (value !== this.pending) {
                         throw new Error("conflicting changes: " + value + " !== " + this.pending);
                     }
                 }
                 else { // add to list of changes
                     this.pending = value;
                     RootClock.changes.add(this);
                 }
             }
             else { // not batching, respond to change now
                 if (this.log !== null) {
                     this.pending = value;
                     RootClock.changes.add(this);
                     event();
                 }
                 else {
                     this.value = value;
                 }
             }
             return value;
         };
         DataNode.prototype.clock = function () {
             return RootClockProxy;
         };
         return DataNode;
     }());
     var ComputationNode = /** @class */ (function () {
         function ComputationNode(fn, value) {
             this.state = CURRENT;
             this.source1 = null;
             this.source1slot = 0;
             this.sources = null;
             this.sourceslots = null;
             this.log = null;
             this.owned = null;
             this.cleanups = null;
             this.fn = fn;
             this.value = value;
             this.age = RootClock.time;
             if (fn === null)
                 return;
             var owner = Owner, running = RunningNode;
             if (owner === null)
                 console.warn("computations created without a root or parent will never be disposed");
             Owner = RunningNode = this;
             if (RunningClock === null) {
                 toplevelComputation(this);
             }
             else {
                 this.value = this.fn(this.value);
             }
             if (owner && owner !== UNOWNED) {
                 if (owner.owned === null)
                     owner.owned = [this];
                 else
                     owner.owned.push(this);
             }
             Owner = owner;
             RunningNode = running;
         }
         ComputationNode.prototype.current = function () {
             if (RunningNode !== null) {
                 if (this.age === RootClock.time) {
                     if (this.state === RUNNING)
                         throw new Error("circular dependency");
                     else
                         updateNode(this); // checks for state === STALE internally, so don't need to check here
                 }
                 logComputationRead(this, RunningNode);
             }
             return this.value;
         };
         ComputationNode.prototype.clock = function () {
             return RootClockProxy;
         };
         return ComputationNode;
     }());
     var Log = /** @class */ (function () {
         function Log() {
             this.node1 = null;
             this.node1slot = 0;
             this.nodes = null;
             this.nodeslots = null;
         }
         return Log;
     }());
     var Queue = /** @class */ (function () {
         function Queue() {
             this.items = [];
             this.count = 0;
         }
         Queue.prototype.reset = function () {
             this.count = 0;
         };
         Queue.prototype.add = function (item) {
             this.items[this.count++] = item;
         };
         Queue.prototype.run = function (fn) {
             var items = this.items;
             for (var i = 0; i < this.count; i++) {
                 fn(items[i]);
                 items[i] = null;
             }
             this.count = 0;
         };
         return Queue;
     }());
     // Constants
     var NOTPENDING = {}, CURRENT = 0, STALE = 1, RUNNING = 2;
     // "Globals" used to keep track of current system state
     var RootClock = new Clock(), RunningClock = null, // currently running clock 
     RunningNode = null, // currently running computation
     Owner = null, // owner for new computations
     UNOWNED = new ComputationNode(null, null);
     // Functions
     function logRead(from, to) {
         var fromslot, toslot = to.source1 === null ? -1 : to.sources === null ? 0 : to.sources.length;
         if (from.node1 === null) {
             from.node1 = to;
             from.node1slot = toslot;
             fromslot = -1;
         }
         else if (from.nodes === null) {
             from.nodes = [to];
             from.nodeslots = [toslot];
             fromslot = 0;
         }
         else {
             fromslot = from.nodes.length;
             from.nodes.push(to);
             from.nodeslots.push(toslot);
         }
         if (to.source1 === null) {
             to.source1 = from;
             to.source1slot = fromslot;
         }
         else if (to.sources === null) {
             to.sources = [from];
             to.sourceslots = [fromslot];
         }
         else {
             to.sources.push(from);
             to.sourceslots.push(fromslot);
         }
     }
     function logDataRead(data, to) {
         if (data.log === null)
             data.log = new Log();
         logRead(data.log, to);
     }
     function logComputationRead(node, to) {
         if (node.log === null)
             node.log = new Log();
         logRead(node.log, to);
     }
     function event() {
         // b/c we might be under a top level S.root(), have to preserve current root
         var owner = Owner;
         RootClock.updates.reset();
         RootClock.time++;
         try {
             run(RootClock);
         }
         finally {
             RunningClock = RunningNode = null;
             Owner = owner;
         }
     }
     function toplevelComputation(node) {
         RunningClock = RootClock;
         RootClock.changes.reset();
         RootClock.updates.reset();
         try {
             node.value = node.fn(node.value);
             if (RootClock.changes.count > 0 || RootClock.updates.count > 0) {
                 RootClock.time++;
                 run(RootClock);
             }
         }
         finally {
             RunningClock = Owner = RunningNode = null;
         }
     }
     function run(clock) {
         var running = RunningClock, count = 0;
         RunningClock = clock;
         clock.disposes.reset();
         // for each batch ...
         while (clock.changes.count !== 0 || clock.updates.count !== 0 || clock.disposes.count !== 0) {
             if (count > 0) // don't tick on first run, or else we expire already scheduled updates
                 clock.time++;
             clock.changes.run(applyDataChange);
             clock.updates.run(updateNode);
             clock.disposes.run(dispose);
             // if there are still changes after excessive batches, assume runaway            
             if (count++ > 1e5) {
                 throw new Error("Runaway clock detected");
             }
         }
         RunningClock = running;
     }
     function applyDataChange(data) {
         data.value = data.pending;
         data.pending = NOTPENDING;
         if (data.log)
             markComputationsStale(data.log);
     }
     function markComputationsStale(log) {
         var node1 = log.node1, nodes = log.nodes;
         // mark all downstream nodes stale which haven't been already
         if (node1 !== null)
             markNodeStale(node1);
         if (nodes !== null) {
             for (var i = 0, len = nodes.length; i < len; i++) {
                 markNodeStale(nodes[i]);
             }
         }
     }
     function markNodeStale(node) {
         var time = RootClock.time;
         if (node.age < time) {
             node.age = time;
             node.state = STALE;
             RootClock.updates.add(node);
             if (node.owned !== null)
                 markOwnedNodesForDisposal(node.owned);
             if (node.log !== null)
                 markComputationsStale(node.log);
         }
     }
     function markOwnedNodesForDisposal(owned) {
         for (var i = 0; i < owned.length; i++) {
             var child = owned[i];
             child.age = RootClock.time;
             child.state = CURRENT;
             if (child.owned !== null)
                 markOwnedNodesForDisposal(child.owned);
         }
     }
     function updateNode(node) {
         if (node.state === STALE) {
             var owner = Owner, running = RunningNode;
             Owner = RunningNode = node;
             node.state = RUNNING;
             cleanup(node, false);
             node.value = node.fn(node.value);
             node.state = CURRENT;
             Owner = owner;
             RunningNode = running;
         }
     }
     function cleanup(node, final) {
         var source1 = node.source1, sources = node.sources, sourceslots = node.sourceslots, cleanups = node.cleanups, owned = node.owned, i, len;
         if (cleanups !== null) {
             for (i = 0; i < cleanups.length; i++) {
                 cleanups[i](final);
             }
             node.cleanups = null;
         }
         if (owned !== null) {
             for (i = 0; i < owned.length; i++) {
                 dispose(owned[i]);
             }
             node.owned = null;
         }
         if (source1 !== null) {
             cleanupSource(source1, node.source1slot);
             node.source1 = null;
         }
         if (sources !== null) {
             for (i = 0, len = sources.length; i < len; i++) {
                 cleanupSource(sources.pop(), sourceslots.pop());
             }
         }
     }
     function cleanupSource(source, slot) {
         var nodes = source.nodes, nodeslots = source.nodeslots, last, lastslot;
         if (slot === -1) {
             source.node1 = null;
         }
         else {
             last = nodes.pop();
             lastslot = nodeslots.pop();
             if (slot !== nodes.length) {
                 nodes[slot] = last;
                 nodeslots[slot] = lastslot;
                 if (lastslot === -1) {
                     last.source1slot = slot;
                 }
                 else {
                     last.sourceslots[lastslot] = slot;
                 }
             }
         }
     }
     function dispose(node) {
         node.fn = null;
         node.log = null;
         cleanup(node, true);
     }
 
     return S;
 
 })));
 
 },{}],37:[function(require,module,exports){
 // Utilities
 const lowerCase = require('./lower-case')
 const specials = require('./specials')
 
 const regex = /(?:(?:(\s?(?:^|[.\(\)!?;:"-])\s*)(\w))|(\w))(\w*[’']*\w*)/g
 
 const convertToRegExp = specials => specials.map(s => [new RegExp(`\\b${s}\\b`, 'gi'), s])
 
 function parseMatch(match) {
   const firstCharacter = match[0]
 
   // test first character
   if (/\s/.test(firstCharacter)) {
     // if whitespace - trim and return
     return match.substr(1)
   }
   if (/[\(\)]/.test(firstCharacter)) {
     // if parens - this shouldn't be replaced
     return null
   }
 
   return match
 }
 
 module.exports = (str, options = {}) => {
   str = str.toLowerCase().replace(regex, (m, lead = '', forced, lower, rest) => {
     const parsedMatch = parseMatch(m)
     if (!parsedMatch) {
       return m
     }
     if (!forced) {
       const fullLower = lower + rest
 
       if (lowerCase.has(fullLower)) {
         return parsedMatch
       }
     }
 
     return lead + (lower || forced).toUpperCase() + rest
   })
 
   const customSpecials = options.special || []
   const replace = [...specials, ...customSpecials]
   const replaceRegExp = convertToRegExp(replace)
 
   replaceRegExp.forEach(([pattern, s]) => {
     str = str.replace(pattern, s)
   })
 
   return str
 }
 
 },{"./lower-case":38,"./specials":39}],38:[function(require,module,exports){
 const conjunctions = [
   'for',
   'and',
   'nor',
   'but',
   'or',
   'yet',
   'so'
 ]
 
 const articles = [
   'a',
   'an',
   'the'
 ]
 
 const prepositions = [
   'aboard',
   'about',
   'above',
   'across',
   'after',
   'against',
   'along',
   'amid',
   'among',
   'anti',
   'around',
   'as',
   'at',
   'before',
   'behind',
   'below',
   'beneath',
   'beside',
   'besides',
   'between',
   'beyond',
   'but',
   'by',
   'concerning',
   'considering',
   'despite',
   'down',
   'during',
   'except',
   'excepting',
   'excluding',
   'following',
   'for',
   'from',
   'in',
   'inside',
   'into',
   'like',
   'minus',
   'near',
   'of',
   'off',
   'on',
   'onto',
   'opposite',
   'over',
   'past',
   'per',
   'plus',
   'regarding',
   'round',
   'save',
   'since',
   'than',
   'through',
   'to',
   'toward',
   'towards',
   'under',
   'underneath',
   'unlike',
   'until',
   'up',
   'upon',
   'versus',
   'via',
   'with',
   'within',
   'without'
 ]
 
 module.exports = new Set([
   ...conjunctions,
   ...articles,
   ...prepositions
 ])
 
 },{}],39:[function(require,module,exports){
 const intended = [
   'ZEIT',
   'ZEIT Inc.',
   'CLI',
   'API',
   'Next.js',
   'Node.js',
   'HTTP',
   'HTTPS',
   'JSX',
   'DNS',
   'URL',
   'now.sh',
   'now.json',
   'CI',
   'CDN',
   'package.json'
 ]
 
 module.exports = intended
 
 },{}],40:[function(require,module,exports){
 module.exports = function isBuffer(arg) {
   return arg && typeof arg === 'object'
     && typeof arg.copy === 'function'
     && typeof arg.fill === 'function'
     && typeof arg.readUInt8 === 'function';
 }
 },{}],41:[function(require,module,exports){
 (function (process,global){
 // 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 = require('./support/isBuffer');
 
 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 = require('inherits');
 
 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);
 }
 
 }).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
 },{"./support/isBuffer":40,"_process":34,"inherits":12}],42:[function(require,module,exports){
 var assert = require('assert')
 var trie = require('./trie')
 
 module.exports = Wayfarer
 
 // create a router
 // str -> obj
 function Wayfarer (dft) {
   if (!(this instanceof Wayfarer)) return new Wayfarer(dft)
 
   var _default = (dft || '').replace(/^\//, '')
   var _trie = trie()
 
   emit._trie = _trie
   emit.on = on
   emit.emit = emit
   emit.match = match
   emit._wayfarer = true
 
   return emit
 
   // define a route
   // (str, fn) -> obj
   function on (route, fn) {
     assert.equal(typeof route, 'string')
     assert.equal(typeof fn, 'function')
 
     var cb = fn._wayfarer && fn._trie ? fn : proxy
     route = route || '/'
     cb.route = route
 
     if (cb._wayfarer && cb._trie) {
       _trie.mount(route, cb._trie.trie)
     } else {
       var node = _trie.create(route)
       node.cb = cb
     }
 
     return emit
 
     function proxy () {
       return fn.apply(this, Array.prototype.slice.call(arguments))
     }
   }
 
   // match and call a route
   // (str, obj?) -> null
   function emit (route) {
     var matched = match(route)
 
     var args = new Array(arguments.length)
     args[0] = matched.params
     for (var i = 1; i < args.length; i++) {
       args[i] = arguments[i]
     }
 
     return matched.cb.apply(matched.cb, args)
   }
 
   function match (route) {
     assert.notEqual(route, undefined, "'route' must be defined")
 
     var matched = _trie.match(route)
     if (matched && matched.cb) return new Route(matched)
 
     var dft = _trie.match(_default)
     if (dft && dft.cb) return new Route(dft)
 
     throw new Error("route '" + route + "' did not match")
   }
 
   function Route (matched) {
     this.cb = matched.cb
     this.route = matched.cb.route
     this.params = matched.params
   }
 }
 
 },{"./trie":43,"assert":2}],43:[function(require,module,exports){
 var mutate = require('xtend/mutable')
 var assert = require('assert')
 var xtend = require('xtend')
 
 module.exports = Trie
 
 // create a new trie
 // null -> obj
 function Trie () {
   if (!(this instanceof Trie)) return new Trie()
   this.trie = { nodes: {} }
 }
 
 // create a node on the trie at route
 // and return a node
 // str -> null
 Trie.prototype.create = function (route) {
   assert.equal(typeof route, 'string', 'route should be a string')
   // strip leading '/' and split routes
   var routes = route.replace(/^\//, '').split('/')
 
   function createNode (index, trie) {
     var thisRoute = (routes.hasOwnProperty(index) && routes[index])
     if (thisRoute === false) return trie
 
     var node = null
     if (/^:|^\*/.test(thisRoute)) {
       // if node is a name match, set name and append to ':' node
       if (!trie.nodes.hasOwnProperty('$$')) {
         node = { nodes: {} }
         trie.nodes['$$'] = node
       } else {
         node = trie.nodes['$$']
       }
 
       if (thisRoute[0] === '*') {
         trie.wildcard = true
       }
 
       trie.name = thisRoute.replace(/^:|^\*/, '')
     } else if (!trie.nodes.hasOwnProperty(thisRoute)) {
       node = { nodes: {} }
       trie.nodes[thisRoute] = node
     } else {
       node = trie.nodes[thisRoute]
     }
 
     // we must recurse deeper
     return createNode(index + 1, node)
   }
 
   return createNode(0, this.trie)
 }
 
 // match a route on the trie
 // and return the node
 // str -> obj
 Trie.prototype.match = function (route) {
   assert.equal(typeof route, 'string', 'route should be a string')
 
   var routes = route.replace(/^\//, '').split('/')
   var params = {}
 
   function search (index, trie) {
     // either there's no match, or we're done searching
     if (trie === undefined) return undefined
     var thisRoute = routes[index]
     if (thisRoute === undefined) return trie
 
     if (trie.nodes.hasOwnProperty(thisRoute)) {
       // match regular routes first
       return search(index + 1, trie.nodes[thisRoute])
     } else if (trie.name) {
       // match named routes
       try {
         params[trie.name] = decodeURIComponent(thisRoute)
       } catch (e) {
         return search(index, undefined)
       }
       return search(index + 1, trie.nodes['$$'])
     } else if (trie.wildcard) {
       // match wildcards
       try {
         params['wildcard'] = decodeURIComponent(routes.slice(index).join('/'))
       } catch (e) {
         return search(index, undefined)
       }
       // return early, or else search may keep recursing through the wildcard
       return trie.nodes['$$']
     } else {
       // no matches found
       return search(index + 1)
     }
   }
 
   var node = search(0, this.trie)
 
   if (!node) return undefined
   node = xtend(node)
   node.params = params
   return node
 }
 
 // mount a trie onto a node at route
 // (str, obj) -> null
 Trie.prototype.mount = function (route, trie) {
   assert.equal(typeof route, 'string', 'route should be a string')
   assert.equal(typeof trie, 'object', 'trie should be a object')
 
   var split = route.replace(/^\//, '').split('/')
   var node = null
   var key = null
 
   if (split.length === 1) {
     key = split[0]
     node = this.create(key)
   } else {
     var head = split.join('/')
     key = split[0]
     node = this.create(head)
   }
 
   mutate(node.nodes, trie.nodes)
   if (trie.name) node.name = trie.name
 
   // delegate properties from '/' to the new node
   // '/' cannot be reached once mounted
   if (node.nodes['']) {
     Object.keys(node.nodes['']).forEach(function (key) {
       if (key === 'nodes') return
       node[key] = node.nodes[''][key]
     })
     mutate(node.nodes, node.nodes[''].nodes)
     delete node.nodes[''].nodes
   }
 }
 
 },{"assert":2,"xtend":45,"xtend/mutable":46}],44:[function(require,module,exports){
 var assert = require('assert')
 
 module.exports = walk
 
 // walk a wayfarer trie
 // (obj, fn) -> null
 function walk (router, transform) {
   assert.equal(typeof router, 'function', 'wayfarer.walk: router should be an function')
   assert.equal(typeof transform, 'function', 'wayfarer.walk: transform should be a function')
 
   var trie = router._trie
   assert.equal(typeof trie, 'object', 'wayfarer.walk: trie should be an object')
 
   // (str, obj) -> null
   ;(function walk (route, trie) {
     if (trie.cb) {
       trie.cb = transform(route, trie.cb)
     }
 
     if (trie.nodes) {
       var nodes = trie.nodes
       Object.keys(nodes).forEach(function (key) {
         var node = nodes[key]
         var newRoute = (key === '$$')
           ? route + '/:' + trie.name
           : route + '/' + key
         walk(newRoute, node)
       })
     }
   })('', trie.trie)
 }
 
 },{"assert":2}],45:[function(require,module,exports){
 module.exports = extend
 
 var hasOwnProperty = Object.prototype.hasOwnProperty;
 
 function extend() {
     var target = {}
 
     for (var i = 0; i < arguments.length; i++) {
         var source = arguments[i]
 
         for (var key in source) {
             if (hasOwnProperty.call(source, key)) {
                 target[key] = source[key]
             }
         }
     }
 
     return target
 }
 
 },{}],46:[function(require,module,exports){
 module.exports = extend
 
 var hasOwnProperty = Object.prototype.hasOwnProperty;
 
 function extend(target) {
     for (var i = 1; i < arguments.length; i++) {
         var source = arguments[i]
 
         for (var key in source) {
             if (hasOwnProperty.call(source, key)) {
                 target[key] = source[key]
             }
         }
     }
 
     return target
 }
 
 },{}]},{},[1]);