text: (function webpackUniversalModuleDefinition(root, factory) {
  	if(typeof exports === 'object' && typeof module === 'object')
  		module.exports = factory();
  	else if(typeof define === 'function' && define.amd)
  		define([], factory);
  	else if(typeof exports === 'object')
  		exports["gremlin"] = factory();
  	else
  		root["gremlin"] = factory();
  })(this, function() {
  return /******/ (function(modules) { // webpackBootstrap
  /******/ 	// The module cache
  /******/ 	var installedModules = {};
  
  /******/ 	// The require function
  /******/ 	function __webpack_require__(moduleId) {
  
  /******/ 		// Check if module is in cache
  /******/ 		if(installedModules[moduleId])
  /******/ 			return installedModules[moduleId].exports;
  
  /******/ 		// Create a new module (and put it into the cache)
  /******/ 		var module = installedModules[moduleId] = {
  /******/ 			exports: {},
  /******/ 			id: moduleId,
  /******/ 			loaded: false
  /******/ 		};
  
  /******/ 		// Execute the module function
  /******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
  
  /******/ 		// Flag the module as loaded
  /******/ 		module.loaded = true;
  
  /******/ 		// Return the exports of the module
  /******/ 		return module.exports;
  /******/ 	}
  
  
  /******/ 	// expose the modules object (__webpack_modules__)
  /******/ 	__webpack_require__.m = modules;
  
  /******/ 	// expose the module cache
  /******/ 	__webpack_require__.c = installedModules;
  
  /******/ 	// __webpack_public_path__
  /******/ 	__webpack_require__.p = "";
  
  /******/ 	// Load entry module and return exports
  /******/ 	return __webpack_require__(0);
  /******/ })
  /************************************************************************/
  /******/ ([
  /* 0 */
  /***/ function(module, exports, __webpack_require__) {
  
  	'use strict';
  
  	Object.defineProperty(exports, "__esModule", {
  	  value: true
  	});
  	exports.makeTemplateTag = undefined;
  
  	var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol ? "symbol" : typeof obj; };
  
  	exports.createClient = createClient;
  
  	var _GremlinClient = __webpack_require__(1);
  
  	var _GremlinClient2 = _interopRequireDefault(_GremlinClient);
  
  	var _gremlinTemplateString = __webpack_require__(61);
  
  	var _gremlinTemplateString2 = _interopRequireDefault(_gremlinTemplateString);
  
  	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
  
  	function createClient(port, host, options) {
  	  if ((typeof port === 'undefined' ? 'undefined' : _typeof(port)) === 'object') {
  	    options = port;
  	    port = undefined;
  	  }
  
  	  if ((typeof host === 'undefined' ? 'undefined' : _typeof(host)) === 'object') {
  	    options = host;
  	    host = undefined;
  	  }
  
  	  return new _GremlinClient2.default(port, host, options);
  	};
  
  	var makeTemplateTag = exports.makeTemplateTag = function makeTemplateTag(client) {
  	  return function () {
  	    var query = _gremlinTemplateString2.default.apply(undefined, arguments);
  	    var promise = new Promise(function (resolve, reject) {
  	      return client.execute(query, function (err, results) {
  	        return err ? reject(err) : resolve(results);
  	      });
  	    });
  	    // Let's attach the query for easier debugging
  	    promise.query = query;
  
  	    return promise;
  	  };
  	};
  
  	exports.default = {
  	  createClient: createClient,
  	  makeTemplateTag: makeTemplateTag
  	};
  	//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbInNyYy9pbmRleC5qcyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7Ozs7Ozs7UUFJZ0I7O0FBSmhCOzs7O0FBQ0E7Ozs7OztBQUdPLFNBQVMsWUFBVCxDQUFzQixJQUF0QixFQUE0QixJQUE1QixFQUFrQyxPQUFsQyxFQUEyQztBQUNoRCxNQUFJLFFBQU8sbURBQVAsS0FBZ0IsUUFBaEIsRUFBMEI7QUFDNUIsY0FBVSxJQUFWLENBRDRCO0FBRTVCLFdBQU8sU0FBUCxDQUY0QjtHQUE5Qjs7QUFLQSxNQUFJLFFBQU8sbURBQVAsS0FBZ0IsUUFBaEIsRUFBMEI7QUFDNUIsY0FBVSxJQUFWLENBRDRCO0FBRTVCLFdBQU8sU0FBUCxDQUY0QjtHQUE5Qjs7QUFLQSxTQUFPLDRCQUFrQixJQUFsQixFQUF3QixJQUF4QixFQUE4QixPQUE5QixDQUFQLENBWGdEO0NBQTNDOztBQWNBLElBQU0sNENBQWtCLFNBQWxCLGVBQWtCLENBQUMsTUFBRDtTQUFZLFlBQXNCO0FBQy9ELFFBQU0sUUFBUSwyREFBUixDQUR5RDtBQUUvRCxRQUFNLFVBQVUsSUFBSSxPQUFKLENBQVksVUFBQyxPQUFELEVBQVUsTUFBVjthQUMxQixPQUFPLE9BQVAsQ0FBZSxLQUFmLEVBQXNCLFVBQUMsR0FBRCxFQUFNLE9BQU47ZUFDcEIsTUFBTSxPQUFPLEdBQVAsQ0FBTixHQUFvQixRQUFRLE9BQVIsQ0FBcEI7T0FEb0I7S0FESSxDQUF0Qjs7QUFGeUQsV0FRL0QsQ0FBUSxLQUFSLEdBQWdCLEtBQWhCLENBUitEOztBQVUvRCxXQUFPLE9BQVAsQ0FWK0Q7R0FBdEI7Q0FBWjs7a0JBYWhCO0FBQ2IsNEJBRGE7QUFFYixrQ0FGYSIsImZpbGUiOiJpbmRleC5qcyIsInNvdXJjZVJvb3QiOiIvVXNlcnMvdmljdG9yL0Rlc2t0b3AvZ3JlbWxpbi1qYXZhc2NyaXB0Iiwic291cmNlc0NvbnRlbnQiOlsiaW1wb3J0IEdyZW1saW5DbGllbnQgZnJvbSAnLi9HcmVtbGluQ2xpZW50JztcbmltcG9ydCB0ZW1wbGF0ZSBmcm9tICdncmVtbGluLXRlbXBsYXRlLXN0cmluZyc7XG5cblxuZXhwb3J0IGZ1bmN0aW9uIGNyZWF0ZUNsaWVudChwb3J0LCBob3N0LCBvcHRpb25zKSB7XG4gIGlmICh0eXBlb2YgcG9ydCA9PT0gJ29iamVjdCcpIHtcbiAgICBvcHRpb25zID0gcG9ydDtcbiAgICBwb3J0ID0gdW5kZWZpbmVkO1xuICB9XG5cbiAgaWYgKHR5cGVvZiBob3N0ID09PSAnb2JqZWN0Jykge1xuICAgIG9wdGlvbnMgPSBob3N0O1xuICAgIGhvc3QgPSB1bmRlZmluZWQ7XG4gIH1cblxuICByZXR1cm4gbmV3IEdyZW1saW5DbGllbnQocG9ydCwgaG9zdCwgb3B0aW9ucyk7XG59O1xuXG5leHBvcnQgY29uc3QgbWFrZVRlbXBsYXRlVGFnID0gKGNsaWVudCkgPT4gKC4uLmdyZW1saW5DaHVua3MpID0+IHtcbiAgY29uc3QgcXVlcnkgPSB0ZW1wbGF0ZSguLi5ncmVtbGluQ2h1bmtzKTtcbiAgY29uc3QgcHJvbWlzZSA9IG5ldyBQcm9taXNlKChyZXNvbHZlLCByZWplY3QpID0+XG4gICAgY2xpZW50LmV4ZWN1dGUocXVlcnksIChlcnIsIHJlc3VsdHMpID0+XG4gICAgICBlcnIgPyByZWplY3QoZXJyKSA6IHJlc29sdmUocmVzdWx0cylcbiAgICApXG4gICk7XG4gIC8vIExldCdzIGF0dGFjaCB0aGUgcXVlcnkgZm9yIGVhc2llciBkZWJ1Z2dpbmdcbiAgcHJvbWlzZS5xdWVyeSA9IHF1ZXJ5O1xuXG4gIHJldHVybiBwcm9taXNlO1xufVxuXG5leHBvcnQgZGVmYXVsdCB7XG4gIGNyZWF0ZUNsaWVudCxcbiAgbWFrZVRlbXBsYXRlVGFnXG59XG4iXX0=
  
  /***/ },
  /* 1 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(Buffer) {'use strict';
  
  	Object.defineProperty(exports, "__esModule", {
  	  value: true
  	});
  
  	var _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };
  
  	var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();
  
  	var _events = __webpack_require__(6);
  
  	var _nodeUuid = __webpack_require__(7);
  
  	var _nodeUuid2 = _interopRequireDefault(_nodeUuid);
  
  	var _lodash = __webpack_require__(27);
  
  	var _lodash2 = _interopRequireDefault(_lodash);
  
  	var _highland = __webpack_require__(29);
  
  	var _highland2 = _interopRequireDefault(_highland);
  
  	var _WebSocketGremlinConnection = __webpack_require__(34);
  
  	var _WebSocketGremlinConnection2 = _interopRequireDefault(_WebSocketGremlinConnection);
  
  	var _MessageStream = __webpack_require__(36);
  
  	var _MessageStream2 = _interopRequireDefault(_MessageStream);
  
  	var _executeHandler = __webpack_require__(59);
  
  	var _executeHandler2 = _interopRequireDefault(_executeHandler);
  
  	var _utils = __webpack_require__(60);
  
  	var Utils = _interopRequireWildcard(_utils);
  
  	function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }
  
  	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
  
  	function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
  
  	function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; }
  
  	function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } /*jslint -W079 */
  	/*jslint node: true */
  
  
  	var GremlinClient = function (_EventEmitter) {
  	  _inherits(GremlinClient, _EventEmitter);
  
  	  function GremlinClient() {
  	    var port = arguments.length <= 0 || arguments[0] === undefined ? 8182 : arguments[0];
  	    var host = arguments.length <= 1 || arguments[1] === undefined ? 'localhost' : arguments[1];
  	    var options = arguments.length <= 2 || arguments[2] === undefined ? {} : arguments[2];
  
  	    _classCallCheck(this, GremlinClient);
  
  	    var _this = _possibleConstructorReturn(this, Object.getPrototypeOf(GremlinClient).call(this));
  
  	    _this.port = port;
  	    _this.host = host;
  
  	    var _options$path = options.path;
  	    var path = _options$path === undefined ? '' : _options$path;
  
  
  	    _this.options = _extends({
  	      language: 'gremlin-groovy',
  	      session: false,
  	      op: 'eval',
  	      processor: '',
  	      accept: 'application/json',
  	      executeHandler: _executeHandler2.default
  	    }, options, {
  	      path: path.length && !path.startsWith('/') ? '/' + path : path
  	    });
  
  	    _this.useSession = _this.options.session;
  
  	    if (_this.useSession) {
  	      _this.sessionId = _nodeUuid2.default.v1();
  	    }
  
  	    _this.connected = false;
  	    _this.queue = [];
  
  	    _this.commands = {};
  
  	    _this.connection = _this.createConnection({
  	      port: port,
  	      host: host,
  	      path: _this.options.path
  	    });
  	    return _this;
  	  }
  
  	  _createClass(GremlinClient, [{
  	    key: 'createConnection',
  	    value: function createConnection(_ref) {
  	      var _this2 = this;
  
  	      var port = _ref.port;
  	      var host = _ref.host;
  	      var path = _ref.path;
  
  	      var connection = new _WebSocketGremlinConnection2.default({ port: port, host: host, path: path });
  
  	      connection.on('open', function () {
  	        return _this2.onConnectionOpen();
  	      });
  	      connection.on('error', function (error) {
  	        return _this2.handleError(error);
  	      });
  	      connection.on('message', function (message) {
  	        return _this2.handleProtocolMessage(message);
  	      });
  	      connection.on('close', function (event) {
  	        return _this2.handleDisconnection(event);
  	      });
  
  	      return connection;
  	    }
  	  }, {
  	    key: 'handleError',
  	    value: function handleError(err) {
  	      this.connected = false;
  	      this.emit('error', err);
  	    }
  
  	    /**
  	     * Process all incoming raw message events sent by Gremlin Server, and dispatch
  	     * to the appropriate command.
  	     *
  	     * @param {MessageEvent} event
  	     */
  
  	  }, {
  	    key: 'handleProtocolMessage',
  	    value: function handleProtocolMessage(message) {
  	      var data = message.data;
  
  	      var buffer = new Buffer(data, 'binary');
  	      var rawMessage = JSON.parse(buffer.toString('utf-8'));
  	      var requestId = rawMessage.requestId;
  	      var _rawMessage$status = rawMessage.status;
  	      var statusCode = _rawMessage$status.code;
  	      var statusMessage = _rawMessage$status.message;
  	      var messageStream = this.commands[requestId].messageStream;
  
  
  	      switch (statusCode) {
  	        case 200:
  	          // SUCCESS
  	          delete this.commands[requestId]; // TODO: optimize performance
  	          messageStream.push(rawMessage);
  	          messageStream.push(null);
  	          break;
  	        case 204:
  	          // NO_CONTENT
  	          delete this.commands[requestId];
  	          messageStream.push(null);
  	          break;
  	        case 206:
  	          // PARTIAL_CONTENT
  	          messageStream.push(rawMessage);
  	          break;
  	        default:
  	          delete this.commands[requestId];
  	          messageStream.emit('error', new Error(statusMessage + ' (Error ' + statusCode + ')'));
  	          break;
  	      }
  	    }
  
  	    /**
  	     * Handle the WebSocket onOpen event, flag the client as connected and
  	     * process command queue.
  	     */
  
  	  }, {
  	    key: 'onConnectionOpen',
  	    value: function onConnectionOpen() {
  	      this.connected = true;
  	      this.emit('connect');
  
  	      this.executeQueue();
  	    }
  	  }, {
  	    key: 'handleDisconnection',
  
  
  	    /**
  	     * @param {CloseEvent} event
  	     */
  	    value: function handleDisconnection(event) {
  	      this.cancelPendingCommands({
  	        message: 'WebSocket closed',
  	        details: event
  	      });
  	    }
  	  }, {
  	    key: 'executeQueue',
  
  
  	    /**
  	     * Process the current command queue, sending commands to Gremlin Server
  	     * (First In, First Out).
  	     */
  	    value: function executeQueue() {
  	      while (this.queue.length > 0) {
  	        var _queue$shift = this.queue.shift();
  
  	        var message = _queue$shift.message;
  
  	        this.sendMessage(message);
  	      }
  	    }
  	  }, {
  	    key: 'cancelPendingCommands',
  
  
  	    /**
  	     * @param {Object} reason
  	     */
  	    value: function cancelPendingCommands(_ref2) {
  	      var message = _ref2.message;
  	      var details = _ref2.details;
  
  	      var commands = this.commands;
  	      var command = void 0;
  	      var error = new Error(message);
  	      error.details = details;
  
  	      // Empty queue
  	      this.queue.length = 0;
  	      this.commands = {};
  
  	      Object.keys(commands).forEach(function (key) {
  	        command = commands[key];
  	        command.messageStream.emit('error', error);
  	      });
  	    }
  	  }, {
  	    key: 'buildMessage',
  
  
  	    /**
  	     * For a given script string and optional bound parameters, build a protocol
  	     * message object to be sent to Gremlin Server.
  	     *
  	     * @param {String|Function} script
  	     * @param {Object} bindings
  	     * @param {Object} message
  	     */
  	    value: function buildMessage(rawScript) {
  	      var rawBindings = arguments.length <= 1 || arguments[1] === undefined ? {} : arguments[1];
  	      var baseMessage = arguments.length <= 2 || arguments[2] === undefined ? {} : arguments[2];
  
  	      var _Utils$buildQueryFrom = Utils.buildQueryFromSignature(rawScript, rawBindings);
  
  	      var gremlin = _Utils$buildQueryFrom.gremlin;
  	      var bindings = _Utils$buildQueryFrom.bindings;
  	      var _options = this.options;
  	      var processor = _options.processor;
  	      var op = _options.op;
  	      var accept = _options.accept;
  	      var language = _options.language;
  
  
  	      var baseArgs = { gremlin: gremlin, bindings: bindings, accept: accept, language: language };
  	      var args = _lodash2.default.defaults(baseMessage.args || {}, baseArgs);
  
  	      var message = _extends({
  	        requestId: _nodeUuid2.default.v1(),
  	        processor: processor,
  	        op: op,
  	        args: args
  	      }, baseMessage);
  
  	      if (this.useSession) {
  	        // Assume that people want to use the 'session' processor unless specified
  	        message.processor = message.processor || processor || 'session';
  	        message.args.session = this.sessionId;
  	      }
  
  	      return message;
  	    }
  	  }, {
  	    key: 'sendMessage',
  	    value: function sendMessage(message) {
  	      var serializedMessage = this.options.accept + JSON.stringify(message);
  
  	      // Let's start packing the message into binary
  	      // mimeLength(1) + mimeType Length + serializedMessage Length
  	      var binaryMessage = new Uint8Array(1 + serializedMessage.length);
  	      binaryMessage[0] = this.options.accept.length;
  
  	      for (var i = 0; i < serializedMessage.length; i++) {
  	        binaryMessage[i + 1] = serializedMessage.charCodeAt(i);
  	      }
  
  	      this.connection.sendMessage(binaryMessage);
  	    }
  	  }, {
  	    key: 'execute',
  
  
  	    /**
  	     * Asynchronously send a script to Gremlin Server for execution and fire
  	     * the provided callback when all results have been fetched.
  	     *
  	     * This method internally uses a stream to handle the potential concatenation
  	     * of results.
  	     *
  	     * Callback signature: (Error, Array<result>)
  	     *
  	     * @public
  	     * @param {String|Function} script
  	     * @param {Object} bindings
  	     * @param {Object} message
  	     * @param {Function} callback
  	     */
  	    value: function execute(script) {
  	      var bindings = arguments.length <= 1 || arguments[1] === undefined ? {} : arguments[1];
  	      var message = arguments.length <= 2 || arguments[2] === undefined ? {} : arguments[2];
  
  	      var callback = arguments.length <= arguments.length - 3 - 1 + 3 ? undefined : arguments[arguments.length - 3 - 1 + 3];
  
  	      if (typeof message === 'function') {
  	        callback = message;
  	        message = {};
  	      }
  
  	      var messageStream = this.messageStream(script, bindings, message);
  
  	      // TO CHECK: errors handling could be improved
  	      // See https://groups.google.com/d/msg/nodejs/lJYT9hZxFu0/L59CFbqWGyYJ
  	      // for an example using domains
  	      var executeHandler = this.options.executeHandler;
  
  
  	      executeHandler(messageStream, callback);
  	    }
  
  	    /**
  	     * Execute the script and return a stream of distinct/single results.
  	     * This method reemits a distinct data event for each returned result, which
  	     * makes the stream behave as if `resultIterationBatchSize` was set to 1.
  	     *
  	     * If you do not wish this behavior, please use client.messageStream() instead.
  	     *
  	     * Even though this method uses Highland.js internally, it does not return
  	     * a high level Highland readable stream so we do not risk having to deal
  	     * with unexpected API breaking changes as Highland.js evolves.
  	     *
  	     * @return {ReadableStream} A Node.js Stream2
  	     */
  
  	  }, {
  	    key: 'stream',
  	    value: function stream(script, bindings, message) {
  	      var messageStream = this.messageStream(script, bindings, message);
  	      var _ = _highland2.default; // override lo-dash locally
  
  	      // Create a local highland 'through' pipeline so we don't expose
  	      // a Highland stream to the end user, but a standard Node.js Stream2
  	      var through = _.pipeline(_.map(function (_ref3) {
  	        var data = _ref3.result.data;
  	        return data;
  	      }), _.sequence());
  
  	      var rawStream = messageStream.pipe(through);
  
  	      messageStream.on('error', function (e) {
  	        rawStream.emit('error', new Error(e));
  	      });
  
  	      return rawStream;
  	    }
  	  }, {
  	    key: 'messageStream',
  
  
  	    /**
  	     * Execute the script and return a stream of raw messages returned by Gremlin
  	     * Server.
  	     * This method does not reemit one distinct data event per result. It directly
  	     * emits the raw messages returned by Gremlin Server as they are received.
  	     *
  	     * Although public, this is a low level method intended to be used for
  	     * advanced usages.
  	     *
  	     * @public
  	     * @param {String|Function} script
  	     * @param {Object} bindings
  	     * @param {Object} message
  	     * @return {MessageStream}
  	     */
  	    value: function messageStream(script, bindings, rawMessage) {
  	      var stream = new _MessageStream2.default({ objectMode: true });
  
  	      var command = {
  	        message: this.buildMessage(script, bindings, rawMessage),
  	        messageStream: stream
  	      };
  
  	      this.sendCommand(command); //todo improve for streams
  
  	      return stream;
  	    }
  	  }, {
  	    key: 'sendCommand',
  
  
  	    /**
  	     * Send a command to Gremlin Server, or add it to queue if the connection
  	     * is not established.
  	     *
  	     * @param {Object} command
  	     */
  	    value: function sendCommand(command) {
  	      var message = command.message;
  	      var requestId = command.message.requestId;
  
  
  	      this.commands[requestId] = command;
  
  	      if (this.connected) {
  	        this.sendMessage(message);
  	      } else {
  	        this.queue.push(command);
  	      }
  	    }
  	  }]);
  
  	  return GremlinClient;
  	}(_events.EventEmitter);
  
  	exports.default = GremlinClient;
  	//# sourceMappingURL=data:application/json;base64,{"version":3,"sources":["src/GremlinClient.js"],"names":[],"mappings":";;;;;;;;;;AAEA;;AAEA;;;;AACA;;;;AACA;;;;AAEA;;;;AACA;;;;AACA;;;;AACA;;IAAY;;;;;;;;;;;;;;IAGN;;;AACJ,WADI,aACJ,GAA2D;QAA/C,6DAAO,oBAAwC;QAAlC,6DAAO,2BAA2B;QAAd,gEAAU,kBAAI;;0BADvD,eACuD;;uEADvD,2BACuD;;AAGzD,UAAK,IAAL,GAAY,IAAZ,CAHyD;AAIzD,UAAK,IAAL,GAAY,IAAZ,CAJyD;;wBAMnC,QAAd,KANiD;QAMjD,qCAAO,mBAN0C;;;AAQzD,UAAK,OAAL;AACE,gBAAU,gBAAV;AACA,eAAS,KAAT;AACA,UAAI,MAAJ;AACA,iBAAW,EAAX;AACA,cAAQ,kBAAR;AACA;OACG;AACH,YAAM,KAAK,MAAL,IAAe,CAAC,KAAK,UAAL,CAAgB,GAAhB,CAAD,SAA4B,IAA3C,GAAoD,IAApD;MARR,CARyD;;AAmBzD,UAAK,UAAL,GAAkB,MAAK,OAAL,CAAa,OAAb,CAnBuC;;AAqBzD,QAAI,MAAK,UAAL,EAAiB;AACnB,YAAK,SAAL,GAAiB,mBAAK,EAAL,EAAjB,CADmB;KAArB;;AAIA,UAAK,SAAL,GAAiB,KAAjB,CAzByD;AA0BzD,UAAK,KAAL,GAAa,EAAb,CA1ByD;;AA4BzD,UAAK,QAAL,GAAgB,EAAhB,CA5ByD;;AA8BzD,UAAK,UAAL,GAAkB,MAAK,gBAAL,CAAsB;AACtC,gBADsC;AAEtC,gBAFsC;AAGtC,YAAM,MAAK,OAAL,CAAa,IAAb;KAHU,CAAlB,CA9ByD;;GAA3D;;eADI;;2CAsCmC;;;UAApB,iBAAoB;UAAd,iBAAc;UAAR,iBAAQ;;AACrC,UAAM,aAAa,yCAA+B,EAAE,UAAF,EAAQ,UAAR,EAAc,UAAd,EAA/B,CAAb,CAD+B;;AAGrC,iBAAW,EAAX,CAAc,MAAd,EAAsB;eAAM,OAAK,gBAAL;OAAN,CAAtB,CAHqC;AAIrC,iBAAW,EAAX,CAAc,OAAd,EAAuB,UAAC,KAAD;eAAW,OAAK,WAAL,CAAiB,KAAjB;OAAX,CAAvB,CAJqC;AAKrC,iBAAW,EAAX,CAAc,SAAd,EAAyB,UAAC,OAAD;eAAa,OAAK,qBAAL,CAA2B,OAA3B;OAAb,CAAzB,CALqC;AAMrC,iBAAW,EAAX,CAAc,OAAd,EAAuB,UAAC,KAAD;eAAW,OAAK,mBAAL,CAAyB,KAAzB;OAAX,CAAvB,CANqC;;AAQrC,aAAO,UAAP,CARqC;;;;gCAW3B,KAAK;AACf,WAAK,SAAL,GAAiB,KAAjB,CADe;AAEf,WAAK,IAAL,CAAU,OAAV,EAAmB,GAAnB,EAFe;;;;;;;;;;;;0CAWK,SAAS;UACrB,OAAS,QAAT,KADqB;;AAE7B,UAAM,SAAS,IAAI,MAAJ,CAAW,IAAX,EAAiB,QAAjB,CAAT,CAFuB;AAG7B,UAAM,aAAa,KAAK,KAAL,CAAW,OAAO,QAAP,CAAgB,OAAhB,CAAX,CAAb,CAHuB;UAK3B,YAKE,WALF,UAL2B;+BAUzB,WAJF,OAN2B;UAOnB,gCAAN,KAPyB;UAQhB,mCAAT,QARyB;UAYrB,gBAAkB,KAAK,QAAL,CAAc,SAAd,EAAlB,cAZqB;;;AAc7B,cAAQ,UAAR;AACE,aAAK,GAAL;;AACE,iBAAO,KAAK,QAAL,CAAc,SAAd,CAAP;AADF,uBAEE,CAAc,IAAd,CAAmB,UAAnB,EAFF;AAGE,wBAAc,IAAd,CAAmB,IAAnB,EAHF;AAIE,gBAJF;AADF,aAMO,GAAL;;AACE,iBAAO,KAAK,QAAL,CAAc,SAAd,CAAP,CADF;AAEE,wBAAc,IAAd,CAAmB,IAAnB,EAFF;AAGE,gBAHF;AANF,aAUO,GAAL;;AACE,wBAAc,IAAd,CAAmB,UAAnB,EADF;AAEE,gBAFF;AAVF;AAcI,iBAAO,KAAK,QAAL,CAAc,SAAd,CAAP,CADF;AAEE,wBAAc,IAAd,CAAmB,OAAnB,EAA4B,IAAI,KAAJ,CAAU,gBAAgB,UAAhB,GAA4B,UAA5B,GAAwC,GAAxC,CAAtC,EAFF;AAGE,gBAHF;AAbF,OAd6B;;;;;;;;;;uCAsCZ;AACjB,WAAK,SAAL,GAAiB,IAAjB,CADiB;AAEjB,WAAK,IAAL,CAAU,SAAV,EAFiB;;AAIjB,WAAK,YAAL,GAJiB;;;;;;;;;wCAUC,OAAO;AACzB,WAAK,qBAAL,CAA2B;AACzB,iBAAS,kBAAT;AACA,iBAAS,KAAT;OAFF,EADyB;;;;;;;;;;mCAWZ;AACb,aAAO,KAAK,KAAL,CAAW,MAAX,GAAoB,CAApB,EAAuB;2BACV,KAAK,KAAL,CAAW,KAAX,GADU;;YACtB,+BADsB;;AAE5B,aAAK,WAAL,CAAiB,OAAjB,EAF4B;OAA9B;;;;;;;;;iDAS0C;UAApB,wBAAoB;UAAX,wBAAW;;AAC1C,UAAM,WAAW,KAAK,QAAL,CADyB;AAE1C,UAAI,gBAAJ,CAF0C;AAG1C,UAAM,QAAQ,IAAI,KAAJ,CAAU,OAAV,CAAR,CAHoC;AAI1C,YAAM,OAAN,GAAgB,OAAhB;;;AAJ0C,UAO1C,CAAK,KAAL,CAAW,MAAX,GAAoB,CAApB,CAP0C;AAQ1C,WAAK,QAAL,GAAgB,EAAhB,CAR0C;;AAU1C,aAAO,IAAP,CAAY,QAAZ,EAAsB,OAAtB,CAA8B,UAAC,GAAD,EAAS;AACrC,kBAAU,SAAS,GAAT,CAAV,CADqC;AAErC,gBAAQ,aAAR,CAAsB,IAAtB,CAA2B,OAA3B,EAAoC,KAApC,EAFqC;OAAT,CAA9B,CAV0C;;;;;;;;;;;;;;iCAwB/B,WAA+C;UAApC,oEAAc,kBAAsB;UAAlB,oEAAc,kBAAI;;kCAC9B,MAAM,uBAAN,CAA8B,SAA9B,EAAyC,WAAzC,EAD8B;;UACpD,wCADoD;UAC3C,0CAD2C;qBAEd,KAAK,OAAL,CAFc;UAElD,+BAFkD;UAEvC,iBAFuC;UAEnC,yBAFmC;UAE3B,6BAF2B;;;AAI1D,UAAM,WAAW,EAAE,gBAAF,EAAW,kBAAX,EAAqB,cAArB,EAA6B,kBAA7B,EAAX,CAJoD;AAK1D,UAAM,OAAO,iBAAE,QAAF,CAAW,YAAY,IAAZ,IAAoB,EAApB,EAAwB,QAAnC,CAAP,CALoD;;AAO1D,UAAM;AACJ,mBAAW,mBAAK,EAAL,EAAX;AACA;AACA;AACA;SACG,YALC,CAPoD;;AAe1D,UAAI,KAAK,UAAL,EAAiB;;AAEnB,gBAAQ,SAAR,GAAoB,QAAQ,SAAR,IAAqB,SAArB,IAAkC,SAAlC,CAFD;AAGnB,gBAAQ,IAAR,CAAa,OAAb,GAAuB,KAAK,SAAL,CAHJ;OAArB;;AAMA,aAAO,OAAP,CArB0D;;;;gCAwBhD,SAAS;AACnB,UAAM,oBAAoB,KAAK,OAAL,CAAa,MAAb,GAAsB,KAAK,SAAL,CAAe,OAAf,CAAtB;;;;AADP,UAKf,gBAAgB,IAAI,UAAJ,CAAe,IAAI,kBAAkB,MAAlB,CAAnC,CALe;AAMnB,oBAAc,CAAd,IAAmB,KAAK,OAAL,CAAa,MAAb,CAAoB,MAApB,CANA;;AAQnB,WAAK,IAAI,IAAI,CAAJ,EAAO,IAAI,kBAAkB,MAAlB,EAA0B,GAA9C,EAAmD;AACjD,sBAAc,IAAI,CAAJ,CAAd,GAAuB,kBAAkB,UAAlB,CAA6B,CAA7B,CAAvB,CADiD;OAAnD;;AAIA,WAAK,UAAL,CAAgB,WAAhB,CAA4B,aAA5B,EAZmB;;;;;;;;;;;;;;;;;;;;;4BA8Bb,QAA8C;UAAtC,iEAAW,kBAA2B;UAAvB,gEAAU,kBAAa;;AACpD,UAAI,+BAAgB,uBAAc,CAAd,oDAAc,CAAd,KAAhB,CADgD;;AAGpD,UAAI,OAAO,OAAP,KAAmB,UAAnB,EAA+B;AACjC,mBAAW,OAAX,CADiC;AAEjC,kBAAU,EAAV,CAFiC;OAAnC;;AAKA,UAAM,gBAAgB,KAAK,aAAL,CAAmB,MAAnB,EAA2B,QAA3B,EAAqC,OAArC,CAAhB;;;;;AAR8C,UAa5C,iBAAmB,KAAK,OAAL,CAAnB,eAb4C;;;AAepD,qBAAe,aAAf,EAA8B,QAA9B,EAfoD;;;;;;;;;;;;;;;;;;;2BA+B/C,QAAQ,UAAU,SAAS;AAChC,UAAM,gBAAgB,KAAK,aAAL,CAAmB,MAAnB,EAA2B,QAA3B,EAAqC,OAArC,CAAhB,CAD0B;AAEhC,UAAM,sBAAN;;;;AAFgC,UAM1B,UAAU,EAAE,QAAF,CACd,EAAE,GAAF,CAAM;YAAa,aAAV,OAAU;eAAY;OAAzB,CADQ,EAEd,EAAE,QAAF,EAFc,CAAV,CAN0B;;AAWhC,UAAI,YAAY,cAAc,IAAd,CAAmB,OAAnB,CAAZ,CAX4B;;AAahC,oBAAc,EAAd,CAAiB,OAAjB,EAA0B,UAAC,CAAD,EAAO;AAC/B,kBAAU,IAAV,CAAe,OAAf,EAAwB,IAAI,KAAJ,CAAU,CAAV,CAAxB,EAD+B;OAAP,CAA1B,CAbgC;;AAiBhC,aAAO,SAAP,CAjBgC;;;;;;;;;;;;;;;;;;;;;kCAmCpB,QAAQ,UAAU,YAAY;AAC1C,UAAI,SAAS,4BAAkB,EAAE,YAAY,IAAZ,EAApB,CAAT,CADsC;;AAG1C,UAAM,UAAU;AACd,iBAAS,KAAK,YAAL,CAAkB,MAAlB,EAA0B,QAA1B,EAAoC,UAApC,CAAT;AACA,uBAAe,MAAf;OAFI,CAHoC;;AAQ1C,WAAK,WAAL,CAAiB,OAAjB;;AAR0C,aAUnC,MAAP,CAV0C;;;;;;;;;;;;gCAmBhC,SAAS;UAEjB,UAIE,QAJF,QAFiB;UAIf,YAEA,QAHF,QACE,UAJe;;;AAQnB,WAAK,QAAL,CAAc,SAAd,IAA2B,OAA3B,CARmB;;AAUnB,UAAI,KAAK,SAAL,EAAgB;AAClB,aAAK,WAAL,CAAiB,OAAjB,EADkB;OAApB,MAEO;AACL,aAAK,KAAL,CAAW,IAAX,CAAgB,OAAhB,EADK;OAFP;;;;SA9SE;;;kBAsTS","file":"GremlinClient.js","sourceRoot":"/Users/victor/Desktop/gremlin-javascript","sourcesContent":["/*jslint -W079 */\n/*jslint node: true */\nimport { EventEmitter } from 'events';\n\nimport uuid from 'node-uuid';\nimport _ from 'lodash';\nimport highland from 'highland';\n\nimport WebSocketGremlinConnection from './WebSocketGremlinConnection';\nimport MessageStream from './MessageStream';\nimport executeHandler from './executeHandler';\nimport * as Utils from './utils';\n\n\nclass GremlinClient extends EventEmitter {\n  constructor(port = 8182, host = 'localhost', options = {}) {\n    super();\n\n    this.port = port;\n    this.host = host;\n\n    const { path = '' } = options;\n\n    this.options = {\n      language: 'gremlin-groovy',\n      session: false,\n      op: 'eval',\n      processor: '',\n      accept: 'application/json',\n      executeHandler,\n      ...options,\n      path: path.length && !path.startsWith('/') ? `/${path}` : path\n    }\n\n    this.useSession = this.options.session;\n\n    if (this.useSession) {\n      this.sessionId = uuid.v1();\n    }\n\n    this.connected = false;\n    this.queue = [];\n\n    this.commands = {};\n\n    this.connection = this.createConnection({\n      port,\n      host,\n      path: this.options.path\n    });\n  }\n\n  createConnection({ port, host, path }) {\n    const connection = new WebSocketGremlinConnection({ port, host, path });\n\n    connection.on('open', () => this.onConnectionOpen());\n    connection.on('error', (error) => this.handleError(error));\n    connection.on('message', (message) => this.handleProtocolMessage(message));\n    connection.on('close', (event) => this.handleDisconnection(event))\n\n    return connection;\n  }\n\n  handleError(err) {\n    this.connected = false;\n    this.emit('error', err);\n  }\n\n  /**\n   * Process all incoming raw message events sent by Gremlin Server, and dispatch\n   * to the appropriate command.\n   *\n   * @param {MessageEvent} event\n   */\n  handleProtocolMessage(message) {\n    const { data } = message;\n    const buffer = new Buffer(data, 'binary');\n    const rawMessage = JSON.parse(buffer.toString('utf-8'));\n    const {\n      requestId,\n      status: {\n        code: statusCode,\n        message: statusMessage\n      }\n    } = rawMessage;\n\n    const { messageStream } = this.commands[requestId];\n\n    switch (statusCode) {\n      case 200: // SUCCESS\n        delete this.commands[requestId]; // TODO: optimize performance\n        messageStream.push(rawMessage);\n        messageStream.push(null);\n        break;\n      case 204: // NO_CONTENT\n        delete this.commands[requestId];\n        messageStream.push(null);\n        break;\n      case 206: // PARTIAL_CONTENT\n        messageStream.push(rawMessage);\n        break;\n      default:\n        delete this.commands[requestId];\n        messageStream.emit('error', new Error(statusMessage + ' (Error '+ statusCode +')'));\n        break;\n    }\n  }\n\n  /**\n   * Handle the WebSocket onOpen event, flag the client as connected and\n   * process command queue.\n   */\n  onConnectionOpen() {\n    this.connected = true;\n    this.emit('connect');\n\n    this.executeQueue();\n  };\n\n  /**\n   * @param {CloseEvent} event\n   */\n  handleDisconnection(event) {\n    this.cancelPendingCommands({\n      message: 'WebSocket closed',\n      details: event\n    });\n  };\n\n  /**\n   * Process the current command queue, sending commands to Gremlin Server\n   * (First In, First Out).\n   */\n  executeQueue() {\n    while (this.queue.length > 0) {\n      let { message } = this.queue.shift();\n      this.sendMessage(message);\n    }\n  };\n\n  /**\n   * @param {Object} reason\n   */\n  cancelPendingCommands({ message, details }) {\n    const commands = this.commands;\n    let command;\n    const error = new Error(message);\n    error.details = details;\n\n    // Empty queue\n    this.queue.length = 0;\n    this.commands = {};\n\n    Object.keys(commands).forEach((key) => {\n      command = commands[key];\n      command.messageStream.emit('error', error);\n    });\n  };\n\n  /**\n   * For a given script string and optional bound parameters, build a protocol\n   * message object to be sent to Gremlin Server.\n   *\n   * @param {String|Function} script\n   * @param {Object} bindings\n   * @param {Object} message\n   */\n  buildMessage(rawScript, rawBindings = {}, baseMessage = {}) {\n    let { gremlin, bindings } = Utils.buildQueryFromSignature(rawScript, rawBindings);\n    const { processor, op, accept, language } = this.options;\n\n    const baseArgs = { gremlin, bindings, accept, language };\n    const args = _.defaults(baseMessage.args || {}, baseArgs);\n\n    const message = {\n      requestId: uuid.v1(),\n      processor,\n      op,\n      args,\n      ...baseMessage\n    };\n\n    if (this.useSession) {\n      // Assume that people want to use the 'session' processor unless specified\n      message.processor = message.processor || processor || 'session';\n      message.args.session = this.sessionId;\n    }\n\n    return message;\n  };\n\n  sendMessage(message) {\n    const serializedMessage = this.options.accept + JSON.stringify(message);\n\n    // Let's start packing the message into binary\n    // mimeLength(1) + mimeType Length + serializedMessage Length\n    let binaryMessage = new Uint8Array(1 + serializedMessage.length);\n    binaryMessage[0] = this.options.accept.length;\n\n    for (let i = 0; i < serializedMessage.length; i++) {\n      binaryMessage[i + 1] = serializedMessage.charCodeAt(i);\n    }\n\n    this.connection.sendMessage(binaryMessage);\n  };\n\n  /**\n   * Asynchronously send a script to Gremlin Server for execution and fire\n   * the provided callback when all results have been fetched.\n   *\n   * This method internally uses a stream to handle the potential concatenation\n   * of results.\n   *\n   * Callback signature: (Error, Array<result>)\n   *\n   * @public\n   * @param {String|Function} script\n   * @param {Object} bindings\n   * @param {Object} message\n   * @param {Function} callback\n   */\n  execute(script, bindings = {}, message = {}, ...args) {\n    let callback = args[args.length - 1];\n\n    if (typeof message === 'function') {\n      callback = message;\n      message = {};\n    }\n\n    const messageStream = this.messageStream(script, bindings, message);\n\n    // TO CHECK: errors handling could be improved\n    // See https://groups.google.com/d/msg/nodejs/lJYT9hZxFu0/L59CFbqWGyYJ\n    // for an example using domains\n    const { executeHandler } = this.options;\n\n    executeHandler(messageStream, callback);\n  }\n\n  /**\n   * Execute the script and return a stream of distinct/single results.\n   * This method reemits a distinct data event for each returned result, which\n   * makes the stream behave as if `resultIterationBatchSize` was set to 1.\n   *\n   * If you do not wish this behavior, please use client.messageStream() instead.\n   *\n   * Even though this method uses Highland.js internally, it does not return\n   * a high level Highland readable stream so we do not risk having to deal\n   * with unexpected API breaking changes as Highland.js evolves.\n   *\n   * @return {ReadableStream} A Node.js Stream2\n   */\n  stream(script, bindings, message) {\n    const messageStream = this.messageStream(script, bindings, message);\n    const _ = highland; // override lo-dash locally\n\n    // Create a local highland 'through' pipeline so we don't expose\n    // a Highland stream to the end user, but a standard Node.js Stream2\n    const through = _.pipeline(\n      _.map(({ result: { data }}) => data),\n      _.sequence()\n    );\n\n    let rawStream = messageStream.pipe(through);\n\n    messageStream.on('error', (e) => {\n      rawStream.emit('error', new Error(e));\n    });\n\n    return rawStream;\n  };\n\n  /**\n   * Execute the script and return a stream of raw messages returned by Gremlin\n   * Server.\n   * This method does not reemit one distinct data event per result. It directly\n   * emits the raw messages returned by Gremlin Server as they are received.\n   *\n   * Although public, this is a low level method intended to be used for\n   * advanced usages.\n   *\n   * @public\n   * @param {String|Function} script\n   * @param {Object} bindings\n   * @param {Object} message\n   * @return {MessageStream}\n   */\n  messageStream(script, bindings, rawMessage) {\n    let stream = new MessageStream({ objectMode: true });\n\n    const command = {\n      message: this.buildMessage(script, bindings, rawMessage),\n      messageStream: stream\n    };\n\n    this.sendCommand(command); //todo improve for streams\n\n    return stream;\n  };\n\n  /**\n   * Send a command to Gremlin Server, or add it to queue if the connection\n   * is not established.\n   *\n   * @param {Object} command\n   */\n  sendCommand(command) {\n    const {\n      message,\n      message: {\n        requestId\n      }\n    } = command;\n\n    this.commands[requestId] = command;\n\n    if (this.connected) {\n      this.sendMessage(message);\n    } else {\n      this.queue.push(command);\n    }\n  };\n}\n\nexport default GremlinClient;\n"]}
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2).Buffer))
  
  /***/ },
  /* 2 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(Buffer, global) {/*!
  	 * The buffer module from node.js, for the browser.
  	 *
  	 * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
  	 * @license  MIT
  	 */
  	/* eslint-disable no-proto */
  
  	'use strict'
  
  	var base64 = __webpack_require__(3)
  	var ieee754 = __webpack_require__(4)
  	var isArray = __webpack_require__(5)
  
  	exports.Buffer = Buffer
  	exports.SlowBuffer = SlowBuffer
  	exports.INSPECT_MAX_BYTES = 50
  	Buffer.poolSize = 8192 // not used by this implementation
  
  	var rootParent = {}
  
  	/**
  	 * If `Buffer.TYPED_ARRAY_SUPPORT`:
  	 *   === true    Use Uint8Array implementation (fastest)
  	 *   === false   Use Object implementation (most compatible, even IE6)
  	 *
  	 * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,
  	 * Opera 11.6+, iOS 4.2+.
  	 *
  	 * Due to various browser bugs, sometimes the Object implementation will be used even
  	 * when the browser supports typed arrays.
  	 *
  	 * Note:
  	 *
  	 *   - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,
  	 *     See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.
  	 *
  	 *   - Safari 5-7 lacks support for changing the `Object.prototype.constructor` property
  	 *     on objects.
  	 *
  	 *   - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.
  	 *
  	 *   - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of
  	 *     incorrect length in some situations.
  
  	 * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they
  	 * get the Object implementation, which is slower but behaves correctly.
  	 */
  	Buffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined
  	  ? global.TYPED_ARRAY_SUPPORT
  	  : typedArraySupport()
  
  	function typedArraySupport () {
  	  function Bar () {}
  	  try {
  	    var arr = new Uint8Array(1)
  	    arr.foo = function () { return 42 }
  	    arr.constructor = Bar
  	    return arr.foo() === 42 && // typed array instances can be augmented
  	        arr.constructor === Bar && // constructor can be set
  	        typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray`
  	        arr.subarray(1, 1).byteLength === 0 // ie10 has broken `subarray`
  	  } catch (e) {
  	    return false
  	  }
  	}
  
  	function kMaxLength () {
  	  return Buffer.TYPED_ARRAY_SUPPORT
  	    ? 0x7fffffff
  	    : 0x3fffffff
  	}
  
  	/**
  	 * Class: Buffer
  	 * =============
  	 *
  	 * The Buffer constructor returns instances of `Uint8Array` that are augmented
  	 * with function properties for all the node `Buffer` API functions. We use
  	 * `Uint8Array` so that square bracket notation works as expected -- it returns
  	 * a single octet.
  	 *
  	 * By augmenting the instances, we can avoid modifying the `Uint8Array`
  	 * prototype.
  	 */
  	function Buffer (arg) {
  	  if (!(this instanceof Buffer)) {
  	    // Avoid going through an ArgumentsAdaptorTrampoline in the common case.
  	    if (arguments.length > 1) return new Buffer(arg, arguments[1])
  	    return new Buffer(arg)
  	  }
  
  	  if (!Buffer.TYPED_ARRAY_SUPPORT) {
  	    this.length = 0
  	    this.parent = undefined
  	  }
  
  	  // Common case.
  	  if (typeof arg === 'number') {
  	    return fromNumber(this, arg)
  	  }
  
  	  // Slightly less common case.
  	  if (typeof arg === 'string') {
  	    return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')
  	  }
  
  	  // Unusual.
  	  return fromObject(this, arg)
  	}
  
  	function fromNumber (that, length) {
  	  that = allocate(that, length < 0 ? 0 : checked(length) | 0)
  	  if (!Buffer.TYPED_ARRAY_SUPPORT) {
  	    for (var i = 0; i < length; i++) {
  	      that[i] = 0
  	    }
  	  }
  	  return that
  	}
  
  	function fromString (that, string, encoding) {
  	  if (typeof encoding !== 'string' || encoding === '') encoding = 'utf8'
  
  	  // Assumption: byteLength() return value is always < kMaxLength.
  	  var length = byteLength(string, encoding) | 0
  	  that = allocate(that, length)
  
  	  that.write(string, encoding)
  	  return that
  	}
  
  	function fromObject (that, object) {
  	  if (Buffer.isBuffer(object)) return fromBuffer(that, object)
  
  	  if (isArray(object)) return fromArray(that, object)
  
  	  if (object == null) {
  	    throw new TypeError('must start with number, buffer, array or string')
  	  }
  
  	  if (typeof ArrayBuffer !== 'undefined') {
  	    if (object.buffer instanceof ArrayBuffer) {
  	      return fromTypedArray(that, object)
  	    }
  	    if (object instanceof ArrayBuffer) {
  	      return fromArrayBuffer(that, object)
  	    }
  	  }
  
  	  if (object.length) return fromArrayLike(that, object)
  
  	  return fromJsonObject(that, object)
  	}
  
  	function fromBuffer (that, buffer) {
  	  var length = checked(buffer.length) | 0
  	  that = allocate(that, length)
  	  buffer.copy(that, 0, 0, length)
  	  return that
  	}
  
  	function fromArray (that, array) {
  	  var length = checked(array.length) | 0
  	  that = allocate(that, length)
  	  for (var i = 0; i < length; i += 1) {
  	    that[i] = array[i] & 255
  	  }
  	  return that
  	}
  
  	// Duplicate of fromArray() to keep fromArray() monomorphic.
  	function fromTypedArray (that, array) {
  	  var length = checked(array.length) | 0
  	  that = allocate(that, length)
  	  // Truncating the elements is probably not what people expect from typed
  	  // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior
  	  // of the old Buffer constructor.
  	  for (var i = 0; i < length; i += 1) {
  	    that[i] = array[i] & 255
  	  }
  	  return that
  	}
  
  	function fromArrayBuffer (that, array) {
  	  if (Buffer.TYPED_ARRAY_SUPPORT) {
  	    // Return an augmented `Uint8Array` instance, for best performance
  	    array.byteLength
  	    that = Buffer._augment(new Uint8Array(array))
  	  } else {
  	    // Fallback: Return an object instance of the Buffer class
  	    that = fromTypedArray(that, new Uint8Array(array))
  	  }
  	  return that
  	}
  
  	function fromArrayLike (that, array) {
  	  var length = checked(array.length) | 0
  	  that = allocate(that, length)
  	  for (var i = 0; i < length; i += 1) {
  	    that[i] = array[i] & 255
  	  }
  	  return that
  	}
  
  	// Deserialize { type: 'Buffer', data: [1,2,3,...] } into a Buffer object.
  	// Returns a zero-length buffer for inputs that don't conform to the spec.
  	function fromJsonObject (that, object) {
  	  var array
  	  var length = 0
  
  	  if (object.type === 'Buffer' && isArray(object.data)) {
  	    array = object.data
  	    length = checked(array.length) | 0
  	  }
  	  that = allocate(that, length)
  
  	  for (var i = 0; i < length; i += 1) {
  	    that[i] = array[i] & 255
  	  }
  	  return that
  	}
  
  	if (Buffer.TYPED_ARRAY_SUPPORT) {
  	  Buffer.prototype.__proto__ = Uint8Array.prototype
  	  Buffer.__proto__ = Uint8Array
  	} else {
  	  // pre-set for values that may exist in the future
  	  Buffer.prototype.length = undefined
  	  Buffer.prototype.parent = undefined
  	}
  
  	function allocate (that, length) {
  	  if (Buffer.TYPED_ARRAY_SUPPORT) {
  	    // Return an augmented `Uint8Array` instance, for best performance
  	    that = Buffer._augment(new Uint8Array(length))
  	    that.__proto__ = Buffer.prototype
  	  } else {
  	    // Fallback: Return an object instance of the Buffer class
  	    that.length = length
  	    that._isBuffer = true
  	  }
  
  	  var fromPool = length !== 0 && length <= Buffer.poolSize >>> 1
  	  if (fromPool) that.parent = rootParent
  
  	  return that
  	}
  
  	function checked (length) {
  	  // Note: cannot use `length < kMaxLength` here because that fails when
  	  // length is NaN (which is otherwise coerced to zero.)
  	  if (length >= kMaxLength()) {
  	    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +
  	                         'size: 0x' + kMaxLength().toString(16) + ' bytes')
  	  }
  	  return length | 0
  	}
  
  	function SlowBuffer (subject, encoding) {
  	  if (!(this instanceof SlowBuffer)) return new SlowBuffer(subject, encoding)
  
  	  var buf = new Buffer(subject, encoding)
  	  delete buf.parent
  	  return buf
  	}
  
  	Buffer.isBuffer = function isBuffer (b) {
  	  return !!(b != null && b._isBuffer)
  	}
  
  	Buffer.compare = function compare (a, b) {
  	  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {
  	    throw new TypeError('Arguments must be Buffers')
  	  }
  
  	  if (a === b) return 0
  
  	  var x = a.length
  	  var y = b.length
  
  	  var i = 0
  	  var len = Math.min(x, y)
  	  while (i < len) {
  	    if (a[i] !== b[i]) break
  
  	    ++i
  	  }
  
  	  if (i !== len) {
  	    x = a[i]
  	    y = b[i]
  	  }
  
  	  if (x < y) return -1
  	  if (y < x) return 1
  	  return 0
  	}
  
  	Buffer.isEncoding = function isEncoding (encoding) {
  	  switch (String(encoding).toLowerCase()) {
  	    case 'hex':
  	    case 'utf8':
  	    case 'utf-8':
  	    case 'ascii':
  	    case 'binary':
  	    case 'base64':
  	    case 'raw':
  	    case 'ucs2':
  	    case 'ucs-2':
  	    case 'utf16le':
  	    case 'utf-16le':
  	      return true
  	    default:
  	      return false
  	  }
  	}
  
  	Buffer.concat = function concat (list, length) {
  	  if (!isArray(list)) throw new TypeError('list argument must be an Array of Buffers.')
  
  	  if (list.length === 0) {
  	    return new Buffer(0)
  	  }
  
  	  var i
  	  if (length === undefined) {
  	    length = 0
  	    for (i = 0; i < list.length; i++) {
  	      length += list[i].length
  	    }
  	  }
  
  	  var buf = new Buffer(length)
  	  var pos = 0
  	  for (i = 0; i < list.length; i++) {
  	    var item = list[i]
  	    item.copy(buf, pos)
  	    pos += item.length
  	  }
  	  return buf
  	}
  
  	function byteLength (string, encoding) {
  	  if (typeof string !== 'string') string = '' + string
  
  	  var len = string.length
  	  if (len === 0) return 0
  
  	  // Use a for loop to avoid recursion
  	  var loweredCase = false
  	  for (;;) {
  	    switch (encoding) {
  	      case 'ascii':
  	      case 'binary':
  	      // Deprecated
  	      case 'raw':
  	      case 'raws':
  	        return len
  	      case 'utf8':
  	      case 'utf-8':
  	        return utf8ToBytes(string).length
  	      case 'ucs2':
  	      case 'ucs-2':
  	      case 'utf16le':
  	      case 'utf-16le':
  	        return len * 2
  	      case 'hex':
  	        return len >>> 1
  	      case 'base64':
  	        return base64ToBytes(string).length
  	      default:
  	        if (loweredCase) return utf8ToBytes(string).length // assume utf8
  	        encoding = ('' + encoding).toLowerCase()
  	        loweredCase = true
  	    }
  	  }
  	}
  	Buffer.byteLength = byteLength
  
  	function slowToString (encoding, start, end) {
  	  var loweredCase = false
  
  	  start = start | 0
  	  end = end === undefined || end === Infinity ? this.length : end | 0
  
  	  if (!encoding) encoding = 'utf8'
  	  if (start < 0) start = 0
  	  if (end > this.length) end = this.length
  	  if (end <= start) return ''
  
  	  while (true) {
  	    switch (encoding) {
  	      case 'hex':
  	        return hexSlice(this, start, end)
  
  	      case 'utf8':
  	      case 'utf-8':
  	        return utf8Slice(this, start, end)
  
  	      case 'ascii':
  	        return asciiSlice(this, start, end)
  
  	      case 'binary':
  	        return binarySlice(this, start, end)
  
  	      case 'base64':
  	        return base64Slice(this, start, end)
  
  	      case 'ucs2':
  	      case 'ucs-2':
  	      case 'utf16le':
  	      case 'utf-16le':
  	        return utf16leSlice(this, start, end)
  
  	      default:
  	        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
  	        encoding = (encoding + '').toLowerCase()
  	        loweredCase = true
  	    }
  	  }
  	}
  
  	Buffer.prototype.toString = function toString () {
  	  var length = this.length | 0
  	  if (length === 0) return ''
  	  if (arguments.length === 0) return utf8Slice(this, 0, length)
  	  return slowToString.apply(this, arguments)
  	}
  
  	Buffer.prototype.equals = function equals (b) {
  	  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')
  	  if (this === b) return true
  	  return Buffer.compare(this, b) === 0
  	}
  
  	Buffer.prototype.inspect = function inspect () {
  	  var str = ''
  	  var max = exports.INSPECT_MAX_BYTES
  	  if (this.length > 0) {
  	    str = this.toString('hex', 0, max).match(/.{2}/g).join(' ')
  	    if (this.length > max) str += ' ... '
  	  }
  	  return '<Buffer ' + str + '>'
  	}
  
  	Buffer.prototype.compare = function compare (b) {
  	  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')
  	  if (this === b) return 0
  	  return Buffer.compare(this, b)
  	}
  
  	Buffer.prototype.indexOf = function indexOf (val, byteOffset) {
  	  if (byteOffset > 0x7fffffff) byteOffset = 0x7fffffff
  	  else if (byteOffset < -0x80000000) byteOffset = -0x80000000
  	  byteOffset >>= 0
  
  	  if (this.length === 0) return -1
  	  if (byteOffset >= this.length) return -1
  
  	  // Negative offsets start from the end of the buffer
  	  if (byteOffset < 0) byteOffset = Math.max(this.length + byteOffset, 0)
  
  	  if (typeof val === 'string') {
  	    if (val.length === 0) return -1 // special case: looking for empty string always fails
  	    return String.prototype.indexOf.call(this, val, byteOffset)
  	  }
  	  if (Buffer.isBuffer(val)) {
  	    return arrayIndexOf(this, val, byteOffset)
  	  }
  	  if (typeof val === 'number') {
  	    if (Buffer.TYPED_ARRAY_SUPPORT && Uint8Array.prototype.indexOf === 'function') {
  	      return Uint8Array.prototype.indexOf.call(this, val, byteOffset)
  	    }
  	    return arrayIndexOf(this, [ val ], byteOffset)
  	  }
  
  	  function arrayIndexOf (arr, val, byteOffset) {
  	    var foundIndex = -1
  	    for (var i = 0; byteOffset + i < arr.length; i++) {
  	      if (arr[byteOffset + i] === val[foundIndex === -1 ? 0 : i - foundIndex]) {
  	        if (foundIndex === -1) foundIndex = i
  	        if (i - foundIndex + 1 === val.length) return byteOffset + foundIndex
  	      } else {
  	        foundIndex = -1
  	      }
  	    }
  	    return -1
  	  }
  
  	  throw new TypeError('val must be string, number or Buffer')
  	}
  
  	// `get` is deprecated
  	Buffer.prototype.get = function get (offset) {
  	  console.log('.get() is deprecated. Access using array indexes instead.')
  	  return this.readUInt8(offset)
  	}
  
  	// `set` is deprecated
  	Buffer.prototype.set = function set (v, offset) {
  	  console.log('.set() is deprecated. Access using array indexes instead.')
  	  return this.writeUInt8(v, offset)
  	}
  
  	function hexWrite (buf, string, offset, length) {
  	  offset = Number(offset) || 0
  	  var remaining = buf.length - offset
  	  if (!length) {
  	    length = remaining
  	  } else {
  	    length = Number(length)
  	    if (length > remaining) {
  	      length = remaining
  	    }
  	  }
  
  	  // must be an even number of digits
  	  var strLen = string.length
  	  if (strLen % 2 !== 0) throw new Error('Invalid hex string')
  
  	  if (length > strLen / 2) {
  	    length = strLen / 2
  	  }
  	  for (var i = 0; i < length; i++) {
  	    var parsed = parseInt(string.substr(i * 2, 2), 16)
  	    if (isNaN(parsed)) throw new Error('Invalid hex string')
  	    buf[offset + i] = parsed
  	  }
  	  return i
  	}
  
  	function utf8Write (buf, string, offset, length) {
  	  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)
  	}
  
  	function asciiWrite (buf, string, offset, length) {
  	  return blitBuffer(asciiToBytes(string), buf, offset, length)
  	}
  
  	function binaryWrite (buf, string, offset, length) {
  	  return asciiWrite(buf, string, offset, length)
  	}
  
  	function base64Write (buf, string, offset, length) {
  	  return blitBuffer(base64ToBytes(string), buf, offset, length)
  	}
  
  	function ucs2Write (buf, string, offset, length) {
  	  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)
  	}
  
  	Buffer.prototype.write = function write (string, offset, length, encoding) {
  	  // Buffer#write(string)
  	  if (offset === undefined) {
  	    encoding = 'utf8'
  	    length = this.length
  	    offset = 0
  	  // Buffer#write(string, encoding)
  	  } else if (length === undefined && typeof offset === 'string') {
  	    encoding = offset
  	    length = this.length
  	    offset = 0
  	  // Buffer#write(string, offset[, length][, encoding])
  	  } else if (isFinite(offset)) {
  	    offset = offset | 0
  	    if (isFinite(length)) {
  	      length = length | 0
  	      if (encoding === undefined) encoding = 'utf8'
  	    } else {
  	      encoding = length
  	      length = undefined
  	    }
  	  // legacy write(string, encoding, offset, length) - remove in v0.13
  	  } else {
  	    var swap = encoding
  	    encoding = offset
  	    offset = length | 0
  	    length = swap
  	  }
  
  	  var remaining = this.length - offset
  	  if (length === undefined || length > remaining) length = remaining
  
  	  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {
  	    throw new RangeError('attempt to write outside buffer bounds')
  	  }
  
  	  if (!encoding) encoding = 'utf8'
  
  	  var loweredCase = false
  	  for (;;) {
  	    switch (encoding) {
  	      case 'hex':
  	        return hexWrite(this, string, offset, length)
  
  	      case 'utf8':
  	      case 'utf-8':
  	        return utf8Write(this, string, offset, length)
  
  	      case 'ascii':
  	        return asciiWrite(this, string, offset, length)
  
  	      case 'binary':
  	        return binaryWrite(this, string, offset, length)
  
  	      case 'base64':
  	        // Warning: maxLength not taken into account in base64Write
  	        return base64Write(this, string, offset, length)
  
  	      case 'ucs2':
  	      case 'ucs-2':
  	      case 'utf16le':
  	      case 'utf-16le':
  	        return ucs2Write(this, string, offset, length)
  
  	      default:
  	        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
  	        encoding = ('' + encoding).toLowerCase()
  	        loweredCase = true
  	    }
  	  }
  	}
  
  	Buffer.prototype.toJSON = function toJSON () {
  	  return {
  	    type: 'Buffer',
  	    data: Array.prototype.slice.call(this._arr || this, 0)
  	  }
  	}
  
  	function base64Slice (buf, start, end) {
  	  if (start === 0 && end === buf.length) {
  	    return base64.fromByteArray(buf)
  	  } else {
  	    return base64.fromByteArray(buf.slice(start, end))
  	  }
  	}
  
  	function utf8Slice (buf, start, end) {
  	  end = Math.min(buf.length, end)
  	  var res = []
  
  	  var i = start
  	  while (i < end) {
  	    var firstByte = buf[i]
  	    var codePoint = null
  	    var bytesPerSequence = (firstByte > 0xEF) ? 4
  	      : (firstByte > 0xDF) ? 3
  	      : (firstByte > 0xBF) ? 2
  	      : 1
  
  	    if (i + bytesPerSequence <= end) {
  	      var secondByte, thirdByte, fourthByte, tempCodePoint
  
  	      switch (bytesPerSequence) {
  	        case 1:
  	          if (firstByte < 0x80) {
  	            codePoint = firstByte
  	          }
  	          break
  	        case 2:
  	          secondByte = buf[i + 1]
  	          if ((secondByte & 0xC0) === 0x80) {
  	            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)
  	            if (tempCodePoint > 0x7F) {
  	              codePoint = tempCodePoint
  	            }
  	          }
  	          break
  	        case 3:
  	          secondByte = buf[i + 1]
  	          thirdByte = buf[i + 2]
  	          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {
  	            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)
  	            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {
  	              codePoint = tempCodePoint
  	            }
  	          }
  	          break
  	        case 4:
  	          secondByte = buf[i + 1]
  	          thirdByte = buf[i + 2]
  	          fourthByte = buf[i + 3]
  	          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {
  	            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)
  	            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {
  	              codePoint = tempCodePoint
  	            }
  	          }
  	      }
  	    }
  
  	    if (codePoint === null) {
  	      // we did not generate a valid codePoint so insert a
  	      // replacement char (U+FFFD) and advance only 1 byte
  	      codePoint = 0xFFFD
  	      bytesPerSequence = 1
  	    } else if (codePoint > 0xFFFF) {
  	      // encode to utf16 (surrogate pair dance)
  	      codePoint -= 0x10000
  	      res.push(codePoint >>> 10 & 0x3FF | 0xD800)
  	      codePoint = 0xDC00 | codePoint & 0x3FF
  	    }
  
  	    res.push(codePoint)
  	    i += bytesPerSequence
  	  }
  
  	  return decodeCodePointsArray(res)
  	}
  
  	// Based on http://stackoverflow.com/a/22747272/680742, the browser with
  	// the lowest limit is Chrome, with 0x10000 args.
  	// We go 1 magnitude less, for safety
  	var MAX_ARGUMENTS_LENGTH = 0x1000
  
  	function decodeCodePointsArray (codePoints) {
  	  var len = codePoints.length
  	  if (len <= MAX_ARGUMENTS_LENGTH) {
  	    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()
  	  }
  
  	  // Decode in chunks to avoid "call stack size exceeded".
  	  var res = ''
  	  var i = 0
  	  while (i < len) {
  	    res += String.fromCharCode.apply(
  	      String,
  	      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)
  	    )
  	  }
  	  return res
  	}
  
  	function asciiSlice (buf, start, end) {
  	  var ret = ''
  	  end = Math.min(buf.length, end)
  
  	  for (var i = start; i < end; i++) {
  	    ret += String.fromCharCode(buf[i] & 0x7F)
  	  }
  	  return ret
  	}
  
  	function binarySlice (buf, start, end) {
  	  var ret = ''
  	  end = Math.min(buf.length, end)
  
  	  for (var i = start; i < end; i++) {
  	    ret += String.fromCharCode(buf[i])
  	  }
  	  return ret
  	}
  
  	function hexSlice (buf, start, end) {
  	  var len = buf.length
  
  	  if (!start || start < 0) start = 0
  	  if (!end || end < 0 || end > len) end = len
  
  	  var out = ''
  	  for (var i = start; i < end; i++) {
  	    out += toHex(buf[i])
  	  }
  	  return out
  	}
  
  	function utf16leSlice (buf, start, end) {
  	  var bytes = buf.slice(start, end)
  	  var res = ''
  	  for (var i = 0; i < bytes.length; i += 2) {
  	    res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256)
  	  }
  	  return res
  	}
  
  	Buffer.prototype.slice = function slice (start, end) {
  	  var len = this.length
  	  start = ~~start
  	  end = end === undefined ? len : ~~end
  
  	  if (start < 0) {
  	    start += len
  	    if (start < 0) start = 0
  	  } else if (start > len) {
  	    start = len
  	  }
  
  	  if (end < 0) {
  	    end += len
  	    if (end < 0) end = 0
  	  } else if (end > len) {
  	    end = len
  	  }
  
  	  if (end < start) end = start
  
  	  var newBuf
  	  if (Buffer.TYPED_ARRAY_SUPPORT) {
  	    newBuf = Buffer._augment(this.subarray(start, end))
  	  } else {
  	    var sliceLen = end - start
  	    newBuf = new Buffer(sliceLen, undefined)
  	    for (var i = 0; i < sliceLen; i++) {
  	      newBuf[i] = this[i + start]
  	    }
  	  }
  
  	  if (newBuf.length) newBuf.parent = this.parent || this
  
  	  return newBuf
  	}
  
  	/*
  	 * Need to make sure that buffer isn't trying to write out of bounds.
  	 */
  	function checkOffset (offset, ext, length) {
  	  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')
  	  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')
  	}
  
  	Buffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {
  	  offset = offset | 0
  	  byteLength = byteLength | 0
  	  if (!noAssert) checkOffset(offset, byteLength, this.length)
  
  	  var val = this[offset]
  	  var mul = 1
  	  var i = 0
  	  while (++i < byteLength && (mul *= 0x100)) {
  	    val += this[offset + i] * mul
  	  }
  
  	  return val
  	}
  
  	Buffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {
  	  offset = offset | 0
  	  byteLength = byteLength | 0
  	  if (!noAssert) {
  	    checkOffset(offset, byteLength, this.length)
  	  }
  
  	  var val = this[offset + --byteLength]
  	  var mul = 1
  	  while (byteLength > 0 && (mul *= 0x100)) {
  	    val += this[offset + --byteLength] * mul
  	  }
  
  	  return val
  	}
  
  	Buffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 1, this.length)
  	  return this[offset]
  	}
  
  	Buffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 2, this.length)
  	  return this[offset] | (this[offset + 1] << 8)
  	}
  
  	Buffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 2, this.length)
  	  return (this[offset] << 8) | this[offset + 1]
  	}
  
  	Buffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 4, this.length)
  
  	  return ((this[offset]) |
  	      (this[offset + 1] << 8) |
  	      (this[offset + 2] << 16)) +
  	      (this[offset + 3] * 0x1000000)
  	}
  
  	Buffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 4, this.length)
  
  	  return (this[offset] * 0x1000000) +
  	    ((this[offset + 1] << 16) |
  	    (this[offset + 2] << 8) |
  	    this[offset + 3])
  	}
  
  	Buffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {
  	  offset = offset | 0
  	  byteLength = byteLength | 0
  	  if (!noAssert) checkOffset(offset, byteLength, this.length)
  
  	  var val = this[offset]
  	  var mul = 1
  	  var i = 0
  	  while (++i < byteLength && (mul *= 0x100)) {
  	    val += this[offset + i] * mul
  	  }
  	  mul *= 0x80
  
  	  if (val >= mul) val -= Math.pow(2, 8 * byteLength)
  
  	  return val
  	}
  
  	Buffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {
  	  offset = offset | 0
  	  byteLength = byteLength | 0
  	  if (!noAssert) checkOffset(offset, byteLength, this.length)
  
  	  var i = byteLength
  	  var mul = 1
  	  var val = this[offset + --i]
  	  while (i > 0 && (mul *= 0x100)) {
  	    val += this[offset + --i] * mul
  	  }
  	  mul *= 0x80
  
  	  if (val >= mul) val -= Math.pow(2, 8 * byteLength)
  
  	  return val
  	}
  
  	Buffer.prototype.readInt8 = function readInt8 (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 1, this.length)
  	  if (!(this[offset] & 0x80)) return (this[offset])
  	  return ((0xff - this[offset] + 1) * -1)
  	}
  
  	Buffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 2, this.length)
  	  var val = this[offset] | (this[offset + 1] << 8)
  	  return (val & 0x8000) ? val | 0xFFFF0000 : val
  	}
  
  	Buffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 2, this.length)
  	  var val = this[offset + 1] | (this[offset] << 8)
  	  return (val & 0x8000) ? val | 0xFFFF0000 : val
  	}
  
  	Buffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 4, this.length)
  
  	  return (this[offset]) |
  	    (this[offset + 1] << 8) |
  	    (this[offset + 2] << 16) |
  	    (this[offset + 3] << 24)
  	}
  
  	Buffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 4, this.length)
  
  	  return (this[offset] << 24) |
  	    (this[offset + 1] << 16) |
  	    (this[offset + 2] << 8) |
  	    (this[offset + 3])
  	}
  
  	Buffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 4, this.length)
  	  return ieee754.read(this, offset, true, 23, 4)
  	}
  
  	Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 4, this.length)
  	  return ieee754.read(this, offset, false, 23, 4)
  	}
  
  	Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 8, this.length)
  	  return ieee754.read(this, offset, true, 52, 8)
  	}
  
  	Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {
  	  if (!noAssert) checkOffset(offset, 8, this.length)
  	  return ieee754.read(this, offset, false, 52, 8)
  	}
  
  	function checkInt (buf, value, offset, ext, max, min) {
  	  if (!Buffer.isBuffer(buf)) throw new TypeError('buffer must be a Buffer instance')
  	  if (value > max || value < min) throw new RangeError('value is out of bounds')
  	  if (offset + ext > buf.length) throw new RangeError('index out of range')
  	}
  
  	Buffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  byteLength = byteLength | 0
  	  if (!noAssert) checkInt(this, value, offset, byteLength, Math.pow(2, 8 * byteLength), 0)
  
  	  var mul = 1
  	  var i = 0
  	  this[offset] = value & 0xFF
  	  while (++i < byteLength && (mul *= 0x100)) {
  	    this[offset + i] = (value / mul) & 0xFF
  	  }
  
  	  return offset + byteLength
  	}
  
  	Buffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  byteLength = byteLength | 0
  	  if (!noAssert) checkInt(this, value, offset, byteLength, Math.pow(2, 8 * byteLength), 0)
  
  	  var i = byteLength - 1
  	  var mul = 1
  	  this[offset + i] = value & 0xFF
  	  while (--i >= 0 && (mul *= 0x100)) {
  	    this[offset + i] = (value / mul) & 0xFF
  	  }
  
  	  return offset + byteLength
  	}
  
  	Buffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)
  	  if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)
  	  this[offset] = (value & 0xff)
  	  return offset + 1
  	}
  
  	function objectWriteUInt16 (buf, value, offset, littleEndian) {
  	  if (value < 0) value = 0xffff + value + 1
  	  for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; i++) {
  	    buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>
  	      (littleEndian ? i : 1 - i) * 8
  	  }
  	}
  
  	Buffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)
  	  if (Buffer.TYPED_ARRAY_SUPPORT) {
  	    this[offset] = (value & 0xff)
  	    this[offset + 1] = (value >>> 8)
  	  } else {
  	    objectWriteUInt16(this, value, offset, true)
  	  }
  	  return offset + 2
  	}
  
  	Buffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)
  	  if (Buffer.TYPED_ARRAY_SUPPORT) {
  	    this[offset] = (value >>> 8)
  	    this[offset + 1] = (value & 0xff)
  	  } else {
  	    objectWriteUInt16(this, value, offset, false)
  	  }
  	  return offset + 2
  	}
  
  	function objectWriteUInt32 (buf, value, offset, littleEndian) {
  	  if (value < 0) value = 0xffffffff + value + 1
  	  for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; i++) {
  	    buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff
  	  }
  	}
  
  	Buffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)
  	  if (Buffer.TYPED_ARRAY_SUPPORT) {
  	    this[offset + 3] = (value >>> 24)
  	    this[offset + 2] = (value >>> 16)
  	    this[offset + 1] = (value >>> 8)
  	    this[offset] = (value & 0xff)
  	  } else {
  	    objectWriteUInt32(this, value, offset, true)
  	  }
  	  return offset + 4
  	}
  
  	Buffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)
  	  if (Buffer.TYPED_ARRAY_SUPPORT) {
  	    this[offset] = (value >>> 24)
  	    this[offset + 1] = (value >>> 16)
  	    this[offset + 2] = (value >>> 8)
  	    this[offset + 3] = (value & 0xff)
  	  } else {
  	    objectWriteUInt32(this, value, offset, false)
  	  }
  	  return offset + 4
  	}
  
  	Buffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) {
  	    var limit = Math.pow(2, 8 * byteLength - 1)
  
  	    checkInt(this, value, offset, byteLength, limit - 1, -limit)
  	  }
  
  	  var i = 0
  	  var mul = 1
  	  var sub = value < 0 ? 1 : 0
  	  this[offset] = value & 0xFF
  	  while (++i < byteLength && (mul *= 0x100)) {
  	    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF
  	  }
  
  	  return offset + byteLength
  	}
  
  	Buffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) {
  	    var limit = Math.pow(2, 8 * byteLength - 1)
  
  	    checkInt(this, value, offset, byteLength, limit - 1, -limit)
  	  }
  
  	  var i = byteLength - 1
  	  var mul = 1
  	  var sub = value < 0 ? 1 : 0
  	  this[offset + i] = value & 0xFF
  	  while (--i >= 0 && (mul *= 0x100)) {
  	    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF
  	  }
  
  	  return offset + byteLength
  	}
  
  	Buffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)
  	  if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)
  	  if (value < 0) value = 0xff + value + 1
  	  this[offset] = (value & 0xff)
  	  return offset + 1
  	}
  
  	Buffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)
  	  if (Buffer.TYPED_ARRAY_SUPPORT) {
  	    this[offset] = (value & 0xff)
  	    this[offset + 1] = (value >>> 8)
  	  } else {
  	    objectWriteUInt16(this, value, offset, true)
  	  }
  	  return offset + 2
  	}
  
  	Buffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)
  	  if (Buffer.TYPED_ARRAY_SUPPORT) {
  	    this[offset] = (value >>> 8)
  	    this[offset + 1] = (value & 0xff)
  	  } else {
  	    objectWriteUInt16(this, value, offset, false)
  	  }
  	  return offset + 2
  	}
  
  	Buffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)
  	  if (Buffer.TYPED_ARRAY_SUPPORT) {
  	    this[offset] = (value & 0xff)
  	    this[offset + 1] = (value >>> 8)
  	    this[offset + 2] = (value >>> 16)
  	    this[offset + 3] = (value >>> 24)
  	  } else {
  	    objectWriteUInt32(this, value, offset, true)
  	  }
  	  return offset + 4
  	}
  
  	Buffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {
  	  value = +value
  	  offset = offset | 0
  	  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)
  	  if (value < 0) value = 0xffffffff + value + 1
  	  if (Buffer.TYPED_ARRAY_SUPPORT) {
  	    this[offset] = (value >>> 24)
  	    this[offset + 1] = (value >>> 16)
  	    this[offset + 2] = (value >>> 8)
  	    this[offset + 3] = (value & 0xff)
  	  } else {
  	    objectWriteUInt32(this, value, offset, false)
  	  }
  	  return offset + 4
  	}
  
  	function checkIEEE754 (buf, value, offset, ext, max, min) {
  	  if (value > max || value < min) throw new RangeError('value is out of bounds')
  	  if (offset + ext > buf.length) throw new RangeError('index out of range')
  	  if (offset < 0) throw new RangeError('index out of range')
  	}
  
  	function writeFloat (buf, value, offset, littleEndian, noAssert) {
  	  if (!noAssert) {
  	    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)
  	  }
  	  ieee754.write(buf, value, offset, littleEndian, 23, 4)
  	  return offset + 4
  	}
  
  	Buffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {
  	  return writeFloat(this, value, offset, true, noAssert)
  	}
  
  	Buffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {
  	  return writeFloat(this, value, offset, false, noAssert)
  	}
  
  	function writeDouble (buf, value, offset, littleEndian, noAssert) {
  	  if (!noAssert) {
  	    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)
  	  }
  	  ieee754.write(buf, value, offset, littleEndian, 52, 8)
  	  return offset + 8
  	}
  
  	Buffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {
  	  return writeDouble(this, value, offset, true, noAssert)
  	}
  
  	Buffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {
  	  return writeDouble(this, value, offset, false, noAssert)
  	}
  
  	// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)
  	Buffer.prototype.copy = function copy (target, targetStart, start, end) {
  	  if (!start) start = 0
  	  if (!end && end !== 0) end = this.length
  	  if (targetStart >= target.length) targetStart = target.length
  	  if (!targetStart) targetStart = 0
  	  if (end > 0 && end < start) end = start
  
  	  // Copy 0 bytes; we're done
  	  if (end === start) return 0
  	  if (target.length === 0 || this.length === 0) return 0
  
  	  // Fatal error conditions
  	  if (targetStart < 0) {
  	    throw new RangeError('targetStart out of bounds')
  	  }
  	  if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds')
  	  if (end < 0) throw new RangeError('sourceEnd out of bounds')
  
  	  // Are we oob?
  	  if (end > this.length) end = this.length
  	  if (target.length - targetStart < end - start) {
  	    end = target.length - targetStart + start
  	  }
  
  	  var len = end - start
  	  var i
  
  	  if (this === target && start < targetStart && targetStart < end) {
  	    // descending copy from end
  	    for (i = len - 1; i >= 0; i--) {
  	      target[i + targetStart] = this[i + start]
  	    }
  	  } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {
  	    // ascending copy from start
  	    for (i = 0; i < len; i++) {
  	      target[i + targetStart] = this[i + start]
  	    }
  	  } else {
  	    target._set(this.subarray(start, start + len), targetStart)
  	  }
  
  	  return len
  	}
  
  	// fill(value, start=0, end=buffer.length)
  	Buffer.prototype.fill = function fill (value, start, end) {
  	  if (!value) value = 0
  	  if (!start) start = 0
  	  if (!end) end = this.length
  
  	  if (end < start) throw new RangeError('end < start')
  
  	  // Fill 0 bytes; we're done
  	  if (end === start) return
  	  if (this.length === 0) return
  
  	  if (start < 0 || start >= this.length) throw new RangeError('start out of bounds')
  	  if (end < 0 || end > this.length) throw new RangeError('end out of bounds')
  
  	  var i
  	  if (typeof value === 'number') {
  	    for (i = start; i < end; i++) {
  	      this[i] = value
  	    }
  	  } else {
  	    var bytes = utf8ToBytes(value.toString())
  	    var len = bytes.length
  	    for (i = start; i < end; i++) {
  	      this[i] = bytes[i % len]
  	    }
  	  }
  
  	  return this
  	}
  
  	/**
  	 * Creates a new `ArrayBuffer` with the *copied* memory of the buffer instance.
  	 * Added in Node 0.12. Only available in browsers that support ArrayBuffer.
  	 */
  	Buffer.prototype.toArrayBuffer = function toArrayBuffer () {
  	  if (typeof Uint8Array !== 'undefined') {
  	    if (Buffer.TYPED_ARRAY_SUPPORT) {
  	      return (new Buffer(this)).buffer
  	    } else {
  	      var buf = new Uint8Array(this.length)
  	      for (var i = 0, len = buf.length; i < len; i += 1) {
  	        buf[i] = this[i]
  	      }
  	      return buf.buffer
  	    }
  	  } else {
  	    throw new TypeError('Buffer.toArrayBuffer not supported in this browser')
  	  }
  	}
  
  	// HELPER FUNCTIONS
  	// ================
  
  	var BP = Buffer.prototype
  
  	/**
  	 * Augment a Uint8Array *instance* (not the Uint8Array class!) with Buffer methods
  	 */
  	Buffer._augment = function _augment (arr) {
  	  arr.constructor = Buffer
  	  arr._isBuffer = true
  
  	  // save reference to original Uint8Array set method before overwriting
  	  arr._set = arr.set
  
  	  // deprecated
  	  arr.get = BP.get
  	  arr.set = BP.set
  
  	  arr.write = BP.write
  	  arr.toString = BP.toString
  	  arr.toLocaleString = BP.toString
  	  arr.toJSON = BP.toJSON
  	  arr.equals = BP.equals
  	  arr.compare = BP.compare
  	  arr.indexOf = BP.indexOf
  	  arr.copy = BP.copy
  	  arr.slice = BP.slice
  	  arr.readUIntLE = BP.readUIntLE
  	  arr.readUIntBE = BP.readUIntBE
  	  arr.readUInt8 = BP.readUInt8
  	  arr.readUInt16LE = BP.readUInt16LE
  	  arr.readUInt16BE = BP.readUInt16BE
  	  arr.readUInt32LE = BP.readUInt32LE
  	  arr.readUInt32BE = BP.readUInt32BE
  	  arr.readIntLE = BP.readIntLE
  	  arr.readIntBE = BP.readIntBE
  	  arr.readInt8 = BP.readInt8
  	  arr.readInt16LE = BP.readInt16LE
  	  arr.readInt16BE = BP.readInt16BE
  	  arr.readInt32LE = BP.readInt32LE
  	  arr.readInt32BE = BP.readInt32BE
  	  arr.readFloatLE = BP.readFloatLE
  	  arr.readFloatBE = BP.readFloatBE
  	  arr.readDoubleLE = BP.readDoubleLE
  	  arr.readDoubleBE = BP.readDoubleBE
  	  arr.writeUInt8 = BP.writeUInt8
  	  arr.writeUIntLE = BP.writeUIntLE
  	  arr.writeUIntBE = BP.writeUIntBE
  	  arr.writeUInt16LE = BP.writeUInt16LE
  	  arr.writeUInt16BE = BP.writeUInt16BE
  	  arr.writeUInt32LE = BP.writeUInt32LE
  	  arr.writeUInt32BE = BP.writeUInt32BE
  	  arr.writeIntLE = BP.writeIntLE
  	  arr.writeIntBE = BP.writeIntBE
  	  arr.writeInt8 = BP.writeInt8
  	  arr.writeInt16LE = BP.writeInt16LE
  	  arr.writeInt16BE = BP.writeInt16BE
  	  arr.writeInt32LE = BP.writeInt32LE
  	  arr.writeInt32BE = BP.writeInt32BE
  	  arr.writeFloatLE = BP.writeFloatLE
  	  arr.writeFloatBE = BP.writeFloatBE
  	  arr.writeDoubleLE = BP.writeDoubleLE
  	  arr.writeDoubleBE = BP.writeDoubleBE
  	  arr.fill = BP.fill
  	  arr.inspect = BP.inspect
  	  arr.toArrayBuffer = BP.toArrayBuffer
  
  	  return arr
  	}
  
  	var INVALID_BASE64_RE = /[^+\/0-9A-Za-z-_]/g
  
  	function base64clean (str) {
  	  // Node strips out invalid characters like \n and \t from the string, base64-js does not
  	  str = stringtrim(str).replace(INVALID_BASE64_RE, '')
  	  // Node converts strings with length < 2 to ''
  	  if (str.length < 2) return ''
  	  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not
  	  while (str.length % 4 !== 0) {
  	    str = str + '='
  	  }
  	  return str
  	}
  
  	function stringtrim (str) {
  	  if (str.trim) return str.trim()
  	  return str.replace(/^\s+|\s+$/g, '')
  	}
  
  	function toHex (n) {
  	  if (n < 16) return '0' + n.toString(16)
  	  return n.toString(16)
  	}
  
  	function utf8ToBytes (string, units) {
  	  units = units || Infinity
  	  var codePoint
  	  var length = string.length
  	  var leadSurrogate = null
  	  var bytes = []
  
  	  for (var i = 0; i < length; i++) {
  	    codePoint = string.charCodeAt(i)
  
  	    // is surrogate component
  	    if (codePoint > 0xD7FF && codePoint < 0xE000) {
  	      // last char was a lead
  	      if (!leadSurrogate) {
  	        // no lead yet
  	        if (codePoint > 0xDBFF) {
  	          // unexpected trail
  	          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
  	          continue
  	        } else if (i + 1 === length) {
  	          // unpaired lead
  	          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
  	          continue
  	        }
  
  	        // valid lead
  	        leadSurrogate = codePoint
  
  	        continue
  	      }
  
  	      // 2 leads in a row
  	      if (codePoint < 0xDC00) {
  	        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
  	        leadSurrogate = codePoint
  	        continue
  	      }
  
  	      // valid surrogate pair
  	      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000
  	    } else if (leadSurrogate) {
  	      // valid bmp char, but last char was a lead
  	      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
  	    }
  
  	    leadSurrogate = null
  
  	    // encode utf8
  	    if (codePoint < 0x80) {
  	      if ((units -= 1) < 0) break
  	      bytes.push(codePoint)
  	    } else if (codePoint < 0x800) {
  	      if ((units -= 2) < 0) break
  	      bytes.push(
  	        codePoint >> 0x6 | 0xC0,
  	        codePoint & 0x3F | 0x80
  	      )
  	    } else if (codePoint < 0x10000) {
  	      if ((units -= 3) < 0) break
  	      bytes.push(
  	        codePoint >> 0xC | 0xE0,
  	        codePoint >> 0x6 & 0x3F | 0x80,
  	        codePoint & 0x3F | 0x80
  	      )
  	    } else if (codePoint < 0x110000) {
  	      if ((units -= 4) < 0) break
  	      bytes.push(
  	        codePoint >> 0x12 | 0xF0,
  	        codePoint >> 0xC & 0x3F | 0x80,
  	        codePoint >> 0x6 & 0x3F | 0x80,
  	        codePoint & 0x3F | 0x80
  	      )
  	    } else {
  	      throw new Error('Invalid code point')
  	    }
  	  }
  
  	  return bytes
  	}
  
  	function asciiToBytes (str) {
  	  var byteArray = []
  	  for (var i = 0; i < str.length; i++) {
  	    // Node's code seems to be doing this and not & 0x7F..
  	    byteArray.push(str.charCodeAt(i) & 0xFF)
  	  }
  	  return byteArray
  	}
  
  	function utf16leToBytes (str, units) {
  	  var c, hi, lo
  	  var byteArray = []
  	  for (var i = 0; i < str.length; i++) {
  	    if ((units -= 2) < 0) break
  
  	    c = str.charCodeAt(i)
  	    hi = c >> 8
  	    lo = c % 256
  	    byteArray.push(lo)
  	    byteArray.push(hi)
  	  }
  
  	  return byteArray
  	}
  
  	function base64ToBytes (str) {
  	  return base64.toByteArray(base64clean(str))
  	}
  
  	function blitBuffer (src, dst, offset, length) {
  	  for (var i = 0; i < length; i++) {
  	    if ((i + offset >= dst.length) || (i >= src.length)) break
  	    dst[i + offset] = src[i]
  	  }
  	  return i
  	}
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2).Buffer, (function() { return this; }())))
  
  /***/ },
  /* 3 */
  /***/ function(module, exports, __webpack_require__) {
  
  	var lookup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
  
  	;(function (exports) {
  		'use strict';
  
  	  var Arr = (typeof Uint8Array !== 'undefined')
  	    ? Uint8Array
  	    : Array
  
  		var PLUS   = '+'.charCodeAt(0)
  		var SLASH  = '/'.charCodeAt(0)
  		var NUMBER = '0'.charCodeAt(0)
  		var LOWER  = 'a'.charCodeAt(0)
  		var UPPER  = 'A'.charCodeAt(0)
  		var PLUS_URL_SAFE = '-'.charCodeAt(0)
  		var SLASH_URL_SAFE = '_'.charCodeAt(0)
  
  		function decode (elt) {
  			var code = elt.charCodeAt(0)
  			if (code === PLUS ||
  			    code === PLUS_URL_SAFE)
  				return 62 // '+'
  			if (code === SLASH ||
  			    code === SLASH_URL_SAFE)
  				return 63 // '/'
  			if (code < NUMBER)
  				return -1 //no match
  			if (code < NUMBER + 10)
  				return code - NUMBER + 26 + 26
  			if (code < UPPER + 26)
  				return code - UPPER
  			if (code < LOWER + 26)
  				return code - LOWER + 26
  		}
  
  		function b64ToByteArray (b64) {
  			var i, j, l, tmp, placeHolders, arr
  
  			if (b64.length % 4 > 0) {
  				throw new Error('Invalid string. Length must be a multiple of 4')
  			}
  
  			// the number of equal signs (place holders)
  			// if there are two placeholders, than the two characters before it
  			// represent one byte
  			// if there is only one, then the three characters before it represent 2 bytes
  			// this is just a cheap hack to not do indexOf twice
  			var len = b64.length
  			placeHolders = '=' === b64.charAt(len - 2) ? 2 : '=' === b64.charAt(len - 1) ? 1 : 0
  
  			// base64 is 4/3 + up to two characters of the original data
  			arr = new Arr(b64.length * 3 / 4 - placeHolders)
  
  			// if there are placeholders, only get up to the last complete 4 chars
  			l = placeHolders > 0 ? b64.length - 4 : b64.length
  
  			var L = 0
  
  			function push (v) {
  				arr[L++] = v
  			}
  
  			for (i = 0, j = 0; i < l; i += 4, j += 3) {
  				tmp = (decode(b64.charAt(i)) << 18) | (decode(b64.charAt(i + 1)) << 12) | (decode(b64.charAt(i + 2)) << 6) | decode(b64.charAt(i + 3))
  				push((tmp & 0xFF0000) >> 16)
  				push((tmp & 0xFF00) >> 8)
  				push(tmp & 0xFF)
  			}
  
  			if (placeHolders === 2) {
  				tmp = (decode(b64.charAt(i)) << 2) | (decode(b64.charAt(i + 1)) >> 4)
  				push(tmp & 0xFF)
  			} else if (placeHolders === 1) {
  				tmp = (decode(b64.charAt(i)) << 10) | (decode(b64.charAt(i + 1)) << 4) | (decode(b64.charAt(i + 2)) >> 2)
  				push((tmp >> 8) & 0xFF)
  				push(tmp & 0xFF)
  			}
  
  			return arr
  		}
  
  		function uint8ToBase64 (uint8) {
  			var i,
  				extraBytes = uint8.length % 3, // if we have 1 byte left, pad 2 bytes
  				output = "",
  				temp, length
  
  			function encode (num) {
  				return lookup.charAt(num)
  			}
  
  			function tripletToBase64 (num) {
  				return encode(num >> 18 & 0x3F) + encode(num >> 12 & 0x3F) + encode(num >> 6 & 0x3F) + encode(num & 0x3F)
  			}
  
  			// go through the array every three bytes, we'll deal with trailing stuff later
  			for (i = 0, length = uint8.length - extraBytes; i < length; i += 3) {
  				temp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2])
  				output += tripletToBase64(temp)
  			}
  
  			// pad the end with zeros, but make sure to not forget the extra bytes
  			switch (extraBytes) {
  				case 1:
  					temp = uint8[uint8.length - 1]
  					output += encode(temp >> 2)
  					output += encode((temp << 4) & 0x3F)
  					output += '=='
  					break
  				case 2:
  					temp = (uint8[uint8.length - 2] << 8) + (uint8[uint8.length - 1])
  					output += encode(temp >> 10)
  					output += encode((temp >> 4) & 0x3F)
  					output += encode((temp << 2) & 0x3F)
  					output += '='
  					break
  			}
  
  			return output
  		}
  
  		exports.toByteArray = b64ToByteArray
  		exports.fromByteArray = uint8ToBase64
  	}( false ? (this.base64js = {}) : exports))
  
  
  /***/ },
  /* 4 */
  /***/ function(module, exports) {
  
  	exports.read = function (buffer, offset, isLE, mLen, nBytes) {
  	  var e, m
  	  var eLen = nBytes * 8 - mLen - 1
  	  var eMax = (1 << eLen) - 1
  	  var eBias = eMax >> 1
  	  var nBits = -7
  	  var i = isLE ? (nBytes - 1) : 0
  	  var d = isLE ? -1 : 1
  	  var s = buffer[offset + i]
  
  	  i += d
  
  	  e = s & ((1 << (-nBits)) - 1)
  	  s >>= (-nBits)
  	  nBits += eLen
  	  for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8) {}
  
  	  m = e & ((1 << (-nBits)) - 1)
  	  e >>= (-nBits)
  	  nBits += mLen
  	  for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8) {}
  
  	  if (e === 0) {
  	    e = 1 - eBias
  	  } else if (e === eMax) {
  	    return m ? NaN : ((s ? -1 : 1) * Infinity)
  	  } else {
  	    m = m + Math.pow(2, mLen)
  	    e = e - eBias
  	  }
  	  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)
  	}
  
  	exports.write = function (buffer, value, offset, isLE, mLen, nBytes) {
  	  var e, m, c
  	  var eLen = nBytes * 8 - mLen - 1
  	  var eMax = (1 << eLen) - 1
  	  var eBias = eMax >> 1
  	  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)
  	  var i = isLE ? 0 : (nBytes - 1)
  	  var d = isLE ? 1 : -1
  	  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0
  
  	  value = Math.abs(value)
  
  	  if (isNaN(value) || value === Infinity) {
  	    m = isNaN(value) ? 1 : 0
  	    e = eMax
  	  } else {
  	    e = Math.floor(Math.log(value) / Math.LN2)
  	    if (value * (c = Math.pow(2, -e)) < 1) {
  	      e--
  	      c *= 2
  	    }
  	    if (e + eBias >= 1) {
  	      value += rt / c
  	    } else {
  	      value += rt * Math.pow(2, 1 - eBias)
  	    }
  	    if (value * c >= 2) {
  	      e++
  	      c /= 2
  	    }
  
  	    if (e + eBias >= eMax) {
  	      m = 0
  	      e = eMax
  	    } else if (e + eBias >= 1) {
  	      m = (value * c - 1) * Math.pow(2, mLen)
  	      e = e + eBias
  	    } else {
  	      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)
  	      e = 0
  	    }
  	  }
  
  	  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}
  
  	  e = (e << mLen) | m
  	  eLen += mLen
  	  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}
  
  	  buffer[offset + i - d] |= s * 128
  	}
  
  
  /***/ },
  /* 5 */
  /***/ function(module, exports) {
  
  	var toString = {}.toString;
  
  	module.exports = Array.isArray || function (arr) {
  	  return toString.call(arr) == '[object Array]';
  	};
  
  
  /***/ },
  /* 6 */
  /***/ function(module, exports) {
  
  	// Copyright Joyent, Inc. and other Node contributors.
  	//
  	// Permission is hereby granted, free of charge, to any person obtaining a
  	// copy of this software and associated documentation files (the
  	// "Software"), to deal in the Software without restriction, including
  	// without limitation the rights to use, copy, modify, merge, publish,
  	// distribute, sublicense, and/or sell copies of the Software, and to permit
  	// persons to whom the Software is furnished to do so, subject to the
  	// following conditions:
  	//
  	// The above copyright notice and this permission notice shall be included
  	// in all copies or substantial portions of the Software.
  	//
  	// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  	// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  	// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
  	// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
  	// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  	// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  	// USE OR OTHER DEALINGS IN THE SOFTWARE.
  
  	function EventEmitter() {
  	  this._events = this._events || {};
  	  this._maxListeners = this._maxListeners || undefined;
  	}
  	module.exports = EventEmitter;
  
  	// Backwards-compat with node 0.10.x
  	EventEmitter.EventEmitter = EventEmitter;
  
  	EventEmitter.prototype._events = undefined;
  	EventEmitter.prototype._maxListeners = undefined;
  
  	// By default EventEmitters will print a warning if more than 10 listeners are
  	// added to it. This is a useful default which helps finding memory leaks.
  	EventEmitter.defaultMaxListeners = 10;
  
  	// Obviously not all Emitters should be limited to 10. This function allows
  	// that to be increased. Set to zero for unlimited.
  	EventEmitter.prototype.setMaxListeners = function(n) {
  	  if (!isNumber(n) || n < 0 || isNaN(n))
  	    throw TypeError('n must be a positive number');
  	  this._maxListeners = n;
  	  return this;
  	};
  
  	EventEmitter.prototype.emit = function(type) {
  	  var er, handler, len, args, i, listeners;
  
  	  if (!this._events)
  	    this._events = {};
  
  	  // If there is no 'error' event listener then throw.
  	  if (type === 'error') {
  	    if (!this._events.error ||
  	        (isObject(this._events.error) && !this._events.error.length)) {
  	      er = arguments[1];
  	      if (er instanceof Error) {
  	        throw er; // Unhandled 'error' event
  	      }
  	      throw TypeError('Uncaught, unspecified "error" event.');
  	    }
  	  }
  
  	  handler = this._events[type];
  
  	  if (isUndefined(handler))
  	    return false;
  
  	  if (isFunction(handler)) {
  	    switch (arguments.length) {
  	      // fast cases
  	      case 1:
  	        handler.call(this);
  	        break;
  	      case 2:
  	        handler.call(this, arguments[1]);
  	        break;
  	      case 3:
  	        handler.call(this, arguments[1], arguments[2]);
  	        break;
  	      // slower
  	      default:
  	        len = arguments.length;
  	        args = new Array(len - 1);
  	        for (i = 1; i < len; i++)
  	          args[i - 1] = arguments[i];
  	        handler.apply(this, args);
  	    }
  	  } else if (isObject(handler)) {
  	    len = arguments.length;
  	    args = new Array(len - 1);
  	    for (i = 1; i < len; i++)
  	      args[i - 1] = arguments[i];
  
  	    listeners = handler.slice();
  	    len = listeners.length;
  	    for (i = 0; i < len; i++)
  	      listeners[i].apply(this, args);
  	  }
  
  	  return true;
  	};
  
  	EventEmitter.prototype.addListener = function(type, listener) {
  	  var m;
  
  	  if (!isFunction(listener))
  	    throw TypeError('listener must be a function');
  
  	  if (!this._events)
  	    this._events = {};
  
  	  // To avoid recursion in the case that type === "newListener"! Before
  	  // adding it to the listeners, first emit "newListener".
  	  if (this._events.newListener)
  	    this.emit('newListener', type,
  	              isFunction(listener.listener) ?
  	              listener.listener : listener);
  
  	  if (!this._events[type])
  	    // Optimize the case of one listener. Don't need the extra array object.
  	    this._events[type] = listener;
  	  else if (isObject(this._events[type]))
  	    // If we've already got an array, just append.
  	    this._events[type].push(listener);
  	  else
  	    // Adding the second element, need to change to array.
  	    this._events[type] = [this._events[type], listener];
  
  	  // Check for listener leak
  	  if (isObject(this._events[type]) && !this._events[type].warned) {
  	    var m;
  	    if (!isUndefined(this._maxListeners)) {
  	      m = this._maxListeners;
  	    } else {
  	      m = EventEmitter.defaultMaxListeners;
  	    }
  
  	    if (m && m > 0 && this._events[type].length > m) {
  	      this._events[type].warned = true;
  	      console.error('(node) warning: possible EventEmitter memory ' +
  	                    'leak detected. %d listeners added. ' +
  	                    'Use emitter.setMaxListeners() to increase limit.',
  	                    this._events[type].length);
  	      if (typeof console.trace === 'function') {
  	        // not supported in IE 10
  	        console.trace();
  	      }
  	    }
  	  }
  
  	  return this;
  	};
  
  	EventEmitter.prototype.on = EventEmitter.prototype.addListener;
  
  	EventEmitter.prototype.once = function(type, listener) {
  	  if (!isFunction(listener))
  	    throw TypeError('listener must be a function');
  
  	  var fired = false;
  
  	  function g() {
  	    this.removeListener(type, g);
  
  	    if (!fired) {
  	      fired = true;
  	      listener.apply(this, arguments);
  	    }
  	  }
  
  	  g.listener = listener;
  	  this.on(type, g);
  
  	  return this;
  	};
  
  	// emits a 'removeListener' event iff the listener was removed
  	EventEmitter.prototype.removeListener = function(type, listener) {
  	  var list, position, length, i;
  
  	  if (!isFunction(listener))
  	    throw TypeError('listener must be a function');
  
  	  if (!this._events || !this._events[type])
  	    return this;
  
  	  list = this._events[type];
  	  length = list.length;
  	  position = -1;
  
  	  if (list === listener ||
  	      (isFunction(list.listener) && list.listener === listener)) {
  	    delete this._events[type];
  	    if (this._events.removeListener)
  	      this.emit('removeListener', type, listener);
  
  	  } else if (isObject(list)) {
  	    for (i = length; i-- > 0;) {
  	      if (list[i] === listener ||
  	          (list[i].listener && list[i].listener === listener)) {
  	        position = i;
  	        break;
  	      }
  	    }
  
  	    if (position < 0)
  	      return this;
  
  	    if (list.length === 1) {
  	      list.length = 0;
  	      delete this._events[type];
  	    } else {
  	      list.splice(position, 1);
  	    }
  
  	    if (this._events.removeListener)
  	      this.emit('removeListener', type, listener);
  	  }
  
  	  return this;
  	};
  
  	EventEmitter.prototype.removeAllListeners = function(type) {
  	  var key, listeners;
  
  	  if (!this._events)
  	    return this;
  
  	  // not listening for removeListener, no need to emit
  	  if (!this._events.removeListener) {
  	    if (arguments.length === 0)
  	      this._events = {};
  	    else if (this._events[type])
  	      delete this._events[type];
  	    return this;
  	  }
  
  	  // emit removeListener for all listeners on all events
  	  if (arguments.length === 0) {
  	    for (key in this._events) {
  	      if (key === 'removeListener') continue;
  	      this.removeAllListeners(key);
  	    }
  	    this.removeAllListeners('removeListener');
  	    this._events = {};
  	    return this;
  	  }
  
  	  listeners = this._events[type];
  
  	  if (isFunction(listeners)) {
  	    this.removeListener(type, listeners);
  	  } else {
  	    // LIFO order
  	    while (listeners.length)
  	      this.removeListener(type, listeners[listeners.length - 1]);
  	  }
  	  delete this._events[type];
  
  	  return this;
  	};
  
  	EventEmitter.prototype.listeners = function(type) {
  	  var ret;
  	  if (!this._events || !this._events[type])
  	    ret = [];
  	  else if (isFunction(this._events[type]))
  	    ret = [this._events[type]];
  	  else
  	    ret = this._events[type].slice();
  	  return ret;
  	};
  
  	EventEmitter.listenerCount = function(emitter, type) {
  	  var ret;
  	  if (!emitter._events || !emitter._events[type])
  	    ret = 0;
  	  else if (isFunction(emitter._events[type]))
  	    ret = 1;
  	  else
  	    ret = emitter._events[type].length;
  	  return ret;
  	};
  
  	function isFunction(arg) {
  	  return typeof arg === 'function';
  	}
  
  	function isNumber(arg) {
  	  return typeof arg === 'number';
  	}
  
  	function isObject(arg) {
  	  return typeof arg === 'object' && arg !== null;
  	}
  
  	function isUndefined(arg) {
  	  return arg === void 0;
  	}
  
  
  /***/ },
  /* 7 */
  /***/ function(module, exports, __webpack_require__) {
  
  	var __WEBPACK_AMD_DEFINE_RESULT__;/* WEBPACK VAR INJECTION */(function(Buffer) {//     uuid.js
  	//
  	//     Copyright (c) 2010-2012 Robert Kieffer
  	//     MIT License - http://opensource.org/licenses/mit-license.php
  
  	/*global window, require, define */
  	(function(_window) {
  	  'use strict';
  
  	  // Unique ID creation requires a high quality random # generator.  We feature
  	  // detect to determine the best RNG source, normalizing to a function that
  	  // returns 128-bits of randomness, since that's what's usually required
  	  var _rng, _mathRNG, _nodeRNG, _whatwgRNG, _previousRoot;
  
  	  function setupBrowser() {
  	    // Allow for MSIE11 msCrypto
  	    var _crypto = _window.crypto || _window.msCrypto;
  
  	    if (!_rng && _crypto && _crypto.getRandomValues) {
  	      // WHATWG crypto-based RNG - http://wiki.whatwg.org/wiki/Crypto
  	      //
  	      // Moderately fast, high quality
  	      try {
  	        var _rnds8 = new Uint8Array(16);
  	        _whatwgRNG = _rng = function whatwgRNG() {
  	          _crypto.getRandomValues(_rnds8);
  	          return _rnds8;
  	        };
  	        _rng();
  	      } catch(e) {}
  	    }
  
  	    if (!_rng) {
  	      // Math.random()-based (RNG)
  	      //
  	      // If all else fails, use Math.random().  It's fast, but is of unspecified
  	      // quality.
  	      var  _rnds = new Array(16);
  	      _mathRNG = _rng = function() {
  	        for (var i = 0, r; i < 16; i++) {
  	          if ((i & 0x03) === 0) { r = Math.random() * 0x100000000; }
  	          _rnds[i] = r >>> ((i & 0x03) << 3) & 0xff;
  	        }
  
  	        return _rnds;
  	      };
  	      if ('undefined' !== typeof console && console.warn) {
  	        console.warn("[SECURITY] node-uuid: crypto not usable, falling back to insecure Math.random()");
  	      }
  	    }
  	  }
  
  	  function setupNode() {
  	    // Node.js crypto-based RNG - http://nodejs.org/docs/v0.6.2/api/crypto.html
  	    //
  	    // Moderately fast, high quality
  	    if (true) {
  	      try {
  	        var _rb = __webpack_require__(8).randomBytes;
  	        _nodeRNG = _rng = _rb && function() {return _rb(16);};
  	        _rng();
  	      } catch(e) {}
  	    }
  	  }
  
  	  if (_window) {
  	    setupBrowser();
  	  } else {
  	    setupNode();
  	  }
  
  	  // Buffer class to use
  	  var BufferClass = ('function' === typeof Buffer) ? Buffer : Array;
  
  	  // Maps for number <-> hex string conversion
  	  var _byteToHex = [];
  	  var _hexToByte = {};
  	  for (var i = 0; i < 256; i++) {
  	    _byteToHex[i] = (i + 0x100).toString(16).substr(1);
  	    _hexToByte[_byteToHex[i]] = i;
  	  }
  
  	  // **`parse()` - Parse a UUID into it's component bytes**
  	  function parse(s, buf, offset) {
  	    var i = (buf && offset) || 0, ii = 0;
  
  	    buf = buf || [];
  	    s.toLowerCase().replace(/[0-9a-f]{2}/g, function(oct) {
  	      if (ii < 16) { // Don't overflow!
  	        buf[i + ii++] = _hexToByte[oct];
  	      }
  	    });
  
  	    // Zero out remaining bytes if string was short
  	    while (ii < 16) {
  	      buf[i + ii++] = 0;
  	    }
  
  	    return buf;
  	  }
  
  	  // **`unparse()` - Convert UUID byte array (ala parse()) into a string**
  	  function unparse(buf, offset) {
  	    var i = offset || 0, bth = _byteToHex;
  	    return  bth[buf[i++]] + bth[buf[i++]] +
  	            bth[buf[i++]] + bth[buf[i++]] + '-' +
  	            bth[buf[i++]] + bth[buf[i++]] + '-' +
  	            bth[buf[i++]] + bth[buf[i++]] + '-' +
  	            bth[buf[i++]] + bth[buf[i++]] + '-' +
  	            bth[buf[i++]] + bth[buf[i++]] +
  	            bth[buf[i++]] + bth[buf[i++]] +
  	            bth[buf[i++]] + bth[buf[i++]];
  	  }
  
  	  // **`v1()` - Generate time-based UUID**
  	  //
  	  // Inspired by https://github.com/LiosK/UUID.js
  	  // and http://docs.python.org/library/uuid.html
  
  	  // random #'s we need to init node and clockseq
  	  var _seedBytes = _rng();
  
  	  // Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1)
  	  var _nodeId = [
  	    _seedBytes[0] | 0x01,
  	    _seedBytes[1], _seedBytes[2], _seedBytes[3], _seedBytes[4], _seedBytes[5]
  	  ];
  
  	  // Per 4.2.2, randomize (14 bit) clockseq
  	  var _clockseq = (_seedBytes[6] << 8 | _seedBytes[7]) & 0x3fff;
  
  	  // Previous uuid creation time
  	  var _lastMSecs = 0, _lastNSecs = 0;
  
  	  // See https://github.com/broofa/node-uuid for API details
  	  function v1(options, buf, offset) {
  	    var i = buf && offset || 0;
  	    var b = buf || [];
  
  	    options = options || {};
  
  	    var clockseq = (options.clockseq != null) ? options.clockseq : _clockseq;
  
  	    // UUID timestamps are 100 nano-second units since the Gregorian epoch,
  	    // (1582-10-15 00:00).  JSNumbers aren't precise enough for this, so
  	    // time is handled internally as 'msecs' (integer milliseconds) and 'nsecs'
  	    // (100-nanoseconds offset from msecs) since unix epoch, 1970-01-01 00:00.
  	    var msecs = (options.msecs != null) ? options.msecs : new Date().getTime();
  
  	    // Per 4.2.1.2, use count of uuid's generated during the current clock
  	    // cycle to simulate higher resolution clock
  	    var nsecs = (options.nsecs != null) ? options.nsecs : _lastNSecs + 1;
  
  	    // Time since last uuid creation (in msecs)
  	    var dt = (msecs - _lastMSecs) + (nsecs - _lastNSecs)/10000;
  
  	    // Per 4.2.1.2, Bump clockseq on clock regression
  	    if (dt < 0 && options.clockseq == null) {
  	      clockseq = clockseq + 1 & 0x3fff;
  	    }
  
  	    // Reset nsecs if clock regresses (new clockseq) or we've moved onto a new
  	    // time interval
  	    if ((dt < 0 || msecs > _lastMSecs) && options.nsecs == null) {
  	      nsecs = 0;
  	    }
  
  	    // Per 4.2.1.2 Throw error if too many uuids are requested
  	    if (nsecs >= 10000) {
  	      throw new Error('uuid.v1(): Can\'t create more than 10M uuids/sec');
  	    }
  
  	    _lastMSecs = msecs;
  	    _lastNSecs = nsecs;
  	    _clockseq = clockseq;
  
  	    // Per 4.1.4 - Convert from unix epoch to Gregorian epoch
  	    msecs += 12219292800000;
  
  	    // `time_low`
  	    var tl = ((msecs & 0xfffffff) * 10000 + nsecs) % 0x100000000;
  	    b[i++] = tl >>> 24 & 0xff;
  	    b[i++] = tl >>> 16 & 0xff;
  	    b[i++] = tl >>> 8 & 0xff;
  	    b[i++] = tl & 0xff;
  
  	    // `time_mid`
  	    var tmh = (msecs / 0x100000000 * 10000) & 0xfffffff;
  	    b[i++] = tmh >>> 8 & 0xff;
  	    b[i++] = tmh & 0xff;
  
  	    // `time_high_and_version`
  	    b[i++] = tmh >>> 24 & 0xf | 0x10; // include version
  	    b[i++] = tmh >>> 16 & 0xff;
  
  	    // `clock_seq_hi_and_reserved` (Per 4.2.2 - include variant)
  	    b[i++] = clockseq >>> 8 | 0x80;
  
  	    // `clock_seq_low`
  	    b[i++] = clockseq & 0xff;
  
  	    // `node`
  	    var node = options.node || _nodeId;
  	    for (var n = 0; n < 6; n++) {
  	      b[i + n] = node[n];
  	    }
  
  	    return buf ? buf : unparse(b);
  	  }
  
  	  // **`v4()` - Generate random UUID**
  
  	  // See https://github.com/broofa/node-uuid for API details
  	  function v4(options, buf, offset) {
  	    // Deprecated - 'format' argument, as supported in v1.2
  	    var i = buf && offset || 0;
  
  	    if (typeof(options) === 'string') {
  	      buf = (options === 'binary') ? new BufferClass(16) : null;
  	      options = null;
  	    }
  	    options = options || {};
  
  	    var rnds = options.random || (options.rng || _rng)();
  
  	    // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`
  	    rnds[6] = (rnds[6] & 0x0f) | 0x40;
  	    rnds[8] = (rnds[8] & 0x3f) | 0x80;
  
  	    // Copy bytes to buffer, if provided
  	    if (buf) {
  	      for (var ii = 0; ii < 16; ii++) {
  	        buf[i + ii] = rnds[ii];
  	      }
  	    }
  
  	    return buf || unparse(rnds);
  	  }
  
  	  // Export public API
  	  var uuid = v4;
  	  uuid.v1 = v1;
  	  uuid.v4 = v4;
  	  uuid.parse = parse;
  	  uuid.unparse = unparse;
  	  uuid.BufferClass = BufferClass;
  	  uuid._rng = _rng;
  	  uuid._mathRNG = _mathRNG;
  	  uuid._nodeRNG = _nodeRNG;
  	  uuid._whatwgRNG = _whatwgRNG;
  
  	  if (('undefined' !== typeof module) && module.exports) {
  	    // Publish as node.js module
  	    module.exports = uuid;
  	  } else if (true) {
  	    // Publish as AMD module
  	    !(__WEBPACK_AMD_DEFINE_RESULT__ = function() {return uuid;}.call(exports, __webpack_require__, exports, module), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
  
  
  	  } else {
  	    // Publish as global (in browsers)
  	    _previousRoot = _window.uuid;
  
  	    // **`noConflict()` - (browser only) to reset global 'uuid' var**
  	    uuid.noConflict = function() {
  	      _window.uuid = _previousRoot;
  	      return uuid;
  	    };
  
  	    _window.uuid = uuid;
  	  }
  	})('undefined' !== typeof window ? window : null);
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2).Buffer))
  
  /***/ },
  /* 8 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(Buffer) {var rng = __webpack_require__(9)
  
  	function error () {
  	  var m = [].slice.call(arguments).join(' ')
  	  throw new Error([
  	    m,
  	    'we accept pull requests',
  	    'http://github.com/dominictarr/crypto-browserify'
  	    ].join('\n'))
  	}
  
  	exports.createHash = __webpack_require__(11)
  
  	exports.createHmac = __webpack_require__(24)
  
  	exports.randomBytes = function(size, callback) {
  	  if (callback && callback.call) {
  	    try {
  	      callback.call(this, undefined, new Buffer(rng(size)))
  	    } catch (err) { callback(err) }
  	  } else {
  	    return new Buffer(rng(size))
  	  }
  	}
  
  	function each(a, f) {
  	  for(var i in a)
  	    f(a[i], i)
  	}
  
  	exports.getHashes = function () {
  	  return ['sha1', 'sha256', 'sha512', 'md5', 'rmd160']
  	}
  
  	var p = __webpack_require__(25)(exports)
  	exports.pbkdf2 = p.pbkdf2
  	exports.pbkdf2Sync = p.pbkdf2Sync
  
  
  	// the least I can do is make error messages for the rest of the node.js/crypto api.
  	each(['createCredentials'
  	, 'createCipher'
  	, 'createCipheriv'
  	, 'createDecipher'
  	, 'createDecipheriv'
  	, 'createSign'
  	, 'createVerify'
  	, 'createDiffieHellman'
  	], function (name) {
  	  exports[name] = function () {
  	    error('sorry,', name, 'is not implemented yet')
  	  }
  	})
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2).Buffer))
  
  /***/ },
  /* 9 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(global, Buffer) {(function() {
  	  var g = ('undefined' === typeof window ? global : window) || {}
  	  _crypto = (
  	    g.crypto || g.msCrypto || __webpack_require__(10)
  	  )
  	  module.exports = function(size) {
  	    // Modern Browsers
  	    if(_crypto.getRandomValues) {
  	      var bytes = new Buffer(size); //in browserify, this is an extended Uint8Array
  	      /* This will not work in older browsers.
  	       * See https://developer.mozilla.org/en-US/docs/Web/API/window.crypto.getRandomValues
  	       */
  	    
  	      _crypto.getRandomValues(bytes);
  	      return bytes;
  	    }
  	    else if (_crypto.randomBytes) {
  	      return _crypto.randomBytes(size)
  	    }
  	    else
  	      throw new Error(
  	        'secure random number generation not supported by this browser\n'+
  	        'use chrome, FireFox or Internet Explorer 11'
  	      )
  	  }
  	}())
  
  	/* WEBPACK VAR INJECTION */}.call(exports, (function() { return this; }()), __webpack_require__(2).Buffer))
  
  /***/ },
  /* 10 */
  /***/ function(module, exports) {
  
  	/* (ignored) */
  
  /***/ },
  /* 11 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(Buffer) {var createHash = __webpack_require__(12)
  
  	var md5 = toConstructor(__webpack_require__(21))
  	var rmd160 = toConstructor(__webpack_require__(23))
  
  	function toConstructor (fn) {
  	  return function () {
  	    var buffers = []
  	    var m= {
  	      update: function (data, enc) {
  	        if(!Buffer.isBuffer(data)) data = new Buffer(data, enc)
  	        buffers.push(data)
  	        return this
  	      },
  	      digest: function (enc) {
  	        var buf = Buffer.concat(buffers)
  	        var r = fn(buf)
  	        buffers = null
  	        return enc ? r.toString(enc) : r
  	      }
  	    }
  	    return m
  	  }
  	}
  
  	module.exports = function (alg) {
  	  if('md5' === alg) return new md5()
  	  if('rmd160' === alg) return new rmd160()
  	  return createHash(alg)
  	}
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2).Buffer))
  
  /***/ },
  /* 12 */
  /***/ function(module, exports, __webpack_require__) {
  
  	var exports = module.exports = function (alg) {
  	  var Alg = exports[alg]
  	  if(!Alg) throw new Error(alg + ' is not supported (we accept pull requests)')
  	  return new Alg()
  	}
  
  	var Buffer = __webpack_require__(2).Buffer
  	var Hash   = __webpack_require__(13)(Buffer)
  
  	exports.sha1 = __webpack_require__(14)(Buffer, Hash)
  	exports.sha256 = __webpack_require__(19)(Buffer, Hash)
  	exports.sha512 = __webpack_require__(20)(Buffer, Hash)
  
  
  /***/ },
  /* 13 */
  /***/ function(module, exports) {
  
  	module.exports = function (Buffer) {
  
  	  //prototype class for hash functions
  	  function Hash (blockSize, finalSize) {
  	    this._block = new Buffer(blockSize) //new Uint32Array(blockSize/4)
  	    this._finalSize = finalSize
  	    this._blockSize = blockSize
  	    this._len = 0
  	    this._s = 0
  	  }
  
  	  Hash.prototype.init = function () {
  	    this._s = 0
  	    this._len = 0
  	  }
  
  	  Hash.prototype.update = function (data, enc) {
  	    if ("string" === typeof data) {
  	      enc = enc || "utf8"
  	      data = new Buffer(data, enc)
  	    }
  
  	    var l = this._len += data.length
  	    var s = this._s = (this._s || 0)
  	    var f = 0
  	    var buffer = this._block
  
  	    while (s < l) {
  	      var t = Math.min(data.length, f + this._blockSize - (s % this._blockSize))
  	      var ch = (t - f)
  
  	      for (var i = 0; i < ch; i++) {
  	        buffer[(s % this._blockSize) + i] = data[i + f]
  	      }
  
  	      s += ch
  	      f += ch
  
  	      if ((s % this._blockSize) === 0) {
  	        this._update(buffer)
  	      }
  	    }
  	    this._s = s
  
  	    return this
  	  }
  
  	  Hash.prototype.digest = function (enc) {
  	    // Suppose the length of the message M, in bits, is l
  	    var l = this._len * 8
  
  	    // Append the bit 1 to the end of the message
  	    this._block[this._len % this._blockSize] = 0x80
  
  	    // and then k zero bits, where k is the smallest non-negative solution to the equation (l + 1 + k) === finalSize mod blockSize
  	    this._block.fill(0, this._len % this._blockSize + 1)
  
  	    if (l % (this._blockSize * 8) >= this._finalSize * 8) {
  	      this._update(this._block)
  	      this._block.fill(0)
  	    }
  
  	    // to this append the block which is equal to the number l written in binary
  	    // TODO: handle case where l is > Math.pow(2, 29)
  	    this._block.writeInt32BE(l, this._blockSize - 4)
  
  	    var hash = this._update(this._block) || this._hash()
  
  	    return enc ? hash.toString(enc) : hash
  	  }
  
  	  Hash.prototype._update = function () {
  	    throw new Error('_update must be implemented by subclass')
  	  }
  
  	  return Hash
  	}
  
  
  /***/ },
  /* 14 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/*
  	 * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
  	 * in FIPS PUB 180-1
  	 * Version 2.1a Copyright Paul Johnston 2000 - 2002.
  	 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
  	 * Distributed under the BSD License
  	 * See http://pajhome.org.uk/crypt/md5 for details.
  	 */
  
  	var inherits = __webpack_require__(15).inherits
  
  	module.exports = function (Buffer, Hash) {
  
  	  var A = 0|0
  	  var B = 4|0
  	  var C = 8|0
  	  var D = 12|0
  	  var E = 16|0
  
  	  var W = new (typeof Int32Array === 'undefined' ? Array : Int32Array)(80)
  
  	  var POOL = []
  
  	  function Sha1 () {
  	    if(POOL.length)
  	      return POOL.pop().init()
  
  	    if(!(this instanceof Sha1)) return new Sha1()
  	    this._w = W
  	    Hash.call(this, 16*4, 14*4)
  
  	    this._h = null
  	    this.init()
  	  }
  
  	  inherits(Sha1, Hash)
  
  	  Sha1.prototype.init = function () {
  	    this._a = 0x67452301
  	    this._b = 0xefcdab89
  	    this._c = 0x98badcfe
  	    this._d = 0x10325476
  	    this._e = 0xc3d2e1f0
  
  	    Hash.prototype.init.call(this)
  	    return this
  	  }
  
  	  Sha1.prototype._POOL = POOL
  	  Sha1.prototype._update = function (X) {
  
  	    var a, b, c, d, e, _a, _b, _c, _d, _e
  
  	    a = _a = this._a
  	    b = _b = this._b
  	    c = _c = this._c
  	    d = _d = this._d
  	    e = _e = this._e
  
  	    var w = this._w
  
  	    for(var j = 0; j < 80; j++) {
  	      var W = w[j] = j < 16 ? X.readInt32BE(j*4)
  	        : rol(w[j - 3] ^ w[j -  8] ^ w[j - 14] ^ w[j - 16], 1)
  
  	      var t = add(
  	        add(rol(a, 5), sha1_ft(j, b, c, d)),
  	        add(add(e, W), sha1_kt(j))
  	      )
  
  	      e = d
  	      d = c
  	      c = rol(b, 30)
  	      b = a
  	      a = t
  	    }
  
  	    this._a = add(a, _a)
  	    this._b = add(b, _b)
  	    this._c = add(c, _c)
  	    this._d = add(d, _d)
  	    this._e = add(e, _e)
  	  }
  
  	  Sha1.prototype._hash = function () {
  	    if(POOL.length < 100) POOL.push(this)
  	    var H = new Buffer(20)
  	    //console.log(this._a|0, this._b|0, this._c|0, this._d|0, this._e|0)
  	    H.writeInt32BE(this._a|0, A)
  	    H.writeInt32BE(this._b|0, B)
  	    H.writeInt32BE(this._c|0, C)
  	    H.writeInt32BE(this._d|0, D)
  	    H.writeInt32BE(this._e|0, E)
  	    return H
  	  }
  
  	  /*
  	   * Perform the appropriate triplet combination function for the current
  	   * iteration
  	   */
  	  function sha1_ft(t, b, c, d) {
  	    if(t < 20) return (b & c) | ((~b) & d);
  	    if(t < 40) return b ^ c ^ d;
  	    if(t < 60) return (b & c) | (b & d) | (c & d);
  	    return b ^ c ^ d;
  	  }
  
  	  /*
  	   * Determine the appropriate additive constant for the current iteration
  	   */
  	  function sha1_kt(t) {
  	    return (t < 20) ?  1518500249 : (t < 40) ?  1859775393 :
  	           (t < 60) ? -1894007588 : -899497514;
  	  }
  
  	  /*
  	   * Add integers, wrapping at 2^32. This uses 16-bit operations internally
  	   * to work around bugs in some JS interpreters.
  	   * //dominictarr: this is 10 years old, so maybe this can be dropped?)
  	   *
  	   */
  	  function add(x, y) {
  	    return (x + y ) | 0
  	  //lets see how this goes on testling.
  	  //  var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  	  //  var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  	  //  return (msw << 16) | (lsw & 0xFFFF);
  	  }
  
  	  /*
  	   * Bitwise rotate a 32-bit number to the left.
  	   */
  	  function rol(num, cnt) {
  	    return (num << cnt) | (num >>> (32 - cnt));
  	  }
  
  	  return Sha1
  	}
  
  
  /***/ },
  /* 15 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(global, process) {// Copyright Joyent, Inc. and other Node contributors.
  	//
  	// Permission is hereby granted, free of charge, to any person obtaining a
  	// copy of this software and associated documentation files (the
  	// "Software"), to deal in the Software without restriction, including
  	// without limitation the rights to use, copy, modify, merge, publish,
  	// distribute, sublicense, and/or sell copies of the Software, and to permit
  	// persons to whom the Software is furnished to do so, subject to the
  	// following conditions:
  	//
  	// The above copyright notice and this permission notice shall be included
  	// in all copies or substantial portions of the Software.
  	//
  	// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  	// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  	// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
  	// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
  	// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  	// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  	// USE OR OTHER DEALINGS IN THE SOFTWARE.
  
  	var formatRegExp = /%[sdj%]/g;
  	exports.format = function(f) {
  	  if (!isString(f)) {
  	    var objects = [];
  	    for (var i = 0; i < arguments.length; i++) {
  	      objects.push(inspect(arguments[i]));
  	    }
  	    return objects.join(' ');
  	  }
  
  	  var i = 1;
  	  var args = arguments;
  	  var len = args.length;
  	  var str = String(f).replace(formatRegExp, function(x) {
  	    if (x === '%%') return '%';
  	    if (i >= len) return x;
  	    switch (x) {
  	      case '%s': return String(args[i++]);
  	      case '%d': return Number(args[i++]);
  	      case '%j':
  	        try {
  	          return JSON.stringify(args[i++]);
  	        } catch (_) {
  	          return '[Circular]';
  	        }
  	      default:
  	        return x;
  	    }
  	  });
  	  for (var x = args[i]; i < len; x = args[++i]) {
  	    if (isNull(x) || !isObject(x)) {
  	      str += ' ' + x;
  	    } else {
  	      str += ' ' + inspect(x);
  	    }
  	  }
  	  return str;
  	};
  
  
  	// Mark that a method should not be used.
  	// Returns a modified function which warns once by default.
  	// If --no-deprecation is set, then it is a no-op.
  	exports.deprecate = function(fn, msg) {
  	  // Allow for deprecating things in the process of starting up.
  	  if (isUndefined(global.process)) {
  	    return function() {
  	      return exports.deprecate(fn, msg).apply(this, arguments);
  	    };
  	  }
  
  	  if (process.noDeprecation === true) {
  	    return fn;
  	  }
  
  	  var warned = false;
  	  function deprecated() {
  	    if (!warned) {
  	      if (process.throwDeprecation) {
  	        throw new Error(msg);
  	      } else if (process.traceDeprecation) {
  	        console.trace(msg);
  	      } else {
  	        console.error(msg);
  	      }
  	      warned = true;
  	    }
  	    return fn.apply(this, arguments);
  	  }
  
  	  return deprecated;
  	};
  
  
  	var debugs = {};
  	var debugEnviron;
  	exports.debuglog = function(set) {
  	  if (isUndefined(debugEnviron))
  	    debugEnviron = process.env.NODE_DEBUG || '';
  	  set = set.toUpperCase();
  	  if (!debugs[set]) {
  	    if (new RegExp('\\b' + set + '\\b', 'i').test(debugEnviron)) {
  	      var pid = process.pid;
  	      debugs[set] = function() {
  	        var msg = exports.format.apply(exports, arguments);
  	        console.error('%s %d: %s', set, pid, msg);
  	      };
  	    } else {
  	      debugs[set] = function() {};
  	    }
  	  }
  	  return debugs[set];
  	};
  
  
  	/**
  	 * Echos the value of a value. Trys to print the value out
  	 * in the best way possible given the different types.
  	 *
  	 * @param {Object} obj The object to print out.
  	 * @param {Object} opts Optional options object that alters the output.
  	 */
  	/* legacy: obj, showHidden, depth, colors*/
  	function inspect(obj, opts) {
  	  // default options
  	  var ctx = {
  	    seen: [],
  	    stylize: stylizeNoColor
  	  };
  	  // legacy...
  	  if (arguments.length >= 3) ctx.depth = arguments[2];
  	  if (arguments.length >= 4) ctx.colors = arguments[3];
  	  if (isBoolean(opts)) {
  	    // legacy...
  	    ctx.showHidden = opts;
  	  } else if (opts) {
  	    // got an "options" object
  	    exports._extend(ctx, opts);
  	  }
  	  // set default options
  	  if (isUndefined(ctx.showHidden)) ctx.showHidden = false;
  	  if (isUndefined(ctx.depth)) ctx.depth = 2;
  	  if (isUndefined(ctx.colors)) ctx.colors = false;
  	  if (isUndefined(ctx.customInspect)) ctx.customInspect = true;
  	  if (ctx.colors) ctx.stylize = stylizeWithColor;
  	  return formatValue(ctx, obj, ctx.depth);
  	}
  	exports.inspect = inspect;
  
  
  	// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics
  	inspect.colors = {
  	  'bold' : [1, 22],
  	  'italic' : [3, 23],
  	  'underline' : [4, 24],
  	  'inverse' : [7, 27],
  	  'white' : [37, 39],
  	  'grey' : [90, 39],
  	  'black' : [30, 39],
  	  'blue' : [34, 39],
  	  'cyan' : [36, 39],
  	  'green' : [32, 39],
  	  'magenta' : [35, 39],
  	  'red' : [31, 39],
  	  'yellow' : [33, 39]
  	};
  
  	// Don't use 'blue' not visible on cmd.exe
  	inspect.styles = {
  	  'special': 'cyan',
  	  'number': 'yellow',
  	  'boolean': 'yellow',
  	  'undefined': 'grey',
  	  'null': 'bold',
  	  'string': 'green',
  	  'date': 'magenta',
  	  // "name": intentionally not styling
  	  'regexp': 'red'
  	};
  
  
  	function stylizeWithColor(str, styleType) {
  	  var style = inspect.styles[styleType];
  
  	  if (style) {
  	    return '\u001b[' + inspect.colors[style][0] + 'm' + str +
  	           '\u001b[' + inspect.colors[style][1] + 'm';
  	  } else {
  	    return str;
  	  }
  	}
  
  
  	function stylizeNoColor(str, styleType) {
  	  return str;
  	}
  
  
  	function arrayToHash(array) {
  	  var hash = {};
  
  	  array.forEach(function(val, idx) {
  	    hash[val] = true;
  	  });
  
  	  return hash;
  	}
  
  
  	function formatValue(ctx, value, recurseTimes) {
  	  // Provide a hook for user-specified inspect functions.
  	  // Check that value is an object with an inspect function on it
  	  if (ctx.customInspect &&
  	      value &&
  	      isFunction(value.inspect) &&
  	      // Filter out the util module, it's inspect function is special
  	      value.inspect !== exports.inspect &&
  	      // Also filter out any prototype objects using the circular check.
  	      !(value.constructor && value.constructor.prototype === value)) {
  	    var ret = value.inspect(recurseTimes, ctx);
  	    if (!isString(ret)) {
  	      ret = formatValue(ctx, ret, recurseTimes);
  	    }
  	    return ret;
  	  }
  
  	  // Primitive types cannot have properties
  	  var primitive = formatPrimitive(ctx, value);
  	  if (primitive) {
  	    return primitive;
  	  }
  
  	  // Look up the keys of the object.
  	  var keys = Object.keys(value);
  	  var visibleKeys = arrayToHash(keys);
  
  	  if (ctx.showHidden) {
  	    keys = Object.getOwnPropertyNames(value);
  	  }
  
  	  // IE doesn't make error fields non-enumerable
  	  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx
  	  if (isError(value)
  	      && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {
  	    return formatError(value);
  	  }
  
  	  // Some type of object without properties can be shortcutted.
  	  if (keys.length === 0) {
  	    if (isFunction(value)) {
  	      var name = value.name ? ': ' + value.name : '';
  	      return ctx.stylize('[Function' + name + ']', 'special');
  	    }
  	    if (isRegExp(value)) {
  	      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
  	    }
  	    if (isDate(value)) {
  	      return ctx.stylize(Date.prototype.toString.call(value), 'date');
  	    }
  	    if (isError(value)) {
  	      return formatError(value);
  	    }
  	  }
  
  	  var base = '', array = false, braces = ['{', '}'];
  
  	  // Make Array say that they are Array
  	  if (isArray(value)) {
  	    array = true;
  	    braces = ['[', ']'];
  	  }
  
  	  // Make functions say that they are functions
  	  if (isFunction(value)) {
  	    var n = value.name ? ': ' + value.name : '';
  	    base = ' [Function' + n + ']';
  	  }
  
  	  // Make RegExps say that they are RegExps
  	  if (isRegExp(value)) {
  	    base = ' ' + RegExp.prototype.toString.call(value);
  	  }
  
  	  // Make dates with properties first say the date
  	  if (isDate(value)) {
  	    base = ' ' + Date.prototype.toUTCString.call(value);
  	  }
  
  	  // Make error with message first say the error
  	  if (isError(value)) {
  	    base = ' ' + formatError(value);
  	  }
  
  	  if (keys.length === 0 && (!array || value.length == 0)) {
  	    return braces[0] + base + braces[1];
  	  }
  
  	  if (recurseTimes < 0) {
  	    if (isRegExp(value)) {
  	      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
  	    } else {
  	      return ctx.stylize('[Object]', 'special');
  	    }
  	  }
  
  	  ctx.seen.push(value);
  
  	  var output;
  	  if (array) {
  	    output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);
  	  } else {
  	    output = keys.map(function(key) {
  	      return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);
  	    });
  	  }
  
  	  ctx.seen.pop();
  
  	  return reduceToSingleString(output, base, braces);
  	}
  
  
  	function formatPrimitive(ctx, value) {
  	  if (isUndefined(value))
  	    return ctx.stylize('undefined', 'undefined');
  	  if (isString(value)) {
  	    var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '')
  	                                             .replace(/'/g, "\\'")
  	                                             .replace(/\\"/g, '"') + '\'';
  	    return ctx.stylize(simple, 'string');
  	  }
  	  if (isNumber(value))
  	    return ctx.stylize('' + value, 'number');
  	  if (isBoolean(value))
  	    return ctx.stylize('' + value, 'boolean');
  	  // For some reason typeof null is "object", so special case here.
  	  if (isNull(value))
  	    return ctx.stylize('null', 'null');
  	}
  
  
  	function formatError(value) {
  	  return '[' + Error.prototype.toString.call(value) + ']';
  	}
  
  
  	function formatArray(ctx, value, recurseTimes, visibleKeys, keys) {
  	  var output = [];
  	  for (var i = 0, l = value.length; i < l; ++i) {
  	    if (hasOwnProperty(value, String(i))) {
  	      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
  	          String(i), true));
  	    } else {
  	      output.push('');
  	    }
  	  }
  	  keys.forEach(function(key) {
  	    if (!key.match(/^\d+$/)) {
  	      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
  	          key, true));
  	    }
  	  });
  	  return output;
  	}
  
  
  	function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {
  	  var name, str, desc;
  	  desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };
  	  if (desc.get) {
  	    if (desc.set) {
  	      str = ctx.stylize('[Getter/Setter]', 'special');
  	    } else {
  	      str = ctx.stylize('[Getter]', 'special');
  	    }
  	  } else {
  	    if (desc.set) {
  	      str = ctx.stylize('[Setter]', 'special');
  	    }
  	  }
  	  if (!hasOwnProperty(visibleKeys, key)) {
  	    name = '[' + key + ']';
  	  }
  	  if (!str) {
  	    if (ctx.seen.indexOf(desc.value) < 0) {
  	      if (isNull(recurseTimes)) {
  	        str = formatValue(ctx, desc.value, null);
  	      } else {
  	        str = formatValue(ctx, desc.value, recurseTimes - 1);
  	      }
  	      if (str.indexOf('\n') > -1) {
  	        if (array) {
  	          str = str.split('\n').map(function(line) {
  	            return '  ' + line;
  	          }).join('\n').substr(2);
  	        } else {
  	          str = '\n' + str.split('\n').map(function(line) {
  	            return '   ' + line;
  	          }).join('\n');
  	        }
  	      }
  	    } else {
  	      str = ctx.stylize('[Circular]', 'special');
  	    }
  	  }
  	  if (isUndefined(name)) {
  	    if (array && key.match(/^\d+$/)) {
  	      return str;
  	    }
  	    name = JSON.stringify('' + key);
  	    if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) {
  	      name = name.substr(1, name.length - 2);
  	      name = ctx.stylize(name, 'name');
  	    } else {
  	      name = name.replace(/'/g, "\\'")
  	                 .replace(/\\"/g, '"')
  	                 .replace(/(^"|"$)/g, "'");
  	      name = ctx.stylize(name, 'string');
  	    }
  	  }
  
  	  return name + ': ' + str;
  	}
  
  
  	function reduceToSingleString(output, base, braces) {
  	  var numLinesEst = 0;
  	  var length = output.reduce(function(prev, cur) {
  	    numLinesEst++;
  	    if (cur.indexOf('\n') >= 0) numLinesEst++;
  	    return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1;
  	  }, 0);
  
  	  if (length > 60) {
  	    return braces[0] +
  	           (base === '' ? '' : base + '\n ') +
  	           ' ' +
  	           output.join(',\n  ') +
  	           ' ' +
  	           braces[1];
  	  }
  
  	  return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];
  	}
  
  
  	// NOTE: These type checking functions intentionally don't use `instanceof`
  	// because it is fragile and can be easily faked with `Object.create()`.
  	function isArray(ar) {
  	  return Array.isArray(ar);
  	}
  	exports.isArray = isArray;
  
  	function isBoolean(arg) {
  	  return typeof arg === 'boolean';
  	}
  	exports.isBoolean = isBoolean;
  
  	function isNull(arg) {
  	  return arg === null;
  	}
  	exports.isNull = isNull;
  
  	function isNullOrUndefined(arg) {
  	  return arg == null;
  	}
  	exports.isNullOrUndefined = isNullOrUndefined;
  
  	function isNumber(arg) {
  	  return typeof arg === 'number';
  	}
  	exports.isNumber = isNumber;
  
  	function isString(arg) {
  	  return typeof arg === 'string';
  	}
  	exports.isString = isString;
  
  	function isSymbol(arg) {
  	  return typeof arg === 'symbol';
  	}
  	exports.isSymbol = isSymbol;
  
  	function isUndefined(arg) {
  	  return arg === void 0;
  	}
  	exports.isUndefined = isUndefined;
  
  	function isRegExp(re) {
  	  return isObject(re) && objectToString(re) === '[object RegExp]';
  	}
  	exports.isRegExp = isRegExp;
  
  	function isObject(arg) {
  	  return typeof arg === 'object' && arg !== null;
  	}
  	exports.isObject = isObject;
  
  	function isDate(d) {
  	  return isObject(d) && objectToString(d) === '[object Date]';
  	}
  	exports.isDate = isDate;
  
  	function isError(e) {
  	  return isObject(e) &&
  	      (objectToString(e) === '[object Error]' || e instanceof Error);
  	}
  	exports.isError = isError;
  
  	function isFunction(arg) {
  	  return typeof arg === 'function';
  	}
  	exports.isFunction = isFunction;
  
  	function isPrimitive(arg) {
  	  return arg === null ||
  	         typeof arg === 'boolean' ||
  	         typeof arg === 'number' ||
  	         typeof arg === 'string' ||
  	         typeof arg === 'symbol' ||  // ES6 symbol
  	         typeof arg === 'undefined';
  	}
  	exports.isPrimitive = isPrimitive;
  
  	exports.isBuffer = __webpack_require__(17);
  
  	function objectToString(o) {
  	  return Object.prototype.toString.call(o);
  	}
  
  
  	function pad(n) {
  	  return n < 10 ? '0' + n.toString(10) : n.toString(10);
  	}
  
  
  	var months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',
  	              'Oct', 'Nov', 'Dec'];
  
  	// 26 Feb 16:19:34
  	function timestamp() {
  	  var d = new Date();
  	  var time = [pad(d.getHours()),
  	              pad(d.getMinutes()),
  	              pad(d.getSeconds())].join(':');
  	  return [d.getDate(), months[d.getMonth()], time].join(' ');
  	}
  
  
  	// log is just a thin wrapper to console.log that prepends a timestamp
  	exports.log = function() {
  	  console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));
  	};
  
  
  	/**
  	 * Inherit the prototype methods from one constructor into another.
  	 *
  	 * The Function.prototype.inherits from lang.js rewritten as a standalone
  	 * function (not on Function.prototype). NOTE: If this file is to be loaded
  	 * during bootstrapping this function needs to be rewritten using some native
  	 * functions as prototype setup using normal JavaScript does not work as
  	 * expected during bootstrapping (see mirror.js in r114903).
  	 *
  	 * @param {function} ctor Constructor function which needs to inherit the
  	 *     prototype.
  	 * @param {function} superCtor Constructor function to inherit prototype from.
  	 */
  	exports.inherits = __webpack_require__(18);
  
  	exports._extend = function(origin, add) {
  	  // Don't do anything if add isn't an object
  	  if (!add || !isObject(add)) return origin;
  
  	  var keys = Object.keys(add);
  	  var i = keys.length;
  	  while (i--) {
  	    origin[keys[i]] = add[keys[i]];
  	  }
  	  return origin;
  	};
  
  	function hasOwnProperty(obj, prop) {
  	  return Object.prototype.hasOwnProperty.call(obj, prop);
  	}
  
  	/* WEBPACK VAR INJECTION */}.call(exports, (function() { return this; }()), __webpack_require__(16)))
  
  /***/ },
  /* 16 */
  /***/ function(module, exports) {
  
  	// shim for using process in browser
  
  	var process = module.exports = {};
  	var queue = [];
  	var draining = false;
  	var currentQueue;
  	var queueIndex = -1;
  
  	function cleanUpNextTick() {
  	    draining = false;
  	    if (currentQueue.length) {
  	        queue = currentQueue.concat(queue);
  	    } else {
  	        queueIndex = -1;
  	    }
  	    if (queue.length) {
  	        drainQueue();
  	    }
  	}
  
  	function drainQueue() {
  	    if (draining) {
  	        return;
  	    }
  	    var timeout = setTimeout(cleanUpNextTick);
  	    draining = true;
  
  	    var len = queue.length;
  	    while(len) {
  	        currentQueue = queue;
  	        queue = [];
  	        while (++queueIndex < len) {
  	            if (currentQueue) {
  	                currentQueue[queueIndex].run();
  	            }
  	        }
  	        queueIndex = -1;
  	        len = queue.length;
  	    }
  	    currentQueue = null;
  	    draining = false;
  	    clearTimeout(timeout);
  	}
  
  	process.nextTick = function (fun) {
  	    var args = new Array(arguments.length - 1);
  	    if (arguments.length > 1) {
  	        for (var i = 1; i < arguments.length; i++) {
  	            args[i - 1] = arguments[i];
  	        }
  	    }
  	    queue.push(new Item(fun, args));
  	    if (queue.length === 1 && !draining) {
  	        setTimeout(drainQueue, 0);
  	    }
  	};
  
  	// v8 likes predictible objects
  	function Item(fun, array) {
  	    this.fun = fun;
  	    this.array = array;
  	}
  	Item.prototype.run = function () {
  	    this.fun.apply(null, this.array);
  	};
  	process.title = 'browser';
  	process.browser = true;
  	process.env = {};
  	process.argv = [];
  	process.version = ''; // empty string to avoid regexp issues
  	process.versions = {};
  
  	function noop() {}
  
  	process.on = noop;
  	process.addListener = noop;
  	process.once = noop;
  	process.off = noop;
  	process.removeListener = noop;
  	process.removeAllListeners = noop;
  	process.emit = noop;
  
  	process.binding = function (name) {
  	    throw new Error('process.binding is not supported');
  	};
  
  	process.cwd = function () { return '/' };
  	process.chdir = function (dir) {
  	    throw new Error('process.chdir is not supported');
  	};
  	process.umask = function() { return 0; };
  
  
  /***/ },
  /* 17 */
  /***/ function(module, exports) {
  
  	module.exports = function isBuffer(arg) {
  	  return arg && typeof arg === 'object'
  	    && typeof arg.copy === 'function'
  	    && typeof arg.fill === 'function'
  	    && typeof arg.readUInt8 === 'function';
  	}
  
  /***/ },
  /* 18 */
  /***/ function(module, exports) {
  
  	if (typeof Object.create === 'function') {
  	  // implementation from standard node.js 'util' module
  	  module.exports = function inherits(ctor, superCtor) {
  	    ctor.super_ = superCtor
  	    ctor.prototype = Object.create(superCtor.prototype, {
  	      constructor: {
  	        value: ctor,
  	        enumerable: false,
  	        writable: true,
  	        configurable: true
  	      }
  	    });
  	  };
  	} else {
  	  // old school shim for old browsers
  	  module.exports = function inherits(ctor, superCtor) {
  	    ctor.super_ = superCtor
  	    var TempCtor = function () {}
  	    TempCtor.prototype = superCtor.prototype
  	    ctor.prototype = new TempCtor()
  	    ctor.prototype.constructor = ctor
  	  }
  	}
  
  
  /***/ },
  /* 19 */
  /***/ function(module, exports, __webpack_require__) {
  
  	
  	/**
  	 * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined
  	 * in FIPS 180-2
  	 * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.
  	 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
  	 *
  	 */
  
  	var inherits = __webpack_require__(15).inherits
  
  	module.exports = function (Buffer, Hash) {
  
  	  var K = [
  	      0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
  	      0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
  	      0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
  	      0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
  	      0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
  	      0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
  	      0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
  	      0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
  	      0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
  	      0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
  	      0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
  	      0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
  	      0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
  	      0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
  	      0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
  	      0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2
  	    ]
  
  	  var W = new Array(64)
  
  	  function Sha256() {
  	    this.init()
  
  	    this._w = W //new Array(64)
  
  	    Hash.call(this, 16*4, 14*4)
  	  }
  
  	  inherits(Sha256, Hash)
  
  	  Sha256.prototype.init = function () {
  
  	    this._a = 0x6a09e667|0
  	    this._b = 0xbb67ae85|0
  	    this._c = 0x3c6ef372|0
  	    this._d = 0xa54ff53a|0
  	    this._e = 0x510e527f|0
  	    this._f = 0x9b05688c|0
  	    this._g = 0x1f83d9ab|0
  	    this._h = 0x5be0cd19|0
  
  	    this._len = this._s = 0
  
  	    return this
  	  }
  
  	  function S (X, n) {
  	    return (X >>> n) | (X << (32 - n));
  	  }
  
  	  function R (X, n) {
  	    return (X >>> n);
  	  }
  
  	  function Ch (x, y, z) {
  	    return ((x & y) ^ ((~x) & z));
  	  }
  
  	  function Maj (x, y, z) {
  	    return ((x & y) ^ (x & z) ^ (y & z));
  	  }
  
  	  function Sigma0256 (x) {
  	    return (S(x, 2) ^ S(x, 13) ^ S(x, 22));
  	  }
  
  	  function Sigma1256 (x) {
  	    return (S(x, 6) ^ S(x, 11) ^ S(x, 25));
  	  }
  
  	  function Gamma0256 (x) {
  	    return (S(x, 7) ^ S(x, 18) ^ R(x, 3));
  	  }
  
  	  function Gamma1256 (x) {
  	    return (S(x, 17) ^ S(x, 19) ^ R(x, 10));
  	  }
  
  	  Sha256.prototype._update = function(M) {
  
  	    var W = this._w
  	    var a, b, c, d, e, f, g, h
  	    var T1, T2
  
  	    a = this._a | 0
  	    b = this._b | 0
  	    c = this._c | 0
  	    d = this._d | 0
  	    e = this._e | 0
  	    f = this._f | 0
  	    g = this._g | 0
  	    h = this._h | 0
  
  	    for (var j = 0; j < 64; j++) {
  	      var w = W[j] = j < 16
  	        ? M.readInt32BE(j * 4)
  	        : Gamma1256(W[j - 2]) + W[j - 7] + Gamma0256(W[j - 15]) + W[j - 16]
  
  	      T1 = h + Sigma1256(e) + Ch(e, f, g) + K[j] + w
  
  	      T2 = Sigma0256(a) + Maj(a, b, c);
  	      h = g; g = f; f = e; e = d + T1; d = c; c = b; b = a; a = T1 + T2;
  	    }
  
  	    this._a = (a + this._a) | 0
  	    this._b = (b + this._b) | 0
  	    this._c = (c + this._c) | 0
  	    this._d = (d + this._d) | 0
  	    this._e = (e + this._e) | 0
  	    this._f = (f + this._f) | 0
  	    this._g = (g + this._g) | 0
  	    this._h = (h + this._h) | 0
  
  	  };
  
  	  Sha256.prototype._hash = function () {
  	    var H = new Buffer(32)
  
  	    H.writeInt32BE(this._a,  0)
  	    H.writeInt32BE(this._b,  4)
  	    H.writeInt32BE(this._c,  8)
  	    H.writeInt32BE(this._d, 12)
  	    H.writeInt32BE(this._e, 16)
  	    H.writeInt32BE(this._f, 20)
  	    H.writeInt32BE(this._g, 24)
  	    H.writeInt32BE(this._h, 28)
  
  	    return H
  	  }
  
  	  return Sha256
  
  	}
  
  
  /***/ },
  /* 20 */
  /***/ function(module, exports, __webpack_require__) {
  
  	var inherits = __webpack_require__(15).inherits
  
  	module.exports = function (Buffer, Hash) {
  	  var K = [
  	    0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,
  	    0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,
  	    0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,
  	    0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,
  	    0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,
  	    0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,
  	    0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,
  	    0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,
  	    0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,
  	    0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,
  	    0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,
  	    0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,
  	    0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,
  	    0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,
  	    0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,
  	    0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,
  	    0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,
  	    0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,
  	    0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,
  	    0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,
  	    0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,
  	    0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,
  	    0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,
  	    0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,
  	    0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,
  	    0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,
  	    0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,
  	    0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,
  	    0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,
  	    0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,
  	    0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,
  	    0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,
  	    0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,
  	    0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,
  	    0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,
  	    0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,
  	    0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,
  	    0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,
  	    0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,
  	    0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817
  	  ]
  
  	  var W = new Array(160)
  
  	  function Sha512() {
  	    this.init()
  	    this._w = W
  
  	    Hash.call(this, 128, 112)
  	  }
  
  	  inherits(Sha512, Hash)
  
  	  Sha512.prototype.init = function () {
  
  	    this._a = 0x6a09e667|0
  	    this._b = 0xbb67ae85|0
  	    this._c = 0x3c6ef372|0
  	    this._d = 0xa54ff53a|0
  	    this._e = 0x510e527f|0
  	    this._f = 0x9b05688c|0
  	    this._g = 0x1f83d9ab|0
  	    this._h = 0x5be0cd19|0
  
  	    this._al = 0xf3bcc908|0
  	    this._bl = 0x84caa73b|0
  	    this._cl = 0xfe94f82b|0
  	    this._dl = 0x5f1d36f1|0
  	    this._el = 0xade682d1|0
  	    this._fl = 0x2b3e6c1f|0
  	    this._gl = 0xfb41bd6b|0
  	    this._hl = 0x137e2179|0
  
  	    this._len = this._s = 0
  
  	    return this
  	  }
  
  	  function S (X, Xl, n) {
  	    return (X >>> n) | (Xl << (32 - n))
  	  }
  
  	  function Ch (x, y, z) {
  	    return ((x & y) ^ ((~x) & z));
  	  }
  
  	  function Maj (x, y, z) {
  	    return ((x & y) ^ (x & z) ^ (y & z));
  	  }
  
  	  Sha512.prototype._update = function(M) {
  
  	    var W = this._w
  	    var a, b, c, d, e, f, g, h
  	    var al, bl, cl, dl, el, fl, gl, hl
  
  	    a = this._a | 0
  	    b = this._b | 0
  	    c = this._c | 0
  	    d = this._d | 0
  	    e = this._e | 0
  	    f = this._f | 0
  	    g = this._g | 0
  	    h = this._h | 0
  
  	    al = this._al | 0
  	    bl = this._bl | 0
  	    cl = this._cl | 0
  	    dl = this._dl | 0
  	    el = this._el | 0
  	    fl = this._fl | 0
  	    gl = this._gl | 0
  	    hl = this._hl | 0
  
  	    for (var i = 0; i < 80; i++) {
  	      var j = i * 2
  
  	      var Wi, Wil
  
  	      if (i < 16) {
  	        Wi = W[j] = M.readInt32BE(j * 4)
  	        Wil = W[j + 1] = M.readInt32BE(j * 4 + 4)
  
  	      } else {
  	        var x  = W[j - 15*2]
  	        var xl = W[j - 15*2 + 1]
  	        var gamma0  = S(x, xl, 1) ^ S(x, xl, 8) ^ (x >>> 7)
  	        var gamma0l = S(xl, x, 1) ^ S(xl, x, 8) ^ S(xl, x, 7)
  
  	        x  = W[j - 2*2]
  	        xl = W[j - 2*2 + 1]
  	        var gamma1  = S(x, xl, 19) ^ S(xl, x, 29) ^ (x >>> 6)
  	        var gamma1l = S(xl, x, 19) ^ S(x, xl, 29) ^ S(xl, x, 6)
  
  	        // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]
  	        var Wi7  = W[j - 7*2]
  	        var Wi7l = W[j - 7*2 + 1]
  
  	        var Wi16  = W[j - 16*2]
  	        var Wi16l = W[j - 16*2 + 1]
  
  	        Wil = gamma0l + Wi7l
  	        Wi  = gamma0  + Wi7 + ((Wil >>> 0) < (gamma0l >>> 0) ? 1 : 0)
  	        Wil = Wil + gamma1l
  	        Wi  = Wi  + gamma1  + ((Wil >>> 0) < (gamma1l >>> 0) ? 1 : 0)
  	        Wil = Wil + Wi16l
  	        Wi  = Wi  + Wi16 + ((Wil >>> 0) < (Wi16l >>> 0) ? 1 : 0)
  
  	        W[j] = Wi
  	        W[j + 1] = Wil
  	      }
  
  	      var maj = Maj(a, b, c)
  	      var majl = Maj(al, bl, cl)
  
  	      var sigma0h = S(a, al, 28) ^ S(al, a, 2) ^ S(al, a, 7)
  	      var sigma0l = S(al, a, 28) ^ S(a, al, 2) ^ S(a, al, 7)
  	      var sigma1h = S(e, el, 14) ^ S(e, el, 18) ^ S(el, e, 9)
  	      var sigma1l = S(el, e, 14) ^ S(el, e, 18) ^ S(e, el, 9)
  
  	      // t1 = h + sigma1 + ch + K[i] + W[i]
  	      var Ki = K[j]
  	      var Kil = K[j + 1]
  
  	      var ch = Ch(e, f, g)
  	      var chl = Ch(el, fl, gl)
  
  	      var t1l = hl + sigma1l
  	      var t1 = h + sigma1h + ((t1l >>> 0) < (hl >>> 0) ? 1 : 0)
  	      t1l = t1l + chl
  	      t1 = t1 + ch + ((t1l >>> 0) < (chl >>> 0) ? 1 : 0)
  	      t1l = t1l + Kil
  	      t1 = t1 + Ki + ((t1l >>> 0) < (Kil >>> 0) ? 1 : 0)
  	      t1l = t1l + Wil
  	      t1 = t1 + Wi + ((t1l >>> 0) < (Wil >>> 0) ? 1 : 0)
  
  	      // t2 = sigma0 + maj
  	      var t2l = sigma0l + majl
  	      var t2 = sigma0h + maj + ((t2l >>> 0) < (sigma0l >>> 0) ? 1 : 0)
  
  	      h  = g
  	      hl = gl
  	      g  = f
  	      gl = fl
  	      f  = e
  	      fl = el
  	      el = (dl + t1l) | 0
  	      e  = (d + t1 + ((el >>> 0) < (dl >>> 0) ? 1 : 0)) | 0
  	      d  = c
  	      dl = cl
  	      c  = b
  	      cl = bl
  	      b  = a
  	      bl = al
  	      al = (t1l + t2l) | 0
  	      a  = (t1 + t2 + ((al >>> 0) < (t1l >>> 0) ? 1 : 0)) | 0
  	    }
  
  	    this._al = (this._al + al) | 0
  	    this._bl = (this._bl + bl) | 0
  	    this._cl = (this._cl + cl) | 0
  	    this._dl = (this._dl + dl) | 0
  	    this._el = (this._el + el) | 0
  	    this._fl = (this._fl + fl) | 0
  	    this._gl = (this._gl + gl) | 0
  	    this._hl = (this._hl + hl) | 0
  
  	    this._a = (this._a + a + ((this._al >>> 0) < (al >>> 0) ? 1 : 0)) | 0
  	    this._b = (this._b + b + ((this._bl >>> 0) < (bl >>> 0) ? 1 : 0)) | 0
  	    this._c = (this._c + c + ((this._cl >>> 0) < (cl >>> 0) ? 1 : 0)) | 0
  	    this._d = (this._d + d + ((this._dl >>> 0) < (dl >>> 0) ? 1 : 0)) | 0
  	    this._e = (this._e + e + ((this._el >>> 0) < (el >>> 0) ? 1 : 0)) | 0
  	    this._f = (this._f + f + ((this._fl >>> 0) < (fl >>> 0) ? 1 : 0)) | 0
  	    this._g = (this._g + g + ((this._gl >>> 0) < (gl >>> 0) ? 1 : 0)) | 0
  	    this._h = (this._h + h + ((this._hl >>> 0) < (hl >>> 0) ? 1 : 0)) | 0
  	  }
  
  	  Sha512.prototype._hash = function () {
  	    var H = new Buffer(64)
  
  	    function writeInt64BE(h, l, offset) {
  	      H.writeInt32BE(h, offset)
  	      H.writeInt32BE(l, offset + 4)
  	    }
  
  	    writeInt64BE(this._a, this._al, 0)
  	    writeInt64BE(this._b, this._bl, 8)
  	    writeInt64BE(this._c, this._cl, 16)
  	    writeInt64BE(this._d, this._dl, 24)
  	    writeInt64BE(this._e, this._el, 32)
  	    writeInt64BE(this._f, this._fl, 40)
  	    writeInt64BE(this._g, this._gl, 48)
  	    writeInt64BE(this._h, this._hl, 56)
  
  	    return H
  	  }
  
  	  return Sha512
  
  	}
  
  
  /***/ },
  /* 21 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/*
  	 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
  	 * Digest Algorithm, as defined in RFC 1321.
  	 * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
  	 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
  	 * Distributed under the BSD License
  	 * See http://pajhome.org.uk/crypt/md5 for more info.
  	 */
  
  	var helpers = __webpack_require__(22);
  
  	/*
  	 * Calculate the MD5 of an array of little-endian words, and a bit length
  	 */
  	function core_md5(x, len)
  	{
  	  /* append padding */
  	  x[len >> 5] |= 0x80 << ((len) % 32);
  	  x[(((len + 64) >>> 9) << 4) + 14] = len;
  
  	  var a =  1732584193;
  	  var b = -271733879;
  	  var c = -1732584194;
  	  var d =  271733878;
  
  	  for(var i = 0; i < x.length; i += 16)
  	  {
  	    var olda = a;
  	    var oldb = b;
  	    var oldc = c;
  	    var oldd = d;
  
  	    a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
  	    d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
  	    c = md5_ff(c, d, a, b, x[i+ 2], 17,  606105819);
  	    b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
  	    a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
  	    d = md5_ff(d, a, b, c, x[i+ 5], 12,  1200080426);
  	    c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
  	    b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
  	    a = md5_ff(a, b, c, d, x[i+ 8], 7 ,  1770035416);
  	    d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
  	    c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
  	    b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
  	    a = md5_ff(a, b, c, d, x[i+12], 7 ,  1804603682);
  	    d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
  	    c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
  	    b = md5_ff(b, c, d, a, x[i+15], 22,  1236535329);
  
  	    a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
  	    d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
  	    c = md5_gg(c, d, a, b, x[i+11], 14,  643717713);
  	    b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
  	    a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
  	    d = md5_gg(d, a, b, c, x[i+10], 9 ,  38016083);
  	    c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
  	    b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
  	    a = md5_gg(a, b, c, d, x[i+ 9], 5 ,  568446438);
  	    d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
  	    c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
  	    b = md5_gg(b, c, d, a, x[i+ 8], 20,  1163531501);
  	    a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
  	    d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
  	    c = md5_gg(c, d, a, b, x[i+ 7], 14,  1735328473);
  	    b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
  
  	    a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
  	    d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
  	    c = md5_hh(c, d, a, b, x[i+11], 16,  1839030562);
  	    b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
  	    a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
  	    d = md5_hh(d, a, b, c, x[i+ 4], 11,  1272893353);
  	    c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
  	    b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
  	    a = md5_hh(a, b, c, d, x[i+13], 4 ,  681279174);
  	    d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
  	    c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
  	    b = md5_hh(b, c, d, a, x[i+ 6], 23,  76029189);
  	    a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
  	    d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
  	    c = md5_hh(c, d, a, b, x[i+15], 16,  530742520);
  	    b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
  
  	    a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
  	    d = md5_ii(d, a, b, c, x[i+ 7], 10,  1126891415);
  	    c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
  	    b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
  	    a = md5_ii(a, b, c, d, x[i+12], 6 ,  1700485571);
  	    d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
  	    c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
  	    b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
  	    a = md5_ii(a, b, c, d, x[i+ 8], 6 ,  1873313359);
  	    d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
  	    c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
  	    b = md5_ii(b, c, d, a, x[i+13], 21,  1309151649);
  	    a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
  	    d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
  	    c = md5_ii(c, d, a, b, x[i+ 2], 15,  718787259);
  	    b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
  
  	    a = safe_add(a, olda);
  	    b = safe_add(b, oldb);
  	    c = safe_add(c, oldc);
  	    d = safe_add(d, oldd);
  	  }
  	  return Array(a, b, c, d);
  
  	}
  
  	/*
  	 * These functions implement the four basic operations the algorithm uses.
  	 */
  	function md5_cmn(q, a, b, x, s, t)
  	{
  	  return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
  	}
  	function md5_ff(a, b, c, d, x, s, t)
  	{
  	  return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
  	}
  	function md5_gg(a, b, c, d, x, s, t)
  	{
  	  return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
  	}
  	function md5_hh(a, b, c, d, x, s, t)
  	{
  	  return md5_cmn(b ^ c ^ d, a, b, x, s, t);
  	}
  	function md5_ii(a, b, c, d, x, s, t)
  	{
  	  return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
  	}
  
  	/*
  	 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
  	 * to work around bugs in some JS interpreters.
  	 */
  	function safe_add(x, y)
  	{
  	  var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  	  var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  	  return (msw << 16) | (lsw & 0xFFFF);
  	}
  
  	/*
  	 * Bitwise rotate a 32-bit number to the left.
  	 */
  	function bit_rol(num, cnt)
  	{
  	  return (num << cnt) | (num >>> (32 - cnt));
  	}
  
  	module.exports = function md5(buf) {
  	  return helpers.hash(buf, core_md5, 16);
  	};
  
  
  /***/ },
  /* 22 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(Buffer) {var intSize = 4;
  	var zeroBuffer = new Buffer(intSize); zeroBuffer.fill(0);
  	var chrsz = 8;
  
  	function toArray(buf, bigEndian) {
  	  if ((buf.length % intSize) !== 0) {
  	    var len = buf.length + (intSize - (buf.length % intSize));
  	    buf = Buffer.concat([buf, zeroBuffer], len);
  	  }
  
  	  var arr = [];
  	  var fn = bigEndian ? buf.readInt32BE : buf.readInt32LE;
  	  for (var i = 0; i < buf.length; i += intSize) {
  	    arr.push(fn.call(buf, i));
  	  }
  	  return arr;
  	}
  
  	function toBuffer(arr, size, bigEndian) {
  	  var buf = new Buffer(size);
  	  var fn = bigEndian ? buf.writeInt32BE : buf.writeInt32LE;
  	  for (var i = 0; i < arr.length; i++) {
  	    fn.call(buf, arr[i], i * 4, true);
  	  }
  	  return buf;
  	}
  
  	function hash(buf, fn, hashSize, bigEndian) {
  	  if (!Buffer.isBuffer(buf)) buf = new Buffer(buf);
  	  var arr = fn(toArray(buf, bigEndian), buf.length * chrsz);
  	  return toBuffer(arr, hashSize, bigEndian);
  	}
  
  	module.exports = { hash: hash };
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2).Buffer))
  
  /***/ },
  /* 23 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(Buffer) {
  	module.exports = ripemd160
  
  
  
  	/*
  	CryptoJS v3.1.2
  	code.google.com/p/crypto-js
  	(c) 2009-2013 by Jeff Mott. All rights reserved.
  	code.google.com/p/crypto-js/wiki/License
  	*/
  	/** @preserve
  	(c) 2012 by Cédric Mesnil. All rights reserved.
  
  	Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
  
  	    - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
  	    - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
  
  	THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  	*/
  
  	// Constants table
  	var zl = [
  	    0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
  	    7,  4, 13,  1, 10,  6, 15,  3, 12,  0,  9,  5,  2, 14, 11,  8,
  	    3, 10, 14,  4,  9, 15,  8,  1,  2,  7,  0,  6, 13, 11,  5, 12,
  	    1,  9, 11, 10,  0,  8, 12,  4, 13,  3,  7, 15, 14,  5,  6,  2,
  	    4,  0,  5,  9,  7, 12,  2, 10, 14,  1,  3,  8, 11,  6, 15, 13];
  	var zr = [
  	    5, 14,  7,  0,  9,  2, 11,  4, 13,  6, 15,  8,  1, 10,  3, 12,
  	    6, 11,  3,  7,  0, 13,  5, 10, 14, 15,  8, 12,  4,  9,  1,  2,
  	    15,  5,  1,  3,  7, 14,  6,  9, 11,  8, 12,  2, 10,  0,  4, 13,
  	    8,  6,  4,  1,  3, 11, 15,  0,  5, 12,  2, 13,  9,  7, 10, 14,
  	    12, 15, 10,  4,  1,  5,  8,  7,  6,  2, 13, 14,  0,  3,  9, 11];
  	var sl = [
  	     11, 14, 15, 12,  5,  8,  7,  9, 11, 13, 14, 15,  6,  7,  9,  8,
  	    7, 6,   8, 13, 11,  9,  7, 15,  7, 12, 15,  9, 11,  7, 13, 12,
  	    11, 13,  6,  7, 14,  9, 13, 15, 14,  8, 13,  6,  5, 12,  7,  5,
  	      11, 12, 14, 15, 14, 15,  9,  8,  9, 14,  5,  6,  8,  6,  5, 12,
  	    9, 15,  5, 11,  6,  8, 13, 12,  5, 12, 13, 14, 11,  8,  5,  6 ];
  	var sr = [
  	    8,  9,  9, 11, 13, 15, 15,  5,  7,  7,  8, 11, 14, 14, 12,  6,
  	    9, 13, 15,  7, 12,  8,  9, 11,  7,  7, 12,  7,  6, 15, 13, 11,
  	    9,  7, 15, 11,  8,  6,  6, 14, 12, 13,  5, 14, 13, 13,  7,  5,
  	    15,  5,  8, 11, 14, 14,  6, 14,  6,  9, 12,  9, 12,  5, 15,  8,
  	    8,  5, 12,  9, 12,  5, 14,  6,  8, 13,  6,  5, 15, 13, 11, 11 ];
  
  	var hl =  [ 0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E];
  	var hr =  [ 0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000];
  
  	var bytesToWords = function (bytes) {
  	  var words = [];
  	  for (var i = 0, b = 0; i < bytes.length; i++, b += 8) {
  	    words[b >>> 5] |= bytes[i] << (24 - b % 32);
  	  }
  	  return words;
  	};
  
  	var wordsToBytes = function (words) {
  	  var bytes = [];
  	  for (var b = 0; b < words.length * 32; b += 8) {
  	    bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
  	  }
  	  return bytes;
  	};
  
  	var processBlock = function (H, M, offset) {
  
  	  // Swap endian
  	  for (var i = 0; i < 16; i++) {
  	    var offset_i = offset + i;
  	    var M_offset_i = M[offset_i];
  
  	    // Swap
  	    M[offset_i] = (
  	        (((M_offset_i << 8)  | (M_offset_i >>> 24)) & 0x00ff00ff) |
  	        (((M_offset_i << 24) | (M_offset_i >>> 8))  & 0xff00ff00)
  	    );
  	  }
  
  	  // Working variables
  	  var al, bl, cl, dl, el;
  	  var ar, br, cr, dr, er;
  
  	  ar = al = H[0];
  	  br = bl = H[1];
  	  cr = cl = H[2];
  	  dr = dl = H[3];
  	  er = el = H[4];
  	  // Computation
  	  var t;
  	  for (var i = 0; i < 80; i += 1) {
  	    t = (al +  M[offset+zl[i]])|0;
  	    if (i<16){
  	        t +=  f1(bl,cl,dl) + hl[0];
  	    } else if (i<32) {
  	        t +=  f2(bl,cl,dl) + hl[1];
  	    } else if (i<48) {
  	        t +=  f3(bl,cl,dl) + hl[2];
  	    } else if (i<64) {
  	        t +=  f4(bl,cl,dl) + hl[3];
  	    } else {// if (i<80) {
  	        t +=  f5(bl,cl,dl) + hl[4];
  	    }
  	    t = t|0;
  	    t =  rotl(t,sl[i]);
  	    t = (t+el)|0;
  	    al = el;
  	    el = dl;
  	    dl = rotl(cl, 10);
  	    cl = bl;
  	    bl = t;
  
  	    t = (ar + M[offset+zr[i]])|0;
  	    if (i<16){
  	        t +=  f5(br,cr,dr) + hr[0];
  	    } else if (i<32) {
  	        t +=  f4(br,cr,dr) + hr[1];
  	    } else if (i<48) {
  	        t +=  f3(br,cr,dr) + hr[2];
  	    } else if (i<64) {
  	        t +=  f2(br,cr,dr) + hr[3];
  	    } else {// if (i<80) {
  	        t +=  f1(br,cr,dr) + hr[4];
  	    }
  	    t = t|0;
  	    t =  rotl(t,sr[i]) ;
  	    t = (t+er)|0;
  	    ar = er;
  	    er = dr;
  	    dr = rotl(cr, 10);
  	    cr = br;
  	    br = t;
  	  }
  	  // Intermediate hash value
  	  t    = (H[1] + cl + dr)|0;
  	  H[1] = (H[2] + dl + er)|0;
  	  H[2] = (H[3] + el + ar)|0;
  	  H[3] = (H[4] + al + br)|0;
  	  H[4] = (H[0] + bl + cr)|0;
  	  H[0] =  t;
  	};
  
  	function f1(x, y, z) {
  	  return ((x) ^ (y) ^ (z));
  	}
  
  	function f2(x, y, z) {
  	  return (((x)&(y)) | ((~x)&(z)));
  	}
  
  	function f3(x, y, z) {
  	  return (((x) | (~(y))) ^ (z));
  	}
  
  	function f4(x, y, z) {
  	  return (((x) & (z)) | ((y)&(~(z))));
  	}
  
  	function f5(x, y, z) {
  	  return ((x) ^ ((y) |(~(z))));
  	}
  
  	function rotl(x,n) {
  	  return (x<<n) | (x>>>(32-n));
  	}
  
  	function ripemd160(message) {
  	  var H = [0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0];
  
  	  if (typeof message == 'string')
  	    message = new Buffer(message, 'utf8');
  
  	  var m = bytesToWords(message);
  
  	  var nBitsLeft = message.length * 8;
  	  var nBitsTotal = message.length * 8;
  
  	  // Add padding
  	  m[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
  	  m[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
  	      (((nBitsTotal << 8)  | (nBitsTotal >>> 24)) & 0x00ff00ff) |
  	      (((nBitsTotal << 24) | (nBitsTotal >>> 8))  & 0xff00ff00)
  	  );
  
  	  for (var i=0 ; i<m.length; i += 16) {
  	    processBlock(H, m, i);
  	  }
  
  	  // Swap endian
  	  for (var i = 0; i < 5; i++) {
  	      // Shortcut
  	    var H_i = H[i];
  
  	    // Swap
  	    H[i] = (((H_i << 8)  | (H_i >>> 24)) & 0x00ff00ff) |
  	          (((H_i << 24) | (H_i >>> 8))  & 0xff00ff00);
  	  }
  
  	  var digestbytes = wordsToBytes(H);
  	  return new Buffer(digestbytes);
  	}
  
  
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2).Buffer))
  
  /***/ },
  /* 24 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(Buffer) {var createHash = __webpack_require__(11)
  
  	var zeroBuffer = new Buffer(128)
  	zeroBuffer.fill(0)
  
  	module.exports = Hmac
  
  	function Hmac (alg, key) {
  	  if(!(this instanceof Hmac)) return new Hmac(alg, key)
  	  this._opad = opad
  	  this._alg = alg
  
  	  var blocksize = (alg === 'sha512') ? 128 : 64
  
  	  key = this._key = !Buffer.isBuffer(key) ? new Buffer(key) : key
  
  	  if(key.length > blocksize) {
  	    key = createHash(alg).update(key).digest()
  	  } else if(key.length < blocksize) {
  	    key = Buffer.concat([key, zeroBuffer], blocksize)
  	  }
  
  	  var ipad = this._ipad = new Buffer(blocksize)
  	  var opad = this._opad = new Buffer(blocksize)
  
  	  for(var i = 0; i < blocksize; i++) {
  	    ipad[i] = key[i] ^ 0x36
  	    opad[i] = key[i] ^ 0x5C
  	  }
  
  	  this._hash = createHash(alg).update(ipad)
  	}
  
  	Hmac.prototype.update = function (data, enc) {
  	  this._hash.update(data, enc)
  	  return this
  	}
  
  	Hmac.prototype.digest = function (enc) {
  	  var h = this._hash.digest()
  	  return createHash(this._alg).update(this._opad).update(h).digest(enc)
  	}
  
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2).Buffer))
  
  /***/ },
  /* 25 */
  /***/ function(module, exports, __webpack_require__) {
  
  	var pbkdf2Export = __webpack_require__(26)
  
  	module.exports = function (crypto, exports) {
  	  exports = exports || {}
  
  	  var exported = pbkdf2Export(crypto)
  
  	  exports.pbkdf2 = exported.pbkdf2
  	  exports.pbkdf2Sync = exported.pbkdf2Sync
  
  	  return exports
  	}
  
  
  /***/ },
  /* 26 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(Buffer) {module.exports = function(crypto) {
  	  function pbkdf2(password, salt, iterations, keylen, digest, callback) {
  	    if ('function' === typeof digest) {
  	      callback = digest
  	      digest = undefined
  	    }
  
  	    if ('function' !== typeof callback)
  	      throw new Error('No callback provided to pbkdf2')
  
  	    setTimeout(function() {
  	      var result
  
  	      try {
  	        result = pbkdf2Sync(password, salt, iterations, keylen, digest)
  	      } catch (e) {
  	        return callback(e)
  	      }
  
  	      callback(undefined, result)
  	    })
  	  }
  
  	  function pbkdf2Sync(password, salt, iterations, keylen, digest) {
  	    if ('number' !== typeof iterations)
  	      throw new TypeError('Iterations not a number')
  
  	    if (iterations < 0)
  	      throw new TypeError('Bad iterations')
  
  	    if ('number' !== typeof keylen)
  	      throw new TypeError('Key length not a number')
  
  	    if (keylen < 0)
  	      throw new TypeError('Bad key length')
  
  	    digest = digest || 'sha1'
  
  	    if (!Buffer.isBuffer(password)) password = new Buffer(password)
  	    if (!Buffer.isBuffer(salt)) salt = new Buffer(salt)
  
  	    var hLen, l = 1, r, T
  	    var DK = new Buffer(keylen)
  	    var block1 = new Buffer(salt.length + 4)
  	    salt.copy(block1, 0, 0, salt.length)
  
  	    for (var i = 1; i <= l; i++) {
  	      block1.writeUInt32BE(i, salt.length)
  
  	      var U = crypto.createHmac(digest, password).update(block1).digest()
  
  	      if (!hLen) {
  	        hLen = U.length
  	        T = new Buffer(hLen)
  	        l = Math.ceil(keylen / hLen)
  	        r = keylen - (l - 1) * hLen
  
  	        if (keylen > (Math.pow(2, 32) - 1) * hLen)
  	          throw new TypeError('keylen exceeds maximum length')
  	      }
  
  	      U.copy(T, 0, 0, hLen)
  
  	      for (var j = 1; j < iterations; j++) {
  	        U = crypto.createHmac(digest, password).update(U).digest()
  
  	        for (var k = 0; k < hLen; k++) {
  	          T[k] ^= U[k]
  	        }
  	      }
  
  	      var destPos = (i - 1) * hLen
  	      var len = (i == l ? r : hLen)
  	      T.copy(DK, destPos, 0, len)
  	    }
  
  	    return DK
  	  }
  
  	  return {
  	    pbkdf2: pbkdf2,
  	    pbkdf2Sync: pbkdf2Sync
  	  }
  	}
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2).Buffer))
  
  /***/ },
  /* 27 */
  /***/ function(module, exports, __webpack_require__) {
  
  	var __WEBPACK_AMD_DEFINE_RESULT__;/* WEBPACK VAR INJECTION */(function(module, global) {/**
  	 * @license
  	 * lodash 3.10.1 (Custom Build) <https://lodash.com/>
  	 * Build: `lodash modern -d -o ./index.js`
  	 * Copyright 2012-2015 The Dojo Foundation <http://dojofoundation.org/>
  	 * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
  	 * Copyright 2009-2015 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
  	 * Available under MIT license <https://lodash.com/license>
  	 */
  	;(function() {
  
  	  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
  	  var undefined;
  
  	  /** Used as the semantic version number. */
  	  var VERSION = '3.10.1';
  
  	  /** Used to compose bitmasks for wrapper metadata. */
  	  var BIND_FLAG = 1,
  	      BIND_KEY_FLAG = 2,
  	      CURRY_BOUND_FLAG = 4,
  	      CURRY_FLAG = 8,
  	      CURRY_RIGHT_FLAG = 16,
  	      PARTIAL_FLAG = 32,
  	      PARTIAL_RIGHT_FLAG = 64,
  	      ARY_FLAG = 128,
  	      REARG_FLAG = 256;
  
  	  /** Used as default options for `_.trunc`. */
  	  var DEFAULT_TRUNC_LENGTH = 30,
  	      DEFAULT_TRUNC_OMISSION = '...';
  
  	  /** Used to detect when a function becomes hot. */
  	  var HOT_COUNT = 150,
  	      HOT_SPAN = 16;
  
  	  /** Used as the size to enable large array optimizations. */
  	  var LARGE_ARRAY_SIZE = 200;
  
  	  /** Used to indicate the type of lazy iteratees. */
  	  var LAZY_FILTER_FLAG = 1,
  	      LAZY_MAP_FLAG = 2;
  
  	  /** Used as the `TypeError` message for "Functions" methods. */
  	  var FUNC_ERROR_TEXT = 'Expected a function';
  
  	  /** Used as the internal argument placeholder. */
  	  var PLACEHOLDER = '__lodash_placeholder__';
  
  	  /** `Object#toString` result references. */
  	  var argsTag = '[object Arguments]',
  	      arrayTag = '[object Array]',
  	      boolTag = '[object Boolean]',
  	      dateTag = '[object Date]',
  	      errorTag = '[object Error]',
  	      funcTag = '[object Function]',
  	      mapTag = '[object Map]',
  	      numberTag = '[object Number]',
  	      objectTag = '[object Object]',
  	      regexpTag = '[object RegExp]',
  	      setTag = '[object Set]',
  	      stringTag = '[object String]',
  	      weakMapTag = '[object WeakMap]';
  
  	  var arrayBufferTag = '[object ArrayBuffer]',
  	      float32Tag = '[object Float32Array]',
  	      float64Tag = '[object Float64Array]',
  	      int8Tag = '[object Int8Array]',
  	      int16Tag = '[object Int16Array]',
  	      int32Tag = '[object Int32Array]',
  	      uint8Tag = '[object Uint8Array]',
  	      uint8ClampedTag = '[object Uint8ClampedArray]',
  	      uint16Tag = '[object Uint16Array]',
  	      uint32Tag = '[object Uint32Array]';
  
  	  /** Used to match empty string literals in compiled template source. */
  	  var reEmptyStringLeading = /\b__p \+= '';/g,
  	      reEmptyStringMiddle = /\b(__p \+=) '' \+/g,
  	      reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g;
  
  	  /** Used to match HTML entities and HTML characters. */
  	  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39|#96);/g,
  	      reUnescapedHtml = /[&<>"'`]/g,
  	      reHasEscapedHtml = RegExp(reEscapedHtml.source),
  	      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);
  
  	  /** Used to match template delimiters. */
  	  var reEscape = /<%-([\s\S]+?)%>/g,
  	      reEvaluate = /<%([\s\S]+?)%>/g,
  	      reInterpolate = /<%=([\s\S]+?)%>/g;
  
  	  /** Used to match property names within property paths. */
  	  var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\n\\]|\\.)*?\1)\]/,
  	      reIsPlainProp = /^\w*$/,
  	      rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\n\\]|\\.)*?)\2)\]/g;
  
  	  /**
  	   * Used to match `RegExp` [syntax characters](http://ecma-international.org/ecma-262/6.0/#sec-patterns)
  	   * and those outlined by [`EscapeRegExpPattern`](http://ecma-international.org/ecma-262/6.0/#sec-escaperegexppattern).
  	   */
  	  var reRegExpChars = /^[:!,]|[\\^$.*+?()[\]{}|\/]|(^[0-9a-fA-Fnrtuvx])|([\n\r\u2028\u2029])/g,
  	      reHasRegExpChars = RegExp(reRegExpChars.source);
  
  	  /** Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks). */
  	  var reComboMark = /[\u0300-\u036f\ufe20-\ufe23]/g;
  
  	  /** Used to match backslashes in property paths. */
  	  var reEscapeChar = /\\(\\)?/g;
  
  	  /** Used to match [ES template delimiters](http://ecma-international.org/ecma-262/6.0/#sec-template-literal-lexical-components). */
  	  var reEsTemplate = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g;
  
  	  /** Used to match `RegExp` flags from their coerced string values. */
  	  var reFlags = /\w*$/;
  
  	  /** Used to detect hexadecimal string values. */
  	  var reHasHexPrefix = /^0[xX]/;
  
  	  /** Used to detect host constructors (Safari > 5). */
  	  var reIsHostCtor = /^\[object .+?Constructor\]$/;
  
  	  /** Used to detect unsigned integer values. */
  	  var reIsUint = /^\d+$/;
  
  	  /** Used to match latin-1 supplementary letters (excluding mathematical operators). */
  	  var reLatin1 = /[\xc0-\xd6\xd8-\xde\xdf-\xf6\xf8-\xff]/g;
  
  	  /** Used to ensure capturing order of template delimiters. */
  	  var reNoMatch = /($^)/;
  
  	  /** Used to match unescaped characters in compiled string literals. */
  	  var reUnescapedString = /['\n\r\u2028\u2029\\]/g;
  
  	  /** Used to match words to create compound words. */
  	  var reWords = (function() {
  	    var upper = '[A-Z\\xc0-\\xd6\\xd8-\\xde]',
  	        lower = '[a-z\\xdf-\\xf6\\xf8-\\xff]+';
  
  	    return RegExp(upper + '+(?=' + upper + lower + ')|' + upper + '?' + lower + '|' + upper + '+|[0-9]+', 'g');
  	  }());
  
  	  /** Used to assign default `context` object properties. */
  	  var contextProps = [
  	    'Array', 'ArrayBuffer', 'Date', 'Error', 'Float32Array', 'Float64Array',
  	    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Math', 'Number',
  	    'Object', 'RegExp', 'Set', 'String', '_', 'clearTimeout', 'isFinite',
  	    'parseFloat', 'parseInt', 'setTimeout', 'TypeError', 'Uint8Array',
  	    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap'
  	  ];
  
  	  /** Used to make template sourceURLs easier to identify. */
  	  var templateCounter = -1;
  
  	  /** Used to identify `toStringTag` values of typed arrays. */
  	  var typedArrayTags = {};
  	  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =
  	  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =
  	  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =
  	  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =
  	  typedArrayTags[uint32Tag] = true;
  	  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =
  	  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =
  	  typedArrayTags[dateTag] = typedArrayTags[errorTag] =
  	  typedArrayTags[funcTag] = typedArrayTags[mapTag] =
  	  typedArrayTags[numberTag] = typedArrayTags[objectTag] =
  	  typedArrayTags[regexpTag] = typedArrayTags[setTag] =
  	  typedArrayTags[stringTag] = typedArrayTags[weakMapTag] = false;
  
  	  /** Used to identify `toStringTag` values supported by `_.clone`. */
  	  var cloneableTags = {};
  	  cloneableTags[argsTag] = cloneableTags[arrayTag] =
  	  cloneableTags[arrayBufferTag] = cloneableTags[boolTag] =
  	  cloneableTags[dateTag] = cloneableTags[float32Tag] =
  	  cloneableTags[float64Tag] = cloneableTags[int8Tag] =
  	  cloneableTags[int16Tag] = cloneableTags[int32Tag] =
  	  cloneableTags[numberTag] = cloneableTags[objectTag] =
  	  cloneableTags[regexpTag] = cloneableTags[stringTag] =
  	  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =
  	  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;
  	  cloneableTags[errorTag] = cloneableTags[funcTag] =
  	  cloneableTags[mapTag] = cloneableTags[setTag] =
  	  cloneableTags[weakMapTag] = false;
  
  	  /** Used to map latin-1 supplementary letters to basic latin letters. */
  	  var deburredLetters = {
  	    '\xc0': 'A',  '\xc1': 'A', '\xc2': 'A', '\xc3': 'A', '\xc4': 'A', '\xc5': 'A',
  	    '\xe0': 'a',  '\xe1': 'a', '\xe2': 'a', '\xe3': 'a', '\xe4': 'a', '\xe5': 'a',
  	    '\xc7': 'C',  '\xe7': 'c',
  	    '\xd0': 'D',  '\xf0': 'd',
  	    '\xc8': 'E',  '\xc9': 'E', '\xca': 'E', '\xcb': 'E',
  	    '\xe8': 'e',  '\xe9': 'e', '\xea': 'e', '\xeb': 'e',
  	    '\xcC': 'I',  '\xcd': 'I', '\xce': 'I', '\xcf': 'I',
  	    '\xeC': 'i',  '\xed': 'i', '\xee': 'i', '\xef': 'i',
  	    '\xd1': 'N',  '\xf1': 'n',
  	    '\xd2': 'O',  '\xd3': 'O', '\xd4': 'O', '\xd5': 'O', '\xd6': 'O', '\xd8': 'O',
  	    '\xf2': 'o',  '\xf3': 'o', '\xf4': 'o', '\xf5': 'o', '\xf6': 'o', '\xf8': 'o',
  	    '\xd9': 'U',  '\xda': 'U', '\xdb': 'U', '\xdc': 'U',
  	    '\xf9': 'u',  '\xfa': 'u', '\xfb': 'u', '\xfc': 'u',
  	    '\xdd': 'Y',  '\xfd': 'y', '\xff': 'y',
  	    '\xc6': 'Ae', '\xe6': 'ae',
  	    '\xde': 'Th', '\xfe': 'th',
  	    '\xdf': 'ss'
  	  };
  
  	  /** Used to map characters to HTML entities. */
  	  var htmlEscapes = {
  	    '&': '&amp;',
  	    '<': '&lt;',
  	    '>': '&gt;',
  	    '"': '&quot;',
  	    "'": '&#39;',
  	    '`': '&#96;'
  	  };
  
  	  /** Used to map HTML entities to characters. */
  	  var htmlUnescapes = {
  	    '&amp;': '&',
  	    '&lt;': '<',
  	    '&gt;': '>',
  	    '&quot;': '"',
  	    '&#39;': "'",
  	    '&#96;': '`'
  	  };
  
  	  /** Used to determine if values are of the language type `Object`. */
  	  var objectTypes = {
  	    'function': true,
  	    'object': true
  	  };
  
  	  /** Used to escape characters for inclusion in compiled regexes. */
  	  var regexpEscapes = {
  	    '0': 'x30', '1': 'x31', '2': 'x32', '3': 'x33', '4': 'x34',
  	    '5': 'x35', '6': 'x36', '7': 'x37', '8': 'x38', '9': 'x39',
  	    'A': 'x41', 'B': 'x42', 'C': 'x43', 'D': 'x44', 'E': 'x45', 'F': 'x46',
  	    'a': 'x61', 'b': 'x62', 'c': 'x63', 'd': 'x64', 'e': 'x65', 'f': 'x66',
  	    'n': 'x6e', 'r': 'x72', 't': 'x74', 'u': 'x75', 'v': 'x76', 'x': 'x78'
  	  };
  
  	  /** Used to escape characters for inclusion in compiled string literals. */
  	  var stringEscapes = {
  	    '\\': '\\',
  	    "'": "'",
  	    '\n': 'n',
  	    '\r': 'r',
  	    '\u2028': 'u2028',
  	    '\u2029': 'u2029'
  	  };
  
  	  /** Detect free variable `exports`. */
  	  var freeExports = objectTypes[typeof exports] && exports && !exports.nodeType && exports;
  
  	  /** Detect free variable `module`. */
  	  var freeModule = objectTypes[typeof module] && module && !module.nodeType && module;
  
  	  /** Detect free variable `global` from Node.js. */
  	  var freeGlobal = freeExports && freeModule && typeof global == 'object' && global && global.Object && global;
  
  	  /** Detect free variable `self`. */
  	  var freeSelf = objectTypes[typeof self] && self && self.Object && self;
  
  	  /** Detect free variable `window`. */
  	  var freeWindow = objectTypes[typeof window] && window && window.Object && window;
  
  	  /** Detect the popular CommonJS extension `module.exports`. */
  	  var moduleExports = freeModule && freeModule.exports === freeExports && freeExports;
  
  	  /**
  	   * Used as a reference to the global object.
  	   *
  	   * The `this` value is used if it's the global object to avoid Greasemonkey's
  	   * restricted `window` object, otherwise the `window` object is used.
  	   */
  	  var root = freeGlobal || ((freeWindow !== (this && this.window)) && freeWindow) || freeSelf || this;
  
  	  /*--------------------------------------------------------------------------*/
  
  	  /**
  	   * The base implementation of `compareAscending` which compares values and
  	   * sorts them in ascending order without guaranteeing a stable sort.
  	   *
  	   * @private
  	   * @param {*} value The value to compare.
  	   * @param {*} other The other value to compare.
  	   * @returns {number} Returns the sort order indicator for `value`.
  	   */
  	  function baseCompareAscending(value, other) {
  	    if (value !== other) {
  	      var valIsNull = value === null,
  	          valIsUndef = value === undefined,
  	          valIsReflexive = value === value;
  
  	      var othIsNull = other === null,
  	          othIsUndef = other === undefined,
  	          othIsReflexive = other === other;
  
  	      if ((value > other && !othIsNull) || !valIsReflexive ||
  	          (valIsNull && !othIsUndef && othIsReflexive) ||
  	          (valIsUndef && othIsReflexive)) {
  	        return 1;
  	      }
  	      if ((value < other && !valIsNull) || !othIsReflexive ||
  	          (othIsNull && !valIsUndef && valIsReflexive) ||
  	          (othIsUndef && valIsReflexive)) {
  	        return -1;
  	      }
  	    }
  	    return 0;
  	  }
  
  	  /**
  	   * The base implementation of `_.findIndex` and `_.findLastIndex` without
  	   * support for callback shorthands and `this` binding.
  	   *
  	   * @private
  	   * @param {Array} array The array to search.
  	   * @param {Function} predicate The function invoked per iteration.
  	   * @param {boolean} [fromRight] Specify iterating from right to left.
  	   * @returns {number} Returns the index of the matched value, else `-1`.
  	   */
  	  function baseFindIndex(array, predicate, fromRight) {
  	    var length = array.length,
  	        index = fromRight ? length : -1;
  
  	    while ((fromRight ? index-- : ++index < length)) {
  	      if (predicate(array[index], index, array)) {
  	        return index;
  	      }
  	    }
  	    return -1;
  	  }
  
  	  /**
  	   * The base implementation of `_.indexOf` without support for binary searches.
  	   *
  	   * @private
  	   * @param {Array} array The array to search.
  	   * @param {*} value The value to search for.
  	   * @param {number} fromIndex The index to search from.
  	   * @returns {number} Returns the index of the matched value, else `-1`.
  	   */
  	  function baseIndexOf(array, value, fromIndex) {
  	    if (value !== value) {
  	      return indexOfNaN(array, fromIndex);
  	    }
  	    var index = fromIndex - 1,
  	        length = array.length;
  
  	    while (++index < length) {
  	      if (array[index] === value) {
  	        return index;
  	      }
  	    }
  	    return -1;
  	  }
  
  	  /**
  	   * The base implementation of `_.isFunction` without support for environments
  	   * with incorrect `typeof` results.
  	   *
  	   * @private
  	   * @param {*} value The value to check.
  	   * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
  	   */
  	  function baseIsFunction(value) {
  	    // Avoid a Chakra JIT bug in compatibility modes of IE 11.
  	    // See https://github.com/jashkenas/underscore/issues/1621 for more details.
  	    return typeof value == 'function' || false;
  	  }
  
  	  /**
  	   * Converts `value` to a string if it's not one. An empty string is returned
  	   * for `null` or `undefined` values.
  	   *
  	   * @private
  	   * @param {*} value The value to process.
  	   * @returns {string} Returns the string.
  	   */
  	  function baseToString(value) {
  	    return value == null ? '' : (value + '');
  	  }
  
  	  /**
  	   * Used by `_.trim` and `_.trimLeft` to get the index of the first character
  	   * of `string` that is not found in `chars`.
  	   *
  	   * @private
  	   * @param {string} string The string to inspect.
  	   * @param {string} chars The characters to find.
  	   * @returns {number} Returns the index of the first character not found in `chars`.
  	   */
  	  function charsLeftIndex(string, chars) {
  	    var index = -1,
  	        length = string.length;
  
  	    while (++index < length && chars.indexOf(string.charAt(index)) > -1) {}
  	    return index;
  	  }
  
  	  /**
  	   * Used by `_.trim` and `_.trimRight` to get the index of the last character
  	   * of `string` that is not found in `chars`.
  	   *
  	   * @private
  	   * @param {string} string The string to inspect.
  	   * @param {string} chars The characters to find.
  	   * @returns {number} Returns the index of the last character not found in `chars`.
  	   */
  	  function charsRightIndex(string, chars) {
  	    var index = string.length;
  
  	    while (index-- && chars.indexOf(string.charAt(index)) > -1) {}
  	    return index;
  	  }
  
  	  /**
  	   * Used by `_.sortBy` to compare transformed elements of a collection and stable
  	   * sort them in ascending order.
  	   *
  	   * @private
  	   * @param {Object} object The object to compare.
  	   * @param {Object} other The other object to compare.
  	   * @returns {number} Returns the sort order indicator for `object`.
  	   */
  	  function compareAscending(object, other) {
  	    return baseCompareAscending(object.criteria, other.criteria) || (object.index - other.index);
  	  }
  
  	  /**
  	   * Used by `_.sortByOrder` to compare multiple properties of a value to another
  	   * and stable sort them.
  	   *
  	   * If `orders` is unspecified, all valuess are sorted in ascending order. Otherwise,
  	   * a value is sorted in ascending order if its corresponding order is "asc", and
  	   * descending if "desc".
  	   *
  	   * @private
  	   * @param {Object} object The object to compare.
  	   * @param {Object} other The other object to compare.
  	   * @param {boolean[]} orders The order to sort by for each property.
  	   * @returns {number} Returns the sort order indicator for `object`.
  	   */
  	  function compareMultiple(object, other, orders) {
  	    var index = -1,
  	        objCriteria = object.criteria,
  	        othCriteria = other.criteria,
  	        length = objCriteria.length,
  	        ordersLength = orders.length;
  
  	    while (++index < length) {
  	      var result = baseCompareAscending(objCriteria[index], othCriteria[index]);
  	      if (result) {
  	        if (index >= ordersLength) {
  	          return result;
  	        }
  	        var order = orders[index];
  	        return result * ((order === 'asc' || order === true) ? 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://code.google.com/p/v8/issues/detail?id=90 for more details.
  	    return object.index - other.index;
  	  }
  
  	  /**
  	   * Used by `_.deburr` to convert latin-1 supplementary letters to basic latin letters.
  	   *
  	   * @private
  	   * @param {string} letter The matched letter to deburr.
  	   * @returns {string} Returns the deburred letter.
  	   */
  	  function deburrLetter(letter) {
  	    return deburredLetters[letter];
  	  }
  
  	  /**
  	   * Used by `_.escape` to convert characters to HTML entities.
  	   *
  	   * @private
  	   * @param {string} chr The matched character to escape.
  	   * @returns {string} Returns the escaped character.
  	   */
  	  function escapeHtmlChar(chr) {
  	    return htmlEscapes[chr];
  	  }
  
  	  /**
  	   * Used by `_.escapeRegExp` to escape characters for inclusion in compiled regexes.
  	   *
  	   * @private
  	   * @param {string} chr The matched character to escape.
  	   * @param {string} leadingChar The capture group for a leading character.
  	   * @param {string} whitespaceChar The capture group for a whitespace character.
  	   * @returns {string} Returns the escaped character.
  	   */
  	  function escapeRegExpChar(chr, leadingChar, whitespaceChar) {
  	    if (leadingChar) {
  	      chr = regexpEscapes[chr];
  	    } else if (whitespaceChar) {
  	      chr = stringEscapes[chr];
  	    }
  	    return '\\' + chr;
  	  }
  
  	  /**
  	   * Used by `_.template` to escape characters for inclusion in compiled string literals.
  	   *
  	   * @private
  	   * @param {string} chr The matched character to escape.
  	   * @returns {string} Returns the escaped character.
  	   */
  	  function escapeStringChar(chr) {
  	    return '\\' + stringEscapes[chr];
  	  }
  
  	  /**
  	   * Gets the index at which the first occurrence of `NaN` is found in `array`.
  	   *
  	   * @private
  	   * @param {Array} array The array to search.
  	   * @param {number} fromIndex The index to search from.
  	   * @param {boolean} [fromRight] Specify iterating from right to left.
  	   * @returns {number} Returns the index of the matched `NaN`, else `-1`.
  	   */
  	  function indexOfNaN(array, fromIndex, fromRight) {
  	    var length = array.length,
  	        index = fromIndex + (fromRight ? 0 : -1);
  
  	    while ((fromRight ? index-- : ++index < length)) {
  	      var other = array[index];
  	      if (other !== other) {
  	        return index;
  	      }
  	    }
  	    return -1;
  	  }
  
  	  /**
  	   * Checks if `value` is object-like.
  	   *
  	   * @private
  	   * @param {*} value The value to check.
  	   * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
  	   */
  	  function isObjectLike(value) {
  	    return !!value && typeof value == 'object';
  	  }
  
  	  /**
  	   * Used by `trimmedLeftIndex` and `trimmedRightIndex` to determine if a
  	   * character code is whitespace.
  	   *
  	   * @private
  	   * @param {number} charCode The character code to inspect.
  	   * @returns {boolean} Returns `true` if `charCode` is whitespace, else `false`.
  	   */
  	  function isSpace(charCode) {
  	    return ((charCode <= 160 && (charCode >= 9 && charCode <= 13) || charCode == 32 || charCode == 160) || charCode == 5760 || charCode == 6158 ||
  	      (charCode >= 8192 && (charCode <= 8202 || charCode == 8232 || charCode == 8233 || charCode == 8239 || charCode == 8287 || charCode == 12288 || charCode == 65279)));
  	  }
  
  	  /**
  	   * Replaces all `placeholder` elements in `array` with an internal placeholder
  	   * and returns an array of their indexes.
  	   *
  	   * @private
  	   * @param {Array} array The array to modify.
  	   * @param {*} placeholder The placeholder to replace.
  	   * @returns {Array} Returns the new array of placeholder indexes.
  	   */
  	  function replaceHolders(array, placeholder) {
  	    var index = -1,
  	        length = array.length,
  	        resIndex = -1,
  	        result = [];
  
  	    while (++index < length) {
  	      if (array[index] === placeholder) {
  	        array[index] = PLACEHOLDER;
  	        result[++resIndex] = index;
  	      }
  	    }
  	    return result;
  	  }
  
  	  /**
  	   * An implementation of `_.uniq` optimized for sorted arrays without support
  	   * for callback shorthands and `this` binding.
  	   *
  	   * @private
  	   * @param {Array} array The array to inspect.
  	   * @param {Function} [iteratee] The function invoked per iteration.
  	   * @returns {Array} Returns the new duplicate-value-free array.
  	   */
  	  function sortedUniq(array, iteratee) {
  	    var seen,
  	        index = -1,
  	        length = array.length,
  	        resIndex = -1,
  	        result = [];
  
  	    while (++index < length) {
  	      var value = array[index],
  	          computed = iteratee ? iteratee(value, index, array) : value;
  
  	      if (!index || seen !== computed) {
  	        seen = computed;
  	        result[++resIndex] = value;
  	      }
  	    }
  	    return result;
  	  }
  
  	  /**
  	   * Used by `_.trim` and `_.trimLeft` to get the index of the first non-whitespace
  	   * character of `string`.
  	   *
  	   * @private
  	   * @param {string} string The string to inspect.
  	   * @returns {number} Returns the index of the first non-whitespace character.
  	   */
  	  function trimmedLeftIndex(string) {
  	    var index = -1,
  	        length = string.length;
  
  	    while (++index < length && isSpace(string.charCodeAt(index))) {}
  	    return index;
  	  }
  
  	  /**
  	   * Used by `_.trim` and `_.trimRight` to get the index of the last non-whitespace
  	   * character of `string`.
  	   *
  	   * @private
  	   * @param {string} string The string to inspect.
  	   * @returns {number} Returns the index of the last non-whitespace character.
  	   */
  	  function trimmedRightIndex(string) {
  	    var index = string.length;
  
  	    while (index-- && isSpace(string.charCodeAt(index))) {}
  	    return index;
  	  }
  
  	  /**
  	   * Used by `_.unescape` to convert HTML entities to characters.
  	   *
  	   * @private
  	   * @param {string} chr The matched character to unescape.
  	   * @returns {string} Returns the unescaped character.
  	   */
  	  function unescapeHtmlChar(chr) {
  	    return htmlUnescapes[chr];
  	  }
  
  	  /*--------------------------------------------------------------------------*/
  
  	  /**
  	   * Create a new pristine `lodash` function using the given `context` object.
  	   *
  	   * @static
  	   * @memberOf _
  	   * @category Utility
  	   * @param {Object} [context=root] The context object.
  	   * @returns {Function} Returns a new `lodash` function.
  	   * @example
  	   *
  	   * _.mixin({ 'foo': _.constant('foo') });
  	   *
  	   * var lodash = _.runInContext();
  	   * lodash.mixin({ 'bar': lodash.constant('bar') });
  	   *
  	   * _.isFunction(_.foo);
  	   * // => true
  	   * _.isFunction(_.bar);
  	   * // => false
  	   *
  	   * lodash.isFunction(lodash.foo);
  	   * // => false
  	   * lodash.isFunction(lodash.bar);
  	   * // => true
  	   *
  	   * // using `context` to mock `Date#getTime` use in `_.now`
  	   * var mock = _.runInContext({
  	   *   'Date': function() {
  	   *     return { 'getTime': getTimeMock };
  	   *   }
  	   * });
  	   *
  	   * // or creating a suped-up `defer` in Node.js
  	   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;
  	   */
  	  function runInContext(context) {
  	    // Avoid issues with some ES3 environments that attempt to use values, named
  	    // after built-in constructors like `Object`, for the creation of literals.
  	    // ES5 clears this up by stating that literals must use built-in constructors.
  	    // See https://es5.github.io/#x11.1.5 for more details.
  	    context = context ? _.defaults(root.Object(), context, _.pick(root, contextProps)) : root;
  
  	    /** Native constructor references. */
  	    var Array = context.Array,
  	        Date = context.Date,
  	        Error = context.Error,
  	        Function = context.Function,
  	        Math = context.Math,
  	        Number = context.Number,
  	        Object = context.Object,
  	        RegExp = context.RegExp,
  	        String = context.String,
  	        TypeError = context.TypeError;
  
  	    /** Used for native method references. */
  	    var arrayProto = Array.prototype,
  	        objectProto = Object.prototype,
  	        stringProto = String.prototype;
  
  	    /** Used to resolve the decompiled source of functions. */
  	    var fnToString = Function.prototype.toString;
  
  	    /** Used to check objects for own properties. */
  	    var hasOwnProperty = objectProto.hasOwnProperty;
  
  	    /** Used to generate unique IDs. */
  	    var idCounter = 0;
  
  	    /**
  	     * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
  	     * of values.
  	     */
  	    var objToString = objectProto.toString;
  
  	    /** Used to restore the original `_` reference in `_.noConflict`. */
  	    var oldDash = root._;
  
  	    /** Used to detect if a method is native. */
  	    var reIsNative = RegExp('^' +
  	      fnToString.call(hasOwnProperty).replace(/[\\^$.*+?()[\]{}|]/g, '\\$&')
  	      .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
  	    );
  
  	    /** Native method references. */
  	    var ArrayBuffer = context.ArrayBuffer,
  	        clearTimeout = context.clearTimeout,
  	        parseFloat = context.parseFloat,
  	        pow = Math.pow,
  	        propertyIsEnumerable = objectProto.propertyIsEnumerable,
  	        Set = getNative(context, 'Set'),
  	        setTimeout = context.setTimeout,
  	        splice = arrayProto.splice,
  	        Uint8Array = context.Uint8Array,
  	        WeakMap = getNative(context, 'WeakMap');
  
  	    /* Native method references for those with the same name as other `lodash` methods. */
  	    var nativeCeil = Math.ceil,
  	        nativeCreate = getNative(Object, 'create'),
  	        nativeFloor = Math.floor,
  	        nativeIsArray = getNative(Array, 'isArray'),
  	        nativeIsFinite = context.isFinite,
  	        nativeKeys = getNative(Object, 'keys'),
  	        nativeMax = Math.max,
  	        nativeMin = Math.min,
  	        nativeNow = getNative(Date, 'now'),
  	        nativeParseInt = context.parseInt,
  	        nativeRandom = Math.random;
  
  	    /** Used as references for `-Infinity` and `Infinity`. */
  	    var NEGATIVE_INFINITY = Number.NEGATIVE_INFINITY,
  	        POSITIVE_INFINITY = Number.POSITIVE_INFINITY;
  
  	    /** Used as references for the maximum length and index of an array. */
  	    var MAX_ARRAY_LENGTH = 4294967295,
  	        MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,
  	        HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;
  
  	    /**
  	     * Used as the [maximum length](http://ecma-international.org/ecma-262/6.0/#sec-number.max_safe_integer)
  	     * of an array-like value.
  	     */
  	    var MAX_SAFE_INTEGER = 9007199254740991;
  
  	    /** Used to store function metadata. */
  	    var metaMap = WeakMap && new WeakMap;
  
  	    /** Used to lookup unminified function names. */
  	    var realNames = {};
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Creates a `lodash` object which wraps `value` to enable implicit chaining.
  	     * Methods that operate on and return arrays, collections, and functions can
  	     * be chained together. Methods that retrieve a single value or may return a
  	     * primitive value will automatically end the chain returning the unwrapped
  	     * value. Explicit chaining may be enabled using `_.chain`. The execution of
  	     * chained methods is lazy, that is, execution is deferred until `_#value`
  	     * is implicitly or explicitly called.
  	     *
  	     * Lazy evaluation allows several methods to support shortcut fusion. Shortcut
  	     * fusion is an optimization strategy which merge iteratee calls; this can help
  	     * to avoid the creation of intermediate data structures and greatly reduce the
  	     * number of iteratee executions.
  	     *
  	     * Chaining is supported in custom builds as long as the `_#value` method is
  	     * directly or indirectly included in the build.
  	     *
  	     * In addition to lodash methods, wrappers have `Array` and `String` methods.
  	     *
  	     * The wrapper `Array` methods are:
  	     * `concat`, `join`, `pop`, `push`, `reverse`, `shift`, `slice`, `sort`,
  	     * `splice`, and `unshift`
  	     *
  	     * The wrapper `String` methods are:
  	     * `replace` and `split`
  	     *
  	     * The wrapper methods that support shortcut fusion are:
  	     * `compact`, `drop`, `dropRight`, `dropRightWhile`, `dropWhile`, `filter`,
  	     * `first`, `initial`, `last`, `map`, `pluck`, `reject`, `rest`, `reverse`,
  	     * `slice`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, `toArray`,
  	     * and `where`
  	     *
  	     * The chainable wrapper methods are:
  	     * `after`, `ary`, `assign`, `at`, `before`, `bind`, `bindAll`, `bindKey`,
  	     * `callback`, `chain`, `chunk`, `commit`, `compact`, `concat`, `constant`,
  	     * `countBy`, `create`, `curry`, `debounce`, `defaults`, `defaultsDeep`,
  	     * `defer`, `delay`, `difference`, `drop`, `dropRight`, `dropRightWhile`,
  	     * `dropWhile`, `fill`, `filter`, `flatten`, `flattenDeep`, `flow`, `flowRight`,
  	     * `forEach`, `forEachRight`, `forIn`, `forInRight`, `forOwn`, `forOwnRight`,
  	     * `functions`, `groupBy`, `indexBy`, `initial`, `intersection`, `invert`,
  	     * `invoke`, `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`,
  	     * `matchesProperty`, `memoize`, `merge`, `method`, `methodOf`, `mixin`,
  	     * `modArgs`, `negate`, `omit`, `once`, `pairs`, `partial`, `partialRight`,
  	     * `partition`, `pick`, `plant`, `pluck`, `property`, `propertyOf`, `pull`,
  	     * `pullAt`, `push`, `range`, `rearg`, `reject`, `remove`, `rest`, `restParam`,
  	     * `reverse`, `set`, `shuffle`, `slice`, `sort`, `sortBy`, `sortByAll`,
  	     * `sortByOrder`, `splice`, `spread`, `take`, `takeRight`, `takeRightWhile`,
  	     * `takeWhile`, `tap`, `throttle`, `thru`, `times`, `toArray`, `toPlainObject`,
  	     * `transform`, `union`, `uniq`, `unshift`, `unzip`, `unzipWith`, `values`,
  	     * `valuesIn`, `where`, `without`, `wrap`, `xor`, `zip`, `zipObject`, `zipWith`
  	     *
  	     * The wrapper methods that are **not** chainable by default are:
  	     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clone`, `cloneDeep`,
  	     * `deburr`, `endsWith`, `escape`, `escapeRegExp`, `every`, `find`, `findIndex`,
  	     * `findKey`, `findLast`, `findLastIndex`, `findLastKey`, `findWhere`, `first`,
  	     * `floor`, `get`, `gt`, `gte`, `has`, `identity`, `includes`, `indexOf`,
  	     * `inRange`, `isArguments`, `isArray`, `isBoolean`, `isDate`, `isElement`,
  	     * `isEmpty`, `isEqual`, `isError`, `isFinite` `isFunction`, `isMatch`,
  	     * `isNative`, `isNaN`, `isNull`, `isNumber`, `isObject`, `isPlainObject`,
  	     * `isRegExp`, `isString`, `isUndefined`, `isTypedArray`, `join`, `kebabCase`,
  	     * `last`, `lastIndexOf`, `lt`, `lte`, `max`, `min`, `noConflict`, `noop`,
  	     * `now`, `pad`, `padLeft`, `padRight`, `parseInt`, `pop`, `random`, `reduce`,
  	     * `reduceRight`, `repeat`, `result`, `round`, `runInContext`, `shift`, `size`,
  	     * `snakeCase`, `some`, `sortedIndex`, `sortedLastIndex`, `startCase`,
  	     * `startsWith`, `sum`, `template`, `trim`, `trimLeft`, `trimRight`, `trunc`,
  	     * `unescape`, `uniqueId`, `value`, and `words`
  	     *
  	     * The wrapper method `sample` will return a wrapped value when `n` is provided,
  	     * otherwise an unwrapped value is returned.
  	     *
  	     * @name _
  	     * @constructor
  	     * @category Chain
  	     * @param {*} value The value to wrap in a `lodash` instance.
  	     * @returns {Object} Returns the new `lodash` wrapper instance.
  	     * @example
  	     *
  	     * var wrapped = _([1, 2, 3]);
  	     *
  	     * // returns an unwrapped value
  	     * wrapped.reduce(function(total, n) {
  	     *   return total + n;
  	     * });
  	     * // => 6
  	     *
  	     * // returns a wrapped value
  	     * var squares = wrapped.map(function(n) {
  	     *   return n * n;
  	     * });
  	     *
  	     * _.isArray(squares);
  	     * // => false
  	     *
  	     * _.isArray(squares.value());
  	     * // => true
  	     */
  	    function lodash(value) {
  	      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {
  	        if (value instanceof LodashWrapper) {
  	          return value;
  	        }
  	        if (hasOwnProperty.call(value, '__chain__') && hasOwnProperty.call(value, '__wrapped__')) {
  	          return wrapperClone(value);
  	        }
  	      }
  	      return new LodashWrapper(value);
  	    }
  
  	    /**
  	     * The function whose prototype all chaining wrappers inherit from.
  	     *
  	     * @private
  	     */
  	    function baseLodash() {
  	      // No operation performed.
  	    }
  
  	    /**
  	     * The base constructor for creating `lodash` wrapper objects.
  	     *
  	     * @private
  	     * @param {*} value The value to wrap.
  	     * @param {boolean} [chainAll] Enable chaining for all wrapper methods.
  	     * @param {Array} [actions=[]] Actions to peform to resolve the unwrapped value.
  	     */
  	    function LodashWrapper(value, chainAll, actions) {
  	      this.__wrapped__ = value;
  	      this.__actions__ = actions || [];
  	      this.__chain__ = !!chainAll;
  	    }
  
  	    /**
  	     * An object environment feature flags.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @type Object
  	     */
  	    var support = lodash.support = {};
  
  	    /**
  	     * By default, the template delimiters used by lodash are like those in
  	     * embedded Ruby (ERB). Change the following template settings to use
  	     * alternative delimiters.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @type Object
  	     */
  	    lodash.templateSettings = {
  
  	      /**
  	       * Used to detect `data` property values to be HTML-escaped.
  	       *
  	       * @memberOf _.templateSettings
  	       * @type RegExp
  	       */
  	      'escape': reEscape,
  
  	      /**
  	       * Used to detect code to be evaluated.
  	       *
  	       * @memberOf _.templateSettings
  	       * @type RegExp
  	       */
  	      'evaluate': reEvaluate,
  
  	      /**
  	       * Used to detect `data` property values to inject.
  	       *
  	       * @memberOf _.templateSettings
  	       * @type RegExp
  	       */
  	      'interpolate': reInterpolate,
  
  	      /**
  	       * Used to reference the data object in the template text.
  	       *
  	       * @memberOf _.templateSettings
  	       * @type string
  	       */
  	      'variable': '',
  
  	      /**
  	       * Used to import variables into the compiled template.
  	       *
  	       * @memberOf _.templateSettings
  	       * @type Object
  	       */
  	      'imports': {
  
  	        /**
  	         * A reference to the `lodash` function.
  	         *
  	         * @memberOf _.templateSettings.imports
  	         * @type Function
  	         */
  	        '_': lodash
  	      }
  	    };
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.
  	     *
  	     * @private
  	     * @param {*} value The value to wrap.
  	     */
  	    function LazyWrapper(value) {
  	      this.__wrapped__ = value;
  	      this.__actions__ = [];
  	      this.__dir__ = 1;
  	      this.__filtered__ = false;
  	      this.__iteratees__ = [];
  	      this.__takeCount__ = POSITIVE_INFINITY;
  	      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__ = arrayCopy(this.__actions__);
  	      result.__dir__ = this.__dir__;
  	      result.__filtered__ = this.__filtered__;
  	      result.__iteratees__ = arrayCopy(this.__iteratees__);
  	      result.__takeCount__ = this.__takeCount__;
  	      result.__views__ = arrayCopy(this.__views__);
  	      return result;
  	    }
  
  	    /**
  	     * Reverses the direction of lazy iteration.
  	     *
  	     * @private
  	     * @name reverse
  	     * @memberOf LazyWrapper
  	     * @returns {Object} Returns the new reversed `LazyWrapper` object.
  	     */
  	    function lazyReverse() {
  	      if (this.__filtered__) {
  	        var result = new LazyWrapper(this);
  	        result.__dir__ = -1;
  	        result.__filtered__ = true;
  	      } else {
  	        result = this.clone();
  	        result.__dir__ *= -1;
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Extracts the unwrapped value from its lazy wrapper.
  	     *
  	     * @private
  	     * @name value
  	     * @memberOf LazyWrapper
  	     * @returns {*} Returns the unwrapped value.
  	     */
  	    function lazyValue() {
  	      var array = this.__wrapped__.value(),
  	          dir = this.__dir__,
  	          isArr = isArray(array),
  	          isRight = dir < 0,
  	          arrLength = isArr ? array.length : 0,
  	          view = getView(0, arrLength, this.__views__),
  	          start = view.start,
  	          end = view.end,
  	          length = end - start,
  	          index = isRight ? end : (start - 1),
  	          iteratees = this.__iteratees__,
  	          iterLength = iteratees.length,
  	          resIndex = 0,
  	          takeCount = nativeMin(length, this.__takeCount__);
  
  	      if (!isArr || arrLength < LARGE_ARRAY_SIZE || (arrLength == length && takeCount == length)) {
  	        return baseWrapperValue((isRight && isArr) ? array.reverse() : 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;
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Creates a cache object to store key/value pairs.
  	     *
  	     * @private
  	     * @static
  	     * @name Cache
  	     * @memberOf _.memoize
  	     */
  	    function MapCache() {
  	      this.__data__ = {};
  	    }
  
  	    /**
  	     * Removes `key` and its value from the cache.
  	     *
  	     * @private
  	     * @name delete
  	     * @memberOf _.memoize.Cache
  	     * @param {string} key The key of the value to remove.
  	     * @returns {boolean} Returns `true` if the entry was removed successfully, else `false`.
  	     */
  	    function mapDelete(key) {
  	      return this.has(key) && delete this.__data__[key];
  	    }
  
  	    /**
  	     * Gets the cached value for `key`.
  	     *
  	     * @private
  	     * @name get
  	     * @memberOf _.memoize.Cache
  	     * @param {string} key The key of the value to get.
  	     * @returns {*} Returns the cached value.
  	     */
  	    function mapGet(key) {
  	      return key == '__proto__' ? undefined : this.__data__[key];
  	    }
  
  	    /**
  	     * Checks if a cached value for `key` exists.
  	     *
  	     * @private
  	     * @name has
  	     * @memberOf _.memoize.Cache
  	     * @param {string} key The key of the entry to check.
  	     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
  	     */
  	    function mapHas(key) {
  	      return key != '__proto__' && hasOwnProperty.call(this.__data__, key);
  	    }
  
  	    /**
  	     * Sets `value` to `key` of the cache.
  	     *
  	     * @private
  	     * @name set
  	     * @memberOf _.memoize.Cache
  	     * @param {string} key The key of the value to cache.
  	     * @param {*} value The value to cache.
  	     * @returns {Object} Returns the cache object.
  	     */
  	    function mapSet(key, value) {
  	      if (key != '__proto__') {
  	        this.__data__[key] = value;
  	      }
  	      return this;
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     *
  	     * Creates a cache object to store unique values.
  	     *
  	     * @private
  	     * @param {Array} [values] The values to cache.
  	     */
  	    function SetCache(values) {
  	      var length = values ? values.length : 0;
  
  	      this.data = { 'hash': nativeCreate(null), 'set': new Set };
  	      while (length--) {
  	        this.push(values[length]);
  	      }
  	    }
  
  	    /**
  	     * Checks if `value` is in `cache` mimicking the return signature of
  	     * `_.indexOf` by returning `0` if the value is found, else `-1`.
  	     *
  	     * @private
  	     * @param {Object} cache The cache to search.
  	     * @param {*} value The value to search for.
  	     * @returns {number} Returns `0` if `value` is found, else `-1`.
  	     */
  	    function cacheIndexOf(cache, value) {
  	      var data = cache.data,
  	          result = (typeof value == 'string' || isObject(value)) ? data.set.has(value) : data.hash[value];
  
  	      return result ? 0 : -1;
  	    }
  
  	    /**
  	     * Adds `value` to the cache.
  	     *
  	     * @private
  	     * @name push
  	     * @memberOf SetCache
  	     * @param {*} value The value to cache.
  	     */
  	    function cachePush(value) {
  	      var data = this.data;
  	      if (typeof value == 'string' || isObject(value)) {
  	        data.set.add(value);
  	      } else {
  	        data.hash[value] = true;
  	      }
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Creates a new array joining `array` with `other`.
  	     *
  	     * @private
  	     * @param {Array} array The array to join.
  	     * @param {Array} other The other array to join.
  	     * @returns {Array} Returns the new concatenated array.
  	     */
  	    function arrayConcat(array, other) {
  	      var index = -1,
  	          length = array.length,
  	          othIndex = -1,
  	          othLength = other.length,
  	          result = Array(length + othLength);
  
  	      while (++index < length) {
  	        result[index] = array[index];
  	      }
  	      while (++othIndex < othLength) {
  	        result[index++] = other[othIndex];
  	      }
  	      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 arrayCopy(source, array) {
  	      var index = -1,
  	          length = source.length;
  
  	      array || (array = Array(length));
  	      while (++index < length) {
  	        array[index] = source[index];
  	      }
  	      return array;
  	    }
  
  	    /**
  	     * A specialized version of `_.forEach` for arrays without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array} array The array to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @returns {Array} Returns `array`.
  	     */
  	    function arrayEach(array, iteratee) {
  	      var index = -1,
  	          length = array.length;
  
  	      while (++index < length) {
  	        if (iteratee(array[index], index, array) === false) {
  	          break;
  	        }
  	      }
  	      return array;
  	    }
  
  	    /**
  	     * A specialized version of `_.forEachRight` for arrays without support for
  	     * callback shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array} array The array to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @returns {Array} Returns `array`.
  	     */
  	    function arrayEachRight(array, iteratee) {
  	      var length = array.length;
  
  	      while (length--) {
  	        if (iteratee(array[length], length, array) === false) {
  	          break;
  	        }
  	      }
  	      return array;
  	    }
  
  	    /**
  	     * A specialized version of `_.every` for arrays without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array} array The array to iterate over.
  	     * @param {Function} predicate The function invoked per iteration.
  	     * @returns {boolean} Returns `true` if all elements pass the predicate check,
  	     *  else `false`.
  	     */
  	    function arrayEvery(array, predicate) {
  	      var index = -1,
  	          length = array.length;
  
  	      while (++index < length) {
  	        if (!predicate(array[index], index, array)) {
  	          return false;
  	        }
  	      }
  	      return true;
  	    }
  
  	    /**
  	     * A specialized version of `baseExtremum` for arrays which invokes `iteratee`
  	     * with one argument: (value).
  	     *
  	     * @private
  	     * @param {Array} array The array to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @param {Function} comparator The function used to compare values.
  	     * @param {*} exValue The initial extremum value.
  	     * @returns {*} Returns the extremum value.
  	     */
  	    function arrayExtremum(array, iteratee, comparator, exValue) {
  	      var index = -1,
  	          length = array.length,
  	          computed = exValue,
  	          result = computed;
  
  	      while (++index < length) {
  	        var value = array[index],
  	            current = +iteratee(value);
  
  	        if (comparator(current, computed)) {
  	          computed = current;
  	          result = value;
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * A specialized version of `_.filter` for arrays without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array} array The array to iterate over.
  	     * @param {Function} predicate The function invoked per iteration.
  	     * @returns {Array} Returns the new filtered array.
  	     */
  	    function arrayFilter(array, predicate) {
  	      var index = -1,
  	          length = array.length,
  	          resIndex = -1,
  	          result = [];
  
  	      while (++index < length) {
  	        var value = array[index];
  	        if (predicate(value, index, array)) {
  	          result[++resIndex] = value;
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * A specialized version of `_.map` for arrays without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array} array The array to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @returns {Array} Returns the new mapped array.
  	     */
  	    function arrayMap(array, iteratee) {
  	      var index = -1,
  	          length = array.length,
  	          result = Array(length);
  
  	      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 callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array} array The array to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @param {*} [accumulator] The initial value.
  	     * @param {boolean} [initFromArray] Specify using the first element of `array`
  	     *  as the initial value.
  	     * @returns {*} Returns the accumulated value.
  	     */
  	    function arrayReduce(array, iteratee, accumulator, initFromArray) {
  	      var index = -1,
  	          length = array.length;
  
  	      if (initFromArray && 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
  	     * callback shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array} array The array to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @param {*} [accumulator] The initial value.
  	     * @param {boolean} [initFromArray] Specify using the last element of `array`
  	     *  as the initial value.
  	     * @returns {*} Returns the accumulated value.
  	     */
  	    function arrayReduceRight(array, iteratee, accumulator, initFromArray) {
  	      var length = array.length;
  	      if (initFromArray && length) {
  	        accumulator = array[--length];
  	      }
  	      while (length--) {
  	        accumulator = iteratee(accumulator, array[length], length, array);
  	      }
  	      return accumulator;
  	    }
  
  	    /**
  	     * A specialized version of `_.some` for arrays without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array} array The array to iterate over.
  	     * @param {Function} predicate The function invoked per iteration.
  	     * @returns {boolean} Returns `true` if any element passes the predicate check,
  	     *  else `false`.
  	     */
  	    function arraySome(array, predicate) {
  	      var index = -1,
  	          length = array.length;
  
  	      while (++index < length) {
  	        if (predicate(array[index], index, array)) {
  	          return true;
  	        }
  	      }
  	      return false;
  	    }
  
  	    /**
  	     * A specialized version of `_.sum` for arrays without support for callback
  	     * shorthands and `this` binding..
  	     *
  	     * @private
  	     * @param {Array} array The array to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @returns {number} Returns the sum.
  	     */
  	    function arraySum(array, iteratee) {
  	      var length = array.length,
  	          result = 0;
  
  	      while (length--) {
  	        result += +iteratee(array[length]) || 0;
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Used by `_.defaults` to customize its `_.assign` use.
  	     *
  	     * @private
  	     * @param {*} objectValue The destination object property value.
  	     * @param {*} sourceValue The source object property value.
  	     * @returns {*} Returns the value to assign to the destination object.
  	     */
  	    function assignDefaults(objectValue, sourceValue) {
  	      return objectValue === undefined ? sourceValue : objectValue;
  	    }
  
  	    /**
  	     * Used by `_.template` to customize its `_.assign` use.
  	     *
  	     * **Note:** This function is like `assignDefaults` except that it ignores
  	     * inherited property values when checking if a property is `undefined`.
  	     *
  	     * @private
  	     * @param {*} objectValue The destination object property value.
  	     * @param {*} sourceValue The source object property value.
  	     * @param {string} key The key associated with the object and source values.
  	     * @param {Object} object The destination object.
  	     * @returns {*} Returns the value to assign to the destination object.
  	     */
  	    function assignOwnDefaults(objectValue, sourceValue, key, object) {
  	      return (objectValue === undefined || !hasOwnProperty.call(object, key))
  	        ? sourceValue
  	        : objectValue;
  	    }
  
  	    /**
  	     * A specialized version of `_.assign` for customizing assigned values without
  	     * support for argument juggling, multiple sources, and `this` binding `customizer`
  	     * functions.
  	     *
  	     * @private
  	     * @param {Object} object The destination object.
  	     * @param {Object} source The source object.
  	     * @param {Function} customizer The function to customize assigned values.
  	     * @returns {Object} Returns `object`.
  	     */
  	    function assignWith(object, source, customizer) {
  	      var index = -1,
  	          props = keys(source),
  	          length = props.length;
  
  	      while (++index < length) {
  	        var key = props[index],
  	            value = object[key],
  	            result = customizer(value, source[key], key, object, source);
  
  	        if ((result === result ? (result !== value) : (value === value)) ||
  	            (value === undefined && !(key in object))) {
  	          object[key] = result;
  	        }
  	      }
  	      return object;
  	    }
  
  	    /**
  	     * The base implementation of `_.assign` without support for argument juggling,
  	     * multiple sources, and `customizer` functions.
  	     *
  	     * @private
  	     * @param {Object} object The destination object.
  	     * @param {Object} source The source object.
  	     * @returns {Object} Returns `object`.
  	     */
  	    function baseAssign(object, source) {
  	      return source == null
  	        ? object
  	        : baseCopy(source, keys(source), object);
  	    }
  
  	    /**
  	     * The base implementation of `_.at` without support for string collections
  	     * and individual key arguments.
  	     *
  	     * @private
  	     * @param {Array|Object} collection The collection to iterate over.
  	     * @param {number[]|string[]} props The property names or indexes of elements to pick.
  	     * @returns {Array} Returns the new array of picked elements.
  	     */
  	    function baseAt(collection, props) {
  	      var index = -1,
  	          isNil = collection == null,
  	          isArr = !isNil && isArrayLike(collection),
  	          length = isArr ? collection.length : 0,
  	          propsLength = props.length,
  	          result = Array(propsLength);
  
  	      while(++index < propsLength) {
  	        var key = props[index];
  	        if (isArr) {
  	          result[index] = isIndex(key, length) ? collection[key] : undefined;
  	        } else {
  	          result[index] = isNil ? undefined : collection[key];
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Copies properties of `source` to `object`.
  	     *
  	     * @private
  	     * @param {Object} source The object to copy properties from.
  	     * @param {Array} props The property names to copy.
  	     * @param {Object} [object={}] The object to copy properties to.
  	     * @returns {Object} Returns `object`.
  	     */
  	    function baseCopy(source, props, object) {
  	      object || (object = {});
  
  	      var index = -1,
  	          length = props.length;
  
  	      while (++index < length) {
  	        var key = props[index];
  	        object[key] = source[key];
  	      }
  	      return object;
  	    }
  
  	    /**
  	     * The base implementation of `_.callback` which supports specifying the
  	     * number of arguments to provide to `func`.
  	     *
  	     * @private
  	     * @param {*} [func=_.identity] The value to convert to a callback.
  	     * @param {*} [thisArg] The `this` binding of `func`.
  	     * @param {number} [argCount] The number of arguments to provide to `func`.
  	     * @returns {Function} Returns the callback.
  	     */
  	    function baseCallback(func, thisArg, argCount) {
  	      var type = typeof func;
  	      if (type == 'function') {
  	        return thisArg === undefined
  	          ? func
  	          : bindCallback(func, thisArg, argCount);
  	      }
  	      if (func == null) {
  	        return identity;
  	      }
  	      if (type == 'object') {
  	        return baseMatches(func);
  	      }
  	      return thisArg === undefined
  	        ? property(func)
  	        : baseMatchesProperty(func, thisArg);
  	    }
  
  	    /**
  	     * The base implementation of `_.clone` without support for argument juggling
  	     * and `this` binding `customizer` functions.
  	     *
  	     * @private
  	     * @param {*} value The value to clone.
  	     * @param {boolean} [isDeep] Specify a deep clone.
  	     * @param {Function} [customizer] The function to customize cloning values.
  	     * @param {string} [key] The key of `value`.
  	     * @param {Object} [object] The object `value` belongs to.
  	     * @param {Array} [stackA=[]] Tracks traversed source objects.
  	     * @param {Array} [stackB=[]] Associates clones with source counterparts.
  	     * @returns {*} Returns the cloned value.
  	     */
  	    function baseClone(value, isDeep, customizer, key, object, stackA, stackB) {
  	      var result;
  	      if (customizer) {
  	        result = object ? customizer(value, key, object) : customizer(value);
  	      }
  	      if (result !== undefined) {
  	        return result;
  	      }
  	      if (!isObject(value)) {
  	        return value;
  	      }
  	      var isArr = isArray(value);
  	      if (isArr) {
  	        result = initCloneArray(value);
  	        if (!isDeep) {
  	          return arrayCopy(value, result);
  	        }
  	      } else {
  	        var tag = objToString.call(value),
  	            isFunc = tag == funcTag;
  
  	        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {
  	          result = initCloneObject(isFunc ? {} : value);
  	          if (!isDeep) {
  	            return baseAssign(result, value);
  	          }
  	        } else {
  	          return cloneableTags[tag]
  	            ? initCloneByTag(value, tag, isDeep)
  	            : (object ? value : {});
  	        }
  	      }
  	      // Check for circular references and return its corresponding clone.
  	      stackA || (stackA = []);
  	      stackB || (stackB = []);
  
  	      var length = stackA.length;
  	      while (length--) {
  	        if (stackA[length] == value) {
  	          return stackB[length];
  	        }
  	      }
  	      // Add the source value to the stack of traversed objects and associate it with its clone.
  	      stackA.push(value);
  	      stackB.push(result);
  
  	      // Recursively populate clone (susceptible to call stack limits).
  	      (isArr ? arrayEach : baseForOwn)(value, function(subValue, key) {
  	        result[key] = baseClone(subValue, isDeep, customizer, key, value, stackA, stackB);
  	      });
  	      return result;
  	    }
  
  	    /**
  	     * The base implementation of `_.create` without support for assigning
  	     * properties to the created object.
  	     *
  	     * @private
  	     * @param {Object} prototype The object to inherit from.
  	     * @returns {Object} Returns the new object.
  	     */
  	    var baseCreate = (function() {
  	      function object() {}
  	      return function(prototype) {
  	        if (isObject(prototype)) {
  	          object.prototype = prototype;
  	          var result = new object;
  	          object.prototype = undefined;
  	        }
  	        return result || {};
  	      };
  	    }());
  
  	    /**
  	     * The base implementation of `_.delay` and `_.defer` which accepts an index
  	     * of where to slice the arguments to provide to `func`.
  	     *
  	     * @private
  	     * @param {Function} func The function to delay.
  	     * @param {number} wait The number of milliseconds to delay invocation.
  	     * @param {Object} args The arguments provide to `func`.
  	     * @returns {number} Returns the timer id.
  	     */
  	    function baseDelay(func, wait, args) {
  	      if (typeof func != 'function') {
  	        throw new TypeError(FUNC_ERROR_TEXT);
  	      }
  	      return setTimeout(function() { func.apply(undefined, args); }, wait);
  	    }
  
  	    /**
  	     * The base implementation of `_.difference` which accepts a single array
  	     * of values to exclude.
  	     *
  	     * @private
  	     * @param {Array} array The array to inspect.
  	     * @param {Array} values The values to exclude.
  	     * @returns {Array} Returns the new array of filtered values.
  	     */
  	    function baseDifference(array, values) {
  	      var length = array ? array.length : 0,
  	          result = [];
  
  	      if (!length) {
  	        return result;
  	      }
  	      var index = -1,
  	          indexOf = getIndexOf(),
  	          isCommon = indexOf == baseIndexOf,
  	          cache = (isCommon && values.length >= LARGE_ARRAY_SIZE) ? createCache(values) : null,
  	          valuesLength = values.length;
  
  	      if (cache) {
  	        indexOf = cacheIndexOf;
  	        isCommon = false;
  	        values = cache;
  	      }
  	      outer:
  	      while (++index < length) {
  	        var value = array[index];
  
  	        if (isCommon && value === value) {
  	          var valuesIndex = valuesLength;
  	          while (valuesIndex--) {
  	            if (values[valuesIndex] === value) {
  	              continue outer;
  	            }
  	          }
  	          result.push(value);
  	        }
  	        else if (indexOf(values, value, 0) < 0) {
  	          result.push(value);
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * The base implementation of `_.forEach` without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @returns {Array|Object|string} Returns `collection`.
  	     */
  	    var baseEach = createBaseEach(baseForOwn);
  
  	    /**
  	     * The base implementation of `_.forEachRight` without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @returns {Array|Object|string} Returns `collection`.
  	     */
  	    var baseEachRight = createBaseEach(baseForOwnRight, true);
  
  	    /**
  	     * The base implementation of `_.every` without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} predicate The function invoked per iteration.
  	     * @returns {boolean} Returns `true` if all elements pass the predicate check,
  	     *  else `false`
  	     */
  	    function baseEvery(collection, predicate) {
  	      var result = true;
  	      baseEach(collection, function(value, index, collection) {
  	        result = !!predicate(value, index, collection);
  	        return result;
  	      });
  	      return result;
  	    }
  
  	    /**
  	     * Gets the extremum value of `collection` invoking `iteratee` for each value
  	     * in `collection` to generate the criterion by which the value is ranked.
  	     * The `iteratee` is invoked with three arguments: (value, index|key, collection).
  	     *
  	     * @private
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @param {Function} comparator The function used to compare values.
  	     * @param {*} exValue The initial extremum value.
  	     * @returns {*} Returns the extremum value.
  	     */
  	    function baseExtremum(collection, iteratee, comparator, exValue) {
  	      var computed = exValue,
  	          result = computed;
  
  	      baseEach(collection, function(value, index, collection) {
  	        var current = +iteratee(value, index, collection);
  	        if (comparator(current, computed) || (current === exValue && current === result)) {
  	          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 = start == null ? 0 : (+start || 0);
  	      if (start < 0) {
  	        start = -start > length ? 0 : (length + start);
  	      }
  	      end = (end === undefined || end > length) ? length : (+end || 0);
  	      if (end < 0) {
  	        end += length;
  	      }
  	      length = start > end ? 0 : (end >>> 0);
  	      start >>>= 0;
  
  	      while (start < length) {
  	        array[start++] = value;
  	      }
  	      return array;
  	    }
  
  	    /**
  	     * The base implementation of `_.filter` without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} predicate The function invoked per iteration.
  	     * @returns {Array} Returns the new filtered array.
  	     */
  	    function baseFilter(collection, predicate) {
  	      var result = [];
  	      baseEach(collection, function(value, index, collection) {
  	        if (predicate(value, index, collection)) {
  	          result.push(value);
  	        }
  	      });
  	      return result;
  	    }
  
  	    /**
  	     * The base implementation of `_.find`, `_.findLast`, `_.findKey`, and `_.findLastKey`,
  	     * without support for callback shorthands and `this` binding, which iterates
  	     * over `collection` using the provided `eachFunc`.
  	     *
  	     * @private
  	     * @param {Array|Object|string} collection The collection to search.
  	     * @param {Function} predicate The function invoked per iteration.
  	     * @param {Function} eachFunc The function to iterate over `collection`.
  	     * @param {boolean} [retKey] Specify returning the key of the found element
  	     *  instead of the element itself.
  	     * @returns {*} Returns the found element or its key, else `undefined`.
  	     */
  	    function baseFind(collection, predicate, eachFunc, retKey) {
  	      var result;
  	      eachFunc(collection, function(value, key, collection) {
  	        if (predicate(value, key, collection)) {
  	          result = retKey ? key : value;
  	          return false;
  	        }
  	      });
  	      return result;
  	    }
  
  	    /**
  	     * The base implementation of `_.flatten` with added support for restricting
  	     * flattening and specifying the start index.
  	     *
  	     * @private
  	     * @param {Array} array The array to flatten.
  	     * @param {boolean} [isDeep] Specify a deep flatten.
  	     * @param {boolean} [isStrict] Restrict flattening to arrays-like objects.
  	     * @param {Array} [result=[]] The initial result value.
  	     * @returns {Array} Returns the new flattened array.
  	     */
  	    function baseFlatten(array, isDeep, isStrict, result) {
  	      result || (result = []);
  
  	      var index = -1,
  	          length = array.length;
  
  	      while (++index < length) {
  	        var value = array[index];
  	        if (isObjectLike(value) && isArrayLike(value) &&
  	            (isStrict || isArray(value) || isArguments(value))) {
  	          if (isDeep) {
  	            // Recursively flatten arrays (susceptible to call stack limits).
  	            baseFlatten(value, isDeep, isStrict, result);
  	          } else {
  	            arrayPush(result, value);
  	          }
  	        } else if (!isStrict) {
  	          result[result.length] = value;
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * The base implementation of `baseForIn` and `baseForOwn` which iterates
  	     * over `object` properties returned by `keysFunc` invoking `iteratee` for
  	     * each property. Iteratee functions may exit iteration early by explicitly
  	     * returning `false`.
  	     *
  	     * @private
  	     * @param {Object} object The object to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @param {Function} keysFunc The function to get the keys of `object`.
  	     * @returns {Object} Returns `object`.
  	     */
  	    var baseFor = createBaseFor();
  
  	    /**
  	     * This function is like `baseFor` except that it iterates over properties
  	     * in the opposite order.
  	     *
  	     * @private
  	     * @param {Object} object The object to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @param {Function} keysFunc The function to get the keys of `object`.
  	     * @returns {Object} Returns `object`.
  	     */
  	    var baseForRight = createBaseFor(true);
  
  	    /**
  	     * The base implementation of `_.forIn` without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Object} object The object to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @returns {Object} Returns `object`.
  	     */
  	    function baseForIn(object, iteratee) {
  	      return baseFor(object, iteratee, keysIn);
  	    }
  
  	    /**
  	     * The base implementation of `_.forOwn` without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Object} object The object to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @returns {Object} Returns `object`.
  	     */
  	    function baseForOwn(object, iteratee) {
  	      return baseFor(object, iteratee, keys);
  	    }
  
  	    /**
  	     * The base implementation of `_.forOwnRight` without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Object} object The object to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @returns {Object} Returns `object`.
  	     */
  	    function baseForOwnRight(object, iteratee) {
  	      return baseForRight(object, iteratee, keys);
  	    }
  
  	    /**
  	     * The base implementation of `_.functions` which creates an array of
  	     * `object` function property names filtered from those provided.
  	     *
  	     * @private
  	     * @param {Object} object The object to inspect.
  	     * @param {Array} props The property names to filter.
  	     * @returns {Array} Returns the new array of filtered property names.
  	     */
  	    function baseFunctions(object, props) {
  	      var index = -1,
  	          length = props.length,
  	          resIndex = -1,
  	          result = [];
  
  	      while (++index < length) {
  	        var key = props[index];
  	        if (isFunction(object[key])) {
  	          result[++resIndex] = key;
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * The base implementation of `get` without support for string paths
  	     * and default values.
  	     *
  	     * @private
  	     * @param {Object} object The object to query.
  	     * @param {Array} path The path of the property to get.
  	     * @param {string} [pathKey] The key representation of path.
  	     * @returns {*} Returns the resolved value.
  	     */
  	    function baseGet(object, path, pathKey) {
  	      if (object == null) {
  	        return;
  	      }
  	      if (pathKey !== undefined && pathKey in toObject(object)) {
  	        path = [pathKey];
  	      }
  	      var index = 0,
  	          length = path.length;
  
  	      while (object != null && index < length) {
  	        object = object[path[index++]];
  	      }
  	      return (index && index == length) ? object : undefined;
  	    }
  
  	    /**
  	     * The base implementation of `_.isEqual` without support for `this` binding
  	     * `customizer` functions.
  	     *
  	     * @private
  	     * @param {*} value The value to compare.
  	     * @param {*} other The other value to compare.
  	     * @param {Function} [customizer] The function to customize comparing values.
  	     * @param {boolean} [isLoose] Specify performing partial comparisons.
  	     * @param {Array} [stackA] Tracks traversed `value` objects.
  	     * @param {Array} [stackB] Tracks traversed `other` objects.
  	     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
  	     */
  	    function baseIsEqual(value, other, customizer, isLoose, stackA, stackB) {
  	      if (value === other) {
  	        return true;
  	      }
  	      if (value == null || other == null || (!isObject(value) && !isObjectLike(other))) {
  	        return value !== value && other !== other;
  	      }
  	      return baseIsEqualDeep(value, other, baseIsEqual, customizer, isLoose, stackA, stackB);
  	    }
  
  	    /**
  	     * A specialized version of `baseIsEqual` for arrays and objects which performs
  	     * deep comparisons and tracks traversed objects enabling objects with circular
  	     * references to be compared.
  	     *
  	     * @private
  	     * @param {Object} object The object to compare.
  	     * @param {Object} other The other object to compare.
  	     * @param {Function} equalFunc The function to determine equivalents of values.
  	     * @param {Function} [customizer] The function to customize comparing objects.
  	     * @param {boolean} [isLoose] Specify performing partial comparisons.
  	     * @param {Array} [stackA=[]] Tracks traversed `value` objects.
  	     * @param {Array} [stackB=[]] Tracks traversed `other` objects.
  	     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
  	     */
  	    function baseIsEqualDeep(object, other, equalFunc, customizer, isLoose, stackA, stackB) {
  	      var objIsArr = isArray(object),
  	          othIsArr = isArray(other),
  	          objTag = arrayTag,
  	          othTag = arrayTag;
  
  	      if (!objIsArr) {
  	        objTag = objToString.call(object);
  	        if (objTag == argsTag) {
  	          objTag = objectTag;
  	        } else if (objTag != objectTag) {
  	          objIsArr = isTypedArray(object);
  	        }
  	      }
  	      if (!othIsArr) {
  	        othTag = objToString.call(other);
  	        if (othTag == argsTag) {
  	          othTag = objectTag;
  	        } else if (othTag != objectTag) {
  	          othIsArr = isTypedArray(other);
  	        }
  	      }
  	      var objIsObj = objTag == objectTag,
  	          othIsObj = othTag == objectTag,
  	          isSameTag = objTag == othTag;
  
  	      if (isSameTag && !(objIsArr || objIsObj)) {
  	        return equalByTag(object, other, objTag);
  	      }
  	      if (!isLoose) {
  	        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
  	            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
  
  	        if (objIsWrapped || othIsWrapped) {
  	          return equalFunc(objIsWrapped ? object.value() : object, othIsWrapped ? other.value() : other, customizer, isLoose, stackA, stackB);
  	        }
  	      }
  	      if (!isSameTag) {
  	        return false;
  	      }
  	      // Assume cyclic values are equal.
  	      // For more information on detecting circular references see https://es5.github.io/#JO.
  	      stackA || (stackA = []);
  	      stackB || (stackB = []);
  
  	      var length = stackA.length;
  	      while (length--) {
  	        if (stackA[length] == object) {
  	          return stackB[length] == other;
  	        }
  	      }
  	      // Add `object` and `other` to the stack of traversed objects.
  	      stackA.push(object);
  	      stackB.push(other);
  
  	      var result = (objIsArr ? equalArrays : equalObjects)(object, other, equalFunc, customizer, isLoose, stackA, stackB);
  
  	      stackA.pop();
  	      stackB.pop();
  
  	      return result;
  	    }
  
  	    /**
  	     * The base implementation of `_.isMatch` without support for callback
  	     * shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Object} object The object to inspect.
  	     * @param {Array} matchData The propery names, values, and compare flags to match.
  	     * @param {Function} [customizer] The function to customize comparing objects.
  	     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
  	     */
  	    function baseIsMatch(object, matchData, customizer) {
  	      var index = matchData.length,
  	          length = index,
  	          noCustomizer = !customizer;
  
  	      if (object == null) {
  	        return !length;
  	      }
  	      object = toObject(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 result = customizer ? customizer(objValue, srcValue, key) : undefined;
  	          if (!(result === undefined ? baseIsEqual(srcValue, objValue, customizer, true) : result)) {
  	            return false;
  	          }
  	        }
  	      }
  	      return true;
  	    }
  
  	    /**
  	     * The base implementation of `_.map` without support for callback shorthands
  	     * and `this` binding.
  	     *
  	     * @private
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @returns {Array} Returns the new mapped array.
  	     */
  	    function baseMap(collection, iteratee) {
  	      var index = -1,
  	          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 does not clone `source`.
  	     *
  	     * @private
  	     * @param {Object} source The object of property values to match.
  	     * @returns {Function} Returns the new function.
  	     */
  	    function baseMatches(source) {
  	      var matchData = getMatchData(source);
  	      if (matchData.length == 1 && matchData[0][2]) {
  	        var key = matchData[0][0],
  	            value = matchData[0][1];
  
  	        return function(object) {
  	          if (object == null) {
  	            return false;
  	          }
  	          return object[key] === value && (value !== undefined || (key in toObject(object)));
  	        };
  	      }
  	      return function(object) {
  	        return baseIsMatch(object, matchData);
  	      };
  	    }
  
  	    /**
  	     * The base implementation of `_.matchesProperty` which does not clone `srcValue`.
  	     *
  	     * @private
  	     * @param {string} path The path of the property to get.
  	     * @param {*} srcValue The value to compare.
  	     * @returns {Function} Returns the new function.
  	     */
  	    function baseMatchesProperty(path, srcValue) {
  	      var isArr = isArray(path),
  	          isCommon = isKey(path) && isStrictComparable(srcValue),
  	          pathKey = (path + '');
  
  	      path = toPath(path);
  	      return function(object) {
  	        if (object == null) {
  	          return false;
  	        }
  	        var key = pathKey;
  	        object = toObject(object);
  	        if ((isArr || !isCommon) && !(key in object)) {
  	          object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
  	          if (object == null) {
  	            return false;
  	          }
  	          key = last(path);
  	          object = toObject(object);
  	        }
  	        return object[key] === srcValue
  	          ? (srcValue !== undefined || (key in object))
  	          : baseIsEqual(srcValue, object[key], undefined, true);
  	      };
  	    }
  
  	    /**
  	     * The base implementation of `_.merge` without support for argument juggling,
  	     * multiple sources, and `this` binding `customizer` functions.
  	     *
  	     * @private
  	     * @param {Object} object The destination object.
  	     * @param {Object} source The source object.
  	     * @param {Function} [customizer] The function to customize merged values.
  	     * @param {Array} [stackA=[]] Tracks traversed source objects.
  	     * @param {Array} [stackB=[]] Associates values with source counterparts.
  	     * @returns {Object} Returns `object`.
  	     */
  	    function baseMerge(object, source, customizer, stackA, stackB) {
  	      if (!isObject(object)) {
  	        return object;
  	      }
  	      var isSrcArr = isArrayLike(source) && (isArray(source) || isTypedArray(source)),
  	          props = isSrcArr ? undefined : keys(source);
  
  	      arrayEach(props || source, function(srcValue, key) {
  	        if (props) {
  	          key = srcValue;
  	          srcValue = source[key];
  	        }
  	        if (isObjectLike(srcValue)) {
  	          stackA || (stackA = []);
  	          stackB || (stackB = []);
  	          baseMergeDeep(object, source, key, baseMerge, customizer, stackA, stackB);
  	        }
  	        else {
  	          var value = object[key],
  	              result = customizer ? customizer(value, srcValue, key, object, source) : undefined,
  	              isCommon = result === undefined;
  
  	          if (isCommon) {
  	            result = srcValue;
  	          }
  	          if ((result !== undefined || (isSrcArr && !(key in object))) &&
  	              (isCommon || (result === result ? (result !== value) : (value === value)))) {
  	            object[key] = result;
  	          }
  	        }
  	      });
  	      return object;
  	    }
  
  	    /**
  	     * A specialized version of `baseMerge` for arrays and objects which performs
  	     * deep merges and tracks traversed objects enabling objects with circular
  	     * references to be merged.
  	     *
  	     * @private
  	     * @param {Object} object The destination object.
  	     * @param {Object} source The source object.
  	     * @param {string} key The key of the value to merge.
  	     * @param {Function} mergeFunc The function to merge values.
  	     * @param {Function} [customizer] The function to customize merged values.
  	     * @param {Array} [stackA=[]] Tracks traversed source objects.
  	     * @param {Array} [stackB=[]] Associates values with source counterparts.
  	     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
  	     */
  	    function baseMergeDeep(object, source, key, mergeFunc, customizer, stackA, stackB) {
  	      var length = stackA.length,
  	          srcValue = source[key];
  
  	      while (length--) {
  	        if (stackA[length] == srcValue) {
  	          object[key] = stackB[length];
  	          return;
  	        }
  	      }
  	      var value = object[key],
  	          result = customizer ? customizer(value, srcValue, key, object, source) : undefined,
  	          isCommon = result === undefined;
  
  	      if (isCommon) {
  	        result = srcValue;
  	        if (isArrayLike(srcValue) && (isArray(srcValue) || isTypedArray(srcValue))) {
  	          result = isArray(value)
  	            ? value
  	            : (isArrayLike(value) ? arrayCopy(value) : []);
  	        }
  	        else if (isPlainObject(srcValue) || isArguments(srcValue)) {
  	          result = isArguments(value)
  	            ? toPlainObject(value)
  	            : (isPlainObject(value) ? value : {});
  	        }
  	        else {
  	          isCommon = false;
  	        }
  	      }
  	      // Add the source value to the stack of traversed objects and associate
  	      // it with its merged value.
  	      stackA.push(srcValue);
  	      stackB.push(result);
  
  	      if (isCommon) {
  	        // Recursively merge objects and arrays (susceptible to call stack limits).
  	        object[key] = mergeFunc(result, srcValue, customizer, stackA, stackB);
  	      } else if (result === result ? (result !== value) : (value === value)) {
  	        object[key] = result;
  	      }
  	    }
  
  	    /**
  	     * The base implementation of `_.property` without support for deep paths.
  	     *
  	     * @private
  	     * @param {string} key The key of the property to get.
  	     * @returns {Function} Returns the new function.
  	     */
  	    function baseProperty(key) {
  	      return function(object) {
  	        return object == null ? undefined : object[key];
  	      };
  	    }
  
  	    /**
  	     * A specialized version of `baseProperty` which supports deep paths.
  	     *
  	     * @private
  	     * @param {Array|string} path The path of the property to get.
  	     * @returns {Function} Returns the new function.
  	     */
  	    function basePropertyDeep(path) {
  	      var pathKey = (path + '');
  	      path = toPath(path);
  	      return function(object) {
  	        return baseGet(object, path, pathKey);
  	      };
  	    }
  
  	    /**
  	     * The base implementation of `_.pullAt` without support for individual
  	     * index arguments and capturing the removed elements.
  	     *
  	     * @private
  	     * @param {Array} array The array to modify.
  	     * @param {number[]} indexes The indexes of elements to remove.
  	     * @returns {Array} Returns `array`.
  	     */
  	    function basePullAt(array, indexes) {
  	      var length = array ? indexes.length : 0;
  	      while (length--) {
  	        var index = indexes[length];
  	        if (index != previous && isIndex(index)) {
  	          var previous = index;
  	          splice.call(array, index, 1);
  	        }
  	      }
  	      return array;
  	    }
  
  	    /**
  	     * The base implementation of `_.random` without support for argument juggling
  	     * and returning floating-point numbers.
  	     *
  	     * @private
  	     * @param {number} min The minimum possible value.
  	     * @param {number} max The maximum possible value.
  	     * @returns {number} Returns the random number.
  	     */
  	    function baseRandom(min, max) {
  	      return min + nativeFloor(nativeRandom() * (max - min + 1));
  	    }
  
  	    /**
  	     * The base implementation of `_.reduce` and `_.reduceRight` without support
  	     * for callback shorthands and `this` binding, which iterates over `collection`
  	     * using the provided `eachFunc`.
  	     *
  	     * @private
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @param {*} accumulator The initial value.
  	     * @param {boolean} initFromCollection Specify using the first or last element
  	     *  of `collection` as the initial value.
  	     * @param {Function} eachFunc The function to iterate over `collection`.
  	     * @returns {*} Returns the accumulated value.
  	     */
  	    function baseReduce(collection, iteratee, accumulator, initFromCollection, eachFunc) {
  	      eachFunc(collection, function(value, index, collection) {
  	        accumulator = initFromCollection
  	          ? (initFromCollection = false, value)
  	          : iteratee(accumulator, value, index, collection);
  	      });
  	      return accumulator;
  	    }
  
  	    /**
  	     * The base implementation of `setData` without support for hot loop detection.
  	     *
  	     * @private
  	     * @param {Function} func The function to associate metadata with.
  	     * @param {*} data The metadata.
  	     * @returns {Function} Returns `func`.
  	     */
  	    var baseSetData = !metaMap ? identity : function(func, data) {
  	      metaMap.set(func, data);
  	      return func;
  	    };
  
  	    /**
  	     * 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;
  
  	      start = start == null ? 0 : (+start || 0);
  	      if (start < 0) {
  	        start = -start > length ? 0 : (length + start);
  	      }
  	      end = (end === undefined || end > length) ? length : (+end || 0);
  	      if (end < 0) {
  	        end += length;
  	      }
  	      length = start > end ? 0 : ((end - start) >>> 0);
  	      start >>>= 0;
  
  	      var result = Array(length);
  	      while (++index < length) {
  	        result[index] = array[index + start];
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * The base implementation of `_.some` without support for callback shorthands
  	     * and `this` binding.
  	     *
  	     * @private
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} predicate The function invoked per iteration.
  	     * @returns {boolean} Returns `true` if any element passes the predicate check,
  	     *  else `false`.
  	     */
  	    function baseSome(collection, predicate) {
  	      var result;
  
  	      baseEach(collection, function(value, index, collection) {
  	        result = predicate(value, index, collection);
  	        return !result;
  	      });
  	      return !!result;
  	    }
  
  	    /**
  	     * 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 `_.sortByOrder` without param guards.
  	     *
  	     * @private
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
  	     * @param {boolean[]} orders The sort orders of `iteratees`.
  	     * @returns {Array} Returns the new sorted array.
  	     */
  	    function baseSortByOrder(collection, iteratees, orders) {
  	      var callback = getCallback(),
  	          index = -1;
  
  	      iteratees = arrayMap(iteratees, function(iteratee) { return callback(iteratee); });
  
  	      var result = baseMap(collection, function(value) {
  	        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 `_.sum` without support for callback shorthands
  	     * and `this` binding.
  	     *
  	     * @private
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @returns {number} Returns the sum.
  	     */
  	    function baseSum(collection, iteratee) {
  	      var result = 0;
  	      baseEach(collection, function(value, index, collection) {
  	        result += +iteratee(value, index, collection) || 0;
  	      });
  	      return result;
  	    }
  
  	    /**
  	     * The base implementation of `_.uniq` without support for callback shorthands
  	     * and `this` binding.
  	     *
  	     * @private
  	     * @param {Array} array The array to inspect.
  	     * @param {Function} [iteratee] The function invoked per iteration.
  	     * @returns {Array} Returns the new duplicate-value-free array.
  	     */
  	    function baseUniq(array, iteratee) {
  	      var index = -1,
  	          indexOf = getIndexOf(),
  	          length = array.length,
  	          isCommon = indexOf == baseIndexOf,
  	          isLarge = isCommon && length >= LARGE_ARRAY_SIZE,
  	          seen = isLarge ? createCache() : null,
  	          result = [];
  
  	      if (seen) {
  	        indexOf = cacheIndexOf;
  	        isCommon = false;
  	      } else {
  	        isLarge = false;
  	        seen = iteratee ? [] : result;
  	      }
  	      outer:
  	      while (++index < length) {
  	        var value = array[index],
  	            computed = iteratee ? iteratee(value, index, array) : value;
  
  	        if (isCommon && value === value) {
  	          var seenIndex = seen.length;
  	          while (seenIndex--) {
  	            if (seen[seenIndex] === computed) {
  	              continue outer;
  	            }
  	          }
  	          if (iteratee) {
  	            seen.push(computed);
  	          }
  	          result.push(value);
  	        }
  	        else if (indexOf(seen, computed, 0) < 0) {
  	          if (iteratee || isLarge) {
  	            seen.push(computed);
  	          }
  	          result.push(value);
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * The base implementation of `_.values` and `_.valuesIn` which creates an
  	     * array of `object` property values corresponding to the property names
  	     * of `props`.
  	     *
  	     * @private
  	     * @param {Object} object The object to query.
  	     * @param {Array} props The property names to get values for.
  	     * @returns {Object} Returns the array of property values.
  	     */
  	    function baseValues(object, props) {
  	      var index = -1,
  	          length = props.length,
  	          result = Array(length);
  
  	      while (++index < length) {
  	        result[index] = object[props[index]];
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * The base implementation of `_.dropRightWhile`, `_.dropWhile`, `_.takeRightWhile`,
  	     * and `_.takeWhile` without support for callback shorthands and `this` binding.
  	     *
  	     * @private
  	     * @param {Array} array The array to query.
  	     * @param {Function} predicate The function invoked per iteration.
  	     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.
  	     * @param {boolean} [fromRight] Specify iterating from right to left.
  	     * @returns {Array} Returns the slice of `array`.
  	     */
  	    function baseWhile(array, predicate, isDrop, fromRight) {
  	      var length = array.length,
  	          index = fromRight ? length : -1;
  
  	      while ((fromRight ? index-- : ++index < length) && predicate(array[index], index, array)) {}
  	      return isDrop
  	        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))
  	        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));
  	    }
  
  	    /**
  	     * The base implementation of `wrapperValue` which returns the result of
  	     * performing a sequence of actions on the unwrapped `value`, where each
  	     * successive action is supplied the return value of the previous.
  	     *
  	     * @private
  	     * @param {*} value The unwrapped value.
  	     * @param {Array} actions Actions to peform to resolve the unwrapped value.
  	     * @returns {*} Returns the resolved value.
  	     */
  	    function baseWrapperValue(value, actions) {
  	      var result = value;
  	      if (result instanceof LazyWrapper) {
  	        result = result.value();
  	      }
  	      var index = -1,
  	          length = actions.length;
  
  	      while (++index < length) {
  	        var action = actions[index];
  	        result = action.func.apply(action.thisArg, arrayPush([result], action.args));
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Performs a binary search of `array` to determine the index at which `value`
  	     * should be inserted into `array` in order to maintain its sort order.
  	     *
  	     * @private
  	     * @param {Array} array The sorted array to inspect.
  	     * @param {*} value The value to evaluate.
  	     * @param {boolean} [retHighest] Specify returning the highest qualified index.
  	     * @returns {number} Returns the index at which `value` should be inserted
  	     *  into `array`.
  	     */
  	    function binaryIndex(array, value, retHighest) {
  	      var low = 0,
  	          high = array ? array.length : low;
  
  	      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {
  	        while (low < high) {
  	          var mid = (low + high) >>> 1,
  	              computed = array[mid];
  
  	          if ((retHighest ? (computed <= value) : (computed < value)) && computed !== null) {
  	            low = mid + 1;
  	          } else {
  	            high = mid;
  	          }
  	        }
  	        return high;
  	      }
  	      return binaryIndexBy(array, value, identity, retHighest);
  	    }
  
  	    /**
  	     * This function is like `binaryIndex` except that it invokes `iteratee` for
  	     * `value` and each element of `array` to compute their sort ranking. The
  	     * iteratee is invoked with one argument; (value).
  	     *
  	     * @private
  	     * @param {Array} array The sorted array to inspect.
  	     * @param {*} value The value to evaluate.
  	     * @param {Function} iteratee The function invoked per iteration.
  	     * @param {boolean} [retHighest] Specify returning the highest qualified index.
  	     * @returns {number} Returns the index at which `value` should be inserted
  	     *  into `array`.
  	     */
  	    function binaryIndexBy(array, value, iteratee, retHighest) {
  	      value = iteratee(value);
  
  	      var low = 0,
  	          high = array ? array.length : 0,
  	          valIsNaN = value !== value,
  	          valIsNull = value === null,
  	          valIsUndef = value === undefined;
  
  	      while (low < high) {
  	        var mid = nativeFloor((low + high) / 2),
  	            computed = iteratee(array[mid]),
  	            isDef = computed !== undefined,
  	            isReflexive = computed === computed;
  
  	        if (valIsNaN) {
  	          var setLow = isReflexive || retHighest;
  	        } else if (valIsNull) {
  	          setLow = isReflexive && isDef && (retHighest || computed != null);
  	        } else if (valIsUndef) {
  	          setLow = isReflexive && (retHighest || isDef);
  	        } else if (computed == null) {
  	          setLow = false;
  	        } else {
  	          setLow = retHighest ? (computed <= value) : (computed < value);
  	        }
  	        if (setLow) {
  	          low = mid + 1;
  	        } else {
  	          high = mid;
  	        }
  	      }
  	      return nativeMin(high, MAX_ARRAY_INDEX);
  	    }
  
  	    /**
  	     * A specialized version of `baseCallback` which only supports `this` binding
  	     * and specifying the number of arguments to provide to `func`.
  	     *
  	     * @private
  	     * @param {Function} func The function to bind.
  	     * @param {*} thisArg The `this` binding of `func`.
  	     * @param {number} [argCount] The number of arguments to provide to `func`.
  	     * @returns {Function} Returns the callback.
  	     */
  	    function bindCallback(func, thisArg, argCount) {
  	      if (typeof func != 'function') {
  	        return identity;
  	      }
  	      if (thisArg === undefined) {
  	        return func;
  	      }
  	      switch (argCount) {
  	        case 1: return function(value) {
  	          return func.call(thisArg, value);
  	        };
  	        case 3: return function(value, index, collection) {
  	          return func.call(thisArg, value, index, collection);
  	        };
  	        case 4: return function(accumulator, value, index, collection) {
  	          return func.call(thisArg, accumulator, value, index, collection);
  	        };
  	        case 5: return function(value, other, key, object, source) {
  	          return func.call(thisArg, value, other, key, object, source);
  	        };
  	      }
  	      return function() {
  	        return func.apply(thisArg, arguments);
  	      };
  	    }
  
  	    /**
  	     * Creates a clone of the given array buffer.
  	     *
  	     * @private
  	     * @param {ArrayBuffer} buffer The array buffer to clone.
  	     * @returns {ArrayBuffer} Returns the cloned array buffer.
  	     */
  	    function bufferClone(buffer) {
  	      var result = new ArrayBuffer(buffer.byteLength),
  	          view = new Uint8Array(result);
  
  	      view.set(new Uint8Array(buffer));
  	      return result;
  	    }
  
  	    /**
  	     * Creates an array that is the composition of partially applied arguments,
  	     * placeholders, and provided arguments into a single array of arguments.
  	     *
  	     * @private
  	     * @param {Array|Object} args The provided arguments.
  	     * @param {Array} partials The arguments to prepend to those provided.
  	     * @param {Array} holders The `partials` placeholder indexes.
  	     * @returns {Array} Returns the new array of composed arguments.
  	     */
  	    function composeArgs(args, partials, holders) {
  	      var holdersLength = holders.length,
  	          argsIndex = -1,
  	          argsLength = nativeMax(args.length - holdersLength, 0),
  	          leftIndex = -1,
  	          leftLength = partials.length,
  	          result = Array(leftLength + argsLength);
  
  	      while (++leftIndex < leftLength) {
  	        result[leftIndex] = partials[leftIndex];
  	      }
  	      while (++argsIndex < holdersLength) {
  	        result[holders[argsIndex]] = args[argsIndex];
  	      }
  	      while (argsLength--) {
  	        result[leftIndex++] = args[argsIndex++];
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * This function is like `composeArgs` except that the arguments composition
  	     * is tailored for `_.partialRight`.
  	     *
  	     * @private
  	     * @param {Array|Object} args The provided arguments.
  	     * @param {Array} partials The arguments to append to those provided.
  	     * @param {Array} holders The `partials` placeholder indexes.
  	     * @returns {Array} Returns the new array of composed arguments.
  	     */
  	    function composeArgsRight(args, partials, holders) {
  	      var holdersIndex = -1,
  	          holdersLength = holders.length,
  	          argsIndex = -1,
  	          argsLength = nativeMax(args.length - holdersLength, 0),
  	          rightIndex = -1,
  	          rightLength = partials.length,
  	          result = Array(argsLength + rightLength);
  
  	      while (++argsIndex < argsLength) {
  	        result[argsIndex] = args[argsIndex];
  	      }
  	      var offset = argsIndex;
  	      while (++rightIndex < rightLength) {
  	        result[offset + rightIndex] = partials[rightIndex];
  	      }
  	      while (++holdersIndex < holdersLength) {
  	        result[offset + holders[holdersIndex]] = args[argsIndex++];
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Creates a `_.countBy`, `_.groupBy`, `_.indexBy`, or `_.partition` function.
  	     *
  	     * @private
  	     * @param {Function} setter The function to set keys and values of the accumulator object.
  	     * @param {Function} [initializer] The function to initialize the accumulator object.
  	     * @returns {Function} Returns the new aggregator function.
  	     */
  	    function createAggregator(setter, initializer) {
  	      return function(collection, iteratee, thisArg) {
  	        var result = initializer ? initializer() : {};
  	        iteratee = getCallback(iteratee, thisArg, 3);
  
  	        if (isArray(collection)) {
  	          var index = -1,
  	              length = collection.length;
  
  	          while (++index < length) {
  	            var value = collection[index];
  	            setter(result, value, iteratee(value, index, collection), collection);
  	          }
  	        } else {
  	          baseEach(collection, function(value, key, collection) {
  	            setter(result, value, iteratee(value, key, collection), collection);
  	          });
  	        }
  	        return result;
  	      };
  	    }
  
  	    /**
  	     * Creates a `_.assign`, `_.defaults`, or `_.merge` function.
  	     *
  	     * @private
  	     * @param {Function} assigner The function to assign values.
  	     * @returns {Function} Returns the new assigner function.
  	     */
  	    function createAssigner(assigner) {
  	      return restParam(function(object, sources) {
  	        var index = -1,
  	            length = object == null ? 0 : sources.length,
  	            customizer = length > 2 ? sources[length - 2] : undefined,
  	            guard = length > 2 ? sources[2] : undefined,
  	            thisArg = length > 1 ? sources[length - 1] : undefined;
  
  	        if (typeof customizer == 'function') {
  	          customizer = bindCallback(customizer, thisArg, 5);
  	          length -= 2;
  	        } else {
  	          customizer = typeof thisArg == 'function' ? thisArg : undefined;
  	          length -= (customizer ? 1 : 0);
  	        }
  	        if (guard && isIterateeCall(sources[0], sources[1], guard)) {
  	          customizer = length < 3 ? undefined : customizer;
  	          length = 1;
  	        }
  	        while (++index < length) {
  	          var source = sources[index];
  	          if (source) {
  	            assigner(object, source, 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) {
  	        var length = collection ? getLength(collection) : 0;
  	        if (!isLength(length)) {
  	          return eachFunc(collection, iteratee);
  	        }
  	        var index = fromRight ? length : -1,
  	            iterable = toObject(collection);
  
  	        while ((fromRight ? index-- : ++index < length)) {
  	          if (iteratee(iterable[index], index, iterable) === false) {
  	            break;
  	          }
  	        }
  	        return collection;
  	      };
  	    }
  
  	    /**
  	     * Creates a base function for `_.forIn` or `_.forInRight`.
  	     *
  	     * @private
  	     * @param {boolean} [fromRight] Specify iterating from right to left.
  	     * @returns {Function} Returns the new base function.
  	     */
  	    function createBaseFor(fromRight) {
  	      return function(object, iteratee, keysFunc) {
  	        var iterable = toObject(object),
  	            props = keysFunc(object),
  	            length = props.length,
  	            index = fromRight ? length : -1;
  
  	        while ((fromRight ? index-- : ++index < length)) {
  	          var key = props[index];
  	          if (iteratee(iterable[key], key, iterable) === false) {
  	            break;
  	          }
  	        }
  	        return object;
  	      };
  	    }
  
  	    /**
  	     * Creates a function that wraps `func` and invokes it with the `this`
  	     * binding of `thisArg`.
  	     *
  	     * @private
  	     * @param {Function} func The function to bind.
  	     * @param {*} [thisArg] The `this` binding of `func`.
  	     * @returns {Function} Returns the new bound function.
  	     */
  	    function createBindWrapper(func, thisArg) {
  	      var Ctor = createCtorWrapper(func);
  
  	      function wrapper() {
  	        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
  	        return fn.apply(thisArg, arguments);
  	      }
  	      return wrapper;
  	    }
  
  	    /**
  	     * Creates a `Set` cache object to optimize linear searches of large arrays.
  	     *
  	     * @private
  	     * @param {Array} [values] The values to cache.
  	     * @returns {null|Object} Returns the new cache object if `Set` is supported, else `null`.
  	     */
  	    function createCache(values) {
  	      return (nativeCreate && Set) ? new SetCache(values) : null;
  	    }
  
  	    /**
  	     * Creates a function that produces compound words out of the words in a
  	     * given string.
  	     *
  	     * @private
  	     * @param {Function} callback The function to combine each word.
  	     * @returns {Function} Returns the new compounder function.
  	     */
  	    function createCompounder(callback) {
  	      return function(string) {
  	        var index = -1,
  	            array = words(deburr(string)),
  	            length = array.length,
  	            result = '';
  
  	        while (++index < length) {
  	          result = callback(result, array[index], index);
  	        }
  	        return result;
  	      };
  	    }
  
  	    /**
  	     * Creates a function that produces an instance of `Ctor` regardless of
  	     * whether it was invoked as part of a `new` expression or by `call` or `apply`.
  	     *
  	     * @private
  	     * @param {Function} Ctor The constructor to wrap.
  	     * @returns {Function} Returns the new wrapped function.
  	     */
  	    function createCtorWrapper(Ctor) {
  	      return function() {
  	        // Use a `switch` statement to work with class constructors.
  	        // See http://ecma-international.org/ecma-262/6.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 `_.curry` or `_.curryRight` function.
  	     *
  	     * @private
  	     * @param {boolean} flag The curry bit flag.
  	     * @returns {Function} Returns the new curry function.
  	     */
  	    function createCurry(flag) {
  	      function curryFunc(func, arity, guard) {
  	        if (guard && isIterateeCall(func, arity, guard)) {
  	          arity = undefined;
  	        }
  	        var result = createWrapper(func, flag, undefined, undefined, undefined, undefined, undefined, arity);
  	        result.placeholder = curryFunc.placeholder;
  	        return result;
  	      }
  	      return curryFunc;
  	    }
  
  	    /**
  	     * Creates a `_.defaults` or `_.defaultsDeep` function.
  	     *
  	     * @private
  	     * @param {Function} assigner The function to assign values.
  	     * @param {Function} customizer The function to customize assigned values.
  	     * @returns {Function} Returns the new defaults function.
  	     */
  	    function createDefaults(assigner, customizer) {
  	      return restParam(function(args) {
  	        var object = args[0];
  	        if (object == null) {
  	          return object;
  	        }
  	        args.push(customizer);
  	        return assigner.apply(undefined, args);
  	      });
  	    }
  
  	    /**
  	     * Creates a `_.max` or `_.min` function.
  	     *
  	     * @private
  	     * @param {Function} comparator The function used to compare values.
  	     * @param {*} exValue The initial extremum value.
  	     * @returns {Function} Returns the new extremum function.
  	     */
  	    function createExtremum(comparator, exValue) {
  	      return function(collection, iteratee, thisArg) {
  	        if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {
  	          iteratee = undefined;
  	        }
  	        iteratee = getCallback(iteratee, thisArg, 3);
  	        if (iteratee.length == 1) {
  	          collection = isArray(collection) ? collection : toIterable(collection);
  	          var result = arrayExtremum(collection, iteratee, comparator, exValue);
  	          if (!(collection.length && result === exValue)) {
  	            return result;
  	          }
  	        }
  	        return baseExtremum(collection, iteratee, comparator, exValue);
  	      };
  	    }
  
  	    /**
  	     * Creates a `_.find` or `_.findLast` function.
  	     *
  	     * @private
  	     * @param {Function} eachFunc The function to iterate over a collection.
  	     * @param {boolean} [fromRight] Specify iterating from right to left.
  	     * @returns {Function} Returns the new find function.
  	     */
  	    function createFind(eachFunc, fromRight) {
  	      return function(collection, predicate, thisArg) {
  	        predicate = getCallback(predicate, thisArg, 3);
  	        if (isArray(collection)) {
  	          var index = baseFindIndex(collection, predicate, fromRight);
  	          return index > -1 ? collection[index] : undefined;
  	        }
  	        return baseFind(collection, predicate, eachFunc);
  	      };
  	    }
  
  	    /**
  	     * Creates a `_.findIndex` or `_.findLastIndex` function.
  	     *
  	     * @private
  	     * @param {boolean} [fromRight] Specify iterating from right to left.
  	     * @returns {Function} Returns the new find function.
  	     */
  	    function createFindIndex(fromRight) {
  	      return function(array, predicate, thisArg) {
  	        if (!(array && array.length)) {
  	          return -1;
  	        }
  	        predicate = getCallback(predicate, thisArg, 3);
  	        return baseFindIndex(array, predicate, fromRight);
  	      };
  	    }
  
  	    /**
  	     * Creates a `_.findKey` or `_.findLastKey` function.
  	     *
  	     * @private
  	     * @param {Function} objectFunc The function to iterate over an object.
  	     * @returns {Function} Returns the new find function.
  	     */
  	    function createFindKey(objectFunc) {
  	      return function(object, predicate, thisArg) {
  	        predicate = getCallback(predicate, thisArg, 3);
  	        return baseFind(object, predicate, objectFunc, true);
  	      };
  	    }
  
  	    /**
  	     * Creates a `_.flow` or `_.flowRight` function.
  	     *
  	     * @private
  	     * @param {boolean} [fromRight] Specify iterating from right to left.
  	     * @returns {Function} Returns the new flow function.
  	     */
  	    function createFlow(fromRight) {
  	      return function() {
  	        var wrapper,
  	            length = arguments.length,
  	            index = fromRight ? length : -1,
  	            leftIndex = 0,
  	            funcs = Array(length);
  
  	        while ((fromRight ? index-- : ++index < length)) {
  	          var func = funcs[leftIndex++] = arguments[index];
  	          if (typeof func != 'function') {
  	            throw new TypeError(FUNC_ERROR_TEXT);
  	          }
  	          if (!wrapper && LodashWrapper.prototype.thru && getFuncName(func) == 'wrapper') {
  	            wrapper = new LodashWrapper([], true);
  	          }
  	        }
  	        index = wrapper ? -1 : length;
  	        while (++index < length) {
  	          func = funcs[index];
  
  	          var funcName = getFuncName(func),
  	              data = funcName == 'wrapper' ? getData(func) : undefined;
  
  	          if (data && isLaziable(data[0]) && data[1] == (ARY_FLAG | CURRY_FLAG | PARTIAL_FLAG | REARG_FLAG) && !data[4].length && data[9] == 1) {
  	            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);
  	          } else {
  	            wrapper = (func.length == 1 && isLaziable(func)) ? wrapper[funcName]() : wrapper.thru(func);
  	          }
  	        }
  	        return function() {
  	          var args = arguments,
  	              value = args[0];
  
  	          if (wrapper && args.length == 1 && isArray(value) && value.length >= LARGE_ARRAY_SIZE) {
  	            return wrapper.plant(value).value();
  	          }
  	          var index = 0,
  	              result = length ? funcs[index].apply(this, args) : value;
  
  	          while (++index < length) {
  	            result = funcs[index].call(this, result);
  	          }
  	          return result;
  	        };
  	      };
  	    }
  
  	    /**
  	     * Creates a function for `_.forEach` or `_.forEachRight`.
  	     *
  	     * @private
  	     * @param {Function} arrayFunc The function to iterate over an array.
  	     * @param {Function} eachFunc The function to iterate over a collection.
  	     * @returns {Function} Returns the new each function.
  	     */
  	    function createForEach(arrayFunc, eachFunc) {
  	      return function(collection, iteratee, thisArg) {
  	        return (typeof iteratee == 'function' && thisArg === undefined && isArray(collection))
  	          ? arrayFunc(collection, iteratee)
  	          : eachFunc(collection, bindCallback(iteratee, thisArg, 3));
  	      };
  	    }
  
  	    /**
  	     * Creates a function for `_.forIn` or `_.forInRight`.
  	     *
  	     * @private
  	     * @param {Function} objectFunc The function to iterate over an object.
  	     * @returns {Function} Returns the new each function.
  	     */
  	    function createForIn(objectFunc) {
  	      return function(object, iteratee, thisArg) {
  	        if (typeof iteratee != 'function' || thisArg !== undefined) {
  	          iteratee = bindCallback(iteratee, thisArg, 3);
  	        }
  	        return objectFunc(object, iteratee, keysIn);
  	      };
  	    }
  
  	    /**
  	     * Creates a function for `_.forOwn` or `_.forOwnRight`.
  	     *
  	     * @private
  	     * @param {Function} objectFunc The function to iterate over an object.
  	     * @returns {Function} Returns the new each function.
  	     */
  	    function createForOwn(objectFunc) {
  	      return function(object, iteratee, thisArg) {
  	        if (typeof iteratee != 'function' || thisArg !== undefined) {
  	          iteratee = bindCallback(iteratee, thisArg, 3);
  	        }
  	        return objectFunc(object, iteratee);
  	      };
  	    }
  
  	    /**
  	     * Creates a function for `_.mapKeys` or `_.mapValues`.
  	     *
  	     * @private
  	     * @param {boolean} [isMapKeys] Specify mapping keys instead of values.
  	     * @returns {Function} Returns the new map function.
  	     */
  	    function createObjectMapper(isMapKeys) {
  	      return function(object, iteratee, thisArg) {
  	        var result = {};
  	        iteratee = getCallback(iteratee, thisArg, 3);
  
  	        baseForOwn(object, function(value, key, object) {
  	          var mapped = iteratee(value, key, object);
  	          key = isMapKeys ? mapped : key;
  	          value = isMapKeys ? value : mapped;
  	          result[key] = value;
  	        });
  	        return result;
  	      };
  	    }
  
  	    /**
  	     * Creates a function for `_.padLeft` or `_.padRight`.
  	     *
  	     * @private
  	     * @param {boolean} [fromRight] Specify padding from the right.
  	     * @returns {Function} Returns the new pad function.
  	     */
  	    function createPadDir(fromRight) {
  	      return function(string, length, chars) {
  	        string = baseToString(string);
  	        return (fromRight ? string : '') + createPadding(string, length, chars) + (fromRight ? '' : string);
  	      };
  	    }
  
  	    /**
  	     * Creates a `_.partial` or `_.partialRight` function.
  	     *
  	     * @private
  	     * @param {boolean} flag The partial bit flag.
  	     * @returns {Function} Returns the new partial function.
  	     */
  	    function createPartial(flag) {
  	      var partialFunc = restParam(function(func, partials) {
  	        var holders = replaceHolders(partials, partialFunc.placeholder);
  	        return createWrapper(func, flag, undefined, partials, holders);
  	      });
  	      return partialFunc;
  	    }
  
  	    /**
  	     * Creates a function for `_.reduce` or `_.reduceRight`.
  	     *
  	     * @private
  	     * @param {Function} arrayFunc The function to iterate over an array.
  	     * @param {Function} eachFunc The function to iterate over a collection.
  	     * @returns {Function} Returns the new each function.
  	     */
  	    function createReduce(arrayFunc, eachFunc) {
  	      return function(collection, iteratee, accumulator, thisArg) {
  	        var initFromArray = arguments.length < 3;
  	        return (typeof iteratee == 'function' && thisArg === undefined && isArray(collection))
  	          ? arrayFunc(collection, iteratee, accumulator, initFromArray)
  	          : baseReduce(collection, getCallback(iteratee, thisArg, 4), accumulator, initFromArray, eachFunc);
  	      };
  	    }
  
  	    /**
  	     * Creates a function that wraps `func` and invokes it with optional `this`
  	     * binding of, partial application, and currying.
  	     *
  	     * @private
  	     * @param {Function|string} func The function or method name to reference.
  	     * @param {number} bitmask The bitmask of flags. See `createWrapper` for more details.
  	     * @param {*} [thisArg] The `this` binding of `func`.
  	     * @param {Array} [partials] The arguments to prepend to those provided to the new function.
  	     * @param {Array} [holders] The `partials` placeholder indexes.
  	     * @param {Array} [partialsRight] The arguments to append to those provided to the new function.
  	     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.
  	     * @param {Array} [argPos] The argument positions of the new function.
  	     * @param {number} [ary] The arity cap of `func`.
  	     * @param {number} [arity] The arity of `func`.
  	     * @returns {Function} Returns the new wrapped function.
  	     */
  	    function createHybridWrapper(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {
  	      var isAry = bitmask & ARY_FLAG,
  	          isBind = bitmask & BIND_FLAG,
  	          isBindKey = bitmask & BIND_KEY_FLAG,
  	          isCurry = bitmask & CURRY_FLAG,
  	          isCurryBound = bitmask & CURRY_BOUND_FLAG,
  	          isCurryRight = bitmask & CURRY_RIGHT_FLAG,
  	          Ctor = isBindKey ? undefined : createCtorWrapper(func);
  
  	      function wrapper() {
  	        // Avoid `arguments` object use disqualifying optimizations by
  	        // converting it to an array before providing it to other functions.
  	        var length = arguments.length,
  	            index = length,
  	            args = Array(length);
  
  	        while (index--) {
  	          args[index] = arguments[index];
  	        }
  	        if (partials) {
  	          args = composeArgs(args, partials, holders);
  	        }
  	        if (partialsRight) {
  	          args = composeArgsRight(args, partialsRight, holdersRight);
  	        }
  	        if (isCurry || isCurryRight) {
  	          var placeholder = wrapper.placeholder,
  	              argsHolders = replaceHolders(args, placeholder);
  
  	          length -= argsHolders.length;
  	          if (length < arity) {
  	            var newArgPos = argPos ? arrayCopy(argPos) : undefined,
  	                newArity = nativeMax(arity - length, 0),
  	                newsHolders = isCurry ? argsHolders : undefined,
  	                newHoldersRight = isCurry ? undefined : argsHolders,
  	                newPartials = isCurry ? args : undefined,
  	                newPartialsRight = isCurry ? undefined : args;
  
  	            bitmask |= (isCurry ? PARTIAL_FLAG : PARTIAL_RIGHT_FLAG);
  	            bitmask &= ~(isCurry ? PARTIAL_RIGHT_FLAG : PARTIAL_FLAG);
  
  	            if (!isCurryBound) {
  	              bitmask &= ~(BIND_FLAG | BIND_KEY_FLAG);
  	            }
  	            var newData = [func, bitmask, thisArg, newPartials, newsHolders, newPartialsRight, newHoldersRight, newArgPos, ary, newArity],
  	                result = createHybridWrapper.apply(undefined, newData);
  
  	            if (isLaziable(func)) {
  	              setData(result, newData);
  	            }
  	            result.placeholder = placeholder;
  	            return result;
  	          }
  	        }
  	        var thisBinding = isBind ? thisArg : this,
  	            fn = isBindKey ? thisBinding[func] : func;
  
  	        if (argPos) {
  	          args = reorder(args, argPos);
  	        }
  	        if (isAry && ary < args.length) {
  	          args.length = ary;
  	        }
  	        if (this && this !== root && this instanceof wrapper) {
  	          fn = Ctor || createCtorWrapper(func);
  	        }
  	        return fn.apply(thisBinding, args);
  	      }
  	      return wrapper;
  	    }
  
  	    /**
  	     * Creates the padding required for `string` based on the given `length`.
  	     * The `chars` string is truncated if the number of characters exceeds `length`.
  	     *
  	     * @private
  	     * @param {string} string The string to create padding for.
  	     * @param {number} [length=0] The padding length.
  	     * @param {string} [chars=' '] The string used as padding.
  	     * @returns {string} Returns the pad for `string`.
  	     */
  	    function createPadding(string, length, chars) {
  	      var strLength = string.length;
  	      length = +length;
  
  	      if (strLength >= length || !nativeIsFinite(length)) {
  	        return '';
  	      }
  	      var padLength = length - strLength;
  	      chars = chars == null ? ' ' : (chars + '');
  	      return repeat(chars, nativeCeil(padLength / chars.length)).slice(0, padLength);
  	    }
  
  	    /**
  	     * Creates a function that wraps `func` and invokes it with the optional `this`
  	     * binding of `thisArg` and the `partials` prepended to those provided to
  	     * the wrapper.
  	     *
  	     * @private
  	     * @param {Function} func The function to partially apply arguments to.
  	     * @param {number} bitmask The bitmask of flags. See `createWrapper` for more details.
  	     * @param {*} thisArg The `this` binding of `func`.
  	     * @param {Array} partials The arguments to prepend to those provided to the new function.
  	     * @returns {Function} Returns the new bound function.
  	     */
  	    function createPartialWrapper(func, bitmask, thisArg, partials) {
  	      var isBind = bitmask & BIND_FLAG,
  	          Ctor = createCtorWrapper(func);
  
  	      function wrapper() {
  	        // Avoid `arguments` object use disqualifying optimizations by
  	        // converting it to an array before providing it `func`.
  	        var argsIndex = -1,
  	            argsLength = arguments.length,
  	            leftIndex = -1,
  	            leftLength = partials.length,
  	            args = Array(leftLength + argsLength);
  
  	        while (++leftIndex < leftLength) {
  	          args[leftIndex] = partials[leftIndex];
  	        }
  	        while (argsLength--) {
  	          args[leftIndex++] = arguments[++argsIndex];
  	        }
  	        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
  	        return fn.apply(isBind ? thisArg : this, args);
  	      }
  	      return wrapper;
  	    }
  
  	    /**
  	     * Creates a `_.ceil`, `_.floor`, or `_.round` function.
  	     *
  	     * @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) {
  	        precision = precision === undefined ? 0 : (+precision || 0);
  	        if (precision) {
  	          precision = pow(10, precision);
  	          return func(number * precision) / precision;
  	        }
  	        return func(number);
  	      };
  	    }
  
  	    /**
  	     * Creates a `_.sortedIndex` or `_.sortedLastIndex` function.
  	     *
  	     * @private
  	     * @param {boolean} [retHighest] Specify returning the highest qualified index.
  	     * @returns {Function} Returns the new index function.
  	     */
  	    function createSortedIndex(retHighest) {
  	      return function(array, value, iteratee, thisArg) {
  	        var callback = getCallback(iteratee);
  	        return (iteratee == null && callback === baseCallback)
  	          ? binaryIndex(array, value, retHighest)
  	          : binaryIndexBy(array, value, callback(iteratee, thisArg, 1), retHighest);
  	      };
  	    }
  
  	    /**
  	     * Creates a function that either curries or invokes `func` with optional
  	     * `this` binding and partially applied arguments.
  	     *
  	     * @private
  	     * @param {Function|string} func The function or method name to reference.
  	     * @param {number} bitmask The bitmask of flags.
  	     *  The bitmask may be composed of the following flags:
  	     *     1 - `_.bind`
  	     *     2 - `_.bindKey`
  	     *     4 - `_.curry` or `_.curryRight` of a bound function
  	     *     8 - `_.curry`
  	     *    16 - `_.curryRight`
  	     *    32 - `_.partial`
  	     *    64 - `_.partialRight`
  	     *   128 - `_.rearg`
  	     *   256 - `_.ary`
  	     * @param {*} [thisArg] The `this` binding of `func`.
  	     * @param {Array} [partials] The arguments to be partially applied.
  	     * @param {Array} [holders] The `partials` placeholder indexes.
  	     * @param {Array} [argPos] The argument positions of the new function.
  	     * @param {number} [ary] The arity cap of `func`.
  	     * @param {number} [arity] The arity of `func`.
  	     * @returns {Function} Returns the new wrapped function.
  	     */
  	    function createWrapper(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {
  	      var isBindKey = bitmask & BIND_KEY_FLAG;
  	      if (!isBindKey && typeof func != 'function') {
  	        throw new TypeError(FUNC_ERROR_TEXT);
  	      }
  	      var length = partials ? partials.length : 0;
  	      if (!length) {
  	        bitmask &= ~(PARTIAL_FLAG | PARTIAL_RIGHT_FLAG);
  	        partials = holders = undefined;
  	      }
  	      length -= (holders ? holders.length : 0);
  	      if (bitmask & PARTIAL_RIGHT_FLAG) {
  	        var partialsRight = partials,
  	            holdersRight = holders;
  
  	        partials = holders = undefined;
  	      }
  	      var data = isBindKey ? undefined : getData(func),
  	          newData = [func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity];
  
  	      if (data) {
  	        mergeData(newData, data);
  	        bitmask = newData[1];
  	        arity = newData[9];
  	      }
  	      newData[9] = arity == null
  	        ? (isBindKey ? 0 : func.length)
  	        : (nativeMax(arity - length, 0) || 0);
  
  	      if (bitmask == BIND_FLAG) {
  	        var result = createBindWrapper(newData[0], newData[2]);
  	      } else if ((bitmask == PARTIAL_FLAG || bitmask == (BIND_FLAG | PARTIAL_FLAG)) && !newData[4].length) {
  	        result = createPartialWrapper.apply(undefined, newData);
  	      } else {
  	        result = createHybridWrapper.apply(undefined, newData);
  	      }
  	      var setter = data ? baseSetData : setData;
  	      return setter(result, newData);
  	    }
  
  	    /**
  	     * A specialized version of `baseIsEqualDeep` for arrays with support for
  	     * partial deep comparisons.
  	     *
  	     * @private
  	     * @param {Array} array The array to compare.
  	     * @param {Array} other The other array to compare.
  	     * @param {Function} equalFunc The function to determine equivalents of values.
  	     * @param {Function} [customizer] The function to customize comparing arrays.
  	     * @param {boolean} [isLoose] Specify performing partial comparisons.
  	     * @param {Array} [stackA] Tracks traversed `value` objects.
  	     * @param {Array} [stackB] Tracks traversed `other` objects.
  	     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
  	     */
  	    function equalArrays(array, other, equalFunc, customizer, isLoose, stackA, stackB) {
  	      var index = -1,
  	          arrLength = array.length,
  	          othLength = other.length;
  
  	      if (arrLength != othLength && !(isLoose && othLength > arrLength)) {
  	        return false;
  	      }
  	      // Ignore non-index properties.
  	      while (++index < arrLength) {
  	        var arrValue = array[index],
  	            othValue = other[index],
  	            result = customizer ? customizer(isLoose ? othValue : arrValue, isLoose ? arrValue : othValue, index) : undefined;
  
  	        if (result !== undefined) {
  	          if (result) {
  	            continue;
  	          }
  	          return false;
  	        }
  	        // Recursively compare arrays (susceptible to call stack limits).
  	        if (isLoose) {
  	          if (!arraySome(other, function(othValue) {
  	                return arrValue === othValue || equalFunc(arrValue, othValue, customizer, isLoose, stackA, stackB);
  	              })) {
  	            return false;
  	          }
  	        } else if (!(arrValue === othValue || equalFunc(arrValue, othValue, customizer, isLoose, stackA, stackB))) {
  	          return false;
  	        }
  	      }
  	      return true;
  	    }
  
  	    /**
  	     * 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.
  	     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
  	     */
  	    function equalByTag(object, other, tag) {
  	      switch (tag) {
  	        case boolTag:
  	        case dateTag:
  	          // Coerce dates and booleans to numbers, dates to milliseconds and booleans
  	          // to `1` or `0` treating invalid dates coerced to `NaN` as not equal.
  	          return +object == +other;
  
  	        case errorTag:
  	          return object.name == other.name && object.message == other.message;
  
  	        case numberTag:
  	          // Treat `NaN` vs. `NaN` as equal.
  	          return (object != +object)
  	            ? other != +other
  	            : object == +other;
  
  	        case regexpTag:
  	        case stringTag:
  	          // Coerce regexes to strings and treat strings primitives and string
  	          // objects as equal. See https://es5.github.io/#x15.10.6.4 for more details.
  	          return object == (other + '');
  	      }
  	      return false;
  	    }
  
  	    /**
  	     * A specialized version of `baseIsEqualDeep` for objects with support for
  	     * partial deep comparisons.
  	     *
  	     * @private
  	     * @param {Object} object The object to compare.
  	     * @param {Object} other The other object to compare.
  	     * @param {Function} equalFunc The function to determine equivalents of values.
  	     * @param {Function} [customizer] The function to customize comparing values.
  	     * @param {boolean} [isLoose] Specify performing partial comparisons.
  	     * @param {Array} [stackA] Tracks traversed `value` objects.
  	     * @param {Array} [stackB] Tracks traversed `other` objects.
  	     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
  	     */
  	    function equalObjects(object, other, equalFunc, customizer, isLoose, stackA, stackB) {
  	      var objProps = keys(object),
  	          objLength = objProps.length,
  	          othProps = keys(other),
  	          othLength = othProps.length;
  
  	      if (objLength != othLength && !isLoose) {
  	        return false;
  	      }
  	      var index = objLength;
  	      while (index--) {
  	        var key = objProps[index];
  	        if (!(isLoose ? key in other : hasOwnProperty.call(other, key))) {
  	          return false;
  	        }
  	      }
  	      var skipCtor = isLoose;
  	      while (++index < objLength) {
  	        key = objProps[index];
  	        var objValue = object[key],
  	            othValue = other[key],
  	            result = customizer ? customizer(isLoose ? othValue : objValue, isLoose? objValue : othValue, key) : undefined;
  
  	        // Recursively compare objects (susceptible to call stack limits).
  	        if (!(result === undefined ? equalFunc(objValue, othValue, customizer, isLoose, stackA, stackB) : result)) {
  	          return false;
  	        }
  	        skipCtor || (skipCtor = key == 'constructor');
  	      }
  	      if (!skipCtor) {
  	        var objCtor = object.constructor,
  	            othCtor = other.constructor;
  
  	        // Non `Object` object instances with different constructors are not equal.
  	        if (objCtor != othCtor &&
  	            ('constructor' in object && 'constructor' in other) &&
  	            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
  	              typeof othCtor == 'function' && othCtor instanceof othCtor)) {
  	          return false;
  	        }
  	      }
  	      return true;
  	    }
  
  	    /**
  	     * Gets the appropriate "callback" function. If the `_.callback` method is
  	     * customized this function returns the custom method, otherwise it returns
  	     * the `baseCallback` function. If arguments are provided the chosen function
  	     * is invoked with them and its result is returned.
  	     *
  	     * @private
  	     * @returns {Function} Returns the chosen function or its result.
  	     */
  	    function getCallback(func, thisArg, argCount) {
  	      var result = lodash.callback || callback;
  	      result = result === callback ? baseCallback : result;
  	      return argCount ? result(func, thisArg, argCount) : result;
  	    }
  
  	    /**
  	     * Gets metadata for `func`.
  	     *
  	     * @private
  	     * @param {Function} func The function to query.
  	     * @returns {*} Returns the metadata for `func`.
  	     */
  	    var getData = !metaMap ? noop : function(func) {
  	      return metaMap.get(func);
  	    };
  
  	    /**
  	     * 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 = array ? array.length : 0;
  
  	      while (length--) {
  	        var data = array[length],
  	            otherFunc = data.func;
  	        if (otherFunc == null || otherFunc == func) {
  	          return data.name;
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Gets the appropriate "indexOf" function. If the `_.indexOf` method is
  	     * customized this function returns the custom method, otherwise it returns
  	     * the `baseIndexOf` function. If arguments are provided the chosen function
  	     * is invoked with them and its result is returned.
  	     *
  	     * @private
  	     * @returns {Function|number} Returns the chosen function or its result.
  	     */
  	    function getIndexOf(collection, target, fromIndex) {
  	      var result = lodash.indexOf || indexOf;
  	      result = result === indexOf ? baseIndexOf : result;
  	      return collection ? result(collection, target, fromIndex) : result;
  	    }
  
  	    /**
  	     * Gets the "length" property value of `object`.
  	     *
  	     * **Note:** This function is used to avoid a [JIT bug](https://bugs.webkit.org/show_bug.cgi?id=142792)
  	     * that affects Safari on at least iOS 8.1-8.3 ARM64.
  	     *
  	     * @private
  	     * @param {Object} object The object to query.
  	     * @returns {*} Returns the "length" value.
  	     */
  	    var getLength = baseProperty('length');
  
  	    /**
  	     * Gets the propery 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 = pairs(object),
  	          length = result.length;
  
  	      while (length--) {
  	        result[length][2] = isStrictComparable(result[length][1]);
  	      }
  	      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 = object == null ? undefined : object[key];
  	      return isNative(value) ? value : undefined;
  	    }
  
  	    /**
  	     * 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 };
  	    }
  
  	    /**
  	     * Initializes an array clone.
  	     *
  	     * @private
  	     * @param {Array} array The array to clone.
  	     * @returns {Array} Returns the initialized clone.
  	     */
  	    function initCloneArray(array) {
  	      var length = array.length,
  	          result = new array.constructor(length);
  
  	      // Add array properties assigned by `RegExp#exec`.
  	      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {
  	        result.index = array.index;
  	        result.input = array.input;
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Initializes an object clone.
  	     *
  	     * @private
  	     * @param {Object} object The object to clone.
  	     * @returns {Object} Returns the initialized clone.
  	     */
  	    function initCloneObject(object) {
  	      var Ctor = object.constructor;
  	      if (!(typeof Ctor == 'function' && Ctor instanceof Ctor)) {
  	        Ctor = Object;
  	      }
  	      return new Ctor;
  	    }
  
  	    /**
  	     * Initializes an object clone based on its `toStringTag`.
  	     *
  	     * **Note:** This function only supports cloning values with tags of
  	     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
  	     *
  	     * @private
  	     * @param {Object} object The object to clone.
  	     * @param {string} tag The `toStringTag` of the object to clone.
  	     * @param {boolean} [isDeep] Specify a deep clone.
  	     * @returns {Object} Returns the initialized clone.
  	     */
  	    function initCloneByTag(object, tag, isDeep) {
  	      var Ctor = object.constructor;
  	      switch (tag) {
  	        case arrayBufferTag:
  	          return bufferClone(object);
  
  	        case boolTag:
  	        case dateTag:
  	          return new Ctor(+object);
  
  	        case float32Tag: case float64Tag:
  	        case int8Tag: case int16Tag: case int32Tag:
  	        case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:
  	          var buffer = object.buffer;
  	          return new Ctor(isDeep ? bufferClone(buffer) : buffer, object.byteOffset, object.length);
  
  	        case numberTag:
  	        case stringTag:
  	          return new Ctor(object);
  
  	        case regexpTag:
  	          var result = new Ctor(object.source, reFlags.exec(object));
  	          result.lastIndex = object.lastIndex;
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Invokes the method at `path` on `object`.
  	     *
  	     * @private
  	     * @param {Object} object The object to query.
  	     * @param {Array|string} path The path of the method to invoke.
  	     * @param {Array} args The arguments to invoke the method with.
  	     * @returns {*} Returns the result of the invoked method.
  	     */
  	    function invokePath(object, path, args) {
  	      if (object != null && !isKey(path, object)) {
  	        path = toPath(path);
  	        object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
  	        path = last(path);
  	      }
  	      var func = object == null ? object : object[path];
  	      return func == null ? undefined : func.apply(object, args);
  	    }
  
  	    /**
  	     * Checks if `value` is array-like.
  	     *
  	     * @private
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
  	     */
  	    function isArrayLike(value) {
  	      return value != null && isLength(getLength(value));
  	    }
  
  	    /**
  	     * Checks if `value` is a valid array-like index.
  	     *
  	     * @private
  	     * @param {*} value The value to check.
  	     * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
  	     * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
  	     */
  	    function isIndex(value, length) {
  	      value = (typeof value == 'number' || reIsUint.test(value)) ? +value : -1;
  	      length = length == null ? MAX_SAFE_INTEGER : length;
  	      return value > -1 && value % 1 == 0 && value < length;
  	    }
  
  	    /**
  	     * Checks if the provided arguments are from an iteratee call.
  	     *
  	     * @private
  	     * @param {*} value The potential iteratee value argument.
  	     * @param {*} index The potential iteratee index or key argument.
  	     * @param {*} object The potential iteratee object argument.
  	     * @returns {boolean} Returns `true` if the arguments are from an iteratee call, else `false`.
  	     */
  	    function isIterateeCall(value, index, object) {
  	      if (!isObject(object)) {
  	        return false;
  	      }
  	      var type = typeof index;
  	      if (type == 'number'
  	          ? (isArrayLike(object) && isIndex(index, object.length))
  	          : (type == 'string' && index in object)) {
  	        var other = object[index];
  	        return value === value ? (value === other) : (other !== other);
  	      }
  	      return false;
  	    }
  
  	    /**
  	     * Checks if `value` is a property name and not a property path.
  	     *
  	     * @private
  	     * @param {*} value The value to check.
  	     * @param {Object} [object] The object to query keys on.
  	     * @returns {boolean} Returns `true` if `value` is a property name, else `false`.
  	     */
  	    function isKey(value, object) {
  	      var type = typeof value;
  	      if ((type == 'string' && reIsPlainProp.test(value)) || type == 'number') {
  	        return true;
  	      }
  	      if (isArray(value)) {
  	        return false;
  	      }
  	      var result = !reIsDeepProp.test(value);
  	      return result || (object != null && value in toObject(object));
  	    }
  
  	    /**
  	     * Checks if `func` has a lazy counterpart.
  	     *
  	     * @private
  	     * @param {Function} func The function to check.
  	     * @returns {boolean} Returns `true` if `func` has a lazy counterpart, else `false`.
  	     */
  	    function isLaziable(func) {
  	      var funcName = getFuncName(func);
  	      if (!(funcName in LazyWrapper.prototype)) {
  	        return false;
  	      }
  	      var other = lodash[funcName];
  	      if (func === other) {
  	        return true;
  	      }
  	      var data = getData(other);
  	      return !!data && func === data[0];
  	    }
  
  	    /**
  	     * Checks if `value` is a valid array-like length.
  	     *
  	     * **Note:** This function is based on [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength).
  	     *
  	     * @private
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.
  	     */
  	    function isLength(value) {
  	      return typeof value == 'number' && value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
  	    }
  
  	    /**
  	     * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.
  	     *
  	     * @private
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` if suitable for strict
  	     *  equality comparisons, else `false`.
  	     */
  	    function isStrictComparable(value) {
  	      return value === value && !isObject(value);
  	    }
  
  	    /**
  	     * Merges the function metadata of `source` into `data`.
  	     *
  	     * Merging metadata reduces the number of wrappers required to invoke a function.
  	     * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`
  	     * may be applied regardless of execution order. Methods like `_.ary` and `_.rearg`
  	     * augment function arguments, making the order in which they are executed important,
  	     * preventing the merging of metadata. However, we make an exception for a safe
  	     * common case where curried functions have `_.ary` and or `_.rearg` applied.
  	     *
  	     * @private
  	     * @param {Array} data The destination metadata.
  	     * @param {Array} source The source metadata.
  	     * @returns {Array} Returns `data`.
  	     */
  	    function mergeData(data, source) {
  	      var bitmask = data[1],
  	          srcBitmask = source[1],
  	          newBitmask = bitmask | srcBitmask,
  	          isCommon = newBitmask < ARY_FLAG;
  
  	      var isCombo =
  	        (srcBitmask == ARY_FLAG && bitmask == CURRY_FLAG) ||
  	        (srcBitmask == ARY_FLAG && bitmask == REARG_FLAG && data[7].length <= source[8]) ||
  	        (srcBitmask == (ARY_FLAG | REARG_FLAG) && bitmask == CURRY_FLAG);
  
  	      // Exit early if metadata can't be merged.
  	      if (!(isCommon || isCombo)) {
  	        return data;
  	      }
  	      // Use source `thisArg` if available.
  	      if (srcBitmask & BIND_FLAG) {
  	        data[2] = source[2];
  	        // Set when currying a bound function.
  	        newBitmask |= (bitmask & BIND_FLAG) ? 0 : CURRY_BOUND_FLAG;
  	      }
  	      // Compose partial arguments.
  	      var value = source[3];
  	      if (value) {
  	        var partials = data[3];
  	        data[3] = partials ? composeArgs(partials, value, source[4]) : arrayCopy(value);
  	        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : arrayCopy(source[4]);
  	      }
  	      // Compose partial right arguments.
  	      value = source[5];
  	      if (value) {
  	        partials = data[5];
  	        data[5] = partials ? composeArgsRight(partials, value, source[6]) : arrayCopy(value);
  	        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : arrayCopy(source[6]);
  	      }
  	      // Use source `argPos` if available.
  	      value = source[7];
  	      if (value) {
  	        data[7] = arrayCopy(value);
  	      }
  	      // Use source `ary` if it's smaller.
  	      if (srcBitmask & ARY_FLAG) {
  	        data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);
  	      }
  	      // Use source `arity` if one is not provided.
  	      if (data[9] == null) {
  	        data[9] = source[9];
  	      }
  	      // Use source `func` and merge bitmasks.
  	      data[0] = source[0];
  	      data[1] = newBitmask;
  
  	      return data;
  	    }
  
  	    /**
  	     * Used by `_.defaultsDeep` to customize its `_.merge` use.
  	     *
  	     * @private
  	     * @param {*} objectValue The destination object property value.
  	     * @param {*} sourceValue The source object property value.
  	     * @returns {*} Returns the value to assign to the destination object.
  	     */
  	    function mergeDefaults(objectValue, sourceValue) {
  	      return objectValue === undefined ? sourceValue : merge(objectValue, sourceValue, mergeDefaults);
  	    }
  
  	    /**
  	     * A specialized version of `_.pick` which picks `object` properties specified
  	     * by `props`.
  	     *
  	     * @private
  	     * @param {Object} object The source object.
  	     * @param {string[]} props The property names to pick.
  	     * @returns {Object} Returns the new object.
  	     */
  	    function pickByArray(object, props) {
  	      object = toObject(object);
  
  	      var index = -1,
  	          length = props.length,
  	          result = {};
  
  	      while (++index < length) {
  	        var key = props[index];
  	        if (key in object) {
  	          result[key] = object[key];
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * A specialized version of `_.pick` which picks `object` properties `predicate`
  	     * returns truthy for.
  	     *
  	     * @private
  	     * @param {Object} object The source object.
  	     * @param {Function} predicate The function invoked per iteration.
  	     * @returns {Object} Returns the new object.
  	     */
  	    function pickByCallback(object, predicate) {
  	      var result = {};
  	      baseForIn(object, function(value, key, object) {
  	        if (predicate(value, key, object)) {
  	          result[key] = value;
  	        }
  	      });
  	      return result;
  	    }
  
  	    /**
  	     * Reorder `array` according to the specified indexes where the element at
  	     * the first index is assigned as the first element, the element at
  	     * the second index is assigned as the second element, and so on.
  	     *
  	     * @private
  	     * @param {Array} array The array to reorder.
  	     * @param {Array} indexes The arranged array indexes.
  	     * @returns {Array} Returns `array`.
  	     */
  	    function reorder(array, indexes) {
  	      var arrLength = array.length,
  	          length = nativeMin(indexes.length, arrLength),
  	          oldArray = arrayCopy(array);
  
  	      while (length--) {
  	        var index = indexes[length];
  	        array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;
  	      }
  	      return array;
  	    }
  
  	    /**
  	     * Sets metadata for `func`.
  	     *
  	     * **Note:** If this function becomes hot, i.e. is invoked a lot in a short
  	     * period of time, it will trip its breaker and transition to an identity function
  	     * to avoid garbage collection pauses in V8. See [V8 issue 2070](https://code.google.com/p/v8/issues/detail?id=2070)
  	     * for more details.
  	     *
  	     * @private
  	     * @param {Function} func The function to associate metadata with.
  	     * @param {*} data The metadata.
  	     * @returns {Function} Returns `func`.
  	     */
  	    var setData = (function() {
  	      var count = 0,
  	          lastCalled = 0;
  
  	      return function(key, value) {
  	        var stamp = now(),
  	            remaining = HOT_SPAN - (stamp - lastCalled);
  
  	        lastCalled = stamp;
  	        if (remaining > 0) {
  	          if (++count >= HOT_COUNT) {
  	            return key;
  	          }
  	        } else {
  	          count = 0;
  	        }
  	        return baseSetData(key, value);
  	      };
  	    }());
  
  	    /**
  	     * A fallback implementation of `Object.keys` which creates an array of the
  	     * own enumerable property names of `object`.
  	     *
  	     * @private
  	     * @param {Object} object The object to query.
  	     * @returns {Array} Returns the array of property names.
  	     */
  	    function shimKeys(object) {
  	      var props = keysIn(object),
  	          propsLength = props.length,
  	          length = propsLength && object.length;
  
  	      var allowIndexes = !!length && isLength(length) &&
  	        (isArray(object) || isArguments(object));
  
  	      var index = -1,
  	          result = [];
  
  	      while (++index < propsLength) {
  	        var key = props[index];
  	        if ((allowIndexes && isIndex(key, length)) || hasOwnProperty.call(object, key)) {
  	          result.push(key);
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Converts `value` to an array-like object if it's not one.
  	     *
  	     * @private
  	     * @param {*} value The value to process.
  	     * @returns {Array|Object} Returns the array-like object.
  	     */
  	    function toIterable(value) {
  	      if (value == null) {
  	        return [];
  	      }
  	      if (!isArrayLike(value)) {
  	        return values(value);
  	      }
  	      return isObject(value) ? value : Object(value);
  	    }
  
  	    /**
  	     * Converts `value` to an object if it's not one.
  	     *
  	     * @private
  	     * @param {*} value The value to process.
  	     * @returns {Object} Returns the object.
  	     */
  	    function toObject(value) {
  	      return isObject(value) ? value : Object(value);
  	    }
  
  	    /**
  	     * Converts `value` to property path array if it's not one.
  	     *
  	     * @private
  	     * @param {*} value The value to process.
  	     * @returns {Array} Returns the property path array.
  	     */
  	    function toPath(value) {
  	      if (isArray(value)) {
  	        return value;
  	      }
  	      var result = [];
  	      baseToString(value).replace(rePropName, function(match, number, quote, string) {
  	        result.push(quote ? string.replace(reEscapeChar, '$1') : (number || match));
  	      });
  	      return result;
  	    }
  
  	    /**
  	     * Creates a clone of `wrapper`.
  	     *
  	     * @private
  	     * @param {Object} wrapper The wrapper to clone.
  	     * @returns {Object} Returns the cloned wrapper.
  	     */
  	    function wrapperClone(wrapper) {
  	      return wrapper instanceof LazyWrapper
  	        ? wrapper.clone()
  	        : new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__, arrayCopy(wrapper.__actions__));
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Creates an array of elements split into groups the length of `size`.
  	     * If `collection` can't be split evenly, the final chunk will be the remaining
  	     * elements.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to process.
  	     * @param {number} [size=1] The length of each chunk.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Array} Returns the new array containing chunks.
  	     * @example
  	     *
  	     * _.chunk(['a', 'b', 'c', 'd'], 2);
  	     * // => [['a', 'b'], ['c', 'd']]
  	     *
  	     * _.chunk(['a', 'b', 'c', 'd'], 3);
  	     * // => [['a', 'b', 'c'], ['d']]
  	     */
  	    function chunk(array, size, guard) {
  	      if (guard ? isIterateeCall(array, size, guard) : size == null) {
  	        size = 1;
  	      } else {
  	        size = nativeMax(nativeFloor(size) || 1, 1);
  	      }
  	      var index = 0,
  	          length = array ? array.length : 0,
  	          resIndex = -1,
  	          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 _
  	     * @category Array
  	     * @param {Array} array The array to compact.
  	     * @returns {Array} Returns the new array of filtered values.
  	     * @example
  	     *
  	     * _.compact([0, 1, false, 2, '', 3]);
  	     * // => [1, 2, 3]
  	     */
  	    function compact(array) {
  	      var index = -1,
  	          length = array ? array.length : 0,
  	          resIndex = -1,
  	          result = [];
  
  	      while (++index < length) {
  	        var value = array[index];
  	        if (value) {
  	          result[++resIndex] = value;
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Creates an array of unique `array` values not included in the other
  	     * provided arrays using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
  	     * for equality comparisons.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to inspect.
  	     * @param {...Array} [values] The arrays of values to exclude.
  	     * @returns {Array} Returns the new array of filtered values.
  	     * @example
  	     *
  	     * _.difference([1, 2, 3], [4, 2]);
  	     * // => [1, 3]
  	     */
  	    var difference = restParam(function(array, values) {
  	      return (isObjectLike(array) && isArrayLike(array))
  	        ? baseDifference(array, baseFlatten(values, false, true))
  	        : [];
  	    });
  
  	    /**
  	     * Creates a slice of `array` with `n` elements dropped from the beginning.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @param {number} [n=1] The number of elements to drop.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Array} Returns the slice of `array`.
  	     * @example
  	     *
  	     * _.drop([1, 2, 3]);
  	     * // => [2, 3]
  	     *
  	     * _.drop([1, 2, 3], 2);
  	     * // => [3]
  	     *
  	     * _.drop([1, 2, 3], 5);
  	     * // => []
  	     *
  	     * _.drop([1, 2, 3], 0);
  	     * // => [1, 2, 3]
  	     */
  	    function drop(array, n, guard) {
  	      var length = array ? array.length : 0;
  	      if (!length) {
  	        return [];
  	      }
  	      if (guard ? isIterateeCall(array, n, guard) : n == null) {
  	        n = 1;
  	      }
  	      return baseSlice(array, n < 0 ? 0 : n);
  	    }
  
  	    /**
  	     * Creates a slice of `array` with `n` elements dropped from the end.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @param {number} [n=1] The number of elements to drop.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Array} Returns the slice of `array`.
  	     * @example
  	     *
  	     * _.dropRight([1, 2, 3]);
  	     * // => [1, 2]
  	     *
  	     * _.dropRight([1, 2, 3], 2);
  	     * // => [1]
  	     *
  	     * _.dropRight([1, 2, 3], 5);
  	     * // => []
  	     *
  	     * _.dropRight([1, 2, 3], 0);
  	     * // => [1, 2, 3]
  	     */
  	    function dropRight(array, n, guard) {
  	      var length = array ? array.length : 0;
  	      if (!length) {
  	        return [];
  	      }
  	      if (guard ? isIterateeCall(array, n, guard) : n == null) {
  	        n = 1;
  	      }
  	      n = length - (+n || 0);
  	      return baseSlice(array, 0, n < 0 ? 0 : n);
  	    }
  
  	    /**
  	     * Creates a slice of `array` excluding elements dropped from the end.
  	     * Elements are dropped until `predicate` returns falsey. The predicate is
  	     * bound to `thisArg` and invoked with three arguments: (value, index, array).
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that match the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {Array} Returns the slice of `array`.
  	     * @example
  	     *
  	     * _.dropRightWhile([1, 2, 3], function(n) {
  	     *   return n > 1;
  	     * });
  	     * // => [1]
  	     *
  	     * var users = [
  	     *   { 'user': 'barney',  'active': true },
  	     *   { 'user': 'fred',    'active': false },
  	     *   { 'user': 'pebbles', 'active': false }
  	     * ];
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.pluck(_.dropRightWhile(users, { 'user': 'pebbles', 'active': false }), 'user');
  	     * // => ['barney', 'fred']
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.pluck(_.dropRightWhile(users, 'active', false), 'user');
  	     * // => ['barney']
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.pluck(_.dropRightWhile(users, 'active'), 'user');
  	     * // => ['barney', 'fred', 'pebbles']
  	     */
  	    function dropRightWhile(array, predicate, thisArg) {
  	      return (array && array.length)
  	        ? baseWhile(array, getCallback(predicate, thisArg, 3), true, true)
  	        : [];
  	    }
  
  	    /**
  	     * Creates a slice of `array` excluding elements dropped from the beginning.
  	     * Elements are dropped until `predicate` returns falsey. The predicate is
  	     * bound to `thisArg` and invoked with three arguments: (value, index, array).
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {Array} Returns the slice of `array`.
  	     * @example
  	     *
  	     * _.dropWhile([1, 2, 3], function(n) {
  	     *   return n < 3;
  	     * });
  	     * // => [3]
  	     *
  	     * var users = [
  	     *   { 'user': 'barney',  'active': false },
  	     *   { 'user': 'fred',    'active': false },
  	     *   { 'user': 'pebbles', 'active': true }
  	     * ];
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.pluck(_.dropWhile(users, { 'user': 'barney', 'active': false }), 'user');
  	     * // => ['fred', 'pebbles']
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.pluck(_.dropWhile(users, 'active', false), 'user');
  	     * // => ['pebbles']
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.pluck(_.dropWhile(users, 'active'), 'user');
  	     * // => ['barney', 'fred', 'pebbles']
  	     */
  	    function dropWhile(array, predicate, thisArg) {
  	      return (array && array.length)
  	        ? baseWhile(array, getCallback(predicate, thisArg, 3), true)
  	        : [];
  	    }
  
  	    /**
  	     * Fills elements of `array` with `value` from `start` up to, but not
  	     * including, `end`.
  	     *
  	     * **Note:** This method mutates `array`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to fill.
  	     * @param {*} value The value to fill `array` with.
  	     * @param {number} [start=0] The start position.
  	     * @param {number} [end=array.length] The end position.
  	     * @returns {Array} Returns `array`.
  	     * @example
  	     *
  	     * var array = [1, 2, 3];
  	     *
  	     * _.fill(array, 'a');
  	     * console.log(array);
  	     * // => ['a', 'a', 'a']
  	     *
  	     * _.fill(Array(3), 2);
  	     * // => [2, 2, 2]
  	     *
  	     * _.fill([4, 6, 8], '*', 1, 2);
  	     * // => [4, '*', 8]
  	     */
  	    function fill(array, value, start, end) {
  	      var length = array ? array.length : 0;
  	      if (!length) {
  	        return [];
  	      }
  	      if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {
  	        start = 0;
  	        end = length;
  	      }
  	      return baseFill(array, value, start, end);
  	    }
  
  	    /**
  	     * This method is like `_.find` except that it returns the index of the first
  	     * element `predicate` returns truthy for instead of the element itself.
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to search.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {number} Returns the index of the found element, else `-1`.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney',  'active': false },
  	     *   { 'user': 'fred',    'active': false },
  	     *   { 'user': 'pebbles', 'active': true }
  	     * ];
  	     *
  	     * _.findIndex(users, function(chr) {
  	     *   return chr.user == 'barney';
  	     * });
  	     * // => 0
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.findIndex(users, { 'user': 'fred', 'active': false });
  	     * // => 1
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.findIndex(users, 'active', false);
  	     * // => 0
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.findIndex(users, 'active');
  	     * // => 2
  	     */
  	    var findIndex = createFindIndex();
  
  	    /**
  	     * This method is like `_.findIndex` except that it iterates over elements
  	     * of `collection` from right to left.
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to search.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {number} Returns the index of the found element, else `-1`.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney',  'active': true },
  	     *   { 'user': 'fred',    'active': false },
  	     *   { 'user': 'pebbles', 'active': false }
  	     * ];
  	     *
  	     * _.findLastIndex(users, function(chr) {
  	     *   return chr.user == 'pebbles';
  	     * });
  	     * // => 2
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.findLastIndex(users, { 'user': 'barney', 'active': true });
  	     * // => 0
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.findLastIndex(users, 'active', false);
  	     * // => 2
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.findLastIndex(users, 'active');
  	     * // => 0
  	     */
  	    var findLastIndex = createFindIndex(true);
  
  	    /**
  	     * Gets the first element of `array`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias head
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @returns {*} Returns the first element of `array`.
  	     * @example
  	     *
  	     * _.first([1, 2, 3]);
  	     * // => 1
  	     *
  	     * _.first([]);
  	     * // => undefined
  	     */
  	    function first(array) {
  	      return array ? array[0] : undefined;
  	    }
  
  	    /**
  	     * Flattens a nested array. If `isDeep` is `true` the array is recursively
  	     * flattened, otherwise it is only flattened a single level.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to flatten.
  	     * @param {boolean} [isDeep] Specify a deep flatten.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Array} Returns the new flattened array.
  	     * @example
  	     *
  	     * _.flatten([1, [2, 3, [4]]]);
  	     * // => [1, 2, 3, [4]]
  	     *
  	     * // using `isDeep`
  	     * _.flatten([1, [2, 3, [4]]], true);
  	     * // => [1, 2, 3, 4]
  	     */
  	    function flatten(array, isDeep, guard) {
  	      var length = array ? array.length : 0;
  	      if (guard && isIterateeCall(array, isDeep, guard)) {
  	        isDeep = false;
  	      }
  	      return length ? baseFlatten(array, isDeep) : [];
  	    }
  
  	    /**
  	     * Recursively flattens a nested array.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to recursively flatten.
  	     * @returns {Array} Returns the new flattened array.
  	     * @example
  	     *
  	     * _.flattenDeep([1, [2, 3, [4]]]);
  	     * // => [1, 2, 3, 4]
  	     */
  	    function flattenDeep(array) {
  	      var length = array ? array.length : 0;
  	      return length ? baseFlatten(array, true) : [];
  	    }
  
  	    /**
  	     * Gets the index at which the first occurrence of `value` is found in `array`
  	     * using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
  	     * for equality comparisons. If `fromIndex` is negative, it is used as the offset
  	     * from the end of `array`. If `array` is sorted providing `true` for `fromIndex`
  	     * performs a faster binary search.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to search.
  	     * @param {*} value The value to search for.
  	     * @param {boolean|number} [fromIndex=0] The index to search from or `true`
  	     *  to perform a binary search on a sorted array.
  	     * @returns {number} Returns the index of the matched value, else `-1`.
  	     * @example
  	     *
  	     * _.indexOf([1, 2, 1, 2], 2);
  	     * // => 1
  	     *
  	     * // using `fromIndex`
  	     * _.indexOf([1, 2, 1, 2], 2, 2);
  	     * // => 3
  	     *
  	     * // performing a binary search
  	     * _.indexOf([1, 1, 2, 2], 2, true);
  	     * // => 2
  	     */
  	    function indexOf(array, value, fromIndex) {
  	      var length = array ? array.length : 0;
  	      if (!length) {
  	        return -1;
  	      }
  	      if (typeof fromIndex == 'number') {
  	        fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : fromIndex;
  	      } else if (fromIndex) {
  	        var index = binaryIndex(array, value);
  	        if (index < length &&
  	            (value === value ? (value === array[index]) : (array[index] !== array[index]))) {
  	          return index;
  	        }
  	        return -1;
  	      }
  	      return baseIndexOf(array, value, fromIndex || 0);
  	    }
  
  	    /**
  	     * Gets all but the last element of `array`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @returns {Array} Returns the slice of `array`.
  	     * @example
  	     *
  	     * _.initial([1, 2, 3]);
  	     * // => [1, 2]
  	     */
  	    function initial(array) {
  	      return dropRight(array, 1);
  	    }
  
  	    /**
  	     * Creates an array of unique values that are included in all of the provided
  	     * arrays using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
  	     * for equality comparisons.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {...Array} [arrays] The arrays to inspect.
  	     * @returns {Array} Returns the new array of shared values.
  	     * @example
  	     * _.intersection([1, 2], [4, 2], [2, 1]);
  	     * // => [2]
  	     */
  	    var intersection = restParam(function(arrays) {
  	      var othLength = arrays.length,
  	          othIndex = othLength,
  	          caches = Array(length),
  	          indexOf = getIndexOf(),
  	          isCommon = indexOf == baseIndexOf,
  	          result = [];
  
  	      while (othIndex--) {
  	        var value = arrays[othIndex] = isArrayLike(value = arrays[othIndex]) ? value : [];
  	        caches[othIndex] = (isCommon && value.length >= 120) ? createCache(othIndex && value) : null;
  	      }
  	      var array = arrays[0],
  	          index = -1,
  	          length = array ? array.length : 0,
  	          seen = caches[0];
  
  	      outer:
  	      while (++index < length) {
  	        value = array[index];
  	        if ((seen ? cacheIndexOf(seen, value) : indexOf(result, value, 0)) < 0) {
  	          var othIndex = othLength;
  	          while (--othIndex) {
  	            var cache = caches[othIndex];
  	            if ((cache ? cacheIndexOf(cache, value) : indexOf(arrays[othIndex], value, 0)) < 0) {
  	              continue outer;
  	            }
  	          }
  	          if (seen) {
  	            seen.push(value);
  	          }
  	          result.push(value);
  	        }
  	      }
  	      return result;
  	    });
  
  	    /**
  	     * Gets the last element of `array`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @returns {*} Returns the last element of `array`.
  	     * @example
  	     *
  	     * _.last([1, 2, 3]);
  	     * // => 3
  	     */
  	    function last(array) {
  	      var length = array ? array.length : 0;
  	      return length ? array[length - 1] : undefined;
  	    }
  
  	    /**
  	     * This method is like `_.indexOf` except that it iterates over elements of
  	     * `array` from right to left.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to search.
  	     * @param {*} value The value to search for.
  	     * @param {boolean|number} [fromIndex=array.length-1] The index to search from
  	     *  or `true` to perform a binary search on a sorted array.
  	     * @returns {number} Returns the index of the matched value, else `-1`.
  	     * @example
  	     *
  	     * _.lastIndexOf([1, 2, 1, 2], 2);
  	     * // => 3
  	     *
  	     * // using `fromIndex`
  	     * _.lastIndexOf([1, 2, 1, 2], 2, 2);
  	     * // => 1
  	     *
  	     * // performing a binary search
  	     * _.lastIndexOf([1, 1, 2, 2], 2, true);
  	     * // => 3
  	     */
  	    function lastIndexOf(array, value, fromIndex) {
  	      var length = array ? array.length : 0;
  	      if (!length) {
  	        return -1;
  	      }
  	      var index = length;
  	      if (typeof fromIndex == 'number') {
  	        index = (fromIndex < 0 ? nativeMax(length + fromIndex, 0) : nativeMin(fromIndex || 0, length - 1)) + 1;
  	      } else if (fromIndex) {
  	        index = binaryIndex(array, value, true) - 1;
  	        var other = array[index];
  	        if (value === value ? (value === other) : (other !== other)) {
  	          return index;
  	        }
  	        return -1;
  	      }
  	      if (value !== value) {
  	        return indexOfNaN(array, index, true);
  	      }
  	      while (index--) {
  	        if (array[index] === value) {
  	          return index;
  	        }
  	      }
  	      return -1;
  	    }
  
  	    /**
  	     * Removes all provided values from `array` using
  	     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
  	     * for equality comparisons.
  	     *
  	     * **Note:** Unlike `_.without`, this method mutates `array`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to modify.
  	     * @param {...*} [values] The values to remove.
  	     * @returns {Array} Returns `array`.
  	     * @example
  	     *
  	     * var array = [1, 2, 3, 1, 2, 3];
  	     *
  	     * _.pull(array, 2, 3);
  	     * console.log(array);
  	     * // => [1, 1]
  	     */
  	    function pull() {
  	      var args = arguments,
  	          array = args[0];
  
  	      if (!(array && array.length)) {
  	        return array;
  	      }
  	      var index = 0,
  	          indexOf = getIndexOf(),
  	          length = args.length;
  
  	      while (++index < length) {
  	        var fromIndex = 0,
  	            value = args[index];
  
  	        while ((fromIndex = indexOf(array, value, fromIndex)) > -1) {
  	          splice.call(array, fromIndex, 1);
  	        }
  	      }
  	      return array;
  	    }
  
  	    /**
  	     * Removes elements from `array` corresponding to the given indexes and returns
  	     * an array of the removed elements. Indexes may be specified as an array of
  	     * indexes or as individual arguments.
  	     *
  	     * **Note:** Unlike `_.at`, this method mutates `array`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to modify.
  	     * @param {...(number|number[])} [indexes] The indexes of elements to remove,
  	     *  specified as individual indexes or arrays of indexes.
  	     * @returns {Array} Returns the new array of removed elements.
  	     * @example
  	     *
  	     * var array = [5, 10, 15, 20];
  	     * var evens = _.pullAt(array, 1, 3);
  	     *
  	     * console.log(array);
  	     * // => [5, 15]
  	     *
  	     * console.log(evens);
  	     * // => [10, 20]
  	     */
  	    var pullAt = restParam(function(array, indexes) {
  	      indexes = baseFlatten(indexes);
  
  	      var result = baseAt(array, indexes);
  	      basePullAt(array, indexes.sort(baseCompareAscending));
  	      return result;
  	    });
  
  	    /**
  	     * Removes all elements from `array` that `predicate` returns truthy for
  	     * and returns an array of the removed elements. The predicate is bound to
  	     * `thisArg` and invoked with three arguments: (value, index, array).
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * **Note:** Unlike `_.filter`, this method mutates `array`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to modify.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {Array} Returns the new array of removed elements.
  	     * @example
  	     *
  	     * var array = [1, 2, 3, 4];
  	     * var evens = _.remove(array, function(n) {
  	     *   return n % 2 == 0;
  	     * });
  	     *
  	     * console.log(array);
  	     * // => [1, 3]
  	     *
  	     * console.log(evens);
  	     * // => [2, 4]
  	     */
  	    function remove(array, predicate, thisArg) {
  	      var result = [];
  	      if (!(array && array.length)) {
  	        return result;
  	      }
  	      var index = -1,
  	          indexes = [],
  	          length = array.length;
  
  	      predicate = getCallback(predicate, thisArg, 3);
  	      while (++index < length) {
  	        var value = array[index];
  	        if (predicate(value, index, array)) {
  	          result.push(value);
  	          indexes.push(index);
  	        }
  	      }
  	      basePullAt(array, indexes);
  	      return result;
  	    }
  
  	    /**
  	     * Gets all but the first element of `array`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias tail
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @returns {Array} Returns the slice of `array`.
  	     * @example
  	     *
  	     * _.rest([1, 2, 3]);
  	     * // => [2, 3]
  	     */
  	    function rest(array) {
  	      return drop(array, 1);
  	    }
  
  	    /**
  	     * Creates a slice of `array` from `start` up to, but not including, `end`.
  	     *
  	     * **Note:** This method is used instead of `Array#slice` to support node
  	     * lists in IE < 9 and to ensure dense arrays are returned.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to slice.
  	     * @param {number} [start=0] The start position.
  	     * @param {number} [end=array.length] The end position.
  	     * @returns {Array} Returns the slice of `array`.
  	     */
  	    function slice(array, start, end) {
  	      var length = array ? array.length : 0;
  	      if (!length) {
  	        return [];
  	      }
  	      if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {
  	        start = 0;
  	        end = length;
  	      }
  	      return baseSlice(array, start, end);
  	    }
  
  	    /**
  	     * Uses a binary search to determine the lowest index at which `value` should
  	     * be inserted into `array` in order to maintain its sort order. If an iteratee
  	     * function is provided it is invoked for `value` and each element of `array`
  	     * to compute their sort ranking. The iteratee is bound to `thisArg` and
  	     * invoked with one argument; (value).
  	     *
  	     * If a property name is provided for `iteratee` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `iteratee` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The sorted array to inspect.
  	     * @param {*} value The value to evaluate.
  	     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {number} Returns the index at which `value` should be inserted
  	     *  into `array`.
  	     * @example
  	     *
  	     * _.sortedIndex([30, 50], 40);
  	     * // => 1
  	     *
  	     * _.sortedIndex([4, 4, 5, 5], 5);
  	     * // => 2
  	     *
  	     * var dict = { 'data': { 'thirty': 30, 'forty': 40, 'fifty': 50 } };
  	     *
  	     * // using an iteratee function
  	     * _.sortedIndex(['thirty', 'fifty'], 'forty', function(word) {
  	     *   return this.data[word];
  	     * }, dict);
  	     * // => 1
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.sortedIndex([{ 'x': 30 }, { 'x': 50 }], { 'x': 40 }, 'x');
  	     * // => 1
  	     */
  	    var sortedIndex = createSortedIndex();
  
  	    /**
  	     * This method is like `_.sortedIndex` except that it returns the highest
  	     * index at which `value` should be inserted into `array` in order to
  	     * maintain its sort order.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The sorted array to inspect.
  	     * @param {*} value The value to evaluate.
  	     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {number} Returns the index at which `value` should be inserted
  	     *  into `array`.
  	     * @example
  	     *
  	     * _.sortedLastIndex([4, 4, 5, 5], 5);
  	     * // => 4
  	     */
  	    var sortedLastIndex = createSortedIndex(true);
  
  	    /**
  	     * Creates a slice of `array` with `n` elements taken from the beginning.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @param {number} [n=1] The number of elements to take.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Array} Returns the slice of `array`.
  	     * @example
  	     *
  	     * _.take([1, 2, 3]);
  	     * // => [1]
  	     *
  	     * _.take([1, 2, 3], 2);
  	     * // => [1, 2]
  	     *
  	     * _.take([1, 2, 3], 5);
  	     * // => [1, 2, 3]
  	     *
  	     * _.take([1, 2, 3], 0);
  	     * // => []
  	     */
  	    function take(array, n, guard) {
  	      var length = array ? array.length : 0;
  	      if (!length) {
  	        return [];
  	      }
  	      if (guard ? isIterateeCall(array, n, guard) : n == null) {
  	        n = 1;
  	      }
  	      return baseSlice(array, 0, n < 0 ? 0 : n);
  	    }
  
  	    /**
  	     * Creates a slice of `array` with `n` elements taken from the end.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @param {number} [n=1] The number of elements to take.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Array} Returns the slice of `array`.
  	     * @example
  	     *
  	     * _.takeRight([1, 2, 3]);
  	     * // => [3]
  	     *
  	     * _.takeRight([1, 2, 3], 2);
  	     * // => [2, 3]
  	     *
  	     * _.takeRight([1, 2, 3], 5);
  	     * // => [1, 2, 3]
  	     *
  	     * _.takeRight([1, 2, 3], 0);
  	     * // => []
  	     */
  	    function takeRight(array, n, guard) {
  	      var length = array ? array.length : 0;
  	      if (!length) {
  	        return [];
  	      }
  	      if (guard ? isIterateeCall(array, n, guard) : n == null) {
  	        n = 1;
  	      }
  	      n = length - (+n || 0);
  	      return baseSlice(array, n < 0 ? 0 : n);
  	    }
  
  	    /**
  	     * Creates a slice of `array` with elements taken from the end. Elements are
  	     * taken until `predicate` returns falsey. The predicate is bound to `thisArg`
  	     * and invoked with three arguments: (value, index, array).
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {Array} Returns the slice of `array`.
  	     * @example
  	     *
  	     * _.takeRightWhile([1, 2, 3], function(n) {
  	     *   return n > 1;
  	     * });
  	     * // => [2, 3]
  	     *
  	     * var users = [
  	     *   { 'user': 'barney',  'active': true },
  	     *   { 'user': 'fred',    'active': false },
  	     *   { 'user': 'pebbles', 'active': false }
  	     * ];
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.pluck(_.takeRightWhile(users, { 'user': 'pebbles', 'active': false }), 'user');
  	     * // => ['pebbles']
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.pluck(_.takeRightWhile(users, 'active', false), 'user');
  	     * // => ['fred', 'pebbles']
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.pluck(_.takeRightWhile(users, 'active'), 'user');
  	     * // => []
  	     */
  	    function takeRightWhile(array, predicate, thisArg) {
  	      return (array && array.length)
  	        ? baseWhile(array, getCallback(predicate, thisArg, 3), false, true)
  	        : [];
  	    }
  
  	    /**
  	     * Creates a slice of `array` with elements taken from the beginning. Elements
  	     * are taken until `predicate` returns falsey. The predicate is bound to
  	     * `thisArg` and invoked with three arguments: (value, index, array).
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to query.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {Array} Returns the slice of `array`.
  	     * @example
  	     *
  	     * _.takeWhile([1, 2, 3], function(n) {
  	     *   return n < 3;
  	     * });
  	     * // => [1, 2]
  	     *
  	     * var users = [
  	     *   { 'user': 'barney',  'active': false },
  	     *   { 'user': 'fred',    'active': false},
  	     *   { 'user': 'pebbles', 'active': true }
  	     * ];
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.pluck(_.takeWhile(users, { 'user': 'barney', 'active': false }), 'user');
  	     * // => ['barney']
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.pluck(_.takeWhile(users, 'active', false), 'user');
  	     * // => ['barney', 'fred']
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.pluck(_.takeWhile(users, 'active'), 'user');
  	     * // => []
  	     */
  	    function takeWhile(array, predicate, thisArg) {
  	      return (array && array.length)
  	        ? baseWhile(array, getCallback(predicate, thisArg, 3))
  	        : [];
  	    }
  
  	    /**
  	     * Creates an array of unique values, in order, from all of the provided arrays
  	     * using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
  	     * for equality comparisons.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {...Array} [arrays] The arrays to inspect.
  	     * @returns {Array} Returns the new array of combined values.
  	     * @example
  	     *
  	     * _.union([1, 2], [4, 2], [2, 1]);
  	     * // => [1, 2, 4]
  	     */
  	    var union = restParam(function(arrays) {
  	      return baseUniq(baseFlatten(arrays, false, true));
  	    });
  
  	    /**
  	     * Creates a duplicate-free version of an array, using
  	     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
  	     * for equality comparisons, in which only the first occurence of each element
  	     * is kept. Providing `true` for `isSorted` performs a faster search algorithm
  	     * for sorted arrays. If an iteratee function is provided it is invoked for
  	     * each element in the array to generate the criterion by which uniqueness
  	     * is computed. The `iteratee` is bound to `thisArg` and invoked with three
  	     * arguments: (value, index, array).
  	     *
  	     * If a property name is provided for `iteratee` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `iteratee` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias unique
  	     * @category Array
  	     * @param {Array} array The array to inspect.
  	     * @param {boolean} [isSorted] Specify the array is sorted.
  	     * @param {Function|Object|string} [iteratee] The function invoked per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Array} Returns the new duplicate-value-free array.
  	     * @example
  	     *
  	     * _.uniq([2, 1, 2]);
  	     * // => [2, 1]
  	     *
  	     * // using `isSorted`
  	     * _.uniq([1, 1, 2], true);
  	     * // => [1, 2]
  	     *
  	     * // using an iteratee function
  	     * _.uniq([1, 2.5, 1.5, 2], function(n) {
  	     *   return this.floor(n);
  	     * }, Math);
  	     * // => [1, 2.5]
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.uniq([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');
  	     * // => [{ 'x': 1 }, { 'x': 2 }]
  	     */
  	    function uniq(array, isSorted, iteratee, thisArg) {
  	      var length = array ? array.length : 0;
  	      if (!length) {
  	        return [];
  	      }
  	      if (isSorted != null && typeof isSorted != 'boolean') {
  	        thisArg = iteratee;
  	        iteratee = isIterateeCall(array, isSorted, thisArg) ? undefined : isSorted;
  	        isSorted = false;
  	      }
  	      var callback = getCallback();
  	      if (!(iteratee == null && callback === baseCallback)) {
  	        iteratee = callback(iteratee, thisArg, 3);
  	      }
  	      return (isSorted && getIndexOf() == baseIndexOf)
  	        ? sortedUniq(array, iteratee)
  	        : baseUniq(array, iteratee);
  	    }
  
  	    /**
  	     * This method is like `_.zip` except that it accepts an array of grouped
  	     * elements and creates an array regrouping the elements to their pre-zip
  	     * configuration.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array of grouped elements to process.
  	     * @returns {Array} Returns the new array of regrouped elements.
  	     * @example
  	     *
  	     * var zipped = _.zip(['fred', 'barney'], [30, 40], [true, false]);
  	     * // => [['fred', 30, true], ['barney', 40, false]]
  	     *
  	     * _.unzip(zipped);
  	     * // => [['fred', 'barney'], [30, 40], [true, false]]
  	     */
  	    function unzip(array) {
  	      if (!(array && array.length)) {
  	        return [];
  	      }
  	      var index = -1,
  	          length = 0;
  
  	      array = arrayFilter(array, function(group) {
  	        if (isArrayLike(group)) {
  	          length = nativeMax(group.length, length);
  	          return true;
  	        }
  	      });
  	      var result = Array(length);
  	      while (++index < length) {
  	        result[index] = arrayMap(array, baseProperty(index));
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * This method is like `_.unzip` except that it accepts an iteratee to specify
  	     * how regrouped values should be combined. The `iteratee` is bound to `thisArg`
  	     * and invoked with four arguments: (accumulator, value, index, group).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array of grouped elements to process.
  	     * @param {Function} [iteratee] The function to combine regrouped values.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @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, thisArg) {
  	      var length = array ? array.length : 0;
  	      if (!length) {
  	        return [];
  	      }
  	      var result = unzip(array);
  	      if (iteratee == null) {
  	        return result;
  	      }
  	      iteratee = bindCallback(iteratee, thisArg, 4);
  	      return arrayMap(result, function(group) {
  	        return arrayReduce(group, iteratee, undefined, true);
  	      });
  	    }
  
  	    /**
  	     * Creates an array excluding all provided values using
  	     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
  	     * for equality comparisons.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {Array} array The array to filter.
  	     * @param {...*} [values] The values to exclude.
  	     * @returns {Array} Returns the new array of filtered values.
  	     * @example
  	     *
  	     * _.without([1, 2, 1, 3], 1, 2);
  	     * // => [3]
  	     */
  	    var without = restParam(function(array, values) {
  	      return isArrayLike(array)
  	        ? baseDifference(array, values)
  	        : [];
  	    });
  
  	    /**
  	     * Creates an array of unique values that is the [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)
  	     * of the provided arrays.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {...Array} [arrays] The arrays to inspect.
  	     * @returns {Array} Returns the new array of values.
  	     * @example
  	     *
  	     * _.xor([1, 2], [4, 2]);
  	     * // => [1, 4]
  	     */
  	    function xor() {
  	      var index = -1,
  	          length = arguments.length;
  
  	      while (++index < length) {
  	        var array = arguments[index];
  	        if (isArrayLike(array)) {
  	          var result = result
  	            ? arrayPush(baseDifference(result, array), baseDifference(array, result))
  	            : array;
  	        }
  	      }
  	      return result ? baseUniq(result) : [];
  	    }
  
  	    /**
  	     * Creates an array of grouped elements, the first of which contains the first
  	     * elements of the given arrays, the second of which contains the second elements
  	     * of the given arrays, and so on.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {...Array} [arrays] The arrays to process.
  	     * @returns {Array} Returns the new array of grouped elements.
  	     * @example
  	     *
  	     * _.zip(['fred', 'barney'], [30, 40], [true, false]);
  	     * // => [['fred', 30, true], ['barney', 40, false]]
  	     */
  	    var zip = restParam(unzip);
  
  	    /**
  	     * The inverse of `_.pairs`; this method returns an object composed from arrays
  	     * of property names and values. Provide either a single two dimensional array,
  	     * e.g. `[[key1, value1], [key2, value2]]` or two arrays, one of property names
  	     * and one of corresponding values.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias object
  	     * @category Array
  	     * @param {Array} props The property names.
  	     * @param {Array} [values=[]] The property values.
  	     * @returns {Object} Returns the new object.
  	     * @example
  	     *
  	     * _.zipObject([['fred', 30], ['barney', 40]]);
  	     * // => { 'fred': 30, 'barney': 40 }
  	     *
  	     * _.zipObject(['fred', 'barney'], [30, 40]);
  	     * // => { 'fred': 30, 'barney': 40 }
  	     */
  	    function zipObject(props, values) {
  	      var index = -1,
  	          length = props ? props.length : 0,
  	          result = {};
  
  	      if (length && !values && !isArray(props[0])) {
  	        values = [];
  	      }
  	      while (++index < length) {
  	        var key = props[index];
  	        if (values) {
  	          result[key] = values[index];
  	        } else if (key) {
  	          result[key[0]] = key[1];
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * This method is like `_.zip` except that it accepts an iteratee to specify
  	     * how grouped values should be combined. The `iteratee` is bound to `thisArg`
  	     * and invoked with four arguments: (accumulator, value, index, group).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Array
  	     * @param {...Array} [arrays] The arrays to process.
  	     * @param {Function} [iteratee] The function to combine grouped values.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Array} Returns the new array of grouped elements.
  	     * @example
  	     *
  	     * _.zipWith([1, 2], [10, 20], [100, 200], _.add);
  	     * // => [111, 222]
  	     */
  	    var zipWith = restParam(function(arrays) {
  	      var length = arrays.length,
  	          iteratee = length > 2 ? arrays[length - 2] : undefined,
  	          thisArg = length > 1 ? arrays[length - 1] : undefined;
  
  	      if (length > 2 && typeof iteratee == 'function') {
  	        length -= 2;
  	      } else {
  	        iteratee = (length > 1 && typeof thisArg == 'function') ? (--length, thisArg) : undefined;
  	        thisArg = undefined;
  	      }
  	      arrays.length = length;
  	      return unzipWith(arrays, iteratee, thisArg);
  	    });
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Creates a `lodash` object that wraps `value` with explicit method
  	     * chaining enabled.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Chain
  	     * @param {*} value The value to wrap.
  	     * @returns {Object} Returns the new `lodash` wrapper instance.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney',  'age': 36 },
  	     *   { 'user': 'fred',    'age': 40 },
  	     *   { 'user': 'pebbles', 'age': 1 }
  	     * ];
  	     *
  	     * var youngest = _.chain(users)
  	     *   .sortBy('age')
  	     *   .map(function(chr) {
  	     *     return chr.user + ' is ' + chr.age;
  	     *   })
  	     *   .first()
  	     *   .value();
  	     * // => 'pebbles is 1'
  	     */
  	    function chain(value) {
  	      var result = lodash(value);
  	      result.__chain__ = true;
  	      return result;
  	    }
  
  	    /**
  	     * This method invokes `interceptor` and returns `value`. The interceptor is
  	     * bound to `thisArg` and invoked with one argument; (value). The purpose of
  	     * this method is to "tap into" a method chain in order to perform operations
  	     * on intermediate results within the chain.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Chain
  	     * @param {*} value The value to provide to `interceptor`.
  	     * @param {Function} interceptor The function to invoke.
  	     * @param {*} [thisArg] The `this` binding of `interceptor`.
  	     * @returns {*} Returns `value`.
  	     * @example
  	     *
  	     * _([1, 2, 3])
  	     *  .tap(function(array) {
  	     *    array.pop();
  	     *  })
  	     *  .reverse()
  	     *  .value();
  	     * // => [2, 1]
  	     */
  	    function tap(value, interceptor, thisArg) {
  	      interceptor.call(thisArg, value);
  	      return value;
  	    }
  
  	    /**
  	     * This method is like `_.tap` except that it returns the result of `interceptor`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Chain
  	     * @param {*} value The value to provide to `interceptor`.
  	     * @param {Function} interceptor The function to invoke.
  	     * @param {*} [thisArg] The `this` binding of `interceptor`.
  	     * @returns {*} Returns the result of `interceptor`.
  	     * @example
  	     *
  	     * _('  abc  ')
  	     *  .chain()
  	     *  .trim()
  	     *  .thru(function(value) {
  	     *    return [value];
  	     *  })
  	     *  .value();
  	     * // => ['abc']
  	     */
  	    function thru(value, interceptor, thisArg) {
  	      return interceptor.call(thisArg, value);
  	    }
  
  	    /**
  	     * Enables explicit method chaining on the wrapper object.
  	     *
  	     * @name chain
  	     * @memberOf _
  	     * @category Chain
  	     * @returns {Object} Returns the new `lodash` wrapper instance.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'age': 36 },
  	     *   { 'user': 'fred',   'age': 40 }
  	     * ];
  	     *
  	     * // without explicit chaining
  	     * _(users).first();
  	     * // => { 'user': 'barney', 'age': 36 }
  	     *
  	     * // with explicit chaining
  	     * _(users).chain()
  	     *   .first()
  	     *   .pick('user')
  	     *   .value();
  	     * // => { 'user': 'barney' }
  	     */
  	    function wrapperChain() {
  	      return chain(this);
  	    }
  
  	    /**
  	     * Executes the chained sequence and returns the wrapped result.
  	     *
  	     * @name commit
  	     * @memberOf _
  	     * @category Chain
  	     * @returns {Object} Returns the new `lodash` wrapper instance.
  	     * @example
  	     *
  	     * var array = [1, 2];
  	     * var 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__);
  	    }
  
  	    /**
  	     * Creates a new array joining a wrapped array with any additional arrays
  	     * and/or values.
  	     *
  	     * @name concat
  	     * @memberOf _
  	     * @category Chain
  	     * @param {...*} [values] The values to concatenate.
  	     * @returns {Array} Returns the new concatenated array.
  	     * @example
  	     *
  	     * var array = [1];
  	     * var wrapped = _(array).concat(2, [3], [[4]]);
  	     *
  	     * console.log(wrapped.value());
  	     * // => [1, 2, 3, [4]]
  	     *
  	     * console.log(array);
  	     * // => [1]
  	     */
  	    var wrapperConcat = restParam(function(values) {
  	      values = baseFlatten(values);
  	      return this.thru(function(array) {
  	        return arrayConcat(isArray(array) ? array : [toObject(array)], values);
  	      });
  	    });
  
  	    /**
  	     * Creates a clone of the chained sequence planting `value` as the wrapped value.
  	     *
  	     * @name plant
  	     * @memberOf _
  	     * @category Chain
  	     * @returns {Object} Returns the new `lodash` wrapper instance.
  	     * @example
  	     *
  	     * var array = [1, 2];
  	     * var wrapped = _(array).map(function(value) {
  	     *   return Math.pow(value, 2);
  	     * });
  	     *
  	     * var other = [3, 4];
  	     * var otherWrapped = wrapped.plant(other);
  	     *
  	     * otherWrapped.value();
  	     * // => [9, 16]
  	     *
  	     * wrapped.value();
  	     * // => [1, 4]
  	     */
  	    function wrapperPlant(value) {
  	      var result,
  	          parent = this;
  
  	      while (parent instanceof baseLodash) {
  	        var clone = wrapperClone(parent);
  	        if (result) {
  	          previous.__wrapped__ = clone;
  	        } else {
  	          result = clone;
  	        }
  	        var previous = clone;
  	        parent = parent.__wrapped__;
  	      }
  	      previous.__wrapped__ = value;
  	      return result;
  	    }
  
  	    /**
  	     * Reverses the wrapped array so the first element becomes the last, the
  	     * second element becomes the second to last, and so on.
  	     *
  	     * **Note:** This method mutates the wrapped array.
  	     *
  	     * @name reverse
  	     * @memberOf _
  	     * @category Chain
  	     * @returns {Object} Returns the new reversed `lodash` wrapper instance.
  	     * @example
  	     *
  	     * var array = [1, 2, 3];
  	     *
  	     * _(array).reverse().value()
  	     * // => [3, 2, 1]
  	     *
  	     * console.log(array);
  	     * // => [3, 2, 1]
  	     */
  	    function wrapperReverse() {
  	      var value = this.__wrapped__;
  
  	      var interceptor = function(value) {
  	        return (wrapped && wrapped.__dir__ < 0) ? value : value.reverse();
  	      };
  	      if (value instanceof LazyWrapper) {
  	        var wrapped = value;
  	        if (this.__actions__.length) {
  	          wrapped = new LazyWrapper(this);
  	        }
  	        wrapped = wrapped.reverse();
  	        wrapped.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });
  	        return new LodashWrapper(wrapped, this.__chain__);
  	      }
  	      return this.thru(interceptor);
  	    }
  
  	    /**
  	     * Produces the result of coercing the unwrapped value to a string.
  	     *
  	     * @name toString
  	     * @memberOf _
  	     * @category Chain
  	     * @returns {string} Returns the coerced string value.
  	     * @example
  	     *
  	     * _([1, 2, 3]).toString();
  	     * // => '1,2,3'
  	     */
  	    function wrapperToString() {
  	      return (this.value() + '');
  	    }
  
  	    /**
  	     * Executes the chained sequence to extract the unwrapped value.
  	     *
  	     * @name value
  	     * @memberOf _
  	     * @alias run, toJSON, valueOf
  	     * @category Chain
  	     * @returns {*} Returns the resolved unwrapped value.
  	     * @example
  	     *
  	     * _([1, 2, 3]).value();
  	     * // => [1, 2, 3]
  	     */
  	    function wrapperValue() {
  	      return baseWrapperValue(this.__wrapped__, this.__actions__);
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Creates an array of elements corresponding to the given keys, or indexes,
  	     * of `collection`. Keys may be specified as individual arguments or as arrays
  	     * of keys.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {...(number|number[]|string|string[])} [props] The property names
  	     *  or indexes of elements to pick, specified individually or in arrays.
  	     * @returns {Array} Returns the new array of picked elements.
  	     * @example
  	     *
  	     * _.at(['a', 'b', 'c'], [0, 2]);
  	     * // => ['a', 'c']
  	     *
  	     * _.at(['barney', 'fred', 'pebbles'], 0, 2);
  	     * // => ['barney', 'pebbles']
  	     */
  	    var at = restParam(function(collection, props) {
  	      return baseAt(collection, baseFlatten(props));
  	    });
  
  	    /**
  	     * Creates an object composed of keys generated from the results of running
  	     * each element of `collection` through `iteratee`. The corresponding value
  	     * of each key is the number of times the key was returned by `iteratee`.
  	     * The `iteratee` is bound to `thisArg` and invoked with three arguments:
  	     * (value, index|key, collection).
  	     *
  	     * If a property name is provided for `iteratee` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `iteratee` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Object} Returns the composed aggregate object.
  	     * @example
  	     *
  	     * _.countBy([4.3, 6.1, 6.4], function(n) {
  	     *   return Math.floor(n);
  	     * });
  	     * // => { '4': 1, '6': 2 }
  	     *
  	     * _.countBy([4.3, 6.1, 6.4], function(n) {
  	     *   return this.floor(n);
  	     * }, Math);
  	     * // => { '4': 1, '6': 2 }
  	     *
  	     * _.countBy(['one', 'two', 'three'], 'length');
  	     * // => { '3': 2, '5': 1 }
  	     */
  	    var countBy = createAggregator(function(result, value, key) {
  	      hasOwnProperty.call(result, key) ? ++result[key] : (result[key] = 1);
  	    });
  
  	    /**
  	     * Checks if `predicate` returns truthy for **all** elements of `collection`.
  	     * The predicate is bound to `thisArg` and invoked with three arguments:
  	     * (value, index|key, collection).
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias all
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {boolean} Returns `true` if all elements pass the predicate check,
  	     *  else `false`.
  	     * @example
  	     *
  	     * _.every([true, 1, null, 'yes'], Boolean);
  	     * // => false
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'active': false },
  	     *   { 'user': 'fred',   'active': false }
  	     * ];
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.every(users, { 'user': 'barney', 'active': false });
  	     * // => false
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.every(users, 'active', false);
  	     * // => true
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.every(users, 'active');
  	     * // => false
  	     */
  	    function every(collection, predicate, thisArg) {
  	      var func = isArray(collection) ? arrayEvery : baseEvery;
  	      if (thisArg && isIterateeCall(collection, predicate, thisArg)) {
  	        predicate = undefined;
  	      }
  	      if (typeof predicate != 'function' || thisArg !== undefined) {
  	        predicate = getCallback(predicate, thisArg, 3);
  	      }
  	      return func(collection, predicate);
  	    }
  
  	    /**
  	     * Iterates over elements of `collection`, returning an array of all elements
  	     * `predicate` returns truthy for. The predicate is bound to `thisArg` and
  	     * invoked with three arguments: (value, index|key, collection).
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias select
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {Array} Returns the new filtered array.
  	     * @example
  	     *
  	     * _.filter([4, 5, 6], function(n) {
  	     *   return n % 2 == 0;
  	     * });
  	     * // => [4, 6]
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'age': 36, 'active': true },
  	     *   { 'user': 'fred',   'age': 40, 'active': false }
  	     * ];
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.pluck(_.filter(users, { 'age': 36, 'active': true }), 'user');
  	     * // => ['barney']
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.pluck(_.filter(users, 'active', false), 'user');
  	     * // => ['fred']
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.pluck(_.filter(users, 'active'), 'user');
  	     * // => ['barney']
  	     */
  	    function filter(collection, predicate, thisArg) {
  	      var func = isArray(collection) ? arrayFilter : baseFilter;
  	      predicate = getCallback(predicate, thisArg, 3);
  	      return func(collection, predicate);
  	    }
  
  	    /**
  	     * Iterates over elements of `collection`, returning the first element
  	     * `predicate` returns truthy for. The predicate is bound to `thisArg` and
  	     * invoked with three arguments: (value, index|key, collection).
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias detect
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to search.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {*} Returns the matched element, else `undefined`.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney',  'age': 36, 'active': true },
  	     *   { 'user': 'fred',    'age': 40, 'active': false },
  	     *   { 'user': 'pebbles', 'age': 1,  'active': true }
  	     * ];
  	     *
  	     * _.result(_.find(users, function(chr) {
  	     *   return chr.age < 40;
  	     * }), 'user');
  	     * // => 'barney'
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.result(_.find(users, { 'age': 1, 'active': true }), 'user');
  	     * // => 'pebbles'
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.result(_.find(users, 'active', false), 'user');
  	     * // => 'fred'
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.result(_.find(users, 'active'), 'user');
  	     * // => 'barney'
  	     */
  	    var find = createFind(baseEach);
  
  	    /**
  	     * This method is like `_.find` except that it iterates over elements of
  	     * `collection` from right to left.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to search.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {*} Returns the matched element, else `undefined`.
  	     * @example
  	     *
  	     * _.findLast([1, 2, 3, 4], function(n) {
  	     *   return n % 2 == 1;
  	     * });
  	     * // => 3
  	     */
  	    var findLast = createFind(baseEachRight, true);
  
  	    /**
  	     * Performs a deep comparison between each element in `collection` and the
  	     * source object, returning the first element that has equivalent property
  	     * values.
  	     *
  	     * **Note:** This method supports comparing arrays, booleans, `Date` objects,
  	     * numbers, `Object` objects, regexes, and strings. Objects are compared by
  	     * their own, not inherited, enumerable properties. For comparing a single
  	     * own or inherited property value see `_.matchesProperty`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to search.
  	     * @param {Object} source The object of property values to match.
  	     * @returns {*} Returns the matched element, else `undefined`.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'age': 36, 'active': true },
  	     *   { 'user': 'fred',   'age': 40, 'active': false }
  	     * ];
  	     *
  	     * _.result(_.findWhere(users, { 'age': 36, 'active': true }), 'user');
  	     * // => 'barney'
  	     *
  	     * _.result(_.findWhere(users, { 'age': 40, 'active': false }), 'user');
  	     * // => 'fred'
  	     */
  	    function findWhere(collection, source) {
  	      return find(collection, baseMatches(source));
  	    }
  
  	    /**
  	     * Iterates over elements of `collection` invoking `iteratee` for each element.
  	     * The `iteratee` is bound to `thisArg` and invoked with three arguments:
  	     * (value, index|key, collection). Iteratee functions may exit iteration early
  	     * by explicitly returning `false`.
  	     *
  	     * **Note:** As with other "Collections" methods, objects with a "length" property
  	     * are iterated like arrays. To avoid this behavior `_.forIn` or `_.forOwn`
  	     * may be used for object iteration.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias each
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Array|Object|string} Returns `collection`.
  	     * @example
  	     *
  	     * _([1, 2]).forEach(function(n) {
  	     *   console.log(n);
  	     * }).value();
  	     * // => logs each value from left to right and returns the array
  	     *
  	     * _.forEach({ 'a': 1, 'b': 2 }, function(n, key) {
  	     *   console.log(n, key);
  	     * });
  	     * // => logs each value-key pair and returns the object (iteration order is not guaranteed)
  	     */
  	    var forEach = createForEach(arrayEach, baseEach);
  
  	    /**
  	     * This method is like `_.forEach` except that it iterates over elements of
  	     * `collection` from right to left.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias eachRight
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Array|Object|string} Returns `collection`.
  	     * @example
  	     *
  	     * _([1, 2]).forEachRight(function(n) {
  	     *   console.log(n);
  	     * }).value();
  	     * // => logs each value from right to left and returns the array
  	     */
  	    var forEachRight = createForEach(arrayEachRight, baseEachRight);
  
  	    /**
  	     * Creates an object composed of keys generated from the results of running
  	     * each element of `collection` through `iteratee`. The corresponding value
  	     * of each key is an array of the elements responsible for generating the key.
  	     * The `iteratee` is bound to `thisArg` and invoked with three arguments:
  	     * (value, index|key, collection).
  	     *
  	     * If a property name is provided for `iteratee` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `iteratee` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Object} Returns the composed aggregate object.
  	     * @example
  	     *
  	     * _.groupBy([4.2, 6.1, 6.4], function(n) {
  	     *   return Math.floor(n);
  	     * });
  	     * // => { '4': [4.2], '6': [6.1, 6.4] }
  	     *
  	     * _.groupBy([4.2, 6.1, 6.4], function(n) {
  	     *   return this.floor(n);
  	     * }, Math);
  	     * // => { '4': [4.2], '6': [6.1, 6.4] }
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.groupBy(['one', 'two', 'three'], 'length');
  	     * // => { '3': ['one', 'two'], '5': ['three'] }
  	     */
  	    var groupBy = createAggregator(function(result, value, key) {
  	      if (hasOwnProperty.call(result, key)) {
  	        result[key].push(value);
  	      } else {
  	        result[key] = [value];
  	      }
  	    });
  
  	    /**
  	     * Checks if `value` is in `collection` using
  	     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
  	     * for equality comparisons. If `fromIndex` is negative, it is used as the offset
  	     * from the end of `collection`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias contains, include
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to search.
  	     * @param {*} target The value to search for.
  	     * @param {number} [fromIndex=0] The index to search from.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.reduce`.
  	     * @returns {boolean} Returns `true` if a matching element is found, else `false`.
  	     * @example
  	     *
  	     * _.includes([1, 2, 3], 1);
  	     * // => true
  	     *
  	     * _.includes([1, 2, 3], 1, 2);
  	     * // => false
  	     *
  	     * _.includes({ 'user': 'fred', 'age': 40 }, 'fred');
  	     * // => true
  	     *
  	     * _.includes('pebbles', 'eb');
  	     * // => true
  	     */
  	    function includes(collection, target, fromIndex, guard) {
  	      var length = collection ? getLength(collection) : 0;
  	      if (!isLength(length)) {
  	        collection = values(collection);
  	        length = collection.length;
  	      }
  	      if (typeof fromIndex != 'number' || (guard && isIterateeCall(target, fromIndex, guard))) {
  	        fromIndex = 0;
  	      } else {
  	        fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : (fromIndex || 0);
  	      }
  	      return (typeof collection == 'string' || !isArray(collection) && isString(collection))
  	        ? (fromIndex <= length && collection.indexOf(target, fromIndex) > -1)
  	        : (!!length && getIndexOf(collection, target, fromIndex) > -1);
  	    }
  
  	    /**
  	     * Creates an object composed of keys generated from the results of running
  	     * each element of `collection` through `iteratee`. The corresponding value
  	     * of each key is the last element responsible for generating the key. The
  	     * iteratee function is bound to `thisArg` and invoked with three arguments:
  	     * (value, index|key, collection).
  	     *
  	     * If a property name is provided for `iteratee` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `iteratee` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Object} Returns the composed aggregate object.
  	     * @example
  	     *
  	     * var keyData = [
  	     *   { 'dir': 'left', 'code': 97 },
  	     *   { 'dir': 'right', 'code': 100 }
  	     * ];
  	     *
  	     * _.indexBy(keyData, 'dir');
  	     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }
  	     *
  	     * _.indexBy(keyData, function(object) {
  	     *   return String.fromCharCode(object.code);
  	     * });
  	     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
  	     *
  	     * _.indexBy(keyData, function(object) {
  	     *   return this.fromCharCode(object.code);
  	     * }, String);
  	     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
  	     */
  	    var indexBy = createAggregator(function(result, value, key) {
  	      result[key] = value;
  	    });
  
  	    /**
  	     * Invokes the method at `path` 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 `methodName` is a function it is
  	     * invoked for, and `this` bound to, each element in `collection`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Array|Function|string} path The path of the method to invoke or
  	     *  the function invoked per iteration.
  	     * @param {...*} [args] The arguments to invoke the method with.
  	     * @returns {Array} Returns the array of results.
  	     * @example
  	     *
  	     * _.invoke([[5, 1, 7], [3, 2, 1]], 'sort');
  	     * // => [[1, 5, 7], [1, 2, 3]]
  	     *
  	     * _.invoke([123, 456], String.prototype.split, '');
  	     * // => [['1', '2', '3'], ['4', '5', '6']]
  	     */
  	    var invoke = restParam(function(collection, path, args) {
  	      var index = -1,
  	          isFunc = typeof path == 'function',
  	          isProp = isKey(path),
  	          result = isArrayLike(collection) ? Array(collection.length) : [];
  
  	      baseEach(collection, function(value) {
  	        var func = isFunc ? path : ((isProp && value != null) ? value[path] : undefined);
  	        result[++index] = func ? func.apply(value, args) : invokePath(value, path, args);
  	      });
  	      return result;
  	    });
  
  	    /**
  	     * Creates an array of values by running each element in `collection` through
  	     * `iteratee`. The `iteratee` is bound to `thisArg` and invoked with three
  	     * arguments: (value, index|key, collection).
  	     *
  	     * If a property name is provided for `iteratee` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `iteratee` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * Many lodash methods are guarded to work as iteratees for methods like
  	     * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.
  	     *
  	     * The guarded methods are:
  	     * `ary`, `callback`, `chunk`, `clone`, `create`, `curry`, `curryRight`,
  	     * `drop`, `dropRight`, `every`, `fill`, `flatten`, `invert`, `max`, `min`,
  	     * `parseInt`, `slice`, `sortBy`, `take`, `takeRight`, `template`, `trim`,
  	     * `trimLeft`, `trimRight`, `trunc`, `random`, `range`, `sample`, `some`,
  	     * `sum`, `uniq`, and `words`
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias collect
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Array} Returns the new mapped array.
  	     * @example
  	     *
  	     * function timesThree(n) {
  	     *   return n * 3;
  	     * }
  	     *
  	     * _.map([1, 2], timesThree);
  	     * // => [3, 6]
  	     *
  	     * _.map({ 'a': 1, 'b': 2 }, timesThree);
  	     * // => [3, 6] (iteration order is not guaranteed)
  	     *
  	     * var users = [
  	     *   { 'user': 'barney' },
  	     *   { 'user': 'fred' }
  	     * ];
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.map(users, 'user');
  	     * // => ['barney', 'fred']
  	     */
  	    function map(collection, iteratee, thisArg) {
  	      var func = isArray(collection) ? arrayMap : baseMap;
  	      iteratee = getCallback(iteratee, thisArg, 3);
  	      return func(collection, iteratee);
  	    }
  
  	    /**
  	     * Creates an array of elements split into two groups, the first of which
  	     * contains elements `predicate` returns truthy for, while the second of which
  	     * contains elements `predicate` returns falsey for. The predicate is bound
  	     * to `thisArg` and invoked with three arguments: (value, index|key, collection).
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {Array} Returns the array of grouped elements.
  	     * @example
  	     *
  	     * _.partition([1, 2, 3], function(n) {
  	     *   return n % 2;
  	     * });
  	     * // => [[1, 3], [2]]
  	     *
  	     * _.partition([1.2, 2.3, 3.4], function(n) {
  	     *   return this.floor(n) % 2;
  	     * }, Math);
  	     * // => [[1.2, 3.4], [2.3]]
  	     *
  	     * var users = [
  	     *   { 'user': 'barney',  'age': 36, 'active': false },
  	     *   { 'user': 'fred',    'age': 40, 'active': true },
  	     *   { 'user': 'pebbles', 'age': 1,  'active': false }
  	     * ];
  	     *
  	     * var mapper = function(array) {
  	     *   return _.pluck(array, 'user');
  	     * };
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.map(_.partition(users, { 'age': 1, 'active': false }), mapper);
  	     * // => [['pebbles'], ['barney', 'fred']]
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.map(_.partition(users, 'active', false), mapper);
  	     * // => [['barney', 'pebbles'], ['fred']]
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.map(_.partition(users, 'active'), mapper);
  	     * // => [['fred'], ['barney', 'pebbles']]
  	     */
  	    var partition = createAggregator(function(result, value, key) {
  	      result[key ? 0 : 1].push(value);
  	    }, function() { return [[], []]; });
  
  	    /**
  	     * Gets the property value of `path` from all elements in `collection`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Array|string} path The path of the property to pluck.
  	     * @returns {Array} Returns the property values.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'age': 36 },
  	     *   { 'user': 'fred',   'age': 40 }
  	     * ];
  	     *
  	     * _.pluck(users, 'user');
  	     * // => ['barney', 'fred']
  	     *
  	     * var userIndex = _.indexBy(users, 'user');
  	     * _.pluck(userIndex, 'age');
  	     * // => [36, 40] (iteration order is not guaranteed)
  	     */
  	    function pluck(collection, path) {
  	      return map(collection, property(path));
  	    }
  
  	    /**
  	     * Reduces `collection` to a value which is the accumulated result of running
  	     * each element in `collection` through `iteratee`, where each successive
  	     * invocation is supplied the return value of the previous. If `accumulator`
  	     * is not provided the first element of `collection` is used as the initial
  	     * value. The `iteratee` is bound to `thisArg` and invoked with four arguments:
  	     * (accumulator, value, index|key, collection).
  	     *
  	     * Many lodash methods are guarded to work as iteratees for methods like
  	     * `_.reduce`, `_.reduceRight`, and `_.transform`.
  	     *
  	     * The guarded methods are:
  	     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `sortByAll`,
  	     * and `sortByOrder`
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias foldl, inject
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
  	     * @param {*} [accumulator] The initial value.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {*} Returns the accumulated value.
  	     * @example
  	     *
  	     * _.reduce([1, 2], function(total, n) {
  	     *   return total + n;
  	     * });
  	     * // => 3
  	     *
  	     * _.reduce({ 'a': 1, 'b': 2 }, function(result, n, key) {
  	     *   result[key] = n * 3;
  	     *   return result;
  	     * }, {});
  	     * // => { 'a': 3, 'b': 6 } (iteration order is not guaranteed)
  	     */
  	    var reduce = createReduce(arrayReduce, baseEach);
  
  	    /**
  	     * This method is like `_.reduce` except that it iterates over elements of
  	     * `collection` from right to left.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias foldr
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
  	     * @param {*} [accumulator] The initial value.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {*} Returns the accumulated value.
  	     * @example
  	     *
  	     * var array = [[0, 1], [2, 3], [4, 5]];
  	     *
  	     * _.reduceRight(array, function(flattened, other) {
  	     *   return flattened.concat(other);
  	     * }, []);
  	     * // => [4, 5, 2, 3, 0, 1]
  	     */
  	    var reduceRight = createReduce(arrayReduceRight, baseEachRight);
  
  	    /**
  	     * The opposite of `_.filter`; this method returns the elements of `collection`
  	     * that `predicate` does **not** return truthy for.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {Array} Returns the new filtered array.
  	     * @example
  	     *
  	     * _.reject([1, 2, 3, 4], function(n) {
  	     *   return n % 2 == 0;
  	     * });
  	     * // => [1, 3]
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'age': 36, 'active': false },
  	     *   { 'user': 'fred',   'age': 40, 'active': true }
  	     * ];
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.pluck(_.reject(users, { 'age': 40, 'active': true }), 'user');
  	     * // => ['barney']
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.pluck(_.reject(users, 'active', false), 'user');
  	     * // => ['fred']
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.pluck(_.reject(users, 'active'), 'user');
  	     * // => ['barney']
  	     */
  	    function reject(collection, predicate, thisArg) {
  	      var func = isArray(collection) ? arrayFilter : baseFilter;
  	      predicate = getCallback(predicate, thisArg, 3);
  	      return func(collection, function(value, index, collection) {
  	        return !predicate(value, index, collection);
  	      });
  	    }
  
  	    /**
  	     * Gets a random element or `n` random elements from a collection.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to sample.
  	     * @param {number} [n] The number of elements to sample.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {*} Returns the random sample(s).
  	     * @example
  	     *
  	     * _.sample([1, 2, 3, 4]);
  	     * // => 2
  	     *
  	     * _.sample([1, 2, 3, 4], 2);
  	     * // => [3, 1]
  	     */
  	    function sample(collection, n, guard) {
  	      if (guard ? isIterateeCall(collection, n, guard) : n == null) {
  	        collection = toIterable(collection);
  	        var length = collection.length;
  	        return length > 0 ? collection[baseRandom(0, length - 1)] : undefined;
  	      }
  	      var index = -1,
  	          result = toArray(collection),
  	          length = result.length,
  	          lastIndex = length - 1;
  
  	      n = nativeMin(n < 0 ? 0 : (+n || 0), length);
  	      while (++index < n) {
  	        var rand = baseRandom(index, lastIndex),
  	            value = result[rand];
  
  	        result[rand] = result[index];
  	        result[index] = value;
  	      }
  	      result.length = n;
  	      return result;
  	    }
  
  	    /**
  	     * Creates an array of shuffled values, using a version of the
  	     * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to shuffle.
  	     * @returns {Array} Returns the new shuffled array.
  	     * @example
  	     *
  	     * _.shuffle([1, 2, 3, 4]);
  	     * // => [4, 1, 3, 2]
  	     */
  	    function shuffle(collection) {
  	      return sample(collection, POSITIVE_INFINITY);
  	    }
  
  	    /**
  	     * Gets the size of `collection` by returning its length for array-like
  	     * values or the number of own enumerable properties for objects.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to inspect.
  	     * @returns {number} Returns the size of `collection`.
  	     * @example
  	     *
  	     * _.size([1, 2, 3]);
  	     * // => 3
  	     *
  	     * _.size({ 'a': 1, 'b': 2 });
  	     * // => 2
  	     *
  	     * _.size('pebbles');
  	     * // => 7
  	     */
  	    function size(collection) {
  	      var length = collection ? getLength(collection) : 0;
  	      return isLength(length) ? length : keys(collection).length;
  	    }
  
  	    /**
  	     * Checks if `predicate` returns truthy for **any** element of `collection`.
  	     * The function returns as soon as it finds a passing value and does not iterate
  	     * over the entire collection. The predicate is bound to `thisArg` and invoked
  	     * with three arguments: (value, index|key, collection).
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias any
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {boolean} Returns `true` if any element passes the predicate check,
  	     *  else `false`.
  	     * @example
  	     *
  	     * _.some([null, 0, 'yes', false], Boolean);
  	     * // => true
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'active': true },
  	     *   { 'user': 'fred',   'active': false }
  	     * ];
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.some(users, { 'user': 'barney', 'active': false });
  	     * // => false
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.some(users, 'active', false);
  	     * // => true
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.some(users, 'active');
  	     * // => true
  	     */
  	    function some(collection, predicate, thisArg) {
  	      var func = isArray(collection) ? arraySome : baseSome;
  	      if (thisArg && isIterateeCall(collection, predicate, thisArg)) {
  	        predicate = undefined;
  	      }
  	      if (typeof predicate != 'function' || thisArg !== undefined) {
  	        predicate = getCallback(predicate, thisArg, 3);
  	      }
  	      return func(collection, predicate);
  	    }
  
  	    /**
  	     * Creates an array of elements, sorted in ascending order by the results of
  	     * running each element in a collection through `iteratee`. This method performs
  	     * a stable sort, that is, it preserves the original sort order of equal elements.
  	     * The `iteratee` is bound to `thisArg` and invoked with three arguments:
  	     * (value, index|key, collection).
  	     *
  	     * If a property name is provided for `iteratee` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `iteratee` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Array} Returns the new sorted array.
  	     * @example
  	     *
  	     * _.sortBy([1, 2, 3], function(n) {
  	     *   return Math.sin(n);
  	     * });
  	     * // => [3, 1, 2]
  	     *
  	     * _.sortBy([1, 2, 3], function(n) {
  	     *   return this.sin(n);
  	     * }, Math);
  	     * // => [3, 1, 2]
  	     *
  	     * var users = [
  	     *   { 'user': 'fred' },
  	     *   { 'user': 'pebbles' },
  	     *   { 'user': 'barney' }
  	     * ];
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.pluck(_.sortBy(users, 'user'), 'user');
  	     * // => ['barney', 'fred', 'pebbles']
  	     */
  	    function sortBy(collection, iteratee, thisArg) {
  	      if (collection == null) {
  	        return [];
  	      }
  	      if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {
  	        iteratee = undefined;
  	      }
  	      var index = -1;
  	      iteratee = getCallback(iteratee, thisArg, 3);
  
  	      var result = baseMap(collection, function(value, key, collection) {
  	        return { 'criteria': iteratee(value, key, collection), 'index': ++index, 'value': value };
  	      });
  	      return baseSortBy(result, compareAscending);
  	    }
  
  	    /**
  	     * This method is like `_.sortBy` except that it can sort by multiple iteratees
  	     * or property names.
  	     *
  	     * If a property name is provided for an iteratee the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If an object is provided for an iteratee the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {...(Function|Function[]|Object|Object[]|string|string[])} iteratees
  	     *  The iteratees to sort by, specified as individual values or arrays of values.
  	     * @returns {Array} Returns the new sorted array.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'fred',   'age': 48 },
  	     *   { 'user': 'barney', 'age': 36 },
  	     *   { 'user': 'fred',   'age': 42 },
  	     *   { 'user': 'barney', 'age': 34 }
  	     * ];
  	     *
  	     * _.map(_.sortByAll(users, ['user', 'age']), _.values);
  	     * // => [['barney', 34], ['barney', 36], ['fred', 42], ['fred', 48]]
  	     *
  	     * _.map(_.sortByAll(users, 'user', function(chr) {
  	     *   return Math.floor(chr.age / 10);
  	     * }), _.values);
  	     * // => [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 42]]
  	     */
  	    var sortByAll = restParam(function(collection, iteratees) {
  	      if (collection == null) {
  	        return [];
  	      }
  	      var guard = iteratees[2];
  	      if (guard && isIterateeCall(iteratees[0], iteratees[1], guard)) {
  	        iteratees.length = 1;
  	      }
  	      return baseSortByOrder(collection, baseFlatten(iteratees), []);
  	    });
  
  	    /**
  	     * This method is like `_.sortByAll` 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, a value is sorted in
  	     * ascending order if its corresponding order is "asc", and descending if "desc".
  	     *
  	     * If a property name is provided for an iteratee the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If an object is provided for an iteratee the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
  	     * @param {boolean[]} [orders] The sort orders of `iteratees`.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.reduce`.
  	     * @returns {Array} Returns the new sorted array.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'fred',   'age': 48 },
  	     *   { 'user': 'barney', 'age': 34 },
  	     *   { 'user': 'fred',   'age': 42 },
  	     *   { 'user': 'barney', 'age': 36 }
  	     * ];
  	     *
  	     * // sort by `user` in ascending order and by `age` in descending order
  	     * _.map(_.sortByOrder(users, ['user', 'age'], ['asc', 'desc']), _.values);
  	     * // => [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 42]]
  	     */
  	    function sortByOrder(collection, iteratees, orders, guard) {
  	      if (collection == null) {
  	        return [];
  	      }
  	      if (guard && isIterateeCall(iteratees, orders, guard)) {
  	        orders = undefined;
  	      }
  	      if (!isArray(iteratees)) {
  	        iteratees = iteratees == null ? [] : [iteratees];
  	      }
  	      if (!isArray(orders)) {
  	        orders = orders == null ? [] : [orders];
  	      }
  	      return baseSortByOrder(collection, iteratees, orders);
  	    }
  
  	    /**
  	     * Performs a deep comparison between each element in `collection` and the
  	     * source object, returning an array of all elements that have equivalent
  	     * property values.
  	     *
  	     * **Note:** This method supports comparing arrays, booleans, `Date` objects,
  	     * numbers, `Object` objects, regexes, and strings. Objects are compared by
  	     * their own, not inherited, enumerable properties. For comparing a single
  	     * own or inherited property value see `_.matchesProperty`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Collection
  	     * @param {Array|Object|string} collection The collection to search.
  	     * @param {Object} source The object of property values to match.
  	     * @returns {Array} Returns the new filtered array.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'age': 36, 'active': false, 'pets': ['hoppy'] },
  	     *   { 'user': 'fred',   'age': 40, 'active': true, 'pets': ['baby puss', 'dino'] }
  	     * ];
  	     *
  	     * _.pluck(_.where(users, { 'age': 36, 'active': false }), 'user');
  	     * // => ['barney']
  	     *
  	     * _.pluck(_.where(users, { 'pets': ['dino'] }), 'user');
  	     * // => ['fred']
  	     */
  	    function where(collection, source) {
  	      return filter(collection, baseMatches(source));
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Gets the number of milliseconds that have elapsed since the Unix epoch
  	     * (1 January 1970 00:00:00 UTC).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Date
  	     * @example
  	     *
  	     * _.defer(function(stamp) {
  	     *   console.log(_.now() - stamp);
  	     * }, _.now());
  	     * // => logs the number of milliseconds it took for the deferred function to be invoked
  	     */
  	    var now = nativeNow || function() {
  	      return new Date().getTime();
  	    };
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * The opposite of `_.before`; this method creates a function that invokes
  	     * `func` once it is called `n` or more times.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {number} n The number of calls before `func` is invoked.
  	     * @param {Function} func The function to restrict.
  	     * @returns {Function} Returns the new restricted function.
  	     * @example
  	     *
  	     * var saves = ['profile', 'settings'];
  	     *
  	     * var done = _.after(saves.length, function() {
  	     *   console.log('done saving!');
  	     * });
  	     *
  	     * _.forEach(saves, function(type) {
  	     *   asyncSave({ 'type': type, 'complete': done });
  	     * });
  	     * // => logs 'done saving!' after the two async saves have completed
  	     */
  	    function after(n, func) {
  	      if (typeof func != 'function') {
  	        if (typeof n == 'function') {
  	          var temp = n;
  	          n = func;
  	          func = temp;
  	        } else {
  	          throw new TypeError(FUNC_ERROR_TEXT);
  	        }
  	      }
  	      n = nativeIsFinite(n = +n) ? n : 0;
  	      return function() {
  	        if (--n < 1) {
  	          return func.apply(this, arguments);
  	        }
  	      };
  	    }
  
  	    /**
  	     * Creates a function that accepts up to `n` arguments ignoring any
  	     * additional arguments.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to cap arguments for.
  	     * @param {number} [n=func.length] The arity cap.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * _.map(['6', '8', '10'], _.ary(parseInt, 1));
  	     * // => [6, 8, 10]
  	     */
  	    function ary(func, n, guard) {
  	      if (guard && isIterateeCall(func, n, guard)) {
  	        n = undefined;
  	      }
  	      n = (func && n == null) ? func.length : nativeMax(+n || 0, 0);
  	      return createWrapper(func, ARY_FLAG, undefined, undefined, undefined, undefined, n);
  	    }
  
  	    /**
  	     * Creates a function that invokes `func`, with the `this` binding and arguments
  	     * of the created function, while it is called less than `n` times. Subsequent
  	     * calls to the created function return the result of the last `func` invocation.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {number} n The number of calls at which `func` is no longer invoked.
  	     * @param {Function} func The function to restrict.
  	     * @returns {Function} Returns the new restricted function.
  	     * @example
  	     *
  	     * jQuery('#add').on('click', _.before(5, addContactToList));
  	     * // => allows adding up to 4 contacts to the list
  	     */
  	    function before(n, func) {
  	      var result;
  	      if (typeof func != 'function') {
  	        if (typeof n == 'function') {
  	          var temp = n;
  	          n = func;
  	          func = temp;
  	        } else {
  	          throw new TypeError(FUNC_ERROR_TEXT);
  	        }
  	      }
  	      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 prepends any additional `_.bind` arguments to those provided to the
  	     * bound function.
  	     *
  	     * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,
  	     * may be used as a placeholder for partially applied arguments.
  	     *
  	     * **Note:** Unlike native `Function#bind` this method does not set the "length"
  	     * property of bound functions.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to bind.
  	     * @param {*} thisArg The `this` binding of `func`.
  	     * @param {...*} [partials] The arguments to be partially applied.
  	     * @returns {Function} Returns the new bound function.
  	     * @example
  	     *
  	     * var greet = function(greeting, punctuation) {
  	     *   return greeting + ' ' + this.user + punctuation;
  	     * };
  	     *
  	     * var object = { 'user': 'fred' };
  	     *
  	     * var bound = _.bind(greet, object, 'hi');
  	     * bound('!');
  	     * // => 'hi fred!'
  	     *
  	     * // using placeholders
  	     * var bound = _.bind(greet, object, _, '!');
  	     * bound('hi');
  	     * // => 'hi fred!'
  	     */
  	    var bind = restParam(function(func, thisArg, partials) {
  	      var bitmask = BIND_FLAG;
  	      if (partials.length) {
  	        var holders = replaceHolders(partials, bind.placeholder);
  	        bitmask |= PARTIAL_FLAG;
  	      }
  	      return createWrapper(func, bitmask, thisArg, partials, holders);
  	    });
  
  	    /**
  	     * Binds methods of an object to the object itself, overwriting the existing
  	     * method. Method names may be specified as individual arguments or as arrays
  	     * of method names. If no method names are provided all enumerable function
  	     * properties, own and inherited, of `object` are bound.
  	     *
  	     * **Note:** This method does not set the "length" property of bound functions.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Object} object The object to bind and assign the bound methods to.
  	     * @param {...(string|string[])} [methodNames] The object method names to bind,
  	     *  specified as individual method names or arrays of method names.
  	     * @returns {Object} Returns `object`.
  	     * @example
  	     *
  	     * var view = {
  	     *   'label': 'docs',
  	     *   'onClick': function() {
  	     *     console.log('clicked ' + this.label);
  	     *   }
  	     * };
  	     *
  	     * _.bindAll(view);
  	     * jQuery('#docs').on('click', view.onClick);
  	     * // => logs 'clicked docs' when the element is clicked
  	     */
  	    var bindAll = restParam(function(object, methodNames) {
  	      methodNames = methodNames.length ? baseFlatten(methodNames) : functions(object);
  
  	      var index = -1,
  	          length = methodNames.length;
  
  	      while (++index < length) {
  	        var key = methodNames[index];
  	        object[key] = createWrapper(object[key], BIND_FLAG, object);
  	      }
  	      return object;
  	    });
  
  	    /**
  	     * Creates a function that invokes the method at `object[key]` and prepends
  	     * any additional `_.bindKey` arguments to those provided to the bound function.
  	     *
  	     * This method differs from `_.bind` by allowing bound functions to reference
  	     * methods that may be redefined or don't yet exist.
  	     * See [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)
  	     * for more details.
  	     *
  	     * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic
  	     * builds, may be used as a placeholder for partially applied arguments.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Object} object The object the method belongs to.
  	     * @param {string} key The key of the method.
  	     * @param {...*} [partials] The arguments to be partially applied.
  	     * @returns {Function} Returns the new bound function.
  	     * @example
  	     *
  	     * var object = {
  	     *   'user': 'fred',
  	     *   'greet': function(greeting, punctuation) {
  	     *     return greeting + ' ' + this.user + punctuation;
  	     *   }
  	     * };
  	     *
  	     * var bound = _.bindKey(object, 'greet', 'hi');
  	     * bound('!');
  	     * // => 'hi fred!'
  	     *
  	     * object.greet = function(greeting, punctuation) {
  	     *   return greeting + 'ya ' + this.user + punctuation;
  	     * };
  	     *
  	     * bound('!');
  	     * // => 'hiya fred!'
  	     *
  	     * // using placeholders
  	     * var bound = _.bindKey(object, 'greet', _, '!');
  	     * bound('hi');
  	     * // => 'hiya fred!'
  	     */
  	    var bindKey = restParam(function(object, key, partials) {
  	      var bitmask = BIND_FLAG | BIND_KEY_FLAG;
  	      if (partials.length) {
  	        var holders = replaceHolders(partials, bindKey.placeholder);
  	        bitmask |= PARTIAL_FLAG;
  	      }
  	      return createWrapper(key, bitmask, object, partials, holders);
  	    });
  
  	    /**
  	     * Creates a function that accepts one or more arguments of `func` that when
  	     * called either invokes `func` returning its result, if all `func` arguments
  	     * have been provided, or returns a function that accepts one or more of the
  	     * remaining `func` arguments, and so on. The arity of `func` may be specified
  	     * if `func.length` is not sufficient.
  	     *
  	     * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,
  	     * may be used as a placeholder for provided arguments.
  	     *
  	     * **Note:** This method does not set the "length" property of curried functions.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to curry.
  	     * @param {number} [arity=func.length] The arity of `func`.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Function} Returns the new curried function.
  	     * @example
  	     *
  	     * var abc = function(a, b, c) {
  	     *   return [a, b, c];
  	     * };
  	     *
  	     * var curried = _.curry(abc);
  	     *
  	     * curried(1)(2)(3);
  	     * // => [1, 2, 3]
  	     *
  	     * curried(1, 2)(3);
  	     * // => [1, 2, 3]
  	     *
  	     * curried(1, 2, 3);
  	     * // => [1, 2, 3]
  	     *
  	     * // using placeholders
  	     * curried(1)(_, 3)(2);
  	     * // => [1, 2, 3]
  	     */
  	    var curry = createCurry(CURRY_FLAG);
  
  	    /**
  	     * This method is like `_.curry` except that arguments are applied to `func`
  	     * in the manner of `_.partialRight` instead of `_.partial`.
  	     *
  	     * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic
  	     * builds, may be used as a placeholder for provided arguments.
  	     *
  	     * **Note:** This method does not set the "length" property of curried functions.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to curry.
  	     * @param {number} [arity=func.length] The arity of `func`.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Function} Returns the new curried function.
  	     * @example
  	     *
  	     * var abc = function(a, b, c) {
  	     *   return [a, b, c];
  	     * };
  	     *
  	     * var curried = _.curryRight(abc);
  	     *
  	     * curried(3)(2)(1);
  	     * // => [1, 2, 3]
  	     *
  	     * curried(2, 3)(1);
  	     * // => [1, 2, 3]
  	     *
  	     * curried(1, 2, 3);
  	     * // => [1, 2, 3]
  	     *
  	     * // using placeholders
  	     * curried(3)(1, _)(2);
  	     * // => [1, 2, 3]
  	     */
  	    var curryRight = createCurry(CURRY_RIGHT_FLAG);
  
  	    /**
  	     * Creates a 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 invocations. Provide an options object to indicate that `func`
  	     * should be invoked on the leading and/or trailing edge of the `wait` timeout.
  	     * Subsequent calls to the debounced function return the result of the last
  	     * `func` invocation.
  	     *
  	     * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked
  	     * on the trailing edge of the timeout only if the the debounced function is
  	     * invoked more than once during the `wait` timeout.
  	     *
  	     * See [David Corbacho's article](http://drupalmotion.com/article/debounce-and-throttle-visual-explanation)
  	     * for details over the differences between `_.debounce` and `_.throttle`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to debounce.
  	     * @param {number} [wait=0] The number of milliseconds to delay.
  	     * @param {Object} [options] The options object.
  	     * @param {boolean} [options.leading=false] Specify invoking on the leading
  	     *  edge of the timeout.
  	     * @param {number} [options.maxWait] The maximum time `func` is allowed to be
  	     *  delayed before it is invoked.
  	     * @param {boolean} [options.trailing=true] Specify invoking on the trailing
  	     *  edge of the timeout.
  	     * @returns {Function} Returns the new debounced function.
  	     * @example
  	     *
  	     * // avoid costly calculations while the window size is in flux
  	     * jQuery(window).on('resize', _.debounce(calculateLayout, 150));
  	     *
  	     * // invoke `sendMail` when the click event is fired, debouncing subsequent calls
  	     * jQuery('#postbox').on('click', _.debounce(sendMail, 300, {
  	     *   'leading': true,
  	     *   'trailing': false
  	     * }));
  	     *
  	     * // ensure `batchLog` is invoked once after 1 second of debounced calls
  	     * var source = new EventSource('/stream');
  	     * jQuery(source).on('message', _.debounce(batchLog, 250, {
  	     *   'maxWait': 1000
  	     * }));
  	     *
  	     * // cancel a debounced call
  	     * var todoChanges = _.debounce(batchLog, 1000);
  	     * Object.observe(models.todo, todoChanges);
  	     *
  	     * Object.observe(models, function(changes) {
  	     *   if (_.find(changes, { 'user': 'todo', 'type': 'delete'})) {
  	     *     todoChanges.cancel();
  	     *   }
  	     * }, ['delete']);
  	     *
  	     * // ...at some point `models.todo` is changed
  	     * models.todo.completed = true;
  	     *
  	     * // ...before 1 second has passed `models.todo` is deleted
  	     * // which cancels the debounced `todoChanges` call
  	     * delete models.todo;
  	     */
  	    function debounce(func, wait, options) {
  	      var args,
  	          maxTimeoutId,
  	          result,
  	          stamp,
  	          thisArg,
  	          timeoutId,
  	          trailingCall,
  	          lastCalled = 0,
  	          maxWait = false,
  	          trailing = true;
  
  	      if (typeof func != 'function') {
  	        throw new TypeError(FUNC_ERROR_TEXT);
  	      }
  	      wait = wait < 0 ? 0 : (+wait || 0);
  	      if (options === true) {
  	        var leading = true;
  	        trailing = false;
  	      } else if (isObject(options)) {
  	        leading = !!options.leading;
  	        maxWait = 'maxWait' in options && nativeMax(+options.maxWait || 0, wait);
  	        trailing = 'trailing' in options ? !!options.trailing : trailing;
  	      }
  
  	      function cancel() {
  	        if (timeoutId) {
  	          clearTimeout(timeoutId);
  	        }
  	        if (maxTimeoutId) {
  	          clearTimeout(maxTimeoutId);
  	        }
  	        lastCalled = 0;
  	        maxTimeoutId = timeoutId = trailingCall = undefined;
  	      }
  
  	      function complete(isCalled, id) {
  	        if (id) {
  	          clearTimeout(id);
  	        }
  	        maxTimeoutId = timeoutId = trailingCall = undefined;
  	        if (isCalled) {
  	          lastCalled = now();
  	          result = func.apply(thisArg, args);
  	          if (!timeoutId && !maxTimeoutId) {
  	            args = thisArg = undefined;
  	          }
  	        }
  	      }
  
  	      function delayed() {
  	        var remaining = wait - (now() - stamp);
  	        if (remaining <= 0 || remaining > wait) {
  	          complete(trailingCall, maxTimeoutId);
  	        } else {
  	          timeoutId = setTimeout(delayed, remaining);
  	        }
  	      }
  
  	      function maxDelayed() {
  	        complete(trailing, timeoutId);
  	      }
  
  	      function debounced() {
  	        args = arguments;
  	        stamp = now();
  	        thisArg = this;
  	        trailingCall = trailing && (timeoutId || !leading);
  
  	        if (maxWait === false) {
  	          var leadingCall = leading && !timeoutId;
  	        } else {
  	          if (!maxTimeoutId && !leading) {
  	            lastCalled = stamp;
  	          }
  	          var remaining = maxWait - (stamp - lastCalled),
  	              isCalled = remaining <= 0 || remaining > maxWait;
  
  	          if (isCalled) {
  	            if (maxTimeoutId) {
  	              maxTimeoutId = clearTimeout(maxTimeoutId);
  	            }
  	            lastCalled = stamp;
  	            result = func.apply(thisArg, args);
  	          }
  	          else if (!maxTimeoutId) {
  	            maxTimeoutId = setTimeout(maxDelayed, remaining);
  	          }
  	        }
  	        if (isCalled && timeoutId) {
  	          timeoutId = clearTimeout(timeoutId);
  	        }
  	        else if (!timeoutId && wait !== maxWait) {
  	          timeoutId = setTimeout(delayed, wait);
  	        }
  	        if (leadingCall) {
  	          isCalled = true;
  	          result = func.apply(thisArg, args);
  	        }
  	        if (isCalled && !timeoutId && !maxTimeoutId) {
  	          args = thisArg = undefined;
  	        }
  	        return result;
  	      }
  	      debounced.cancel = cancel;
  	      return debounced;
  	    }
  
  	    /**
  	     * Defers invoking the `func` until the current call stack has cleared. Any
  	     * additional arguments are provided to `func` when it is invoked.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to defer.
  	     * @param {...*} [args] The arguments to invoke the function with.
  	     * @returns {number} Returns the timer id.
  	     * @example
  	     *
  	     * _.defer(function(text) {
  	     *   console.log(text);
  	     * }, 'deferred');
  	     * // logs 'deferred' after one or more milliseconds
  	     */
  	    var defer = restParam(function(func, args) {
  	      return baseDelay(func, 1, args);
  	    });
  
  	    /**
  	     * Invokes `func` after `wait` milliseconds. Any additional arguments are
  	     * provided to `func` when it is invoked.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to delay.
  	     * @param {number} wait The number of milliseconds to delay invocation.
  	     * @param {...*} [args] The arguments to invoke the function with.
  	     * @returns {number} Returns the timer id.
  	     * @example
  	     *
  	     * _.delay(function(text) {
  	     *   console.log(text);
  	     * }, 1000, 'later');
  	     * // => logs 'later' after one second
  	     */
  	    var delay = restParam(function(func, wait, args) {
  	      return baseDelay(func, wait, args);
  	    });
  
  	    /**
  	     * Creates a function that returns the result of invoking the provided
  	     * functions with the `this` binding of the created function, where each
  	     * successive invocation is supplied the return value of the previous.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {...Function} [funcs] Functions to invoke.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * function square(n) {
  	     *   return n * n;
  	     * }
  	     *
  	     * var addSquare = _.flow(_.add, square);
  	     * addSquare(1, 2);
  	     * // => 9
  	     */
  	    var flow = createFlow();
  
  	    /**
  	     * This method is like `_.flow` except that it creates a function that
  	     * invokes the provided functions from right to left.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias backflow, compose
  	     * @category Function
  	     * @param {...Function} [funcs] Functions to invoke.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * function square(n) {
  	     *   return n * n;
  	     * }
  	     *
  	     * var addSquare = _.flowRight(square, _.add);
  	     * addSquare(1, 2);
  	     * // => 9
  	     */
  	    var flowRight = createFlow(true);
  
  	    /**
  	     * Creates a function that memoizes the result of `func`. If `resolver` is
  	     * provided it determines the cache key for storing the result based on the
  	     * arguments provided to the memoized function. By default, the first argument
  	     * provided to the memoized function is coerced to a string and used as the
  	     * cache key. The `func` is invoked with the `this` binding of the memoized
  	     * function.
  	     *
  	     * **Note:** The cache is exposed as the `cache` property on the memoized
  	     * function. Its creation may be customized by replacing the `_.memoize.Cache`
  	     * constructor with one whose instances implement the [`Map`](http://ecma-international.org/ecma-262/6.0/#sec-properties-of-the-map-prototype-object)
  	     * method interface of `get`, `has`, and `set`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to have its output memoized.
  	     * @param {Function} [resolver] The function to resolve the cache key.
  	     * @returns {Function} Returns the new memoizing function.
  	     * @example
  	     *
  	     * var upperCase = _.memoize(function(string) {
  	     *   return string.toUpperCase();
  	     * });
  	     *
  	     * upperCase('fred');
  	     * // => 'FRED'
  	     *
  	     * // modifying the result cache
  	     * upperCase.cache.set('fred', 'BARNEY');
  	     * upperCase('fred');
  	     * // => 'BARNEY'
  	     *
  	     * // replacing `_.memoize.Cache`
  	     * var object = { 'user': 'fred' };
  	     * var other = { 'user': 'barney' };
  	     * var identity = _.memoize(_.identity);
  	     *
  	     * identity(object);
  	     * // => { 'user': 'fred' }
  	     * identity(other);
  	     * // => { 'user': 'fred' }
  	     *
  	     * _.memoize.Cache = WeakMap;
  	     * var identity = _.memoize(_.identity);
  	     *
  	     * identity(object);
  	     * // => { 'user': 'fred' }
  	     * identity(other);
  	     * // => { 'user': 'barney' }
  	     */
  	    function memoize(func, resolver) {
  	      if (typeof func != 'function' || (resolver && typeof resolver != 'function')) {
  	        throw new TypeError(FUNC_ERROR_TEXT);
  	      }
  	      var memoized = function() {
  	        var args = arguments,
  	            key = resolver ? resolver.apply(this, args) : args[0],
  	            cache = memoized.cache;
  
  	        if (cache.has(key)) {
  	          return cache.get(key);
  	        }
  	        var result = func.apply(this, args);
  	        memoized.cache = cache.set(key, result);
  	        return result;
  	      };
  	      memoized.cache = new memoize.Cache;
  	      return memoized;
  	    }
  
  	    /**
  	     * Creates a function that runs each argument through a corresponding
  	     * transform function.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to wrap.
  	     * @param {...(Function|Function[])} [transforms] The functions to transform
  	     * arguments, specified as individual functions or arrays of functions.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * function doubled(n) {
  	     *   return n * 2;
  	     * }
  	     *
  	     * function square(n) {
  	     *   return n * n;
  	     * }
  	     *
  	     * var modded = _.modArgs(function(x, y) {
  	     *   return [x, y];
  	     * }, square, doubled);
  	     *
  	     * modded(1, 2);
  	     * // => [1, 4]
  	     *
  	     * modded(5, 10);
  	     * // => [25, 20]
  	     */
  	    var modArgs = restParam(function(func, transforms) {
  	      transforms = baseFlatten(transforms);
  	      if (typeof func != 'function' || !arrayEvery(transforms, baseIsFunction)) {
  	        throw new TypeError(FUNC_ERROR_TEXT);
  	      }
  	      var length = transforms.length;
  	      return restParam(function(args) {
  	        var index = nativeMin(args.length, length);
  	        while (index--) {
  	          args[index] = transforms[index](args[index]);
  	        }
  	        return func.apply(this, args);
  	      });
  	    });
  
  	    /**
  	     * Creates a function that negates the result of the predicate `func`. The
  	     * `func` predicate is invoked with the `this` binding and arguments of the
  	     * created function.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} predicate The predicate to negate.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * function isEven(n) {
  	     *   return n % 2 == 0;
  	     * }
  	     *
  	     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));
  	     * // => [1, 3, 5]
  	     */
  	    function negate(predicate) {
  	      if (typeof predicate != 'function') {
  	        throw new TypeError(FUNC_ERROR_TEXT);
  	      }
  	      return function() {
  	        return !predicate.apply(this, arguments);
  	      };
  	    }
  
  	    /**
  	     * Creates a function that is restricted to invoking `func` once. Repeat calls
  	     * to the function return the value of the first call. The `func` is invoked
  	     * with the `this` binding and arguments of the created function.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to restrict.
  	     * @returns {Function} Returns the new restricted function.
  	     * @example
  	     *
  	     * var initialize = _.once(createApplication);
  	     * initialize();
  	     * initialize();
  	     * // `initialize` invokes `createApplication` once
  	     */
  	    function once(func) {
  	      return before(2, func);
  	    }
  
  	    /**
  	     * Creates a function that invokes `func` with `partial` arguments prepended
  	     * to those provided to the new function. This method is like `_.bind` except
  	     * it does **not** alter the `this` binding.
  	     *
  	     * The `_.partial.placeholder` value, which defaults to `_` in monolithic
  	     * builds, may be used as a placeholder for partially applied arguments.
  	     *
  	     * **Note:** This method does not set the "length" property of partially
  	     * applied functions.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to partially apply arguments to.
  	     * @param {...*} [partials] The arguments to be partially applied.
  	     * @returns {Function} Returns the new partially applied function.
  	     * @example
  	     *
  	     * var greet = function(greeting, name) {
  	     *   return greeting + ' ' + name;
  	     * };
  	     *
  	     * var sayHelloTo = _.partial(greet, 'hello');
  	     * sayHelloTo('fred');
  	     * // => 'hello fred'
  	     *
  	     * // using placeholders
  	     * var greetFred = _.partial(greet, _, 'fred');
  	     * greetFred('hi');
  	     * // => 'hi fred'
  	     */
  	    var partial = createPartial(PARTIAL_FLAG);
  
  	    /**
  	     * This method is like `_.partial` except that partially applied arguments
  	     * are appended to those provided to the new function.
  	     *
  	     * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic
  	     * builds, may be used as a placeholder for partially applied arguments.
  	     *
  	     * **Note:** This method does not set the "length" property of partially
  	     * applied functions.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to partially apply arguments to.
  	     * @param {...*} [partials] The arguments to be partially applied.
  	     * @returns {Function} Returns the new partially applied function.
  	     * @example
  	     *
  	     * var greet = function(greeting, name) {
  	     *   return greeting + ' ' + name;
  	     * };
  	     *
  	     * var greetFred = _.partialRight(greet, 'fred');
  	     * greetFred('hi');
  	     * // => 'hi fred'
  	     *
  	     * // using placeholders
  	     * var sayHelloTo = _.partialRight(greet, 'hello', _);
  	     * sayHelloTo('fred');
  	     * // => 'hello fred'
  	     */
  	    var partialRight = createPartial(PARTIAL_RIGHT_FLAG);
  
  	    /**
  	     * Creates a function that invokes `func` with arguments arranged according
  	     * to the specified indexes where the argument value at the first index is
  	     * provided as the first argument, the argument value at the second index is
  	     * provided as the second argument, and so on.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to rearrange arguments for.
  	     * @param {...(number|number[])} indexes The arranged argument indexes,
  	     *  specified as individual indexes or arrays of indexes.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * var rearged = _.rearg(function(a, b, c) {
  	     *   return [a, b, c];
  	     * }, 2, 0, 1);
  	     *
  	     * rearged('b', 'c', 'a')
  	     * // => ['a', 'b', 'c']
  	     *
  	     * var map = _.rearg(_.map, [1, 0]);
  	     * map(function(n) {
  	     *   return n * 3;
  	     * }, [1, 2, 3]);
  	     * // => [3, 6, 9]
  	     */
  	    var rearg = restParam(function(func, indexes) {
  	      return createWrapper(func, REARG_FLAG, undefined, undefined, undefined, baseFlatten(indexes));
  	    });
  
  	    /**
  	     * Creates a function that invokes `func` with the `this` binding of the
  	     * created function and arguments from `start` and beyond provided as an array.
  	     *
  	     * **Note:** This method is based on the [rest parameter](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions/rest_parameters).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to apply a rest parameter to.
  	     * @param {number} [start=func.length-1] The start position of the rest parameter.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * var say = _.restParam(function(what, names) {
  	     *   return what + ' ' + _.initial(names).join(', ') +
  	     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);
  	     * });
  	     *
  	     * say('hello', 'fred', 'barney', 'pebbles');
  	     * // => 'hello fred, barney, & pebbles'
  	     */
  	    function restParam(func, start) {
  	      if (typeof func != 'function') {
  	        throw new TypeError(FUNC_ERROR_TEXT);
  	      }
  	      start = nativeMax(start === undefined ? (func.length - 1) : (+start || 0), 0);
  	      return function() {
  	        var args = arguments,
  	            index = -1,
  	            length = nativeMax(args.length - start, 0),
  	            rest = Array(length);
  
  	        while (++index < length) {
  	          rest[index] = args[start + index];
  	        }
  	        switch (start) {
  	          case 0: return func.call(this, rest);
  	          case 1: return func.call(this, args[0], rest);
  	          case 2: return func.call(this, args[0], args[1], rest);
  	        }
  	        var otherArgs = Array(start + 1);
  	        index = -1;
  	        while (++index < start) {
  	          otherArgs[index] = args[index];
  	        }
  	        otherArgs[start] = rest;
  	        return func.apply(this, otherArgs);
  	      };
  	    }
  
  	    /**
  	     * Creates a function that invokes `func` with the `this` binding of the created
  	     * function and an array of arguments much like [`Function#apply`](https://es5.github.io/#x15.3.4.3).
  	     *
  	     * **Note:** This method is based on the [spread operator](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Spread_operator).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to spread arguments over.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * var say = _.spread(function(who, what) {
  	     *   return who + ' says ' + what;
  	     * });
  	     *
  	     * say(['fred', 'hello']);
  	     * // => 'fred says hello'
  	     *
  	     * // with a Promise
  	     * var numbers = Promise.all([
  	     *   Promise.resolve(40),
  	     *   Promise.resolve(36)
  	     * ]);
  	     *
  	     * numbers.then(_.spread(function(x, y) {
  	     *   return x + y;
  	     * }));
  	     * // => a Promise of 76
  	     */
  	    function spread(func) {
  	      if (typeof func != 'function') {
  	        throw new TypeError(FUNC_ERROR_TEXT);
  	      }
  	      return function(array) {
  	        return func.apply(this, array);
  	      };
  	    }
  
  	    /**
  	     * Creates a throttled function that only invokes `func` at most once per
  	     * every `wait` milliseconds. The throttled function comes with a `cancel`
  	     * method to cancel delayed invocations. Provide an options object to indicate
  	     * that `func` should be invoked on the leading and/or trailing edge of the
  	     * `wait` timeout. Subsequent calls to the throttled function return the
  	     * result of the last `func` call.
  	     *
  	     * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked
  	     * on the trailing edge of the timeout only if the the throttled function is
  	     * invoked more than once during the `wait` timeout.
  	     *
  	     * See [David Corbacho's article](http://drupalmotion.com/article/debounce-and-throttle-visual-explanation)
  	     * for details over the differences between `_.throttle` and `_.debounce`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {Function} func The function to throttle.
  	     * @param {number} [wait=0] The number of milliseconds to throttle invocations to.
  	     * @param {Object} [options] The options object.
  	     * @param {boolean} [options.leading=true] Specify invoking on the leading
  	     *  edge of the timeout.
  	     * @param {boolean} [options.trailing=true] Specify invoking on the trailing
  	     *  edge of the timeout.
  	     * @returns {Function} Returns the new throttled function.
  	     * @example
  	     *
  	     * // avoid excessively updating the position while scrolling
  	     * jQuery(window).on('scroll', _.throttle(updatePosition, 100));
  	     *
  	     * // invoke `renewToken` when the click event is fired, but not more than once every 5 minutes
  	     * jQuery('.interactive').on('click', _.throttle(renewToken, 300000, {
  	     *   'trailing': false
  	     * }));
  	     *
  	     * // cancel a trailing throttled call
  	     * jQuery(window).on('popstate', throttled.cancel);
  	     */
  	    function throttle(func, wait, options) {
  	      var leading = true,
  	          trailing = true;
  
  	      if (typeof func != 'function') {
  	        throw new TypeError(FUNC_ERROR_TEXT);
  	      }
  	      if (options === false) {
  	        leading = false;
  	      } else if (isObject(options)) {
  	        leading = 'leading' in options ? !!options.leading : leading;
  	        trailing = 'trailing' in options ? !!options.trailing : trailing;
  	      }
  	      return debounce(func, wait, { 'leading': leading, 'maxWait': +wait, 'trailing': trailing });
  	    }
  
  	    /**
  	     * Creates a function that provides `value` to the wrapper function as its
  	     * first argument. Any additional arguments provided to the function are
  	     * appended to those provided to the wrapper function. The wrapper is invoked
  	     * with the `this` binding of the created function.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Function
  	     * @param {*} value The value to wrap.
  	     * @param {Function} wrapper The wrapper function.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * var p = _.wrap(_.escape, function(func, text) {
  	     *   return '<p>' + func(text) + '</p>';
  	     * });
  	     *
  	     * p('fred, barney, & pebbles');
  	     * // => '<p>fred, barney, &amp; pebbles</p>'
  	     */
  	    function wrap(value, wrapper) {
  	      wrapper = wrapper == null ? identity : wrapper;
  	      return createWrapper(wrapper, PARTIAL_FLAG, undefined, [value], []);
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Creates a clone of `value`. If `isDeep` is `true` nested objects are cloned,
  	     * otherwise they are assigned by reference. If `customizer` is provided it is
  	     * invoked to produce the cloned values. If `customizer` returns `undefined`
  	     * cloning is handled by the method instead. The `customizer` is bound to
  	     * `thisArg` and invoked with two argument; (value [, index|key, object]).
  	     *
  	     * **Note:** This method is loosely based on the
  	     * [structured clone algorithm](http://www.w3.org/TR/html5/infrastructure.html#internal-structured-cloning-algorithm).
  	     * The enumerable properties of `arguments` objects and objects created by
  	     * constructors other than `Object` are cloned to plain `Object` objects. An
  	     * empty object is returned for uncloneable values such as functions, DOM nodes,
  	     * Maps, Sets, and WeakMaps.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to clone.
  	     * @param {boolean} [isDeep] Specify a deep clone.
  	     * @param {Function} [customizer] The function to customize cloning values.
  	     * @param {*} [thisArg] The `this` binding of `customizer`.
  	     * @returns {*} Returns the cloned value.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney' },
  	     *   { 'user': 'fred' }
  	     * ];
  	     *
  	     * var shallow = _.clone(users);
  	     * shallow[0] === users[0];
  	     * // => true
  	     *
  	     * var deep = _.clone(users, true);
  	     * deep[0] === users[0];
  	     * // => false
  	     *
  	     * // using a customizer callback
  	     * var el = _.clone(document.body, function(value) {
  	     *   if (_.isElement(value)) {
  	     *     return value.cloneNode(false);
  	     *   }
  	     * });
  	     *
  	     * el === document.body
  	     * // => false
  	     * el.nodeName
  	     * // => BODY
  	     * el.childNodes.length;
  	     * // => 0
  	     */
  	    function clone(value, isDeep, customizer, thisArg) {
  	      if (isDeep && typeof isDeep != 'boolean' && isIterateeCall(value, isDeep, customizer)) {
  	        isDeep = false;
  	      }
  	      else if (typeof isDeep == 'function') {
  	        thisArg = customizer;
  	        customizer = isDeep;
  	        isDeep = false;
  	      }
  	      return typeof customizer == 'function'
  	        ? baseClone(value, isDeep, bindCallback(customizer, thisArg, 1))
  	        : baseClone(value, isDeep);
  	    }
  
  	    /**
  	     * Creates a deep clone of `value`. If `customizer` is provided it is invoked
  	     * to produce the cloned values. If `customizer` returns `undefined` cloning
  	     * is handled by the method instead. The `customizer` is bound to `thisArg`
  	     * and invoked with two argument; (value [, index|key, object]).
  	     *
  	     * **Note:** This method is loosely based on the
  	     * [structured clone algorithm](http://www.w3.org/TR/html5/infrastructure.html#internal-structured-cloning-algorithm).
  	     * The enumerable properties of `arguments` objects and objects created by
  	     * constructors other than `Object` are cloned to plain `Object` objects. An
  	     * empty object is returned for uncloneable values such as functions, DOM nodes,
  	     * Maps, Sets, and WeakMaps.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to deep clone.
  	     * @param {Function} [customizer] The function to customize cloning values.
  	     * @param {*} [thisArg] The `this` binding of `customizer`.
  	     * @returns {*} Returns the deep cloned value.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney' },
  	     *   { 'user': 'fred' }
  	     * ];
  	     *
  	     * var deep = _.cloneDeep(users);
  	     * deep[0] === users[0];
  	     * // => false
  	     *
  	     * // using a customizer callback
  	     * var el = _.cloneDeep(document.body, function(value) {
  	     *   if (_.isElement(value)) {
  	     *     return value.cloneNode(true);
  	     *   }
  	     * });
  	     *
  	     * el === document.body
  	     * // => false
  	     * el.nodeName
  	     * // => BODY
  	     * el.childNodes.length;
  	     * // => 20
  	     */
  	    function cloneDeep(value, customizer, thisArg) {
  	      return typeof customizer == 'function'
  	        ? baseClone(value, true, bindCallback(customizer, thisArg, 1))
  	        : baseClone(value, true);
  	    }
  
  	    /**
  	     * Checks if `value` is greater than `other`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @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`.
  	     * @example
  	     *
  	     * _.gt(3, 1);
  	     * // => true
  	     *
  	     * _.gt(3, 3);
  	     * // => false
  	     *
  	     * _.gt(1, 3);
  	     * // => false
  	     */
  	    function gt(value, other) {
  	      return value > other;
  	    }
  
  	    /**
  	     * Checks if `value` is greater than or equal to `other`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @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`.
  	     * @example
  	     *
  	     * _.gte(3, 1);
  	     * // => true
  	     *
  	     * _.gte(3, 3);
  	     * // => true
  	     *
  	     * _.gte(1, 3);
  	     * // => false
  	     */
  	    function gte(value, other) {
  	      return value >= other;
  	    }
  
  	    /**
  	     * Checks if `value` is classified as an `arguments` object.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
  	     * @example
  	     *
  	     * _.isArguments(function() { return arguments; }());
  	     * // => true
  	     *
  	     * _.isArguments([1, 2, 3]);
  	     * // => false
  	     */
  	    function isArguments(value) {
  	      return isObjectLike(value) && isArrayLike(value) &&
  	        hasOwnProperty.call(value, 'callee') && !propertyIsEnumerable.call(value, 'callee');
  	    }
  
  	    /**
  	     * Checks if `value` is classified as an `Array` object.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
  	     * @example
  	     *
  	     * _.isArray([1, 2, 3]);
  	     * // => true
  	     *
  	     * _.isArray(function() { return arguments; }());
  	     * // => false
  	     */
  	    var isArray = nativeIsArray || function(value) {
  	      return isObjectLike(value) && isLength(value.length) && objToString.call(value) == arrayTag;
  	    };
  
  	    /**
  	     * Checks if `value` is classified as a boolean primitive or object.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
  	     * @example
  	     *
  	     * _.isBoolean(false);
  	     * // => true
  	     *
  	     * _.isBoolean(null);
  	     * // => false
  	     */
  	    function isBoolean(value) {
  	      return value === true || value === false || (isObjectLike(value) && objToString.call(value) == boolTag);
  	    }
  
  	    /**
  	     * Checks if `value` is classified as a `Date` object.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
  	     * @example
  	     *
  	     * _.isDate(new Date);
  	     * // => true
  	     *
  	     * _.isDate('Mon April 23 2012');
  	     * // => false
  	     */
  	    function isDate(value) {
  	      return isObjectLike(value) && objToString.call(value) == dateTag;
  	    }
  
  	    /**
  	     * Checks if `value` is a DOM element.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.
  	     * @example
  	     *
  	     * _.isElement(document.body);
  	     * // => true
  	     *
  	     * _.isElement('<body>');
  	     * // => false
  	     */
  	    function isElement(value) {
  	      return !!value && value.nodeType === 1 && isObjectLike(value) && !isPlainObject(value);
  	    }
  
  	    /**
  	     * Checks if `value` is empty. A value is considered empty unless it is an
  	     * `arguments` object, array, string, or jQuery-like collection with a length
  	     * greater than `0` or an object with own enumerable properties.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {Array|Object|string} value The value to inspect.
  	     * @returns {boolean} Returns `true` if `value` is empty, else `false`.
  	     * @example
  	     *
  	     * _.isEmpty(null);
  	     * // => true
  	     *
  	     * _.isEmpty(true);
  	     * // => true
  	     *
  	     * _.isEmpty(1);
  	     * // => true
  	     *
  	     * _.isEmpty([1, 2, 3]);
  	     * // => false
  	     *
  	     * _.isEmpty({ 'a': 1 });
  	     * // => false
  	     */
  	    function isEmpty(value) {
  	      if (value == null) {
  	        return true;
  	      }
  	      if (isArrayLike(value) && (isArray(value) || isString(value) || isArguments(value) ||
  	          (isObjectLike(value) && isFunction(value.splice)))) {
  	        return !value.length;
  	      }
  	      return !keys(value).length;
  	    }
  
  	    /**
  	     * Performs a deep comparison between two values to determine if they are
  	     * equivalent. If `customizer` is provided it is invoked to compare values.
  	     * If `customizer` returns `undefined` comparisons are handled by the method
  	     * instead. The `customizer` is bound to `thisArg` and invoked with three
  	     * arguments: (value, other [, index|key]).
  	     *
  	     * **Note:** This method supports comparing arrays, booleans, `Date` objects,
  	     * numbers, `Object` objects, regexes, and strings. Objects are compared by
  	     * their own, not inherited, enumerable properties. Functions and DOM nodes
  	     * are **not** supported. Provide a customizer function to extend support
  	     * for comparing other values.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias eq
  	     * @category Lang
  	     * @param {*} value The value to compare.
  	     * @param {*} other The other value to compare.
  	     * @param {Function} [customizer] The function to customize value comparisons.
  	     * @param {*} [thisArg] The `this` binding of `customizer`.
  	     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
  	     * @example
  	     *
  	     * var object = { 'user': 'fred' };
  	     * var other = { 'user': 'fred' };
  	     *
  	     * object == other;
  	     * // => false
  	     *
  	     * _.isEqual(object, other);
  	     * // => true
  	     *
  	     * // using a customizer callback
  	     * var array = ['hello', 'goodbye'];
  	     * var other = ['hi', 'goodbye'];
  	     *
  	     * _.isEqual(array, other, function(value, other) {
  	     *   if (_.every([value, other], RegExp.prototype.test, /^h(?:i|ello)$/)) {
  	     *     return true;
  	     *   }
  	     * });
  	     * // => true
  	     */
  	    function isEqual(value, other, customizer, thisArg) {
  	      customizer = typeof customizer == 'function' ? bindCallback(customizer, thisArg, 3) : undefined;
  	      var result = customizer ? customizer(value, other) : undefined;
  	      return  result === undefined ? baseIsEqual(value, other, customizer) : !!result;
  	    }
  
  	    /**
  	     * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,
  	     * `SyntaxError`, `TypeError`, or `URIError` object.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is an error object, else `false`.
  	     * @example
  	     *
  	     * _.isError(new Error);
  	     * // => true
  	     *
  	     * _.isError(Error);
  	     * // => false
  	     */
  	    function isError(value) {
  	      return isObjectLike(value) && typeof value.message == 'string' && objToString.call(value) == errorTag;
  	    }
  
  	    /**
  	     * Checks if `value` is a finite primitive number.
  	     *
  	     * **Note:** This method is based on [`Number.isFinite`](http://ecma-international.org/ecma-262/6.0/#sec-number.isfinite).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.
  	     * @example
  	     *
  	     * _.isFinite(10);
  	     * // => true
  	     *
  	     * _.isFinite('10');
  	     * // => false
  	     *
  	     * _.isFinite(true);
  	     * // => false
  	     *
  	     * _.isFinite(Object(10));
  	     * // => false
  	     *
  	     * _.isFinite(Infinity);
  	     * // => false
  	     */
  	    function isFinite(value) {
  	      return typeof value == 'number' && nativeIsFinite(value);
  	    }
  
  	    /**
  	     * Checks if `value` is classified as a `Function` object.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
  	     * @example
  	     *
  	     * _.isFunction(_);
  	     * // => true
  	     *
  	     * _.isFunction(/abc/);
  	     * // => false
  	     */
  	    function isFunction(value) {
  	      // The use of `Object#toString` avoids issues with the `typeof` operator
  	      // in older versions of Chrome and Safari which return 'function' for regexes
  	      // and Safari 8 equivalents which return 'object' for typed array constructors.
  	      return isObject(value) && objToString.call(value) == funcTag;
  	    }
  
  	    /**
  	     * Checks if `value` is the [language type](https://es5.github.io/#x8) of `Object`.
  	     * (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is an object, else `false`.
  	     * @example
  	     *
  	     * _.isObject({});
  	     * // => true
  	     *
  	     * _.isObject([1, 2, 3]);
  	     * // => true
  	     *
  	     * _.isObject(1);
  	     * // => false
  	     */
  	    function isObject(value) {
  	      // Avoid a V8 JIT bug in Chrome 19-20.
  	      // See https://code.google.com/p/v8/issues/detail?id=2291 for more details.
  	      var type = typeof value;
  	      return !!value && (type == 'object' || type == 'function');
  	    }
  
  	    /**
  	     * Performs a deep comparison between `object` and `source` to determine if
  	     * `object` contains equivalent property values. If `customizer` is provided
  	     * it is invoked to compare values. If `customizer` returns `undefined`
  	     * comparisons are handled by the method instead. The `customizer` is bound
  	     * to `thisArg` and invoked with three arguments: (value, other, index|key).
  	     *
  	     * **Note:** This method supports comparing properties of arrays, booleans,
  	     * `Date` objects, numbers, `Object` objects, regexes, and strings. Functions
  	     * and DOM nodes are **not** supported. Provide a customizer function to extend
  	     * support for comparing other values.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {Object} object The object to inspect.
  	     * @param {Object} source The object of property values to match.
  	     * @param {Function} [customizer] The function to customize value comparisons.
  	     * @param {*} [thisArg] The `this` binding of `customizer`.
  	     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
  	     * @example
  	     *
  	     * var object = { 'user': 'fred', 'age': 40 };
  	     *
  	     * _.isMatch(object, { 'age': 40 });
  	     * // => true
  	     *
  	     * _.isMatch(object, { 'age': 36 });
  	     * // => false
  	     *
  	     * // using a customizer callback
  	     * var object = { 'greeting': 'hello' };
  	     * var source = { 'greeting': 'hi' };
  	     *
  	     * _.isMatch(object, source, function(value, other) {
  	     *   return _.every([value, other], RegExp.prototype.test, /^h(?:i|ello)$/) || undefined;
  	     * });
  	     * // => true
  	     */
  	    function isMatch(object, source, customizer, thisArg) {
  	      customizer = typeof customizer == 'function' ? bindCallback(customizer, thisArg, 3) : undefined;
  	      return baseIsMatch(object, getMatchData(source), customizer);
  	    }
  
  	    /**
  	     * Checks if `value` is `NaN`.
  	     *
  	     * **Note:** This method is not the same as [`isNaN`](https://es5.github.io/#x15.1.2.4)
  	     * which returns `true` for `undefined` and other non-numeric values.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
  	     * @example
  	     *
  	     * _.isNaN(NaN);
  	     * // => true
  	     *
  	     * _.isNaN(new Number(NaN));
  	     * // => true
  	     *
  	     * isNaN(undefined);
  	     * // => true
  	     *
  	     * _.isNaN(undefined);
  	     * // => false
  	     */
  	    function isNaN(value) {
  	      // An `NaN` primitive is the only value that is not equal to itself.
  	      // Perform the `toStringTag` check first to avoid errors with some host objects in IE.
  	      return isNumber(value) && value != +value;
  	    }
  
  	    /**
  	     * Checks if `value` is a native function.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is a native function, else `false`.
  	     * @example
  	     *
  	     * _.isNative(Array.prototype.push);
  	     * // => true
  	     *
  	     * _.isNative(_);
  	     * // => false
  	     */
  	    function isNative(value) {
  	      if (value == null) {
  	        return false;
  	      }
  	      if (isFunction(value)) {
  	        return reIsNative.test(fnToString.call(value));
  	      }
  	      return isObjectLike(value) && reIsHostCtor.test(value);
  	    }
  
  	    /**
  	     * Checks if `value` is `null`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is `null`, else `false`.
  	     * @example
  	     *
  	     * _.isNull(null);
  	     * // => true
  	     *
  	     * _.isNull(void 0);
  	     * // => false
  	     */
  	    function isNull(value) {
  	      return value === null;
  	    }
  
  	    /**
  	     * Checks if `value` is classified as a `Number` primitive or object.
  	     *
  	     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are classified
  	     * as numbers, use the `_.isFinite` method.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
  	     * @example
  	     *
  	     * _.isNumber(8.4);
  	     * // => true
  	     *
  	     * _.isNumber(NaN);
  	     * // => true
  	     *
  	     * _.isNumber('8.4');
  	     * // => false
  	     */
  	    function isNumber(value) {
  	      return typeof value == 'number' || (isObjectLike(value) && objToString.call(value) == numberTag);
  	    }
  
  	    /**
  	     * Checks if `value` is a plain object, that is, an object created by the
  	     * `Object` constructor or one with a `[[Prototype]]` of `null`.
  	     *
  	     * **Note:** This method assumes objects created by the `Object` constructor
  	     * have no inherited enumerable properties.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.
  	     * @example
  	     *
  	     * function Foo() {
  	     *   this.a = 1;
  	     * }
  	     *
  	     * _.isPlainObject(new Foo);
  	     * // => false
  	     *
  	     * _.isPlainObject([1, 2, 3]);
  	     * // => false
  	     *
  	     * _.isPlainObject({ 'x': 0, 'y': 0 });
  	     * // => true
  	     *
  	     * _.isPlainObject(Object.create(null));
  	     * // => true
  	     */
  	    function isPlainObject(value) {
  	      var Ctor;
  
  	      // Exit early for non `Object` objects.
  	      if (!(isObjectLike(value) && objToString.call(value) == objectTag && !isArguments(value)) ||
  	          (!hasOwnProperty.call(value, 'constructor') && (Ctor = value.constructor, typeof Ctor == 'function' && !(Ctor instanceof Ctor)))) {
  	        return false;
  	      }
  	      // IE < 9 iterates inherited properties before own properties. If the first
  	      // iterated property is an object's own property then there are no inherited
  	      // enumerable properties.
  	      var result;
  	      // In most environments an object's own properties are iterated before
  	      // its inherited properties. If the last iterated property is an object's
  	      // own property then there are no inherited enumerable properties.
  	      baseForIn(value, function(subValue, key) {
  	        result = key;
  	      });
  	      return result === undefined || hasOwnProperty.call(value, result);
  	    }
  
  	    /**
  	     * Checks if `value` is classified as a `RegExp` object.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
  	     * @example
  	     *
  	     * _.isRegExp(/abc/);
  	     * // => true
  	     *
  	     * _.isRegExp('/abc/');
  	     * // => false
  	     */
  	    function isRegExp(value) {
  	      return isObject(value) && objToString.call(value) == regexpTag;
  	    }
  
  	    /**
  	     * Checks if `value` is classified as a `String` primitive or object.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
  	     * @example
  	     *
  	     * _.isString('abc');
  	     * // => true
  	     *
  	     * _.isString(1);
  	     * // => false
  	     */
  	    function isString(value) {
  	      return typeof value == 'string' || (isObjectLike(value) && objToString.call(value) == stringTag);
  	    }
  
  	    /**
  	     * Checks if `value` is classified as a typed array.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
  	     * @example
  	     *
  	     * _.isTypedArray(new Uint8Array);
  	     * // => true
  	     *
  	     * _.isTypedArray([]);
  	     * // => false
  	     */
  	    function isTypedArray(value) {
  	      return isObjectLike(value) && isLength(value.length) && !!typedArrayTags[objToString.call(value)];
  	    }
  
  	    /**
  	     * Checks if `value` is `undefined`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to check.
  	     * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.
  	     * @example
  	     *
  	     * _.isUndefined(void 0);
  	     * // => true
  	     *
  	     * _.isUndefined(null);
  	     * // => false
  	     */
  	    function isUndefined(value) {
  	      return value === undefined;
  	    }
  
  	    /**
  	     * Checks if `value` is less than `other`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @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`.
  	     * @example
  	     *
  	     * _.lt(1, 3);
  	     * // => true
  	     *
  	     * _.lt(3, 3);
  	     * // => false
  	     *
  	     * _.lt(3, 1);
  	     * // => false
  	     */
  	    function lt(value, other) {
  	      return value < other;
  	    }
  
  	    /**
  	     * Checks if `value` is less than or equal to `other`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @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`.
  	     * @example
  	     *
  	     * _.lte(1, 3);
  	     * // => true
  	     *
  	     * _.lte(3, 3);
  	     * // => true
  	     *
  	     * _.lte(3, 1);
  	     * // => false
  	     */
  	    function lte(value, other) {
  	      return value <= other;
  	    }
  
  	    /**
  	     * Converts `value` to an array.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to convert.
  	     * @returns {Array} Returns the converted array.
  	     * @example
  	     *
  	     * (function() {
  	     *   return _.toArray(arguments).slice(1);
  	     * }(1, 2, 3));
  	     * // => [2, 3]
  	     */
  	    function toArray(value) {
  	      var length = value ? getLength(value) : 0;
  	      if (!isLength(length)) {
  	        return values(value);
  	      }
  	      if (!length) {
  	        return [];
  	      }
  	      return arrayCopy(value);
  	    }
  
  	    /**
  	     * Converts `value` to a plain object flattening inherited enumerable
  	     * properties of `value` to own properties of the plain object.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Lang
  	     * @param {*} value The value to convert.
  	     * @returns {Object} Returns the converted plain object.
  	     * @example
  	     *
  	     * function Foo() {
  	     *   this.b = 2;
  	     * }
  	     *
  	     * Foo.prototype.c = 3;
  	     *
  	     * _.assign({ 'a': 1 }, new Foo);
  	     * // => { 'a': 1, 'b': 2 }
  	     *
  	     * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));
  	     * // => { 'a': 1, 'b': 2, 'c': 3 }
  	     */
  	    function toPlainObject(value) {
  	      return baseCopy(value, keysIn(value));
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Recursively merges own enumerable properties of the source object(s), that
  	     * don't resolve to `undefined` into the destination object. Subsequent sources
  	     * overwrite property assignments of previous sources. If `customizer` is
  	     * provided it is invoked to produce the merged values of the destination and
  	     * source properties. If `customizer` returns `undefined` merging is handled
  	     * by the method instead. The `customizer` is bound to `thisArg` and invoked
  	     * with five arguments: (objectValue, sourceValue, key, object, source).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The destination object.
  	     * @param {...Object} [sources] The source objects.
  	     * @param {Function} [customizer] The function to customize assigned values.
  	     * @param {*} [thisArg] The `this` binding of `customizer`.
  	     * @returns {Object} Returns `object`.
  	     * @example
  	     *
  	     * var users = {
  	     *   'data': [{ 'user': 'barney' }, { 'user': 'fred' }]
  	     * };
  	     *
  	     * var ages = {
  	     *   'data': [{ 'age': 36 }, { 'age': 40 }]
  	     * };
  	     *
  	     * _.merge(users, ages);
  	     * // => { 'data': [{ 'user': 'barney', 'age': 36 }, { 'user': 'fred', 'age': 40 }] }
  	     *
  	     * // using a customizer callback
  	     * var object = {
  	     *   'fruits': ['apple'],
  	     *   'vegetables': ['beet']
  	     * };
  	     *
  	     * var other = {
  	     *   'fruits': ['banana'],
  	     *   'vegetables': ['carrot']
  	     * };
  	     *
  	     * _.merge(object, other, function(a, b) {
  	     *   if (_.isArray(a)) {
  	     *     return a.concat(b);
  	     *   }
  	     * });
  	     * // => { 'fruits': ['apple', 'banana'], 'vegetables': ['beet', 'carrot'] }
  	     */
  	    var merge = createAssigner(baseMerge);
  
  	    /**
  	     * Assigns own enumerable properties of source object(s) to the destination
  	     * object. Subsequent sources overwrite property assignments of previous sources.
  	     * If `customizer` is provided it is invoked to produce the assigned values.
  	     * The `customizer` is bound to `thisArg` and invoked with five arguments:
  	     * (objectValue, sourceValue, key, object, source).
  	     *
  	     * **Note:** This method mutates `object` and is based on
  	     * [`Object.assign`](http://ecma-international.org/ecma-262/6.0/#sec-object.assign).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias extend
  	     * @category Object
  	     * @param {Object} object The destination object.
  	     * @param {...Object} [sources] The source objects.
  	     * @param {Function} [customizer] The function to customize assigned values.
  	     * @param {*} [thisArg] The `this` binding of `customizer`.
  	     * @returns {Object} Returns `object`.
  	     * @example
  	     *
  	     * _.assign({ 'user': 'barney' }, { 'age': 40 }, { 'user': 'fred' });
  	     * // => { 'user': 'fred', 'age': 40 }
  	     *
  	     * // using a customizer callback
  	     * var defaults = _.partialRight(_.assign, function(value, other) {
  	     *   return _.isUndefined(value) ? other : value;
  	     * });
  	     *
  	     * defaults({ 'user': 'barney' }, { 'age': 36 }, { 'user': 'fred' });
  	     * // => { 'user': 'barney', 'age': 36 }
  	     */
  	    var assign = createAssigner(function(object, source, customizer) {
  	      return customizer
  	        ? assignWith(object, source, customizer)
  	        : baseAssign(object, source);
  	    });
  
  	    /**
  	     * Creates an object that inherits from the given `prototype` object. If a
  	     * `properties` object is provided its own enumerable properties are assigned
  	     * to the created object.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} prototype The object to inherit from.
  	     * @param {Object} [properties] The properties to assign to the object.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Object} Returns the new object.
  	     * @example
  	     *
  	     * function Shape() {
  	     *   this.x = 0;
  	     *   this.y = 0;
  	     * }
  	     *
  	     * function Circle() {
  	     *   Shape.call(this);
  	     * }
  	     *
  	     * Circle.prototype = _.create(Shape.prototype, {
  	     *   'constructor': Circle
  	     * });
  	     *
  	     * var circle = new Circle;
  	     * circle instanceof Circle;
  	     * // => true
  	     *
  	     * circle instanceof Shape;
  	     * // => true
  	     */
  	    function create(prototype, properties, guard) {
  	      var result = baseCreate(prototype);
  	      if (guard && isIterateeCall(prototype, properties, guard)) {
  	        properties = undefined;
  	      }
  	      return properties ? baseAssign(result, properties) : result;
  	    }
  
  	    /**
  	     * Assigns own enumerable properties of source object(s) to the destination
  	     * object for all destination properties that resolve to `undefined`. Once a
  	     * property is set, additional values of the same property are ignored.
  	     *
  	     * **Note:** This method mutates `object`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The destination object.
  	     * @param {...Object} [sources] The source objects.
  	     * @returns {Object} Returns `object`.
  	     * @example
  	     *
  	     * _.defaults({ 'user': 'barney' }, { 'age': 36 }, { 'user': 'fred' });
  	     * // => { 'user': 'barney', 'age': 36 }
  	     */
  	    var defaults = createDefaults(assign, assignDefaults);
  
  	    /**
  	     * This method is like `_.defaults` except that it recursively assigns
  	     * default properties.
  	     *
  	     * **Note:** This method mutates `object`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The destination object.
  	     * @param {...Object} [sources] The source objects.
  	     * @returns {Object} Returns `object`.
  	     * @example
  	     *
  	     * _.defaultsDeep({ 'user': { 'name': 'barney' } }, { 'user': { 'name': 'fred', 'age': 36 } });
  	     * // => { 'user': { 'name': 'barney', 'age': 36 } }
  	     *
  	     */
  	    var defaultsDeep = createDefaults(merge, mergeDefaults);
  
  	    /**
  	     * This method is like `_.find` except that it returns the key of the first
  	     * element `predicate` returns truthy for instead of the element itself.
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to search.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {string|undefined} Returns the key of the matched element, else `undefined`.
  	     * @example
  	     *
  	     * var users = {
  	     *   'barney':  { 'age': 36, 'active': true },
  	     *   'fred':    { 'age': 40, 'active': false },
  	     *   'pebbles': { 'age': 1,  'active': true }
  	     * };
  	     *
  	     * _.findKey(users, function(chr) {
  	     *   return chr.age < 40;
  	     * });
  	     * // => 'barney' (iteration order is not guaranteed)
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.findKey(users, { 'age': 1, 'active': true });
  	     * // => 'pebbles'
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.findKey(users, 'active', false);
  	     * // => 'fred'
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.findKey(users, 'active');
  	     * // => 'barney'
  	     */
  	    var findKey = createFindKey(baseForOwn);
  
  	    /**
  	     * This method is like `_.findKey` except that it iterates over elements of
  	     * a collection in the opposite order.
  	     *
  	     * If a property name is provided for `predicate` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `predicate` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to search.
  	     * @param {Function|Object|string} [predicate=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {string|undefined} Returns the key of the matched element, else `undefined`.
  	     * @example
  	     *
  	     * var users = {
  	     *   'barney':  { 'age': 36, 'active': true },
  	     *   'fred':    { 'age': 40, 'active': false },
  	     *   'pebbles': { 'age': 1,  'active': true }
  	     * };
  	     *
  	     * _.findLastKey(users, function(chr) {
  	     *   return chr.age < 40;
  	     * });
  	     * // => returns `pebbles` assuming `_.findKey` returns `barney`
  	     *
  	     * // using the `_.matches` callback shorthand
  	     * _.findLastKey(users, { 'age': 36, 'active': true });
  	     * // => 'barney'
  	     *
  	     * // using the `_.matchesProperty` callback shorthand
  	     * _.findLastKey(users, 'active', false);
  	     * // => 'fred'
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.findLastKey(users, 'active');
  	     * // => 'pebbles'
  	     */
  	    var findLastKey = createFindKey(baseForOwnRight);
  
  	    /**
  	     * Iterates over own and inherited enumerable properties of an object invoking
  	     * `iteratee` for each property. The `iteratee` is bound to `thisArg` and invoked
  	     * with three arguments: (value, key, object). Iteratee functions may exit
  	     * iteration early by explicitly returning `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to iterate over.
  	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Object} Returns `object`.
  	     * @example
  	     *
  	     * function Foo() {
  	     *   this.a = 1;
  	     *   this.b = 2;
  	     * }
  	     *
  	     * Foo.prototype.c = 3;
  	     *
  	     * _.forIn(new Foo, function(value, key) {
  	     *   console.log(key);
  	     * });
  	     * // => logs 'a', 'b', and 'c' (iteration order is not guaranteed)
  	     */
  	    var forIn = createForIn(baseFor);
  
  	    /**
  	     * This method is like `_.forIn` except that it iterates over properties of
  	     * `object` in the opposite order.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to iterate over.
  	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Object} Returns `object`.
  	     * @example
  	     *
  	     * function Foo() {
  	     *   this.a = 1;
  	     *   this.b = 2;
  	     * }
  	     *
  	     * Foo.prototype.c = 3;
  	     *
  	     * _.forInRight(new Foo, function(value, key) {
  	     *   console.log(key);
  	     * });
  	     * // => logs 'c', 'b', and 'a' assuming `_.forIn ` logs 'a', 'b', and 'c'
  	     */
  	    var forInRight = createForIn(baseForRight);
  
  	    /**
  	     * Iterates over own enumerable properties of an object invoking `iteratee`
  	     * for each property. The `iteratee` is bound to `thisArg` and invoked with
  	     * three arguments: (value, key, object). Iteratee functions may exit iteration
  	     * early by explicitly returning `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to iterate over.
  	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Object} Returns `object`.
  	     * @example
  	     *
  	     * function Foo() {
  	     *   this.a = 1;
  	     *   this.b = 2;
  	     * }
  	     *
  	     * Foo.prototype.c = 3;
  	     *
  	     * _.forOwn(new Foo, function(value, key) {
  	     *   console.log(key);
  	     * });
  	     * // => logs 'a' and 'b' (iteration order is not guaranteed)
  	     */
  	    var forOwn = createForOwn(baseForOwn);
  
  	    /**
  	     * This method is like `_.forOwn` except that it iterates over properties of
  	     * `object` in the opposite order.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to iterate over.
  	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Object} Returns `object`.
  	     * @example
  	     *
  	     * function Foo() {
  	     *   this.a = 1;
  	     *   this.b = 2;
  	     * }
  	     *
  	     * Foo.prototype.c = 3;
  	     *
  	     * _.forOwnRight(new Foo, function(value, key) {
  	     *   console.log(key);
  	     * });
  	     * // => logs 'b' and 'a' assuming `_.forOwn` logs 'a' and 'b'
  	     */
  	    var forOwnRight = createForOwn(baseForOwnRight);
  
  	    /**
  	     * Creates an array of function property names from all enumerable properties,
  	     * own and inherited, of `object`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias methods
  	     * @category Object
  	     * @param {Object} object The object to inspect.
  	     * @returns {Array} Returns the new array of property names.
  	     * @example
  	     *
  	     * _.functions(_);
  	     * // => ['after', 'ary', 'assign', ...]
  	     */
  	    function functions(object) {
  	      return baseFunctions(object, keysIn(object));
  	    }
  
  	    /**
  	     * Gets the property value at `path` of `object`. If the resolved value is
  	     * `undefined` the `defaultValue` is used in its place.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to query.
  	     * @param {Array|string} path The path of the property to get.
  	     * @param {*} [defaultValue] The value returned if the resolved value is `undefined`.
  	     * @returns {*} Returns the resolved value.
  	     * @example
  	     *
  	     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
  	     *
  	     * _.get(object, 'a[0].b.c');
  	     * // => 3
  	     *
  	     * _.get(object, ['a', '0', 'b', 'c']);
  	     * // => 3
  	     *
  	     * _.get(object, 'a.b.c', 'default');
  	     * // => 'default'
  	     */
  	    function get(object, path, defaultValue) {
  	      var result = object == null ? undefined : baseGet(object, toPath(path), path + '');
  	      return result === undefined ? defaultValue : result;
  	    }
  
  	    /**
  	     * Checks if `path` is a direct property.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to query.
  	     * @param {Array|string} path The path to check.
  	     * @returns {boolean} Returns `true` if `path` is a direct property, else `false`.
  	     * @example
  	     *
  	     * var object = { 'a': { 'b': { 'c': 3 } } };
  	     *
  	     * _.has(object, 'a');
  	     * // => true
  	     *
  	     * _.has(object, 'a.b.c');
  	     * // => true
  	     *
  	     * _.has(object, ['a', 'b', 'c']);
  	     * // => true
  	     */
  	    function has(object, path) {
  	      if (object == null) {
  	        return false;
  	      }
  	      var result = hasOwnProperty.call(object, path);
  	      if (!result && !isKey(path)) {
  	        path = toPath(path);
  	        object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
  	        if (object == null) {
  	          return false;
  	        }
  	        path = last(path);
  	        result = hasOwnProperty.call(object, path);
  	      }
  	      return result || (isLength(object.length) && isIndex(path, object.length) &&
  	        (isArray(object) || isArguments(object)));
  	    }
  
  	    /**
  	     * Creates an object composed of the inverted keys and values of `object`.
  	     * If `object` contains duplicate values, subsequent values overwrite property
  	     * assignments of previous values unless `multiValue` is `true`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to invert.
  	     * @param {boolean} [multiValue] Allow multiple values per key.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Object} Returns the new inverted object.
  	     * @example
  	     *
  	     * var object = { 'a': 1, 'b': 2, 'c': 1 };
  	     *
  	     * _.invert(object);
  	     * // => { '1': 'c', '2': 'b' }
  	     *
  	     * // with `multiValue`
  	     * _.invert(object, true);
  	     * // => { '1': ['a', 'c'], '2': ['b'] }
  	     */
  	    function invert(object, multiValue, guard) {
  	      if (guard && isIterateeCall(object, multiValue, guard)) {
  	        multiValue = undefined;
  	      }
  	      var index = -1,
  	          props = keys(object),
  	          length = props.length,
  	          result = {};
  
  	      while (++index < length) {
  	        var key = props[index],
  	            value = object[key];
  
  	        if (multiValue) {
  	          if (hasOwnProperty.call(result, value)) {
  	            result[value].push(key);
  	          } else {
  	            result[value] = [key];
  	          }
  	        }
  	        else {
  	          result[value] = key;
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Creates an array of the own enumerable property names of `object`.
  	     *
  	     * **Note:** Non-object values are coerced to objects. See the
  	     * [ES spec](http://ecma-international.org/ecma-262/6.0/#sec-object.keys)
  	     * for more details.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to query.
  	     * @returns {Array} Returns the array of property names.
  	     * @example
  	     *
  	     * function Foo() {
  	     *   this.a = 1;
  	     *   this.b = 2;
  	     * }
  	     *
  	     * Foo.prototype.c = 3;
  	     *
  	     * _.keys(new Foo);
  	     * // => ['a', 'b'] (iteration order is not guaranteed)
  	     *
  	     * _.keys('hi');
  	     * // => ['0', '1']
  	     */
  	    var keys = !nativeKeys ? shimKeys : function(object) {
  	      var Ctor = object == null ? undefined : object.constructor;
  	      if ((typeof Ctor == 'function' && Ctor.prototype === object) ||
  	          (typeof object != 'function' && isArrayLike(object))) {
  	        return shimKeys(object);
  	      }
  	      return isObject(object) ? nativeKeys(object) : [];
  	    };
  
  	    /**
  	     * Creates an array of the own and inherited enumerable property names of `object`.
  	     *
  	     * **Note:** Non-object values are coerced to objects.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to query.
  	     * @returns {Array} Returns the array of property names.
  	     * @example
  	     *
  	     * function Foo() {
  	     *   this.a = 1;
  	     *   this.b = 2;
  	     * }
  	     *
  	     * Foo.prototype.c = 3;
  	     *
  	     * _.keysIn(new Foo);
  	     * // => ['a', 'b', 'c'] (iteration order is not guaranteed)
  	     */
  	    function keysIn(object) {
  	      if (object == null) {
  	        return [];
  	      }
  	      if (!isObject(object)) {
  	        object = Object(object);
  	      }
  	      var length = object.length;
  	      length = (length && isLength(length) &&
  	        (isArray(object) || isArguments(object)) && length) || 0;
  
  	      var Ctor = object.constructor,
  	          index = -1,
  	          isProto = typeof Ctor == 'function' && Ctor.prototype === object,
  	          result = Array(length),
  	          skipIndexes = length > 0;
  
  	      while (++index < length) {
  	        result[index] = (index + '');
  	      }
  	      for (var key in object) {
  	        if (!(skipIndexes && isIndex(key, length)) &&
  	            !(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {
  	          result.push(key);
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * The opposite of `_.mapValues`; this method creates an object with the
  	     * same values as `object` and keys generated by running each own enumerable
  	     * property of `object` through `iteratee`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to iterate over.
  	     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Object} Returns the new mapped object.
  	     * @example
  	     *
  	     * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {
  	     *   return key + value;
  	     * });
  	     * // => { 'a1': 1, 'b2': 2 }
  	     */
  	    var mapKeys = createObjectMapper(true);
  
  	    /**
  	     * Creates an object with the same keys as `object` and values generated by
  	     * running each own enumerable property of `object` through `iteratee`. The
  	     * iteratee function is bound to `thisArg` and invoked with three arguments:
  	     * (value, key, object).
  	     *
  	     * If a property name is provided for `iteratee` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `iteratee` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to iterate over.
  	     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
  	     *  per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Object} Returns the new mapped object.
  	     * @example
  	     *
  	     * _.mapValues({ 'a': 1, 'b': 2 }, function(n) {
  	     *   return n * 3;
  	     * });
  	     * // => { 'a': 3, 'b': 6 }
  	     *
  	     * var users = {
  	     *   'fred':    { 'user': 'fred',    'age': 40 },
  	     *   'pebbles': { 'user': 'pebbles', 'age': 1 }
  	     * };
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.mapValues(users, 'age');
  	     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
  	     */
  	    var mapValues = createObjectMapper();
  
  	    /**
  	     * The opposite of `_.pick`; this method creates an object composed of the
  	     * own and inherited enumerable properties of `object` that are not omitted.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The source object.
  	     * @param {Function|...(string|string[])} [predicate] The function invoked per
  	     *  iteration or property names to omit, specified as individual property
  	     *  names or arrays of property names.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {Object} Returns the new object.
  	     * @example
  	     *
  	     * var object = { 'user': 'fred', 'age': 40 };
  	     *
  	     * _.omit(object, 'age');
  	     * // => { 'user': 'fred' }
  	     *
  	     * _.omit(object, _.isNumber);
  	     * // => { 'user': 'fred' }
  	     */
  	    var omit = restParam(function(object, props) {
  	      if (object == null) {
  	        return {};
  	      }
  	      if (typeof props[0] != 'function') {
  	        var props = arrayMap(baseFlatten(props), String);
  	        return pickByArray(object, baseDifference(keysIn(object), props));
  	      }
  	      var predicate = bindCallback(props[0], props[1], 3);
  	      return pickByCallback(object, function(value, key, object) {
  	        return !predicate(value, key, object);
  	      });
  	    });
  
  	    /**
  	     * Creates a two dimensional array of the key-value pairs for `object`,
  	     * e.g. `[[key1, value1], [key2, value2]]`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to query.
  	     * @returns {Array} Returns the new array of key-value pairs.
  	     * @example
  	     *
  	     * _.pairs({ 'barney': 36, 'fred': 40 });
  	     * // => [['barney', 36], ['fred', 40]] (iteration order is not guaranteed)
  	     */
  	    function pairs(object) {
  	      object = toObject(object);
  
  	      var index = -1,
  	          props = keys(object),
  	          length = props.length,
  	          result = Array(length);
  
  	      while (++index < length) {
  	        var key = props[index];
  	        result[index] = [key, object[key]];
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Creates an object composed of the picked `object` properties. Property
  	     * names may be specified as individual arguments or as arrays of property
  	     * names. If `predicate` is provided it is invoked for each property of `object`
  	     * picking the properties `predicate` returns truthy for. The predicate is
  	     * bound to `thisArg` and invoked with three arguments: (value, key, object).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The source object.
  	     * @param {Function|...(string|string[])} [predicate] The function invoked per
  	     *  iteration or property names to pick, specified as individual property
  	     *  names or arrays of property names.
  	     * @param {*} [thisArg] The `this` binding of `predicate`.
  	     * @returns {Object} Returns the new object.
  	     * @example
  	     *
  	     * var object = { 'user': 'fred', 'age': 40 };
  	     *
  	     * _.pick(object, 'user');
  	     * // => { 'user': 'fred' }
  	     *
  	     * _.pick(object, _.isString);
  	     * // => { 'user': 'fred' }
  	     */
  	    var pick = restParam(function(object, props) {
  	      if (object == null) {
  	        return {};
  	      }
  	      return typeof props[0] == 'function'
  	        ? pickByCallback(object, bindCallback(props[0], props[1], 3))
  	        : pickByArray(object, baseFlatten(props));
  	    });
  
  	    /**
  	     * This method is like `_.get` except that if the resolved value is a function
  	     * it is invoked with the `this` binding of its parent object and its result
  	     * is returned.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to query.
  	     * @param {Array|string} path The path of the property to resolve.
  	     * @param {*} [defaultValue] The value returned if the resolved value is `undefined`.
  	     * @returns {*} Returns the resolved value.
  	     * @example
  	     *
  	     * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };
  	     *
  	     * _.result(object, 'a[0].b.c1');
  	     * // => 3
  	     *
  	     * _.result(object, 'a[0].b.c2');
  	     * // => 4
  	     *
  	     * _.result(object, 'a.b.c', 'default');
  	     * // => 'default'
  	     *
  	     * _.result(object, 'a.b.c', _.constant('default'));
  	     * // => 'default'
  	     */
  	    function result(object, path, defaultValue) {
  	      var result = object == null ? undefined : object[path];
  	      if (result === undefined) {
  	        if (object != null && !isKey(path, object)) {
  	          path = toPath(path);
  	          object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
  	          result = object == null ? undefined : object[last(path)];
  	        }
  	        result = result === undefined ? defaultValue : result;
  	      }
  	      return isFunction(result) ? result.call(object) : result;
  	    }
  
  	    /**
  	     * Sets the property value of `path` on `object`. If a portion of `path`
  	     * does not exist it is created.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to augment.
  	     * @param {Array|string} path The path of the property to set.
  	     * @param {*} value The value to set.
  	     * @returns {Object} Returns `object`.
  	     * @example
  	     *
  	     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
  	     *
  	     * _.set(object, 'a[0].b.c', 4);
  	     * console.log(object.a[0].b.c);
  	     * // => 4
  	     *
  	     * _.set(object, 'x[0].y.z', 5);
  	     * console.log(object.x[0].y.z);
  	     * // => 5
  	     */
  	    function set(object, path, value) {
  	      if (object == null) {
  	        return object;
  	      }
  	      var pathKey = (path + '');
  	      path = (object[pathKey] != null || isKey(path, object)) ? [pathKey] : toPath(path);
  
  	      var index = -1,
  	          length = path.length,
  	          lastIndex = length - 1,
  	          nested = object;
  
  	      while (nested != null && ++index < length) {
  	        var key = path[index];
  	        if (isObject(nested)) {
  	          if (index == lastIndex) {
  	            nested[key] = value;
  	          } else if (nested[key] == null) {
  	            nested[key] = isIndex(path[index + 1]) ? [] : {};
  	          }
  	        }
  	        nested = nested[key];
  	      }
  	      return object;
  	    }
  
  	    /**
  	     * An alternative to `_.reduce`; this method transforms `object` to a new
  	     * `accumulator` object which is the result of running each of its own enumerable
  	     * properties through `iteratee`, with each invocation potentially mutating
  	     * the `accumulator` object. The `iteratee` is bound to `thisArg` and invoked
  	     * with four arguments: (accumulator, value, key, object). Iteratee functions
  	     * may exit iteration early by explicitly returning `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Array|Object} object The object to iterate over.
  	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
  	     * @param {*} [accumulator] The custom accumulator value.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {*} Returns the accumulated value.
  	     * @example
  	     *
  	     * _.transform([2, 3, 4], function(result, n) {
  	     *   result.push(n *= n);
  	     *   return n % 2 == 0;
  	     * });
  	     * // => [4, 9]
  	     *
  	     * _.transform({ 'a': 1, 'b': 2 }, function(result, n, key) {
  	     *   result[key] = n * 3;
  	     * });
  	     * // => { 'a': 3, 'b': 6 }
  	     */
  	    function transform(object, iteratee, accumulator, thisArg) {
  	      var isArr = isArray(object) || isTypedArray(object);
  	      iteratee = getCallback(iteratee, thisArg, 4);
  
  	      if (accumulator == null) {
  	        if (isArr || isObject(object)) {
  	          var Ctor = object.constructor;
  	          if (isArr) {
  	            accumulator = isArray(object) ? new Ctor : [];
  	          } else {
  	            accumulator = baseCreate(isFunction(Ctor) ? Ctor.prototype : undefined);
  	          }
  	        } else {
  	          accumulator = {};
  	        }
  	      }
  	      (isArr ? arrayEach : baseForOwn)(object, function(value, index, object) {
  	        return iteratee(accumulator, value, index, object);
  	      });
  	      return accumulator;
  	    }
  
  	    /**
  	     * Creates an array of the own enumerable property values of `object`.
  	     *
  	     * **Note:** Non-object values are coerced to objects.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to query.
  	     * @returns {Array} Returns the array of property values.
  	     * @example
  	     *
  	     * function Foo() {
  	     *   this.a = 1;
  	     *   this.b = 2;
  	     * }
  	     *
  	     * Foo.prototype.c = 3;
  	     *
  	     * _.values(new Foo);
  	     * // => [1, 2] (iteration order is not guaranteed)
  	     *
  	     * _.values('hi');
  	     * // => ['h', 'i']
  	     */
  	    function values(object) {
  	      return baseValues(object, keys(object));
  	    }
  
  	    /**
  	     * Creates an array of the own and inherited enumerable property values
  	     * of `object`.
  	     *
  	     * **Note:** Non-object values are coerced to objects.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Object
  	     * @param {Object} object The object to query.
  	     * @returns {Array} Returns the array of property values.
  	     * @example
  	     *
  	     * function Foo() {
  	     *   this.a = 1;
  	     *   this.b = 2;
  	     * }
  	     *
  	     * Foo.prototype.c = 3;
  	     *
  	     * _.valuesIn(new Foo);
  	     * // => [1, 2, 3] (iteration order is not guaranteed)
  	     */
  	    function valuesIn(object) {
  	      return baseValues(object, keysIn(object));
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Checks if `n` is between `start` and up to but not including, `end`. If
  	     * `end` is not specified it is set to `start` with `start` then set to `0`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Number
  	     * @param {number} n The number to check.
  	     * @param {number} [start=0] The start of the range.
  	     * @param {number} end The end of the range.
  	     * @returns {boolean} Returns `true` if `n` is in the range, else `false`.
  	     * @example
  	     *
  	     * _.inRange(3, 2, 4);
  	     * // => true
  	     *
  	     * _.inRange(4, 8);
  	     * // => true
  	     *
  	     * _.inRange(4, 2);
  	     * // => false
  	     *
  	     * _.inRange(2, 2);
  	     * // => false
  	     *
  	     * _.inRange(1.2, 2);
  	     * // => true
  	     *
  	     * _.inRange(5.2, 4);
  	     * // => false
  	     */
  	    function inRange(value, start, end) {
  	      start = +start || 0;
  	      if (end === undefined) {
  	        end = start;
  	        start = 0;
  	      } else {
  	        end = +end || 0;
  	      }
  	      return value >= nativeMin(start, end) && value < nativeMax(start, end);
  	    }
  
  	    /**
  	     * Produces a random number between `min` and `max` (inclusive). If only one
  	     * argument is provided a number between `0` and the given number is returned.
  	     * If `floating` is `true`, or either `min` or `max` are floats, a floating-point
  	     * number is returned instead of an integer.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Number
  	     * @param {number} [min=0] The minimum possible value.
  	     * @param {number} [max=1] The maximum possible value.
  	     * @param {boolean} [floating] Specify returning a floating-point number.
  	     * @returns {number} Returns the random number.
  	     * @example
  	     *
  	     * _.random(0, 5);
  	     * // => an integer between 0 and 5
  	     *
  	     * _.random(5);
  	     * // => also an integer between 0 and 5
  	     *
  	     * _.random(5, true);
  	     * // => a floating-point number between 0 and 5
  	     *
  	     * _.random(1.2, 5.2);
  	     * // => a floating-point number between 1.2 and 5.2
  	     */
  	    function random(min, max, floating) {
  	      if (floating && isIterateeCall(min, max, floating)) {
  	        max = floating = undefined;
  	      }
  	      var noMin = min == null,
  	          noMax = max == null;
  
  	      if (floating == null) {
  	        if (noMax && typeof min == 'boolean') {
  	          floating = min;
  	          min = 1;
  	        }
  	        else if (typeof max == 'boolean') {
  	          floating = max;
  	          noMax = true;
  	        }
  	      }
  	      if (noMin && noMax) {
  	        max = 1;
  	        noMax = false;
  	      }
  	      min = +min || 0;
  	      if (noMax) {
  	        max = min;
  	        min = 0;
  	      } else {
  	        max = +max || 0;
  	      }
  	      if (floating || min % 1 || max % 1) {
  	        var rand = nativeRandom();
  	        return nativeMin(min + (rand * (max - min + parseFloat('1e-' + ((rand + '').length - 1)))), max);
  	      }
  	      return baseRandom(min, max);
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to convert.
  	     * @returns {string} Returns the camel cased string.
  	     * @example
  	     *
  	     * _.camelCase('Foo Bar');
  	     * // => 'fooBar'
  	     *
  	     * _.camelCase('--foo-bar');
  	     * // => 'fooBar'
  	     *
  	     * _.camelCase('__foo_bar__');
  	     * // => 'fooBar'
  	     */
  	    var camelCase = createCompounder(function(result, word, index) {
  	      word = word.toLowerCase();
  	      return result + (index ? (word.charAt(0).toUpperCase() + word.slice(1)) : word);
  	    });
  
  	    /**
  	     * Capitalizes the first character of `string`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to capitalize.
  	     * @returns {string} Returns the capitalized string.
  	     * @example
  	     *
  	     * _.capitalize('fred');
  	     * // => 'Fred'
  	     */
  	    function capitalize(string) {
  	      string = baseToString(string);
  	      return string && (string.charAt(0).toUpperCase() + string.slice(1));
  	    }
  
  	    /**
  	     * Deburrs `string` by converting [latin-1 supplementary letters](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)
  	     * to basic latin letters and removing [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to deburr.
  	     * @returns {string} Returns the deburred string.
  	     * @example
  	     *
  	     * _.deburr('déjà vu');
  	     * // => 'deja vu'
  	     */
  	    function deburr(string) {
  	      string = baseToString(string);
  	      return string && string.replace(reLatin1, deburrLetter).replace(reComboMark, '');
  	    }
  
  	    /**
  	     * Checks if `string` ends with the given target string.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to search.
  	     * @param {string} [target] The string to search for.
  	     * @param {number} [position=string.length] The position to search from.
  	     * @returns {boolean} Returns `true` if `string` ends with `target`, else `false`.
  	     * @example
  	     *
  	     * _.endsWith('abc', 'c');
  	     * // => true
  	     *
  	     * _.endsWith('abc', 'b');
  	     * // => false
  	     *
  	     * _.endsWith('abc', 'b', 2);
  	     * // => true
  	     */
  	    function endsWith(string, target, position) {
  	      string = baseToString(string);
  	      target = (target + '');
  
  	      var length = string.length;
  	      position = position === undefined
  	        ? length
  	        : nativeMin(position < 0 ? 0 : (+position || 0), length);
  
  	      position -= target.length;
  	      return position >= 0 && string.indexOf(target, position) == position;
  	    }
  
  	    /**
  	     * Converts the characters "&", "<", ">", '"', "'", and "\`", in `string` to
  	     * their corresponding HTML entities.
  	     *
  	     * **Note:** No other characters are escaped. To escape additional characters
  	     * use a third-party library like [_he_](https://mths.be/he).
  	     *
  	     * Though the ">" character is escaped for symmetry, characters like
  	     * ">" and "/" don't need escaping in HTML and have no special meaning
  	     * unless they're part of a tag or unquoted attribute value.
  	     * See [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)
  	     * (under "semi-related fun fact") for more details.
  	     *
  	     * Backticks are escaped because in Internet Explorer < 9, they can break out
  	     * of attribute values or HTML comments. See [#59](https://html5sec.org/#59),
  	     * [#102](https://html5sec.org/#102), [#108](https://html5sec.org/#108), and
  	     * [#133](https://html5sec.org/#133) of the [HTML5 Security Cheatsheet](https://html5sec.org/)
  	     * for more details.
  	     *
  	     * When working with HTML you should always [quote attribute values](http://wonko.com/post/html-escaping)
  	     * to reduce XSS vectors.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to escape.
  	     * @returns {string} Returns the escaped string.
  	     * @example
  	     *
  	     * _.escape('fred, barney, & pebbles');
  	     * // => 'fred, barney, &amp; pebbles'
  	     */
  	    function escape(string) {
  	      // Reset `lastIndex` because in IE < 9 `String#replace` does not.
  	      string = baseToString(string);
  	      return (string && reHasUnescapedHtml.test(string))
  	        ? string.replace(reUnescapedHtml, escapeHtmlChar)
  	        : string;
  	    }
  
  	    /**
  	     * Escapes the `RegExp` special characters "\", "/", "^", "$", ".", "|", "?",
  	     * "*", "+", "(", ")", "[", "]", "{" and "}" in `string`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to escape.
  	     * @returns {string} Returns the escaped string.
  	     * @example
  	     *
  	     * _.escapeRegExp('[lodash](https://lodash.com/)');
  	     * // => '\[lodash\]\(https:\/\/lodash\.com\/\)'
  	     */
  	    function escapeRegExp(string) {
  	      string = baseToString(string);
  	      return (string && reHasRegExpChars.test(string))
  	        ? string.replace(reRegExpChars, escapeRegExpChar)
  	        : (string || '(?:)');
  	    }
  
  	    /**
  	     * Converts `string` to [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to convert.
  	     * @returns {string} Returns the kebab cased string.
  	     * @example
  	     *
  	     * _.kebabCase('Foo Bar');
  	     * // => 'foo-bar'
  	     *
  	     * _.kebabCase('fooBar');
  	     * // => 'foo-bar'
  	     *
  	     * _.kebabCase('__foo_bar__');
  	     * // => 'foo-bar'
  	     */
  	    var kebabCase = createCompounder(function(result, word, index) {
  	      return result + (index ? '-' : '') + word.toLowerCase();
  	    });
  
  	    /**
  	     * Pads `string` on the left and right sides if it's shorter than `length`.
  	     * Padding characters are truncated if they can't be evenly divided by `length`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to pad.
  	     * @param {number} [length=0] The padding length.
  	     * @param {string} [chars=' '] The string used as padding.
  	     * @returns {string} Returns the padded string.
  	     * @example
  	     *
  	     * _.pad('abc', 8);
  	     * // => '  abc   '
  	     *
  	     * _.pad('abc', 8, '_-');
  	     * // => '_-abc_-_'
  	     *
  	     * _.pad('abc', 3);
  	     * // => 'abc'
  	     */
  	    function pad(string, length, chars) {
  	      string = baseToString(string);
  	      length = +length;
  
  	      var strLength = string.length;
  	      if (strLength >= length || !nativeIsFinite(length)) {
  	        return string;
  	      }
  	      var mid = (length - strLength) / 2,
  	          leftLength = nativeFloor(mid),
  	          rightLength = nativeCeil(mid);
  
  	      chars = createPadding('', rightLength, chars);
  	      return chars.slice(0, leftLength) + string + chars;
  	    }
  
  	    /**
  	     * Pads `string` on the left side if it's shorter than `length`. Padding
  	     * characters are truncated if they exceed `length`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to pad.
  	     * @param {number} [length=0] The padding length.
  	     * @param {string} [chars=' '] The string used as padding.
  	     * @returns {string} Returns the padded string.
  	     * @example
  	     *
  	     * _.padLeft('abc', 6);
  	     * // => '   abc'
  	     *
  	     * _.padLeft('abc', 6, '_-');
  	     * // => '_-_abc'
  	     *
  	     * _.padLeft('abc', 3);
  	     * // => 'abc'
  	     */
  	    var padLeft = createPadDir();
  
  	    /**
  	     * Pads `string` on the right side if it's shorter than `length`. Padding
  	     * characters are truncated if they exceed `length`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to pad.
  	     * @param {number} [length=0] The padding length.
  	     * @param {string} [chars=' '] The string used as padding.
  	     * @returns {string} Returns the padded string.
  	     * @example
  	     *
  	     * _.padRight('abc', 6);
  	     * // => 'abc   '
  	     *
  	     * _.padRight('abc', 6, '_-');
  	     * // => 'abc_-_'
  	     *
  	     * _.padRight('abc', 3);
  	     * // => 'abc'
  	     */
  	    var padRight = createPadDir(true);
  
  	    /**
  	     * Converts `string` to an integer of the specified radix. If `radix` is
  	     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a hexadecimal,
  	     * in which case a `radix` of `16` is used.
  	     *
  	     * **Note:** This method aligns with the [ES5 implementation](https://es5.github.io/#E)
  	     * of `parseInt`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} string The string to convert.
  	     * @param {number} [radix] The radix to interpret `value` by.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {number} Returns the converted integer.
  	     * @example
  	     *
  	     * _.parseInt('08');
  	     * // => 8
  	     *
  	     * _.map(['6', '08', '10'], _.parseInt);
  	     * // => [6, 8, 10]
  	     */
  	    function parseInt(string, radix, guard) {
  	      // Firefox < 21 and Opera < 15 follow ES3 for `parseInt`.
  	      // Chrome fails to trim leading <BOM> whitespace characters.
  	      // See https://code.google.com/p/v8/issues/detail?id=3109 for more details.
  	      if (guard ? isIterateeCall(string, radix, guard) : radix == null) {
  	        radix = 0;
  	      } else if (radix) {
  	        radix = +radix;
  	      }
  	      string = trim(string);
  	      return nativeParseInt(string, radix || (reHasHexPrefix.test(string) ? 16 : 10));
  	    }
  
  	    /**
  	     * Repeats the given string `n` times.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to repeat.
  	     * @param {number} [n=0] The number of times to repeat the string.
  	     * @returns {string} Returns the repeated string.
  	     * @example
  	     *
  	     * _.repeat('*', 3);
  	     * // => '***'
  	     *
  	     * _.repeat('abc', 2);
  	     * // => 'abcabc'
  	     *
  	     * _.repeat('abc', 0);
  	     * // => ''
  	     */
  	    function repeat(string, n) {
  	      var result = '';
  	      string = baseToString(string);
  	      n = +n;
  	      if (n < 1 || !string || !nativeIsFinite(n)) {
  	        return result;
  	      }
  	      // Leverage the exponentiation by squaring algorithm for a faster repeat.
  	      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.
  	      do {
  	        if (n % 2) {
  	          result += string;
  	        }
  	        n = nativeFloor(n / 2);
  	        string += string;
  	      } while (n);
  
  	      return result;
  	    }
  
  	    /**
  	     * Converts `string` to [snake case](https://en.wikipedia.org/wiki/Snake_case).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to convert.
  	     * @returns {string} Returns the snake cased string.
  	     * @example
  	     *
  	     * _.snakeCase('Foo Bar');
  	     * // => 'foo_bar'
  	     *
  	     * _.snakeCase('fooBar');
  	     * // => 'foo_bar'
  	     *
  	     * _.snakeCase('--foo-bar');
  	     * // => 'foo_bar'
  	     */
  	    var snakeCase = createCompounder(function(result, word, index) {
  	      return result + (index ? '_' : '') + word.toLowerCase();
  	    });
  
  	    /**
  	     * Converts `string` to [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to convert.
  	     * @returns {string} Returns the start cased string.
  	     * @example
  	     *
  	     * _.startCase('--foo-bar');
  	     * // => 'Foo Bar'
  	     *
  	     * _.startCase('fooBar');
  	     * // => 'Foo Bar'
  	     *
  	     * _.startCase('__foo_bar__');
  	     * // => 'Foo Bar'
  	     */
  	    var startCase = createCompounder(function(result, word, index) {
  	      return result + (index ? ' ' : '') + (word.charAt(0).toUpperCase() + word.slice(1));
  	    });
  
  	    /**
  	     * Checks if `string` starts with the given target string.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to search.
  	     * @param {string} [target] The string to search for.
  	     * @param {number} [position=0] The position to search from.
  	     * @returns {boolean} Returns `true` if `string` starts with `target`, else `false`.
  	     * @example
  	     *
  	     * _.startsWith('abc', 'a');
  	     * // => true
  	     *
  	     * _.startsWith('abc', 'b');
  	     * // => false
  	     *
  	     * _.startsWith('abc', 'b', 1);
  	     * // => true
  	     */
  	    function startsWith(string, target, position) {
  	      string = baseToString(string);
  	      position = position == null
  	        ? 0
  	        : nativeMin(position < 0 ? 0 : (+position || 0), string.length);
  
  	      return string.lastIndexOf(target, position) == position;
  	    }
  
  	    /**
  	     * Creates a compiled template function that can interpolate data properties
  	     * in "interpolate" delimiters, HTML-escape interpolated data properties in
  	     * "escape" delimiters, and execute JavaScript in "evaluate" delimiters. Data
  	     * properties may be accessed as free variables in the template. If a setting
  	     * object is provided it takes precedence over `_.templateSettings` values.
  	     *
  	     * **Note:** In the development build `_.template` utilizes
  	     * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)
  	     * for easier debugging.
  	     *
  	     * For more information on precompiling templates see
  	     * [lodash's custom builds documentation](https://lodash.com/custom-builds).
  	     *
  	     * For more information on Chrome extension sandboxes see
  	     * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The template string.
  	     * @param {Object} [options] The options object.
  	     * @param {RegExp} [options.escape] The HTML "escape" delimiter.
  	     * @param {RegExp} [options.evaluate] The "evaluate" delimiter.
  	     * @param {Object} [options.imports] An object to import into the template as free variables.
  	     * @param {RegExp} [options.interpolate] The "interpolate" delimiter.
  	     * @param {string} [options.sourceURL] The sourceURL of the template's compiled source.
  	     * @param {string} [options.variable] The data object variable name.
  	     * @param- {Object} [otherOptions] Enables the legacy `options` param signature.
  	     * @returns {Function} Returns the compiled template function.
  	     * @example
  	     *
  	     * // using the "interpolate" delimiter to create a compiled template
  	     * var compiled = _.template('hello <%= user %>!');
  	     * compiled({ 'user': 'fred' });
  	     * // => 'hello fred!'
  	     *
  	     * // using the HTML "escape" delimiter to escape data property values
  	     * var compiled = _.template('<b><%- value %></b>');
  	     * compiled({ 'value': '<script>' });
  	     * // => '<b>&lt;script&gt;</b>'
  	     *
  	     * // using the "evaluate" delimiter to execute JavaScript and generate HTML
  	     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');
  	     * compiled({ 'users': ['fred', 'barney'] });
  	     * // => '<li>fred</li><li>barney</li>'
  	     *
  	     * // using the internal `print` function in "evaluate" delimiters
  	     * var compiled = _.template('<% print("hello " + user); %>!');
  	     * compiled({ 'user': 'barney' });
  	     * // => 'hello barney!'
  	     *
  	     * // using the ES delimiter as an alternative to the default "interpolate" delimiter
  	     * var compiled = _.template('hello ${ user }!');
  	     * compiled({ 'user': 'pebbles' });
  	     * // => 'hello pebbles!'
  	     *
  	     * // using custom template delimiters
  	     * _.templateSettings.interpolate = /{{([\s\S]+?)}}/g;
  	     * var compiled = _.template('hello {{ user }}!');
  	     * compiled({ 'user': 'mustache' });
  	     * // => 'hello mustache!'
  	     *
  	     * // using backslashes to treat delimiters as plain text
  	     * var compiled = _.template('<%= "\\<%- value %\\>" %>');
  	     * compiled({ 'value': 'ignored' });
  	     * // => '<%- value %>'
  	     *
  	     * // using the `imports` option to import `jQuery` as `jq`
  	     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';
  	     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });
  	     * compiled({ 'users': ['fred', 'barney'] });
  	     * // => '<li>fred</li><li>barney</li>'
  	     *
  	     * // using the `sourceURL` option to specify a custom sourceURL for the template
  	     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });
  	     * compiled(data);
  	     * // => find the source of "greeting.jst" under the Sources tab or Resources panel of the web inspector
  	     *
  	     * // using the `variable` option to ensure a with-statement isn't used in the compiled template
  	     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });
  	     * compiled.source;
  	     * // => function(data) {
  	     * //   var __t, __p = '';
  	     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';
  	     * //   return __p;
  	     * // }
  	     *
  	     * // using the `source` property to inline compiled templates for meaningful
  	     * // line numbers in error messages and a stack trace
  	     * fs.writeFileSync(path.join(cwd, 'jst.js'), '\
  	     *   var JST = {\
  	     *     "main": ' + _.template(mainText).source + '\
  	     *   };\
  	     * ');
  	     */
  	    function template(string, options, otherOptions) {
  	      // Based on John Resig's `tmpl` implementation (http://ejohn.org/blog/javascript-micro-templating/)
  	      // and Laura Doktorova's doT.js (https://github.com/olado/doT).
  	      var settings = lodash.templateSettings;
  
  	      if (otherOptions && isIterateeCall(string, options, otherOptions)) {
  	        options = otherOptions = undefined;
  	      }
  	      string = baseToString(string);
  	      options = assignWith(baseAssign({}, otherOptions || options), settings, assignOwnDefaults);
  
  	      var imports = assignWith(baseAssign({}, options.imports), settings.imports, assignOwnDefaults),
  	          importsKeys = keys(imports),
  	          importsValues = baseValues(imports, importsKeys);
  
  	      var isEscaping,
  	          isEvaluating,
  	          index = 0,
  	          interpolate = options.interpolate || reNoMatch,
  	          source = "__p += '";
  
  	      // Compile the regexp to match each delimiter.
  	      var reDelimiters = RegExp(
  	        (options.escape || reNoMatch).source + '|' +
  	        interpolate.source + '|' +
  	        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +
  	        (options.evaluate || reNoMatch).source + '|$'
  	      , 'g');
  
  	      // Use a sourceURL for easier debugging.
  	      var sourceURL = '//# sourceURL=' +
  	        ('sourceURL' in options
  	          ? options.sourceURL
  	          : ('lodash.templateSources[' + (++templateCounter) + ']')
  	        ) + '\n';
  
  	      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {
  	        interpolateValue || (interpolateValue = esTemplateValue);
  
  	        // Escape characters that can't be included in string literals.
  	        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);
  
  	        // Replace delimiters with snippets.
  	        if (escapeValue) {
  	          isEscaping = true;
  	          source += "' +\n__e(" + escapeValue + ") +\n'";
  	        }
  	        if (evaluateValue) {
  	          isEvaluating = true;
  	          source += "';\n" + evaluateValue + ";\n__p += '";
  	        }
  	        if (interpolateValue) {
  	          source += "' +\n((__t = (" + interpolateValue + ")) == null ? '' : __t) +\n'";
  	        }
  	        index = offset + match.length;
  
  	        // The JS engine embedded in Adobe products requires returning the `match`
  	        // string 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;
  	    }
  
  	    /**
  	     * Removes leading and trailing whitespace or specified characters from `string`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to trim.
  	     * @param {string} [chars=whitespace] The characters to trim.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {string} Returns the trimmed string.
  	     * @example
  	     *
  	     * _.trim('  abc  ');
  	     * // => 'abc'
  	     *
  	     * _.trim('-_-abc-_-', '_-');
  	     * // => 'abc'
  	     *
  	     * _.map(['  foo  ', '  bar  '], _.trim);
  	     * // => ['foo', 'bar']
  	     */
  	    function trim(string, chars, guard) {
  	      var value = string;
  	      string = baseToString(string);
  	      if (!string) {
  	        return string;
  	      }
  	      if (guard ? isIterateeCall(value, chars, guard) : chars == null) {
  	        return string.slice(trimmedLeftIndex(string), trimmedRightIndex(string) + 1);
  	      }
  	      chars = (chars + '');
  	      return string.slice(charsLeftIndex(string, chars), charsRightIndex(string, chars) + 1);
  	    }
  
  	    /**
  	     * Removes leading whitespace or specified characters from `string`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to trim.
  	     * @param {string} [chars=whitespace] The characters to trim.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {string} Returns the trimmed string.
  	     * @example
  	     *
  	     * _.trimLeft('  abc  ');
  	     * // => 'abc  '
  	     *
  	     * _.trimLeft('-_-abc-_-', '_-');
  	     * // => 'abc-_-'
  	     */
  	    function trimLeft(string, chars, guard) {
  	      var value = string;
  	      string = baseToString(string);
  	      if (!string) {
  	        return string;
  	      }
  	      if (guard ? isIterateeCall(value, chars, guard) : chars == null) {
  	        return string.slice(trimmedLeftIndex(string));
  	      }
  	      return string.slice(charsLeftIndex(string, (chars + '')));
  	    }
  
  	    /**
  	     * Removes trailing whitespace or specified characters from `string`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to trim.
  	     * @param {string} [chars=whitespace] The characters to trim.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {string} Returns the trimmed string.
  	     * @example
  	     *
  	     * _.trimRight('  abc  ');
  	     * // => '  abc'
  	     *
  	     * _.trimRight('-_-abc-_-', '_-');
  	     * // => '-_-abc'
  	     */
  	    function trimRight(string, chars, guard) {
  	      var value = string;
  	      string = baseToString(string);
  	      if (!string) {
  	        return string;
  	      }
  	      if (guard ? isIterateeCall(value, chars, guard) : chars == null) {
  	        return string.slice(0, trimmedRightIndex(string) + 1);
  	      }
  	      return string.slice(0, charsRightIndex(string, (chars + '')) + 1);
  	    }
  
  	    /**
  	     * 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 _
  	     * @category String
  	     * @param {string} [string=''] The string to truncate.
  	     * @param {Object|number} [options] The options object or maximum string length.
  	     * @param {number} [options.length=30] The maximum string length.
  	     * @param {string} [options.omission='...'] The string to indicate text is omitted.
  	     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {string} Returns the truncated string.
  	     * @example
  	     *
  	     * _.trunc('hi-diddly-ho there, neighborino');
  	     * // => 'hi-diddly-ho there, neighbo...'
  	     *
  	     * _.trunc('hi-diddly-ho there, neighborino', 24);
  	     * // => 'hi-diddly-ho there, n...'
  	     *
  	     * _.trunc('hi-diddly-ho there, neighborino', {
  	     *   'length': 24,
  	     *   'separator': ' '
  	     * });
  	     * // => 'hi-diddly-ho there,...'
  	     *
  	     * _.trunc('hi-diddly-ho there, neighborino', {
  	     *   'length': 24,
  	     *   'separator': /,? +/
  	     * });
  	     * // => 'hi-diddly-ho there...'
  	     *
  	     * _.trunc('hi-diddly-ho there, neighborino', {
  	     *   'omission': ' [...]'
  	     * });
  	     * // => 'hi-diddly-ho there, neig [...]'
  	     */
  	    function trunc(string, options, guard) {
  	      if (guard && isIterateeCall(string, options, guard)) {
  	        options = undefined;
  	      }
  	      var length = DEFAULT_TRUNC_LENGTH,
  	          omission = DEFAULT_TRUNC_OMISSION;
  
  	      if (options != null) {
  	        if (isObject(options)) {
  	          var separator = 'separator' in options ? options.separator : separator;
  	          length = 'length' in options ? (+options.length || 0) : length;
  	          omission = 'omission' in options ? baseToString(options.omission) : omission;
  	        } else {
  	          length = +options || 0;
  	        }
  	      }
  	      string = baseToString(string);
  	      if (length >= string.length) {
  	        return string;
  	      }
  	      var end = length - omission.length;
  	      if (end < 1) {
  	        return omission;
  	      }
  	      var result = string.slice(0, end);
  	      if (separator == null) {
  	        return result + omission;
  	      }
  	      if (isRegExp(separator)) {
  	        if (string.slice(end).search(separator)) {
  	          var match,
  	              newEnd,
  	              substring = string.slice(0, end);
  
  	          if (!separator.global) {
  	            separator = RegExp(separator.source, (reFlags.exec(separator) || '') + 'g');
  	          }
  	          separator.lastIndex = 0;
  	          while ((match = separator.exec(substring))) {
  	            newEnd = match.index;
  	          }
  	          result = result.slice(0, newEnd == null ? end : newEnd);
  	        }
  	      } else if (string.indexOf(separator, end) != end) {
  	        var index = result.lastIndexOf(separator);
  	        if (index > -1) {
  	          result = result.slice(0, index);
  	        }
  	      }
  	      return result + omission;
  	    }
  
  	    /**
  	     * The inverse of `_.escape`; this method converts the HTML entities
  	     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, `&#39;`, and `&#96;` in `string` to their
  	     * corresponding characters.
  	     *
  	     * **Note:** No other HTML entities are unescaped. To unescape additional HTML
  	     * entities use a third-party library like [_he_](https://mths.be/he).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to unescape.
  	     * @returns {string} Returns the unescaped string.
  	     * @example
  	     *
  	     * _.unescape('fred, barney, &amp; pebbles');
  	     * // => 'fred, barney, & pebbles'
  	     */
  	    function unescape(string) {
  	      string = baseToString(string);
  	      return (string && reHasEscapedHtml.test(string))
  	        ? string.replace(reEscapedHtml, unescapeHtmlChar)
  	        : string;
  	    }
  
  	    /**
  	     * Splits `string` into an array of its words.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category String
  	     * @param {string} [string=''] The string to inspect.
  	     * @param {RegExp|string} [pattern] The pattern to match words.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Array} Returns the words of `string`.
  	     * @example
  	     *
  	     * _.words('fred, barney, & pebbles');
  	     * // => ['fred', 'barney', 'pebbles']
  	     *
  	     * _.words('fred, barney, & pebbles', /[^, ]+/g);
  	     * // => ['fred', 'barney', '&', 'pebbles']
  	     */
  	    function words(string, pattern, guard) {
  	      if (guard && isIterateeCall(string, pattern, guard)) {
  	        pattern = undefined;
  	      }
  	      string = baseToString(string);
  	      return string.match(pattern || reWords) || [];
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Attempts to invoke `func`, returning either the result or the caught error
  	     * object. Any additional arguments are provided to `func` when it is invoked.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {Function} func The function to attempt.
  	     * @returns {*} Returns the `func` result or error object.
  	     * @example
  	     *
  	     * // avoid throwing errors for invalid selectors
  	     * var elements = _.attempt(function(selector) {
  	     *   return document.querySelectorAll(selector);
  	     * }, '>_>');
  	     *
  	     * if (_.isError(elements)) {
  	     *   elements = [];
  	     * }
  	     */
  	    var attempt = restParam(function(func, args) {
  	      try {
  	        return func.apply(undefined, args);
  	      } catch(e) {
  	        return isError(e) ? e : new Error(e);
  	      }
  	    });
  
  	    /**
  	     * Creates a function that invokes `func` with the `this` binding of `thisArg`
  	     * and arguments of the created function. If `func` is a property name the
  	     * created callback returns the property value for a given element. If `func`
  	     * is an object the created callback returns `true` for elements that contain
  	     * the equivalent object properties, otherwise it returns `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @alias iteratee
  	     * @category Utility
  	     * @param {*} [func=_.identity] The value to convert to a callback.
  	     * @param {*} [thisArg] The `this` binding of `func`.
  	     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
  	     * @returns {Function} Returns the callback.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'age': 36 },
  	     *   { 'user': 'fred',   'age': 40 }
  	     * ];
  	     *
  	     * // wrap to create custom callback shorthands
  	     * _.callback = _.wrap(_.callback, function(callback, func, thisArg) {
  	     *   var match = /^(.+?)__([gl]t)(.+)$/.exec(func);
  	     *   if (!match) {
  	     *     return callback(func, thisArg);
  	     *   }
  	     *   return function(object) {
  	     *     return match[2] == 'gt'
  	     *       ? object[match[1]] > match[3]
  	     *       : object[match[1]] < match[3];
  	     *   };
  	     * });
  	     *
  	     * _.filter(users, 'age__gt36');
  	     * // => [{ 'user': 'fred', 'age': 40 }]
  	     */
  	    function callback(func, thisArg, guard) {
  	      if (guard && isIterateeCall(func, thisArg, guard)) {
  	        thisArg = undefined;
  	      }
  	      return isObjectLike(func)
  	        ? matches(func)
  	        : baseCallback(func, thisArg);
  	    }
  
  	    /**
  	     * Creates a function that returns `value`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {*} value The value to return from the new function.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * var object = { 'user': 'fred' };
  	     * var getter = _.constant(object);
  	     *
  	     * getter() === object;
  	     * // => true
  	     */
  	    function constant(value) {
  	      return function() {
  	        return value;
  	      };
  	    }
  
  	    /**
  	     * This method returns the first argument provided to it.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {*} value Any value.
  	     * @returns {*} Returns `value`.
  	     * @example
  	     *
  	     * var object = { 'user': 'fred' };
  	     *
  	     * _.identity(object) === object;
  	     * // => true
  	     */
  	    function identity(value) {
  	      return value;
  	    }
  
  	    /**
  	     * Creates a function that performs a deep comparison between a given object
  	     * and `source`, returning `true` if the given object has equivalent property
  	     * values, else `false`.
  	     *
  	     * **Note:** This method supports comparing arrays, booleans, `Date` objects,
  	     * numbers, `Object` objects, regexes, and strings. Objects are compared by
  	     * their own, not inherited, enumerable properties. For comparing a single
  	     * own or inherited property value see `_.matchesProperty`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {Object} source The object of property values to match.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'age': 36, 'active': true },
  	     *   { 'user': 'fred',   'age': 40, 'active': false }
  	     * ];
  	     *
  	     * _.filter(users, _.matches({ 'age': 40, 'active': false }));
  	     * // => [{ 'user': 'fred', 'age': 40, 'active': false }]
  	     */
  	    function matches(source) {
  	      return baseMatches(baseClone(source, true));
  	    }
  
  	    /**
  	     * Creates a function that compares the property value of `path` on a given
  	     * object to `value`.
  	     *
  	     * **Note:** This method supports comparing arrays, booleans, `Date` objects,
  	     * numbers, `Object` objects, regexes, and strings. Objects are compared by
  	     * their own, not inherited, enumerable properties.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {Array|string} path The path of the property to get.
  	     * @param {*} srcValue The value to match.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * var users = [
  	     *   { 'user': 'barney' },
  	     *   { 'user': 'fred' }
  	     * ];
  	     *
  	     * _.find(users, _.matchesProperty('user', 'fred'));
  	     * // => { 'user': 'fred' }
  	     */
  	    function matchesProperty(path, srcValue) {
  	      return baseMatchesProperty(path, baseClone(srcValue, true));
  	    }
  
  	    /**
  	     * Creates a function that invokes the method at `path` on a given object.
  	     * Any additional arguments are provided to the invoked method.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @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 function.
  	     * @example
  	     *
  	     * var objects = [
  	     *   { 'a': { 'b': { 'c': _.constant(2) } } },
  	     *   { 'a': { 'b': { 'c': _.constant(1) } } }
  	     * ];
  	     *
  	     * _.map(objects, _.method('a.b.c'));
  	     * // => [2, 1]
  	     *
  	     * _.invoke(_.sortBy(objects, _.method(['a', 'b', 'c'])), 'a.b.c');
  	     * // => [1, 2]
  	     */
  	    var method = restParam(function(path, args) {
  	      return function(object) {
  	        return invokePath(object, path, args);
  	      };
  	    });
  
  	    /**
  	     * The opposite of `_.method`; this method creates a function that invokes
  	     * the method at a given path on `object`. Any additional arguments are
  	     * provided to the invoked method.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {Object} object The object to query.
  	     * @param {...*} [args] The arguments to invoke the method with.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * var array = _.times(3, _.constant),
  	     *     object = { 'a': array, 'b': array, 'c': array };
  	     *
  	     * _.map(['a[2]', 'c[0]'], _.methodOf(object));
  	     * // => [2, 0]
  	     *
  	     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));
  	     * // => [2, 0]
  	     */
  	    var methodOf = restParam(function(object, args) {
  	      return function(path) {
  	        return invokePath(object, path, args);
  	      };
  	    });
  
  	    /**
  	     * Adds all own enumerable function properties of a source object to the
  	     * destination object. If `object` is a function then methods are added to
  	     * its prototype as well.
  	     *
  	     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to
  	     * avoid conflicts caused by modifying the original.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {Function|Object} [object=lodash] The destination object.
  	     * @param {Object} source The object of functions to add.
  	     * @param {Object} [options] The options object.
  	     * @param {boolean} [options.chain=true] Specify whether the functions added
  	     *  are chainable.
  	     * @returns {Function|Object} Returns `object`.
  	     * @example
  	     *
  	     * function vowels(string) {
  	     *   return _.filter(string, function(v) {
  	     *     return /[aeiou]/i.test(v);
  	     *   });
  	     * }
  	     *
  	     * _.mixin({ 'vowels': vowels });
  	     * _.vowels('fred');
  	     * // => ['e']
  	     *
  	     * _('fred').vowels().value();
  	     * // => ['e']
  	     *
  	     * _.mixin({ 'vowels': vowels }, { 'chain': false });
  	     * _('fred').vowels();
  	     * // => ['e']
  	     */
  	    function mixin(object, source, options) {
  	      if (options == null) {
  	        var isObj = isObject(source),
  	            props = isObj ? keys(source) : undefined,
  	            methodNames = (props && props.length) ? baseFunctions(source, props) : undefined;
  
  	        if (!(methodNames ? methodNames.length : isObj)) {
  	          methodNames = false;
  	          options = source;
  	          source = object;
  	          object = this;
  	        }
  	      }
  	      if (!methodNames) {
  	        methodNames = baseFunctions(source, keys(source));
  	      }
  	      var chain = true,
  	          index = -1,
  	          isFunc = isFunction(object),
  	          length = methodNames.length;
  
  	      if (options === false) {
  	        chain = false;
  	      } else if (isObject(options) && 'chain' in options) {
  	        chain = options.chain;
  	      }
  	      while (++index < length) {
  	        var methodName = methodNames[index],
  	            func = source[methodName];
  
  	        object[methodName] = func;
  	        if (isFunc) {
  	          object.prototype[methodName] = (function(func) {
  	            return function() {
  	              var chainAll = this.__chain__;
  	              if (chain || chainAll) {
  	                var result = object(this.__wrapped__),
  	                    actions = result.__actions__ = arrayCopy(this.__actions__);
  
  	                actions.push({ 'func': func, 'args': arguments, 'thisArg': object });
  	                result.__chain__ = chainAll;
  	                return result;
  	              }
  	              return func.apply(object, arrayPush([this.value()], arguments));
  	            };
  	          }(func));
  	        }
  	      }
  	      return object;
  	    }
  
  	    /**
  	     * Reverts the `_` variable to its previous value and returns a reference to
  	     * the `lodash` function.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @returns {Function} Returns the `lodash` function.
  	     * @example
  	     *
  	     * var lodash = _.noConflict();
  	     */
  	    function noConflict() {
  	      root._ = oldDash;
  	      return this;
  	    }
  
  	    /**
  	     * A no-operation function that returns `undefined` regardless of the
  	     * arguments it receives.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @example
  	     *
  	     * var object = { 'user': 'fred' };
  	     *
  	     * _.noop(object) === undefined;
  	     * // => true
  	     */
  	    function noop() {
  	      // No operation performed.
  	    }
  
  	    /**
  	     * Creates a function that returns the property value at `path` on a
  	     * given object.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {Array|string} path The path of the property to get.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * var objects = [
  	     *   { 'a': { 'b': { 'c': 2 } } },
  	     *   { 'a': { 'b': { 'c': 1 } } }
  	     * ];
  	     *
  	     * _.map(objects, _.property('a.b.c'));
  	     * // => [2, 1]
  	     *
  	     * _.pluck(_.sortBy(objects, _.property(['a', 'b', 'c'])), 'a.b.c');
  	     * // => [1, 2]
  	     */
  	    function property(path) {
  	      return isKey(path) ? baseProperty(path) : basePropertyDeep(path);
  	    }
  
  	    /**
  	     * The opposite of `_.property`; this method creates a function that returns
  	     * the property value at a given path on `object`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {Object} object The object to query.
  	     * @returns {Function} Returns the new function.
  	     * @example
  	     *
  	     * var array = [0, 1, 2],
  	     *     object = { 'a': array, 'b': array, 'c': array };
  	     *
  	     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));
  	     * // => [2, 0]
  	     *
  	     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));
  	     * // => [2, 0]
  	     */
  	    function propertyOf(object) {
  	      return function(path) {
  	        return baseGet(object, toPath(path), path + '');
  	      };
  	    }
  
  	    /**
  	     * Creates an array of numbers (positive and/or negative) progressing from
  	     * `start` up to, but not including, `end`. If `end` is not specified it is
  	     * set to `start` with `start` then set to `0`. If `end` is less than `start`
  	     * a zero-length range is created unless a negative `step` is specified.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {number} [start=0] The start of the range.
  	     * @param {number} end The end of the range.
  	     * @param {number} [step=1] The value to increment or decrement by.
  	     * @returns {Array} Returns the new array of numbers.
  	     * @example
  	     *
  	     * _.range(4);
  	     * // => [0, 1, 2, 3]
  	     *
  	     * _.range(1, 5);
  	     * // => [1, 2, 3, 4]
  	     *
  	     * _.range(0, 20, 5);
  	     * // => [0, 5, 10, 15]
  	     *
  	     * _.range(0, -4, -1);
  	     * // => [0, -1, -2, -3]
  	     *
  	     * _.range(1, 4, 0);
  	     * // => [1, 1, 1]
  	     *
  	     * _.range(0);
  	     * // => []
  	     */
  	    function range(start, end, step) {
  	      if (step && isIterateeCall(start, end, step)) {
  	        end = step = undefined;
  	      }
  	      start = +start || 0;
  	      step = step == null ? 1 : (+step || 0);
  
  	      if (end == null) {
  	        end = start;
  	        start = 0;
  	      } else {
  	        end = +end || 0;
  	      }
  	      // Use `Array(length)` so engines like Chakra and V8 avoid slower modes.
  	      // See https://youtu.be/XAqIpGU8ZZk#t=17m25s for more details.
  	      var index = -1,
  	          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),
  	          result = Array(length);
  
  	      while (++index < length) {
  	        result[index] = start;
  	        start += step;
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Invokes the iteratee function `n` times, returning an array of the results
  	     * of each invocation. The `iteratee` is bound to `thisArg` and invoked with
  	     * one argument; (index).
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {number} n The number of times to invoke `iteratee`.
  	     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {Array} Returns the array of results.
  	     * @example
  	     *
  	     * var diceRolls = _.times(3, _.partial(_.random, 1, 6, false));
  	     * // => [3, 6, 4]
  	     *
  	     * _.times(3, function(n) {
  	     *   mage.castSpell(n);
  	     * });
  	     * // => invokes `mage.castSpell(n)` three times with `n` of `0`, `1`, and `2`
  	     *
  	     * _.times(3, function(n) {
  	     *   this.cast(n);
  	     * }, mage);
  	     * // => also invokes `mage.castSpell(n)` three times
  	     */
  	    function times(n, iteratee, thisArg) {
  	      n = nativeFloor(n);
  
  	      // Exit early to avoid a JSC JIT bug in Safari 8
  	      // where `Array(0)` is treated as `Array(1)`.
  	      if (n < 1 || !nativeIsFinite(n)) {
  	        return [];
  	      }
  	      var index = -1,
  	          result = Array(nativeMin(n, MAX_ARRAY_LENGTH));
  
  	      iteratee = bindCallback(iteratee, thisArg, 1);
  	      while (++index < n) {
  	        if (index < MAX_ARRAY_LENGTH) {
  	          result[index] = iteratee(index);
  	        } else {
  	          iteratee(index);
  	        }
  	      }
  	      return result;
  	    }
  
  	    /**
  	     * Generates a unique ID. If `prefix` is provided the ID is appended to it.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Utility
  	     * @param {string} [prefix] The value to prefix the ID with.
  	     * @returns {string} Returns the unique ID.
  	     * @example
  	     *
  	     * _.uniqueId('contact_');
  	     * // => 'contact_104'
  	     *
  	     * _.uniqueId();
  	     * // => '105'
  	     */
  	    function uniqueId(prefix) {
  	      var id = ++idCounter;
  	      return baseToString(prefix) + id;
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * Adds two numbers.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Math
  	     * @param {number} augend The first number to add.
  	     * @param {number} addend The second number to add.
  	     * @returns {number} Returns the sum.
  	     * @example
  	     *
  	     * _.add(6, 4);
  	     * // => 10
  	     */
  	    function add(augend, addend) {
  	      return (+augend || 0) + (+addend || 0);
  	    }
  
  	    /**
  	     * Calculates `n` rounded up to `precision`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Math
  	     * @param {number} n 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');
  
  	    /**
  	     * Calculates `n` rounded down to `precision`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Math
  	     * @param {number} n 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');
  
  	    /**
  	     * Gets the maximum value of `collection`. If `collection` is empty or falsey
  	     * `-Infinity` is returned. If an iteratee function is provided it is invoked
  	     * for each value in `collection` to generate the criterion by which the value
  	     * is ranked. The `iteratee` is bound to `thisArg` and invoked with three
  	     * arguments: (value, index, collection).
  	     *
  	     * If a property name is provided for `iteratee` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `iteratee` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Math
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [iteratee] The function invoked per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {*} Returns the maximum value.
  	     * @example
  	     *
  	     * _.max([4, 2, 8, 6]);
  	     * // => 8
  	     *
  	     * _.max([]);
  	     * // => -Infinity
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'age': 36 },
  	     *   { 'user': 'fred',   'age': 40 }
  	     * ];
  	     *
  	     * _.max(users, function(chr) {
  	     *   return chr.age;
  	     * });
  	     * // => { 'user': 'fred', 'age': 40 }
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.max(users, 'age');
  	     * // => { 'user': 'fred', 'age': 40 }
  	     */
  	    var max = createExtremum(gt, NEGATIVE_INFINITY);
  
  	    /**
  	     * Gets the minimum value of `collection`. If `collection` is empty or falsey
  	     * `Infinity` is returned. If an iteratee function is provided it is invoked
  	     * for each value in `collection` to generate the criterion by which the value
  	     * is ranked. The `iteratee` is bound to `thisArg` and invoked with three
  	     * arguments: (value, index, collection).
  	     *
  	     * If a property name is provided for `iteratee` the created `_.property`
  	     * style callback returns the property value of the given element.
  	     *
  	     * If a value is also provided for `thisArg` the created `_.matchesProperty`
  	     * style callback returns `true` for elements that have a matching property
  	     * value, else `false`.
  	     *
  	     * If an object is provided for `iteratee` the created `_.matches` style
  	     * callback returns `true` for elements that have the properties of the given
  	     * object, else `false`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Math
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [iteratee] The function invoked per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {*} Returns the minimum value.
  	     * @example
  	     *
  	     * _.min([4, 2, 8, 6]);
  	     * // => 2
  	     *
  	     * _.min([]);
  	     * // => Infinity
  	     *
  	     * var users = [
  	     *   { 'user': 'barney', 'age': 36 },
  	     *   { 'user': 'fred',   'age': 40 }
  	     * ];
  	     *
  	     * _.min(users, function(chr) {
  	     *   return chr.age;
  	     * });
  	     * // => { 'user': 'barney', 'age': 36 }
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.min(users, 'age');
  	     * // => { 'user': 'barney', 'age': 36 }
  	     */
  	    var min = createExtremum(lt, POSITIVE_INFINITY);
  
  	    /**
  	     * Calculates `n` rounded to `precision`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Math
  	     * @param {number} n 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');
  
  	    /**
  	     * Gets the sum of the values in `collection`.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @category Math
  	     * @param {Array|Object|string} collection The collection to iterate over.
  	     * @param {Function|Object|string} [iteratee] The function invoked per iteration.
  	     * @param {*} [thisArg] The `this` binding of `iteratee`.
  	     * @returns {number} Returns the sum.
  	     * @example
  	     *
  	     * _.sum([4, 6]);
  	     * // => 10
  	     *
  	     * _.sum({ 'a': 4, 'b': 6 });
  	     * // => 10
  	     *
  	     * var objects = [
  	     *   { 'n': 4 },
  	     *   { 'n': 6 }
  	     * ];
  	     *
  	     * _.sum(objects, function(object) {
  	     *   return object.n;
  	     * });
  	     * // => 10
  	     *
  	     * // using the `_.property` callback shorthand
  	     * _.sum(objects, 'n');
  	     * // => 10
  	     */
  	    function sum(collection, iteratee, thisArg) {
  	      if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {
  	        iteratee = undefined;
  	      }
  	      iteratee = getCallback(iteratee, thisArg, 3);
  	      return iteratee.length == 1
  	        ? arraySum(isArray(collection) ? collection : toIterable(collection), iteratee)
  	        : baseSum(collection, iteratee);
  	    }
  
  	    /*------------------------------------------------------------------------*/
  
  	    // Ensure wrappers are instances of `baseLodash`.
  	    lodash.prototype = baseLodash.prototype;
  
  	    LodashWrapper.prototype = baseCreate(baseLodash.prototype);
  	    LodashWrapper.prototype.constructor = LodashWrapper;
  
  	    LazyWrapper.prototype = baseCreate(baseLodash.prototype);
  	    LazyWrapper.prototype.constructor = LazyWrapper;
  
  	    // Add functions to the `Map` cache.
  	    MapCache.prototype['delete'] = mapDelete;
  	    MapCache.prototype.get = mapGet;
  	    MapCache.prototype.has = mapHas;
  	    MapCache.prototype.set = mapSet;
  
  	    // Add functions to the `Set` cache.
  	    SetCache.prototype.push = cachePush;
  
  	    // Assign cache to `_.memoize`.
  	    memoize.Cache = MapCache;
  
  	    // Add functions that return wrapped values when chaining.
  	    lodash.after = after;
  	    lodash.ary = ary;
  	    lodash.assign = assign;
  	    lodash.at = at;
  	    lodash.before = before;
  	    lodash.bind = bind;
  	    lodash.bindAll = bindAll;
  	    lodash.bindKey = bindKey;
  	    lodash.callback = callback;
  	    lodash.chain = chain;
  	    lodash.chunk = chunk;
  	    lodash.compact = compact;
  	    lodash.constant = constant;
  	    lodash.countBy = countBy;
  	    lodash.create = create;
  	    lodash.curry = curry;
  	    lodash.curryRight = curryRight;
  	    lodash.debounce = debounce;
  	    lodash.defaults = defaults;
  	    lodash.defaultsDeep = defaultsDeep;
  	    lodash.defer = defer;
  	    lodash.delay = delay;
  	    lodash.difference = difference;
  	    lodash.drop = drop;
  	    lodash.dropRight = dropRight;
  	    lodash.dropRightWhile = dropRightWhile;
  	    lodash.dropWhile = dropWhile;
  	    lodash.fill = fill;
  	    lodash.filter = filter;
  	    lodash.flatten = flatten;
  	    lodash.flattenDeep = flattenDeep;
  	    lodash.flow = flow;
  	    lodash.flowRight = flowRight;
  	    lodash.forEach = forEach;
  	    lodash.forEachRight = forEachRight;
  	    lodash.forIn = forIn;
  	    lodash.forInRight = forInRight;
  	    lodash.forOwn = forOwn;
  	    lodash.forOwnRight = forOwnRight;
  	    lodash.functions = functions;
  	    lodash.groupBy = groupBy;
  	    lodash.indexBy = indexBy;
  	    lodash.initial = initial;
  	    lodash.intersection = intersection;
  	    lodash.invert = invert;
  	    lodash.invoke = invoke;
  	    lodash.keys = keys;
  	    lodash.keysIn = keysIn;
  	    lodash.map = map;
  	    lodash.mapKeys = mapKeys;
  	    lodash.mapValues = mapValues;
  	    lodash.matches = matches;
  	    lodash.matchesProperty = matchesProperty;
  	    lodash.memoize = memoize;
  	    lodash.merge = merge;
  	    lodash.method = method;
  	    lodash.methodOf = methodOf;
  	    lodash.mixin = mixin;
  	    lodash.modArgs = modArgs;
  	    lodash.negate = negate;
  	    lodash.omit = omit;
  	    lodash.once = once;
  	    lodash.pairs = pairs;
  	    lodash.partial = partial;
  	    lodash.partialRight = partialRight;
  	    lodash.partition = partition;
  	    lodash.pick = pick;
  	    lodash.pluck = pluck;
  	    lodash.property = property;
  	    lodash.propertyOf = propertyOf;
  	    lodash.pull = pull;
  	    lodash.pullAt = pullAt;
  	    lodash.range = range;
  	    lodash.rearg = rearg;
  	    lodash.reject = reject;
  	    lodash.remove = remove;
  	    lodash.rest = rest;
  	    lodash.restParam = restParam;
  	    lodash.set = set;
  	    lodash.shuffle = shuffle;
  	    lodash.slice = slice;
  	    lodash.sortBy = sortBy;
  	    lodash.sortByAll = sortByAll;
  	    lodash.sortByOrder = sortByOrder;
  	    lodash.spread = spread;
  	    lodash.take = take;
  	    lodash.takeRight = takeRight;
  	    lodash.takeRightWhile = takeRightWhile;
  	    lodash.takeWhile = takeWhile;
  	    lodash.tap = tap;
  	    lodash.throttle = throttle;
  	    lodash.thru = thru;
  	    lodash.times = times;
  	    lodash.toArray = toArray;
  	    lodash.toPlainObject = toPlainObject;
  	    lodash.transform = transform;
  	    lodash.union = union;
  	    lodash.uniq = uniq;
  	    lodash.unzip = unzip;
  	    lodash.unzipWith = unzipWith;
  	    lodash.values = values;
  	    lodash.valuesIn = valuesIn;
  	    lodash.where = where;
  	    lodash.without = without;
  	    lodash.wrap = wrap;
  	    lodash.xor = xor;
  	    lodash.zip = zip;
  	    lodash.zipObject = zipObject;
  	    lodash.zipWith = zipWith;
  
  	    // Add aliases.
  	    lodash.backflow = flowRight;
  	    lodash.collect = map;
  	    lodash.compose = flowRight;
  	    lodash.each = forEach;
  	    lodash.eachRight = forEachRight;
  	    lodash.extend = assign;
  	    lodash.iteratee = callback;
  	    lodash.methods = functions;
  	    lodash.object = zipObject;
  	    lodash.select = filter;
  	    lodash.tail = rest;
  	    lodash.unique = uniq;
  
  	    // Add functions to `lodash.prototype`.
  	    mixin(lodash, lodash);
  
  	    /*------------------------------------------------------------------------*/
  
  	    // Add functions that return unwrapped values when chaining.
  	    lodash.add = add;
  	    lodash.attempt = attempt;
  	    lodash.camelCase = camelCase;
  	    lodash.capitalize = capitalize;
  	    lodash.ceil = ceil;
  	    lodash.clone = clone;
  	    lodash.cloneDeep = cloneDeep;
  	    lodash.deburr = deburr;
  	    lodash.endsWith = endsWith;
  	    lodash.escape = escape;
  	    lodash.escapeRegExp = escapeRegExp;
  	    lodash.every = every;
  	    lodash.find = find;
  	    lodash.findIndex = findIndex;
  	    lodash.findKey = findKey;
  	    lodash.findLast = findLast;
  	    lodash.findLastIndex = findLastIndex;
  	    lodash.findLastKey = findLastKey;
  	    lodash.findWhere = findWhere;
  	    lodash.first = first;
  	    lodash.floor = floor;
  	    lodash.get = get;
  	    lodash.gt = gt;
  	    lodash.gte = gte;
  	    lodash.has = has;
  	    lodash.identity = identity;
  	    lodash.includes = includes;
  	    lodash.indexOf = indexOf;
  	    lodash.inRange = inRange;
  	    lodash.isArguments = isArguments;
  	    lodash.isArray = isArray;
  	    lodash.isBoolean = isBoolean;
  	    lodash.isDate = isDate;
  	    lodash.isElement = isElement;
  	    lodash.isEmpty = isEmpty;
  	    lodash.isEqual = isEqual;
  	    lodash.isError = isError;
  	    lodash.isFinite = isFinite;
  	    lodash.isFunction = isFunction;
  	    lodash.isMatch = isMatch;
  	    lodash.isNaN = isNaN;
  	    lodash.isNative = isNative;
  	    lodash.isNull = isNull;
  	    lodash.isNumber = isNumber;
  	    lodash.isObject = isObject;
  	    lodash.isPlainObject = isPlainObject;
  	    lodash.isRegExp = isRegExp;
  	    lodash.isString = isString;
  	    lodash.isTypedArray = isTypedArray;
  	    lodash.isUndefined = isUndefined;
  	    lodash.kebabCase = kebabCase;
  	    lodash.last = last;
  	    lodash.lastIndexOf = lastIndexOf;
  	    lodash.lt = lt;
  	    lodash.lte = lte;
  	    lodash.max = max;
  	    lodash.min = min;
  	    lodash.noConflict = noConflict;
  	    lodash.noop = noop;
  	    lodash.now = now;
  	    lodash.pad = pad;
  	    lodash.padLeft = padLeft;
  	    lodash.padRight = padRight;
  	    lodash.parseInt = parseInt;
  	    lodash.random = random;
  	    lodash.reduce = reduce;
  	    lodash.reduceRight = reduceRight;
  	    lodash.repeat = repeat;
  	    lodash.result = result;
  	    lodash.round = round;
  	    lodash.runInContext = runInContext;
  	    lodash.size = size;
  	    lodash.snakeCase = snakeCase;
  	    lodash.some = some;
  	    lodash.sortedIndex = sortedIndex;
  	    lodash.sortedLastIndex = sortedLastIndex;
  	    lodash.startCase = startCase;
  	    lodash.startsWith = startsWith;
  	    lodash.sum = sum;
  	    lodash.template = template;
  	    lodash.trim = trim;
  	    lodash.trimLeft = trimLeft;
  	    lodash.trimRight = trimRight;
  	    lodash.trunc = trunc;
  	    lodash.unescape = unescape;
  	    lodash.uniqueId = uniqueId;
  	    lodash.words = words;
  
  	    // Add aliases.
  	    lodash.all = every;
  	    lodash.any = some;
  	    lodash.contains = includes;
  	    lodash.eq = isEqual;
  	    lodash.detect = find;
  	    lodash.foldl = reduce;
  	    lodash.foldr = reduceRight;
  	    lodash.head = first;
  	    lodash.include = includes;
  	    lodash.inject = reduce;
  
  	    mixin(lodash, (function() {
  	      var source = {};
  	      baseForOwn(lodash, function(func, methodName) {
  	        if (!lodash.prototype[methodName]) {
  	          source[methodName] = func;
  	        }
  	      });
  	      return source;
  	    }()), false);
  
  	    /*------------------------------------------------------------------------*/
  
  	    // Add functions capable of returning wrapped and unwrapped values when chaining.
  	    lodash.sample = sample;
  
  	    lodash.prototype.sample = function(n) {
  	      if (!this.__chain__ && n == null) {
  	        return sample(this.value());
  	      }
  	      return this.thru(function(value) {
  	        return sample(value, n);
  	      });
  	    };
  
  	    /*------------------------------------------------------------------------*/
  
  	    /**
  	     * The semantic version number.
  	     *
  	     * @static
  	     * @memberOf _
  	     * @type string
  	     */
  	    lodash.VERSION = VERSION;
  
  	    // Assign default placeholders.
  	    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {
  	      lodash[methodName].placeholder = lodash;
  	    });
  
  	    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.
  	    arrayEach(['drop', 'take'], function(methodName, index) {
  	      LazyWrapper.prototype[methodName] = function(n) {
  	        var filtered = this.__filtered__;
  	        if (filtered && !index) {
  	          return new LazyWrapper(this);
  	        }
  	        n = n == null ? 1 : nativeMax(nativeFloor(n) || 0, 0);
  
  	        var result = this.clone();
  	        if (filtered) {
  	          result.__takeCount__ = nativeMin(result.__takeCount__, n);
  	        } else {
  	          result.__views__.push({ 'size': n, '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_MAP_FLAG;
  
  	      LazyWrapper.prototype[methodName] = function(iteratee, thisArg) {
  	        var result = this.clone();
  	        result.__iteratees__.push({ 'iteratee': getCallback(iteratee, thisArg, 1), 'type': type });
  	        result.__filtered__ = result.__filtered__ || isFilter;
  	        return result;
  	      };
  	    });
  
  	    // Add `LazyWrapper` methods for `_.first` and `_.last`.
  	    arrayEach(['first', '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 `_.rest`.
  	    arrayEach(['initial', 'rest'], function(methodName, index) {
  	      var dropName = 'drop' + (index ? '' : 'Right');
  
  	      LazyWrapper.prototype[methodName] = function() {
  	        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);
  	      };
  	    });
  
  	    // Add `LazyWrapper` methods for `_.pluck` and `_.where`.
  	    arrayEach(['pluck', 'where'], function(methodName, index) {
  	      var operationName = index ? 'filter' : 'map',
  	          createCallback = index ? baseMatches : property;
  
  	      LazyWrapper.prototype[methodName] = function(value) {
  	        return this[operationName](createCallback(value));
  	      };
  	    });
  
  	    LazyWrapper.prototype.compact = function() {
  	      return this.filter(identity);
  	    };
  
  	    LazyWrapper.prototype.reject = function(predicate, thisArg) {
  	      predicate = getCallback(predicate, thisArg, 1);
  	      return this.filter(function(value) {
  	        return !predicate(value);
  	      });
  	    };
  
  	    LazyWrapper.prototype.slice = function(start, end) {
  	      start = start == null ? 0 : (+start || 0);
  
  	      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 = (+end || 0);
  	        result = end < 0 ? result.dropRight(-end) : result.take(end - start);
  	      }
  	      return result;
  	    };
  
  	    LazyWrapper.prototype.takeRightWhile = function(predicate, thisArg) {
  	      return this.reverse().takeWhile(predicate, thisArg).reverse();
  	    };
  
  	    LazyWrapper.prototype.toArray = function() {
  	      return this.take(POSITIVE_INFINITY);
  	    };
  
  	    // Add `LazyWrapper` methods to `lodash.prototype`.
  	    baseForOwn(LazyWrapper.prototype, function(func, methodName) {
  	      var checkIteratee = /^(?:filter|map|reject)|While$/.test(methodName),
  	          retUnwrapped = /^(?:first|last)$/.test(methodName),
  	          lodashFunc = lodash[retUnwrapped ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName];
  
  	      if (!lodashFunc) {
  	        return;
  	      }
  	      lodash.prototype[methodName] = function() {
  	        var args = retUnwrapped ? [1] : arguments,
  	            chainAll = this.__chain__,
  	            value = this.__wrapped__,
  	            isHybrid = !!this.__actions__.length,
  	            isLazy = value instanceof LazyWrapper,
  	            iteratee = args[0],
  	            useLazy = isLazy || isArray(value);
  
  	        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {
  	          // Avoid lazy use if the iteratee has a "length" value other than `1`.
  	          isLazy = useLazy = false;
  	        }
  	        var interceptor = function(value) {
  	          return (retUnwrapped && chainAll)
  	            ? lodashFunc(value, 1)[0]
  	            : lodashFunc.apply(undefined, arrayPush([value], args));
  	        };
  
  	        var action = { 'func': thru, 'args': [interceptor], 'thisArg': undefined },
  	            onlyLazy = isLazy && !isHybrid;
  
  	        if (retUnwrapped && !chainAll) {
  	          if (onlyLazy) {
  	            value = value.clone();
  	            value.__actions__.push(action);
  	            return func.call(value);
  	          }
  	          return lodashFunc.call(undefined, this.value())[0];
  	        }
  	        if (!retUnwrapped && useLazy) {
  	          value = onlyLazy ? value : new LazyWrapper(this);
  	          var result = func.apply(value, args);
  	          result.__actions__.push(action);
  	          return new LodashWrapper(result, chainAll);
  	        }
  	        return this.thru(interceptor);
  	      };
  	    });
  
  	    // Add `Array` and `String` methods to `lodash.prototype`.
  	    arrayEach(['join', 'pop', 'push', 'replace', 'shift', 'sort', 'splice', 'split', 'unshift'], function(methodName) {
  	      var func = (/^(?:replace|split)$/.test(methodName) ? stringProto : arrayProto)[methodName],
  	          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',
  	          retUnwrapped = /^(?:join|pop|replace|shift)$/.test(methodName);
  
  	      lodash.prototype[methodName] = function() {
  	        var args = arguments;
  	        if (retUnwrapped && !this.__chain__) {
  	          return func.apply(this.value(), args);
  	        }
  	        return this[chainName](function(value) {
  	          return func.apply(value, args);
  	        });
  	      };
  	    });
  
  	    // Map minified function names to their real names.
  	    baseForOwn(LazyWrapper.prototype, function(func, methodName) {
  	      var lodashFunc = lodash[methodName];
  	      if (lodashFunc) {
  	        var key = lodashFunc.name,
  	            names = realNames[key] || (realNames[key] = []);
  
  	        names.push({ 'name': methodName, 'func': lodashFunc });
  	      }
  	    });
  
  	    realNames[createHybridWrapper(undefined, BIND_KEY_FLAG).name] = [{ 'name': 'wrapper', 'func': undefined }];
  
  	    // Add functions to the lazy wrapper.
  	    LazyWrapper.prototype.clone = lazyClone;
  	    LazyWrapper.prototype.reverse = lazyReverse;
  	    LazyWrapper.prototype.value = lazyValue;
  
  	    // Add chaining functions to the `lodash` wrapper.
  	    lodash.prototype.chain = wrapperChain;
  	    lodash.prototype.commit = wrapperCommit;
  	    lodash.prototype.concat = wrapperConcat;
  	    lodash.prototype.plant = wrapperPlant;
  	    lodash.prototype.reverse = wrapperReverse;
  	    lodash.prototype.toString = wrapperToString;
  	    lodash.prototype.run = lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;
  
  	    // Add function aliases to the `lodash` wrapper.
  	    lodash.prototype.collect = lodash.prototype.map;
  	    lodash.prototype.head = lodash.prototype.first;
  	    lodash.prototype.select = lodash.prototype.filter;
  	    lodash.prototype.tail = lodash.prototype.rest;
  
  	    return lodash;
  	  }
  
  	  /*--------------------------------------------------------------------------*/
  
  	  // Export lodash.
  	  var _ = runInContext();
  
  	  // Some AMD build optimizers like r.js check for condition patterns like the following:
  	  if (true) {
  	    // Expose lodash to the global object when an AMD loader is present to avoid
  	    // errors in cases where lodash is loaded by a script tag and not intended
  	    // as an AMD module. See http://requirejs.org/docs/errors.html#mismatch for
  	    // more details.
  	    root._ = _;
  
  	    // Define as an anonymous module so, through path mapping, it can be
  	    // referenced as the "underscore" module.
  	    !(__WEBPACK_AMD_DEFINE_RESULT__ = function() {
  	      return _;
  	    }.call(exports, __webpack_require__, exports, module), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
  	  }
  	  // Check for `exports` after `define` in case a build optimizer adds an `exports` object.
  	  else if (freeExports && freeModule) {
  	    // Export for Node.js or RingoJS.
  	    if (moduleExports) {
  	      (freeModule.exports = _)._ = _;
  	    }
  	    // Export for Rhino with CommonJS support.
  	    else {
  	      freeExports._ = _;
  	    }
  	  }
  	  else {
  	    // Export for a browser or Rhino.
  	    root._ = _;
  	  }
  	}.call(this));
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(28)(module), (function() { return this; }())))
  
  /***/ },
  /* 28 */
  /***/ function(module, exports) {
  
  	module.exports = function(module) {
  		if(!module.webpackPolyfill) {
  			module.deprecate = function() {};
  			module.paths = [];
  			// module.parent = undefined by default
  			module.children = [];
  			module.webpackPolyfill = 1;
  		}
  		return module;
  	}
  
  
  /***/ },
  /* 29 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(setImmediate, process, global) {/**
  	 * Highland: the high-level streams library
  	 *
  	 * Highland may be freely distributed under the Apache 2.0 license.
  	 * http://github.com/caolan/highland
  	 * Copyright (c) Caolan McMahon
  	 *
  	 */
  
  
  	var inherits = __webpack_require__(15).inherits;
  	var deprecate = __webpack_require__(32);
  	var EventEmitter = __webpack_require__(6).EventEmitter;
  	var Decoder = __webpack_require__(33).StringDecoder;
  
  	/**
  	 * The Stream constructor, accepts an array of values or a generator function
  	 * as an optional argument. This is typically the entry point to the Highland
  	 * APIs, providing a convenient way of chaining calls together.
  	 *
  	 * **Arrays -** Streams created from Arrays will emit each value of the Array
  	 * and then emit a [nil](#nil) value to signal the end of the Stream.
  	 *
  	 * **Generators -** These are functions which provide values for the Stream.
  	 * They are lazy and can be infinite, they can also be asynchronous (for
  	 * example, making a HTTP request). You emit values on the Stream by calling
  	 * `push(err, val)`, much like a standard Node.js callback. Once it has been
  	 * called, the generator function will not be called again unless you call
  	 * `next()`. This call to `next()` will signal you've finished processing the
  	 * current data and allow for the generator function to be called again. If the
  	 * Stream is still being consumed the generator function will then be called
  	 * again.
  	 *
  	 * You can also redirect a generator Stream by passing a new source Stream
  	 * to read from to next. For example: `next(other_stream)` - then any subsequent
  	 * calls will be made to the new source.
  	 *
  	 * **Node Readable Stream -** Pass in a Node Readable Stream object to wrap
  	 * it with the Highland API. Reading from the resulting Highland Stream will
  	 * begin piping the data from the Node Stream to the Highland Stream.
  	 *
  	 * **EventEmitter / jQuery Elements -** Pass in both an event name and an
  	 * event emitter as the two arguments to the constructor and the first
  	 * argument emitted to the event handler will be written to the new Stream.
  	 *
  	 * You can pass a mapping hint as the third argument, which specifies how
  	 * event arguments are pushed into the stream. If no mapping hint is provided,
  	 * only the first value emitted with the event to the will be pushed onto the
  	 * Stream.
  	 *
  	 * If `mappingHint` is a number, an array of that length will be pushed onto
  	 * the stream, containing exactly that many parameters from the event. If it's
  	 * an array, it's used as keys to map the arguments into an object which is
  	 * pushed to the tream. If it is a function, it's called with the event
  	 * arguments, and the returned value is pushed.
  	 *
  	 * **Promise -** Accepts an ES6 / jQuery style promise and returns a
  	 * Highland Stream which will emit a single value (or an error).
  	 *
  	 * **Iterator -** Accepts an ES6 style iterator that implements the [iterator protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_.22iterator.22_protocol):
  	 * yields all the values from the iterator using its `next()` method and terminates when the
  	 * iterator's done value returns true. If the iterator's `next()` method throws, the exception will be emitted as an error,
  	 * and the stream will be ended with no further calls to `next()`.
  	 *
  	 * **Iterable -** Accepts an object that implements the [iterable protocol](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#The_.22iterable.22_protocol),
  	 * i.e., contains a method that returns an object that conforms to the iterator protocol. The stream will use the
  	 * iterator defined in the `Symbol.iterator` property of the iterable object to generate emitted values.
  	 *
  	 * @id _(source)
  	 * @section Stream Objects
  	 * @name _(source)
  	 * @param {Array | Function | Iterator | Iterable | Promise | Readable Stream | String} source - (optional) source to take values from from
  	 * @param {EventEmitter | jQuery Element} eventEmitter - (optional) an event emitter. Only valid if `source` is a String.
  	 * @param {Array | Function | Number} mappingHint - (optional) how to pass the
  	 * arguments to the callback. Only valid if `source` is a String.
  	 * @api public
  	 *
  	 * // from an Array
  	 * _([1, 2, 3, 4]);
  	 *
  	 * // using a generator function
  	 * _(function (push, next) {
  	 *     push(null, 1);
  	 *     push(err);
  	 *     next();
  	 * });
  	 *
  	 * // a stream with no source, can pipe node streams through it etc.
  	 * var through = _();
  	 *
  	 * // wrapping a Node Readable Stream so you can easily manipulate it
  	 * _(readable).filter(hasSomething).pipe(writeable);
  	 *
  	 * // creating a stream from events
  	 * _('click', btn).each(handleEvent);
  	 *
  	 * // creating a stream from events with mapping
  	 * _('request', httpServer, ['req', 'res']).each(handleEvent);
  	 *
  	 * // from a Promise object
  	 * var foo = _($.getJSON('/api/foo'));
  	 *
  	 * //from an iterator
  	 * var map = new Map([['a', 1], ['b', 2]]);
  	 * var bar = _(map.values()).toArray(_.log);
  	 * //=> [1, 2]
  	 *
  	 * //from an iterable
  	 * var set = new Set([1, 2, 2, 3, 4]);
  	 * var bar = _(set).toArray(_.log);
  	 * //=> [ 1, 2, 3, 4]
  	 */
  
  	/*eslint-disable no-multi-spaces */
  	exports = module.exports = function (/*optional*/xs, /*optional*/ee, /*optional*/ mappingHint) {
  	    /*eslint-enable no-multi-spaces */
  	    return new Stream(xs, ee, mappingHint);
  	};
  
  	var _ = exports;
  
  	// Create quick slice reference variable for speed
  	var slice = Array.prototype.slice;
  	var hasOwn = Object.prototype.hasOwnProperty;
  
  	// ES5 detected value, used for switch between ES5 and ES3 code
  	var isES5 = (function () {
  	  'use strict';
  	  return Function.prototype.bind && !this;
  	}());
  
  
  	_.isUndefined = function (x) {
  	    return typeof x === 'undefined';
  	};
  
  	_.isFunction = function (x) {
  	    return typeof x === 'function';
  	};
  
  	_.isObject = function (x) {
  	    return typeof x === 'object' && x !== null;
  	};
  
  	_.isString = function (x) {
  	    return typeof x === 'string';
  	};
  
  	_.isArray = Array.isArray || function (x) {
  	    return Object.prototype.toString.call(x) === '[object Array]';
  	};
  
  	// setImmediate browser fallback
  	if (typeof setImmediate === 'undefined') {
  	    _.setImmediate = function (fn) {
  	        setTimeout(fn, 0);
  	    };
  	}
  	// check no process.stdout to detect browserify
  	else if (typeof process === 'undefined' || !(process.stdout)) {
  	    // modern browser - but not a direct alias for IE10 compatibility
  	    _.setImmediate = function (fn) {
  	        setImmediate(fn);
  	    };
  	}
  	else {
  	    _.setImmediate = setImmediate;
  	}
  
  	/**
  	 * The end of stream marker. This is sent along the data channel of a Stream
  	 * to tell consumers that the Stream has ended. See the example map code for
  	 * an example of detecting the end of a Stream.
  	 *
  	 * Note: `nil` is setup as a global where possible. This makes it convenient
  	 * to access, but more importantly lets Streams from different Highland
  	 * instances work together and detect end-of-stream properly. This is mostly
  	 * useful for NPM where you may have many different Highland versions installed.
  	 *
  	 * @id nil
  	 * @section Utils
  	 * @name _.nil
  	 * @api public
  	 *
  	 * var map = function (iter, source) {
  	 *     return source.consume(function (err, val, push, next) {
  	 *         if (err) {
  	 *             push(err);
  	 *             next();
  	 *         }
  	 *         else if (val === _.nil) {
  	 *             push(null, val);
  	 *         }
  	 *         else {
  	 *             push(null, iter(val));
  	 *             next();
  	 *         }
  	 *     });
  	 * };
  	 */
  
  	// set up a global nil object in cases where you have multiple Highland
  	// instances installed (often via npm)
  	var _global = this;
  	if (typeof global !== 'undefined') {
  	    _global = global;
  	}
  	else if (typeof window !== 'undefined') {
  	    _global = window;
  	}
  	if (!_global.nil) {
  	    _global.nil = {};
  	}
  	var nil = _.nil = _global.nil;
  
  	/**
  	 * Transforms a function with specific arity (all arguments must be
  	 * defined) in a way that it can be called as a chain of functions until
  	 * the arguments list is saturated.
  	 *
  	 * This function is not itself curryable.
  	 *
  	 * @id curry
  	 * @name _.curry(fn, [*arguments])
  	 * @section Functions
  	 * @param {Function} fn - the function to curry
  	 * @param args.. - any number of arguments to pre-apply to the function
  	 * @returns Function
  	 * @api public
  	 *
  	 * fn = curry(function (a, b, c) {
  	 *     return a + b + c;
  	 * });
  	 *
  	 * fn(1)(2)(3) == fn(1, 2, 3)
  	 * fn(1, 2)(3) == fn(1, 2, 3)
  	 * fn(1)(2, 3) == fn(1, 2, 3)
  	 */
  
  	_.curry = function (fn /* args... */) {
  	    var args = slice.call(arguments);
  	    return _.ncurry.apply(this, [fn.length].concat(args));
  	};
  
  	/**
  	 * Same as `curry` but with a specific number of arguments. This can be
  	 * useful when functions do not explicitly define all its parameters.
  	 *
  	 * This function is not itself curryable.
  	 *
  	 * @id ncurry
  	 * @name _.ncurry(n, fn, [args...])
  	 * @section Functions
  	 * @param {Number} n - the number of arguments to wait for before apply fn
  	 * @param {Function} fn - the function to curry
  	 * @param args... - any number of arguments to pre-apply to the function
  	 * @returns Function
  	 * @api public
  	 *
  	 * fn = ncurry(3, function () {
  	 *     return Array.prototype.join.call(arguments, '.');
  	 * });
  	 *
  	 * fn(1, 2, 3) == '1.2.3';
  	 * fn(1, 2)(3) == '1.2.3';
  	 * fn(1)(2)(3) == '1.2.3';
  	 */
  
  	_.ncurry = function (n, fn /* args... */) {
  	    var largs = slice.call(arguments, 2);
  	    if (largs.length >= n) {
  	        return fn.apply(this, largs.slice(0, n));
  	    }
  
  	    return _.partial.apply(this, [_.ncurry, n, fn].concat(largs));
  	};
  
  	/**
  	 * Partially applies the function (regardless of whether it has had curry
  	 * called on it). This will always postpone execution until at least the next
  	 * call of the partially applied function.
  	 *
  	 * @id partial
  	 * @name _.partial(fn, args...)
  	 * @section Functions
  	 * @param {Function} fn - function to partial apply
  	 * @param args... - the arguments to apply to the function
  	 * @api public
  	 *
  	 * var addAll = function () {
  	 *     var args = Array.prototype.slice.call(arguments);
  	 *     return foldl1(add, args);
  	 * };
  	 * var f = partial(addAll, 1, 2);
  	 * f(3, 4) == 10
  	 */
  
  	_.partial = function (f /* args... */) {
  	    var args = slice.call(arguments, 1);
  	    return function () {
  	        return f.apply(this, args.concat(slice.call(arguments)));
  	    };
  	};
  
  	/**
  	 * Evaluates the function `fn` with the argument positions swapped. Only
  	 * works with functions that accept two arguments.
  	 *
  	 * @id flip
  	 * @name _.flip(fn, [x, y])
  	 * @section Functions
  	 * @param {Function} fn - function to flip argument application for
  	 * @param x - parameter to apply to the right hand side of f
  	 * @param y - parameter to apply to the left hand side of f
  	 * @api public
  	 *
  	 * div(2, 4) == 0.5
  	 * flip(div, 2, 4) == 2
  	 * flip(div)(2, 4) == 2
  	 */
  
  	_.flip = _.curry(function (fn, x, y) { return fn(y, x); });
  
  	/**
  	 * Creates a composite function, which is the application of function1 to
  	 * the results of function2. You can pass an arbitrary number of arguments
  	 * and have them composed. This means you can't partially apply the compose
  	 * function itself.
  	 *
  	 * @id compose
  	 * @name _.compose(fn1, fn2, ...)
  	 * @section Functions
  	 * @api public
  	 *
  	 * var add1 = add(1);
  	 * var mul3 = mul(3);
  	 *
  	 * var add1mul3 = compose(mul3, add1);
  	 * add1mul3(2) == 9
  	 */
  
  	_.compose = function (/*functions...*/) {
  	    var fns = slice.call(arguments).reverse();
  	    return _.seq.apply(null, fns);
  	};
  
  	/**
  	 * The reversed version of [compose](#compose). Where arguments are in the
  	 * order of application.
  	 *
  	 * @id seq
  	 * @name _.seq(fn1, fn2, ...)
  	 * @section Functions
  	 * @api public
  	 *
  	 * var add1 = add(1);
  	 * var mul3 = mul(3);
  	 *
  	 * var add1mul3 = seq(add1, mul3);
  	 * add1mul3(2) == 9
  	 */
  
  	_.seq = function () {
  	    var fns = slice.call(arguments);
  	    return function () {
  	        if (!fns.length) {
  	            return null;
  	        }
  	        var r = fns[0].apply(this, arguments);
  	        for (var i = 1; i < fns.length; i++) {
  	            r = fns[i].call(this, r);
  	        }
  	        return r;
  	    };
  	};
  
  	function nop() {
  	    // Do nothing.
  	}
  
  	function pipeReadable(xs, stream) {
  	    // write any errors into the stream
  	    xs.on('error', writeStreamError);
  	    xs.pipe(stream);
  
  	    // TODO: Replace with onDestroy in v3.
  	    stream._destructors.push(function () {
  	        if (xs.unpipe) {
  	            xs.unpipe(stream);
  	        }
  	        xs.removeListener('error', writeStreamError);
  	    });
  
  	    function writeStreamError(err) {
  	        stream.write(new StreamError(err));
  	    }
  	}
  
  	function promiseStream(promise) {
  	    return _(function (push) {
  	        promise.then(function (value) {
  	                push(null, value);
  	                return push(null, nil);
  	            },
  	            function (err) {
  	                push(err);
  	                return push(null, nil);
  	            });
  	    });
  	}
  
  	function iteratorStream(it) {
  	    return _(function (push, next) {
  	        var iterElem, iterErr;
  	        try {
  	            iterElem = it.next();
  	        }
  	        catch (err) {
  	            iterErr = err;
  	        }
  
  	        if (iterErr) {
  	            push(iterErr);
  	            push(null, _.nil);
  	        }
  	        else if (iterElem.done) {
  	            if (!_.isUndefined(iterElem.value)) {
  	                // generators can return a final
  	                // value on completion using return
  	                // keyword otherwise value will be
  	                // undefined
  	                push(null, iterElem.value);
  	            }
  	            push(null, _.nil);
  	        }
  	        else {
  	            push(null, iterElem.value);
  	            next();
  	        }
  
  	    });
  	}
  
  	function hintMapper(mappingHint) {
  	    var mappingHintType = (typeof mappingHint);
  	    var mapper;
  
  	    if (mappingHintType === 'function') {
  	        mapper = mappingHint;
  	    }
  	    else if (mappingHintType === 'number') {
  	        mapper = function () {
  	            return slice.call(arguments, 0, mappingHint);
  	        };
  	    }
  	    else if (_.isArray(mappingHint)) {
  	        mapper = function () {
  	            var args = arguments;
  	            return mappingHint.reduce(function (ctx, hint, idx) {
  	                ctx[hint] = args[idx];
  	                return ctx;
  	            }, {});
  	        };
  	    }
  	    else {
  	        mapper = function (x) { return x; };
  	    }
  
  	    return mapper;
  	}
  
  	function pipeStream(src, dest, write, end, passAlongErrors) {
  	    var resume = null;
  	    var s = src.consume(function (err, x, push, next) {
  	        var canContinue;
  	        if (err) {
  	            if (passAlongErrors) {
  	                canContinue = write.call(dest, new StreamError(err));
  	            }
  	            else {
  	                src.emit('error', err);
  	                canContinue = true;
  	            }
  	        }
  	        else if (x === nil) {
  	            end.call(dest);
  	            return;
  	        }
  	        else {
  	            canContinue = write.call(dest, x);
  	        }
  
  	        if (canContinue !== false) {
  	            next();
  	        }
  	        else {
  	            resume = next;
  	        }
  	    });
  
  	    dest.on('drain', onConsumerDrain);
  
  	    // Since we don't keep a reference to piped-to streams,
  	    // save a callback that will unbind the event handler.
  	    src._destructors.push(function () {
  	        dest.removeListener('drain', onConsumerDrain);
  	    });
  
  	    dest.emit('pipe', src);
  
  	    s.resume();
  	    return dest;
  
  	    function onConsumerDrain() {
  	        if (resume) {
  	            var oldResume = resume;
  	            resume = null;
  	            oldResume();
  	        }
  	    }
  	}
  
  	function generatorPush(stream, write) {
  	    if (!write) {
  	        write = stream.write;
  	    }
  
  	    return function (err, x) {
  	        if (stream._nil_seen) {
  	            throw new Error('Can not write to stream after nil');
  	        }
  
  	        if (x === nil) {
  	            stream._nil_seen = true;
  	        }
  
  	        write.call(stream, err ? new StreamError(err) : x);
  	    };
  	}
  
  
  	/**
  	 * Actual Stream constructor wrapped the the main exported function
  	 */
  
  	/*eslint-disable no-multi-spaces */
  	function Stream(/*optional*/xs, /*optional*/ee, /*optional*/mappingHint) {
  	    /*eslint-enable no-multi-spaces */
  	    if (xs && _.isStream(xs)) {
  	        // already a Stream
  	        return xs;
  	    }
  
  	    EventEmitter.call(this);
  	    var self = this;
  
  	    // used to detect Highland Streams using isStream(x), this
  	    // will work even in cases where npm has installed multiple
  	    // versions, unlike an instanceof check
  	    self.__HighlandStream__ = true;
  
  	    self.id = ('' + Math.random()).substr(2, 6);
  	    this.paused = true;
  	    this._incoming = [];
  	    this._outgoing = [];
  	    this._consumers = [];
  	    this._observers = [];
  	    this._destructors = [];
  	    this._send_events = false;
  	    this._nil_seen = false;
  	    this._delegate = null;
  	    this._is_observer = false;
  	    this._in_consume_cb = false;
  	    this._repeat_resume = false;
  	    this.source = null;
  
  	    // Old-style node Stream.pipe() checks for this
  	    this.writable = true;
  
  	    self.on('newListener', function (ev) {
  	        if (ev === 'data') {
  	            self._send_events = true;
  	            _.setImmediate(self.resume.bind(self));
  	        }
  	        else if (ev === 'end') {
  	            // this property avoids us checking the length of the
  	            // listners subscribed to each event on each _send() call
  	            self._send_events = true;
  	        }
  	    });
  
  	    // TODO: write test to cover this removeListener code
  	    self.on('removeListener', function (ev) {
  	        if (ev === 'end' || ev === 'data') {
  	            var end_listeners = self.listeners('end').length;
  	            var data_listeners = self.listeners('data').length;
  	            if (end_listeners + data_listeners === 0) {
  	                // stop emitting events
  	                self._send_events = false;
  	            }
  	        }
  	    });
  
  	    if (_.isUndefined(xs)) {
  	        // nothing else to do
  	        return this;
  	    }
  	    else if (_.isArray(xs)) {
  	        self._incoming = xs.concat([nil]);
  	        return this;
  	    }
  	    else if (_.isFunction(xs)) {
  	        this._generator = xs;
  	        this._generator_push = generatorPush(this);
  	        this._generator_next = function (s) {
  	            if (self._nil_seen) {
  	                throw new Error('Can not call next after nil');
  	            }
  
  	            if (s) {
  	                // we MUST pause to get the redirect object into the _incoming
  	                // buffer otherwise it would be passed directly to _send(),
  	                // which does not handle StreamRedirect objects!
  	                var _paused = self.paused;
  	                if (!_paused) {
  	                    self.pause();
  	                }
  	                self.write(new StreamRedirect(s));
  	                if (!_paused) {
  	                    self.resume();
  	                }
  	            }
  	            else {
  	                self._generator_running = false;
  	            }
  	            if (!self.paused) {
  	                self.resume();
  	            }
  	        };
  
  	        return this;
  	    }
  	    else if (_.isObject(xs)) {
  	        // check to see if we have a readable stream
  	        if (_.isFunction(xs.on) && _.isFunction(xs.pipe)) {
  	            pipeReadable(xs, self);
  	            return this;
  	        }
  	        else if (_.isFunction(xs.then)) {
  	            //probably a promise
  	            return promiseStream(xs);
  	        }
  	        // must check iterators and iterables in this order
  	        // because generators are both iterators and iterables:
  	        // their Symbol.iterator method returns the `this` object
  	        // and an infinite loop would result otherwise
  	        else if (_.isFunction(xs.next)) {
  	            //probably an iterator
  	            return iteratorStream(xs);
  	        }
  	        else if (!_.isUndefined(_global.Symbol) && xs[_global.Symbol.iterator]) {
  	            //probably an iterable
  	            return iteratorStream(xs[_global.Symbol.iterator]());
  	        }
  	        else {
  	            throw new Error(
  	                'Object was not a stream, promise, iterator or iterable: ' + (typeof xs)
  	            );
  	        }
  	    }
  	    else if (_.isString(xs)) {
  	        var mapper = hintMapper(mappingHint);
  
  	        ee.on(xs, function () {
  	            var ctx = mapper.apply(this, arguments);
  	            self.write(ctx);
  	        });
  
  	        return this;
  	    }
  	    else {
  	        throw new Error(
  	            'Unexpected argument type to Stream(): ' + (typeof xs)
  	        );
  	    }
  	}
  	inherits(Stream, EventEmitter);
  
  	/**
  	 * adds a top-level _.foo(mystream) style export for Stream methods
  	 */
  
  	function exposeMethod(name) {
  	    var f = Stream.prototype[name];
  	    var n = f.length;
  	    _[name] = _.ncurry(n + 1, function () {
  	        var args = slice.call(arguments);
  	        var s = _(args.pop());
  	        return f.apply(s, args);
  	    });
  	}
  
  	/**
  	 * Used as an Error marker when writing to a Stream's incoming buffer
  	 */
  
  	function StreamError(err) {
  	    this.__HighlandStreamError__ = true;
  	    this.error = err;
  	}
  
  	/**
  	 * Used as a Redirect marker when writing to a Stream's incoming buffer
  	 */
  
  	function StreamRedirect(to) {
  	    this.__HighlandStreamRedirect__ = true;
  	    this.to = to;
  	}
  
  	/**
  	 * Returns true if `x` is a Highland Stream.
  	 *
  	 * @id isStream
  	 * @section Utils
  	 * @name _.isStream(x)
  	 * @param x - the object to test
  	 * @returns {Boolean}
  	 * @api public
  	 *
  	 * _.isStream('foo')  // => false
  	 * _.isStream(_([1,2,3]))  // => true
  	 */
  
  	_.isStream = function (x) {
  	    return _.isObject(x) && !!x.__HighlandStream__;
  	};
  
  	_._isStreamError = function (x) {
  	    return _.isObject(x) && !!x.__HighlandStreamError__;
  	};
  
  	_._isStreamRedirect = function (x) {
  	    return _.isObject(x) && !!x.__HighlandStreamRedirect__;
  	};
  
  	/**
  	 * Sends errors / data to consumers, observers and event handlers
  	 */
  
  	Stream.prototype._send = function (err, x) {
  	    //console.log(['_send', this.id, err, x]);
  	    var token;
  
  	    if (x === nil) {
  	        this.ended = true;
  	    }
  	    if (this._consumers.length) {
  	        token = err ? new StreamError(err) : x;
  	        // this._consumers may be changed from under us,
  	        // so we keep a copy.
  	        var consumers = this._consumers;
  	        for (var i = 0, len = consumers.length; i < len; i++) {
  	            consumers[i].write(token);
  	        }
  	    }
  	    if (this._observers.length) {
  	        token = err ? new StreamError(err) : x;
  	        // this._observers may be changed from under us,
  	        // so we keep a copy.
  	        var observers = this._observers;
  	        for (var j = 0, len2 = observers.length; j < len2; j++) {
  	            observers[j].write(token);
  	        }
  	    }
  	    if (this._send_events) {
  	        if (err) {
  	            this.emit('error', err);
  	        }
  	        else if (x === nil) {
  	            this.emit('end');
  	        }
  	        else {
  	            this.emit('data', x);
  	        }
  	    }
  	};
  
  	/**
  	 * Pauses the stream. All Highland Streams start in the paused state.
  	 *
  	 * It is unlikely that you will need to manually call this method.
  	 *
  	 * @id pause
  	 * @section Stream Objects
  	 * @name Stream.pause()
  	 * @api public
  	 *
  	 * var xs = _(generator);
  	 * xs.pause();
  	 */
  
  	Stream.prototype.pause = function () {
  	    //console.log(['pause', this.id]);
  	    this.paused = true;
  	    if (!this._is_observer && this.source) {
  	        this.source._checkBackPressure();
  	    }
  	};
  
  	/**
  	 * When there is a change in downstream consumers, it will often ask
  	 * the parent Stream to re-check its state and pause/resume accordingly.
  	 */
  
  	Stream.prototype._checkBackPressure = function () {
  	    if (!this._consumers.length) {
  	        this._repeat_resume = false;
  	        return this.pause();
  	    }
  	    for (var i = 0, len = this._consumers.length; i < len; i++) {
  	        if (this._consumers[i].paused) {
  	            this._repeat_resume = false;
  	            return this.pause();
  	        }
  	    }
  	    return this.resume();
  	};
  
  	/**
  	 * Starts pull values out of the incoming buffer and sending them downstream,
  	 * this will exit early if this causes a downstream consumer to pause.
  	 */
  
  	Stream.prototype._readFromBuffer = function () {
  	    //console.log(['_readFromBuffer', this.id, this.paused, this._incoming]);
  	    var len = this._incoming.length;
  	    var i = 0;
  	    while (i < len && !this.paused) {
  	        var x = this._incoming[i];
  	        if (_._isStreamError(x)) {
  	            this._send(x.error);
  	        }
  	        else if (_._isStreamRedirect(x)) {
  	            this._redirect(x.to);
  	        }
  	        else {
  	            this._send(null, x);
  	        }
  	        i++;
  	    }
  	    // remove processed data from _incoming buffer
  	    this._incoming.splice(0, i);
  	};
  
  	/**
  	 * Starts pull values out of the incoming buffer and sending them downstream,
  	 * this will exit early if this causes a downstream consumer to pause.
  	 */
  
  	Stream.prototype._sendOutgoing = function () {
  	    //console.log(['_sendOutgoing', this.id, this.paused, this._outgoing]);
  	    var len = this._outgoing.length;
  	    var i = 0;
  	    while (i < len && !this.paused) {
  	        var x = this._outgoing[i];
  	        if (_._isStreamError(x)) {
  	            Stream.prototype._send.call(this, x.error);
  	        }
  	        else if (_._isStreamRedirect(x)) {
  	            this._redirect(x.to);
  	        }
  	        else {
  	            Stream.prototype._send.call(this, null, x);
  	        }
  	        i++;
  	    }
  	    // remove processed data from _outgoing buffer
  	    this._outgoing.splice(0, i);
  	};
  
  	/**
  	 * Resumes a paused Stream. This will either read from the Stream's incoming
  	 * buffer or request more data from an upstream source. Never call this method
  	 * on a stream that has been consumed (via a call to [consume](#consume) or any
  	 * other transform).
  	 *
  	 * @id resume
  	 * @section Stream Objects
  	 * @name Stream.resume()
  	 * @api public
  	 *
  	 * var xs = _(generator);
  	 * xs.resume();
  	 */
  
  	Stream.prototype.resume = function () {
  	    //console.log(['resume', this.id]);
  	    if (this._resume_running || this._in_consume_cb) {
  	        //console.log(['resume already processing _incoming buffer, ignore resume call']);
  	        // already processing _incoming buffer, ignore resume call
  	        this._repeat_resume = true;
  	        return;
  	    }
  	    this._resume_running = true;
  	    do {
  	        // use a repeat flag to avoid recursing resume() calls
  	        this._repeat_resume = false;
  	        this.paused = false;
  
  	        // send values from outgoing buffer first
  	        this._sendOutgoing();
  
  	        // send values from incoming buffer before reading from source
  	        this._readFromBuffer();
  
  	        // we may have paused while reading from buffer
  	        if (!this.paused && !this._is_observer) {
  	            // ask parent for more data
  	            if (this.source) {
  	                //console.log(['ask parent for more data']);
  	                this.source._checkBackPressure();
  	            }
  	            // run _generator to fill up _incoming buffer
  	            else if (this._generator) {
  	                //console.log(['run generator to fill up _incoming buffer']);
  	                this._runGenerator();
  	            }
  	            else {
  	                // perhaps a node stream is being piped in
  	                this.emit('drain');
  	            }
  	        }
  	    } while (this._repeat_resume);
  	    this._resume_running = false;
  	};
  
  	/**
  	 * Ends a Stream. This is the same as sending a [nil](#nil) value as data.
  	 * You shouldn't need to call this directly, rather it will be called by
  	 * any [Node Readable Streams](http://nodejs.org/api/stream.html#stream_class_stream_readable)
  	 * you pipe in.
  	 *
  	 * Only call this function on streams that were constructed with no source
  	 * (i.e., with `_()`).
  	 *
  	 * @id end
  	 * @section Stream Objects
  	 * @name Stream.end()
  	 * @api public
  	 *
  	 * mystream.end();
  	 */
  
  	Stream.prototype.end = function () {
  	    this.write(nil);
  	};
  
  	/**
  	 * Pipes a Highland Stream to a [Node Writable Stream](http://nodejs.org/api/stream.html#stream_class_stream_writable)
  	 * (Highland Streams are also Node Writable Streams). This will pull all the
  	 * data from the source Highland Stream and write it to the destination,
  	 * automatically managing flow so that the destination is not overwhelmed
  	 * by a fast source.
  	 *
  	 * Users may optionally pass an object that may contain any of these fields:
  	 *
  	 * - `end` - Ends the destination when this stream ends. Default: `true`. This
  	 *   option has no effect if the destination is either `process.stdout` or
  	 *   `process.stderr`. Those two streams are never ended.
  	 *
  	 * Like [Readable#pipe](https://nodejs.org/api/stream.html#stream_readable_pipe_destination_options),
  	 * this function will throw errors if there is no `error` handler installed on
  	 * the stream. Use [through](#through) if you are piping to another Highland
  	 * stream and want errors as well as values to be propagated.
  	 *
  	 * This function returns the destination so you can chain together pipe calls.
  	 *
  	 * @id pipe
  	 * @section Consumption
  	 * @name Stream.pipe(dest, options)
  	 * @param {Writable Stream} dest - the destination to write all data to
  	 * @param {Object} options - (optional) pipe options.
  	 * @api public
  	 *
  	 * var source = _(generator);
  	 * var dest = fs.createWriteStream('myfile.txt')
  	 * source.pipe(dest);
  	 *
  	 * // chained call
  	 * source.pipe(through).pipe(dest);
  	 */
  
  	Stream.prototype.pipe = function (dest, options) {
  	    options = options || {};
  
  	    // stdout and stderr are special case writables that cannot be closed
  	    var canClose = dest !== process.stdout && dest !== process.stderr && options.end !== false;
  
  	    var end;
  	    if (canClose) {
  	        end = dest.end;
  	    }
  	    else {
  	        end = nop;
  	    }
  
  	    return pipeStream(this, dest, dest.write, end, false);
  	};
  
  	/**
  	 * Destroys a stream by unlinking it from any consumers and sources. This will
  	 * stop all consumers from receiving events from this stream and removes this
  	 * stream as a consumer of any source stream.
  	 *
  	 * This function calls end() on the stream and unlinks it from any piped-to streams.
  	 *
  	 * @id destroy
  	 * @section Stream Objects
  	 * @name Stream.destroy()
  	 * @api public
  	 */
  
  	Stream.prototype.destroy = function () {
  	    var self = this;
  	    this.end();
  	    _(this._consumers).each(function (consumer) {
  	        self._removeConsumer(consumer);
  	    });
  	    _(this._observers).each(function (observer) {
  	        self._removeObserver(observer);
  	    });
  
  	    if (this.source) {
  	        var source = this.source;
  	        source._removeConsumer(this);
  	        source._removeObserver(this);
  	    }
  	    _(this._destructors).each(function (destructor) {
  	        destructor.call(self);
  	    });
  	};
  
  	/**
  	 * Runs the generator function for this Stream. If the generator is already
  	 * running (it has been called and not called next() yet) then this function
  	 * will do nothing.
  	 */
  
  	Stream.prototype._runGenerator = function () {
  	    //console.log(['_runGenerator', this.id]);
  	    // if _generator already running, exit
  	    if (this._generator_running) {
  	        return;
  	    }
  	    this._generator_running = true;
  	    this._generator(this._generator_push, this._generator_next);
  	};
  
  	/**
  	 * Performs the redirect from one Stream to another. In order for the
  	 * redirect to happen at the appropriate time, it is put on the incoming
  	 * buffer as a StreamRedirect object, and this function is called
  	 * once it is read from the buffer.
  	 */
  
  	Stream.prototype._redirect = function (to) {
  	    //console.log(['_redirect', this.id, '=>', to.id]);
  	    // coerce to Stream
  	    to = _(to);
  
  	    while (to._delegate) {
  	        to = to._delegate;
  	    }
  
  	    to._consumers = this._consumers.map(function (c) {
  	        c.source = to;
  	        return c;
  	    });
  
  	    // TODO: copy _observers
  	    this._consumers = [];
  	    //[this.consume = function () {
  	    //    return to.consume.apply(to, arguments);
  	    //};
  	    //this._removeConsumer = function () {
  	    //    return to._removeConsumer.apply(to, arguments);
  	    //};
  
  	    // this will cause a memory leak as long as the root object is around
  	    to._delegate_source = this._delegate_source || this;
  	    to._delegate_source._delegate = to;
  
  	    if (this.paused) {
  	        to.pause();
  	    }
  	    else {
  	        this.pause();
  	        to._checkBackPressure();
  	    }
  	};
  
  	/**
  	 * Adds a new consumer Stream, which will accept data and provide backpressure
  	 * to this Stream. Adding more than one consumer will cause an exception to be
  	 * thrown as the backpressure strategy must be explicitly chosen by the
  	 * developer (through calling fork or observe).
  	 */
  
  	Stream.prototype._addConsumer = function (s) {
  	    if (this._consumers.length) {
  	        throw new Error(
  	            'Stream already being consumed, you must either fork() or observe()'
  	        );
  	    }
  	    s.source = this;
  	    this._consumers.push(s);
  	    this._checkBackPressure();
  	};
  
  	/**
  	 * Removes a consumer from this Stream.
  	 */
  
  	Stream.prototype._removeConsumer = function (s) {
  	    var src = this;
  	    while (src._delegate) {
  	        src = src._delegate;
  	    }
  	    src._consumers = src._consumers.filter(function (c) {
  	        return c !== s;
  	    });
  	    if (s.source === src) {
  	        s.source = null;
  	    }
  	    src._checkBackPressure();
  	};
  
  	/**
  	 * Removes an observer from this Stream.
  	 */
  
  	Stream.prototype._removeObserver = function (s) {
  	    this._observers = this._observers.filter(function (o) {
  	        return o !== s;
  	    });
  	    if (s.source === this) {
  	        s.source = null;
  	    }
  	};
  
  	/**
  	 * Consumes values from a Stream (once resumed) and returns a new Stream for
  	 * you to optionally push values onto using the provided push / next functions.
  	 *
  	 * This function forms the basis of many higher-level Stream operations.
  	 * It will not cause a paused stream to immediately resume, but behaves more
  	 * like a 'through' stream, handling values as they are read.
  	 *
  	 * @id consume
  	 * @section Transforms
  	 * @name Stream.consume(f)
  	 * @param {Function} f - the function to handle errors and values
  	 * @api public
  	 *
  	 * var filter = function (f, source) {
  	 *     return source.consume(function (err, x, push, next) {
  	 *         if (err) {
  	 *             // pass errors along the stream and consume next value
  	 *             push(err);
  	 *             next();
  	 *         }
  	 *         else if (x === _.nil) {
  	 *             // pass nil (end event) along the stream
  	 *             push(null, x);
  	 *         }
  	 *         else {
  	 *             // pass on the value only if the value passes the predicate
  	 *             if (f(x)) {
  	 *                 push(null, x);
  	 *             }
  	 *             next();
  	 *         }
  	 *     });
  	 * };
  	 */
  
  	Stream.prototype.consume = function (f) {
  	    var self = this;
  	    while (self._delegate) {
  	        self = self._delegate;
  	    }
  	    var s = new Stream();
  	    var _send = s._send;
  	    var push = function (err, x) {
  	        //console.log(['push', err, x, s.paused]);
  	        if (s._nil_seen) {
  	            throw new Error('Can not write to stream after nil');
  	        }
  	        if (x === nil) {
  	            // ended, remove consumer from source
  	            s._nil_seen = true;
  	            self._removeConsumer(s);
  	        }
  	        if (s.paused) {
  	            if (err) {
  	                s._outgoing.push(new StreamError(err));
  	            }
  	            else {
  	                s._outgoing.push(x);
  	            }
  	        }
  	        else {
  	            _send.call(s, err, x);
  	        }
  	    };
  	    var async;
  	    var next_called;
  	    var next = function (s2) {
  	        //console.log(['next', async]);
  	        if (s._nil_seen) {
  	            throw new Error('Can not call next after nil');
  	        }
  	        if (s2) {
  	            // we MUST pause to get the redirect object into the _incoming
  	            // buffer otherwise it would be passed directly to _send(),
  	            // which does not handle StreamRedirect objects!
  	            var _paused = s.paused;
  	            if (!_paused) {
  	                s.pause();
  	            }
  	            s.write(new StreamRedirect(s2));
  	            if (!_paused) {
  	                s.resume();
  	            }
  	        }
  	        else if (async) {
  	            s.resume();
  	        }
  	        else {
  	            next_called = true;
  	        }
  	    };
  	    s._send = function (err, x) {
  	        async = false;
  	        next_called = false;
  	        s._in_consume_cb = true;
  
  	        f(err, x, push, next);
  
  	        s._in_consume_cb = false;
  	        async = true;
  
  	        // Don't pause if x is nil -- as next will never be called after
  	        if (!next_called && x !== nil) {
  	            s.pause();
  	        }
  
  	        if (s._repeat_resume) {
  	            s._repeat_resume = false;
  	            s.resume();
  	        }
  	    };
  	    self._addConsumer(s);
  	    self._already_consumed = true;
  	    return s;
  	};
  	exposeMethod('consume');
  
  	/**
  	 * Consumes a single item from the Stream. Unlike consume, this function will
  	 * not provide a new stream for you to push values onto, and it will unsubscribe
  	 * as soon as it has a single error, value or nil from the source.
  	 *
  	 * You probably won't need to use this directly, but it is used internally by
  	 * some functions in the Highland library.
  	 *
  	 * @id pull
  	 * @section Consumption
  	 * @name Stream.pull(f)
  	 * @param {Function} f - the function to handle data
  	 * @api public
  	 *
  	 * xs.pull(function (err, x) {
  	 *     // do something
  	 * });
  	 */
  
  	Stream.prototype.pull = function (f) {
  	    var s = this.consume(function (err, x) {
  	        s.source._removeConsumer(s);
  	        f(err, x);
  	    });
  	    s.id = 'pull:' + s.id;
  	    s.resume();
  	};
  
  	/**
  	 * Writes a value to the Stream. If the Stream is paused it will go into the
  	 * Stream's incoming buffer, otherwise it will be immediately processed and
  	 * sent to the Stream's consumers (if any). Returns false if the Stream is
  	 * paused, true otherwise. This lets Node's pipe method handle back-pressure.
  	 *
  	 * You shouldn't need to call this yourself, but it may be called by Node
  	 * functions which treat Highland Streams as a [Node Writable Stream](http://nodejs.org/api/stream.html#stream_class_stream_writable).
  	 *
  	 * Only call this function on streams that were constructed with no source
  	 * (i.e., with `_()`).
  
  	 * @id write
  	 * @section Stream Objects
  	 * @name Stream.write(x)
  	 * @param x - the value to write to the Stream
  	 * @api public
  	 *
  	 * var xs = _();
  	 * xs.write(1);
  	 * xs.write(2);
  	 * xs.end();
  	 *
  	 * xs.toArray(function (ys) {
  	 *     // ys will be [1, 2]
  	 * });
  	 *
  	 * // Do *not* do this.
  	 * var xs2 = _().toArray(_.log);
  	 * xs2.write(1); // This call is illegal.
  	 */
  
  	Stream.prototype.write = function (x) {
  	    if (this.paused) {
  	        this._incoming.push(x);
  	    }
  	    else {
  	        if (_._isStreamError(x)) {
  	            this._send(x.error);
  	        }
  	        else {
  	            this._send(null, x);
  	        }
  	    }
  	    return !this.paused;
  	};
  
  	/**
  	 * Forks a stream, allowing you to add additional consumers with shared
  	 * back-pressure. A stream forked to multiple consumers will only pull values
  	 * from its source as fast as the slowest consumer can handle them.
  	 *
  	 * *Deprecation warning:* It is currently possible to `fork` a stream after
  	 * [consuming](#consume) it (e.g., via a [transform](#Transforms)). This will
  	 * no longer be possible in the next major release. If you are going to `fork`
  	 * a stream, always call `fork` on it.
  	 *
  	 * @id fork
  	 * @section Higher-order Streams
  	 * @name Stream.fork()
  	 * @api public
  	 *
  	 * var xs = _([1, 2, 3, 4]);
  	 * var ys = xs.fork();
  	 * var zs = xs.fork();
  	 *
  	 * // no values will be pulled from xs until zs also resume
  	 * ys.resume();
  	 *
  	 * // now both ys and zs will get values from xs
  	 * zs.resume();
  	 */
  
  	// Hack our way around the fact that util.deprecate is all-or-nothing for a
  	// function.
  	var warnForkAfterConsume = deprecate(function () {
  	}, 'Highland: Calling Stream.fork() on a stream that has already been consumed is deprecated. Always call fork() on a stream that is meant to be forked.');
  
  	Stream.prototype.fork = function () {
  	    if (this._already_consumed) {
  	        // Trigger deprecation warning.
  	        warnForkAfterConsume();
  	    }
  
  	    var s = new Stream();
  	    s.id = 'fork:' + s.id;
  	    s.source = this;
  	    this._consumers.push(s);
  	    this._checkBackPressure();
  	    return s;
  	};
  
  	/**
  	 * Observes a stream, allowing you to handle values as they are emitted, without
  	 * adding back-pressure or causing data to be pulled from the source. This can
  	 * be useful when you are performing two related queries on a stream where one
  	 * would block the other. Just be aware that a slow observer could fill up its
  	 * buffer and cause memory issues. Where possible, you should use [fork](#fork).
  	 *
  	 * @id observe
  	 * @section Higher-order Streams
  	 * @name Stream.observe()
  	 * @api public
  	 *
  	 * var xs = _([1, 2, 3, 4]);
  	 * var ys = xs.fork();
  	 * var zs = xs.observe();
  	 *
  	 * // now both zs and ys will receive data as fast as ys can handle it
  	 * ys.resume();
  	 */
  
  	Stream.prototype.observe = function () {
  	    var s = new Stream();
  	    s.id = 'observe:' + s.id;
  	    s.source = this;
  	    s._is_observer = true;
  	    this._observers.push(s);
  	    return s;
  	};
  
  	/**
  	 * Extracts errors from a Stream and applies them to an error handler
  	 * function. Returns a new Stream with the errors removed (unless the error
  	 * handler chooses to rethrow them using `push`). Errors can also be
  	 * transformed and put back onto the Stream as values.
  	 *
  	 * @id errors
  	 * @section Transforms
  	 * @name Stream.errors(f)
  	 * @param {Function} f - the function to pass all errors to
  	 * @api public
  	 *
  	 * getDocument.errors(function (err, push) {
  	 *     if (err.statusCode === 404) {
  	 *         // not found, return empty doc
  	 *         push(null, {});
  	 *     }
  	 *     else {
  	 *         // otherwise, re-throw the error
  	 *         push(err);
  	 *     }
  	 * });
  	 */
  
  	Stream.prototype.errors = function (f) {
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            f(err, push);
  	            next();
  	        }
  	        else if (x === nil) {
  	            push(null, nil);
  	        }
  	        else {
  	            push(null, x);
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('errors');
  
  	/**
  	 * Like the [errors](#errors) method, but emits a Stream end marker after
  	 * an Error is encountered.
  	 *
  	 * @id stopOnError
  	 * @section Transforms
  	 * @name Stream.stopOnError(f)
  	 * @param {Function} f - the function to handle an error
  	 * @api public
  	 *
  	 * brokenStream.stopOnError(function (err) {
  	 *     //console.error('Something broke: ' + err);
  	 * });
  	 */
  
  	Stream.prototype.stopOnError = function (f) {
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            f(err, push);
  	            push(null, nil);
  	        }
  	        else if (x === nil) {
  	            push(null, nil);
  	        }
  	        else {
  	            push(null, x);
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('stopOnError');
  
  	/**
  	 * Iterates over every value from the Stream, calling the iterator function
  	 * on each of them. This method consumes the Stream.
  	 *
  	 * If an error from the Stream reaches the `each` call, it will emit an
  	 * error event (which will cause it to throw if unhandled).
  	 *
  	 * While `each` consumes the stream, it is possible to chain [done](#done) (and
  	 * *only* `done`) after it.
  	 *
  	 * @id each
  	 * @section Consumption
  	 * @name Stream.each(f)
  	 * @param {Function} f - the iterator function
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4]).each(function (x) {
  	 *     // will be called 4 times with x being 1, 2, 3 and 4
  	 * });
  	 */
  
  	Stream.prototype.each = function (f) {
  	    var self = this;
  	    var s = this.consume(function (err, x, push, next) {
  	        if (err) {
  	            self.emit('error', err);
  	        }
  	        else if (x === nil) {
  	            push(null, nil);
  	        }
  	        else {
  	            f(x);
  	            next();
  	        }
  	    });
  	    s.resume();
  	    return s;
  	};
  	exposeMethod('each');
  
  	/**
  	 * Applies all values from a Stream as arguments to a function. This method consumes the stream.
  	 * `f` will always be called when the `nil` token is encountered, even when the stream is empty.
  	 *
  	 * @id apply
  	 * @section Consumption
  	 * @name Stream.apply(f)
  	 * @param {Function} f - the function to apply arguments to
  	 * @api public
  	 *
  	 * _([1, 2, 3]).apply(function (a, b, c) {
  	 *     // a === 1
  	 *     // b === 2
  	 *     // c === 3
  	 * });
  	 *
  	 * _([1, 2, 3]).apply(function (a) {
  	 *     // arguments.length === 3
  	 *     // a === 1
  	 * });
  	 */
  
  	Stream.prototype.apply = function (f) {
  	    return this.toArray(function (args) {
  	        f.apply(null, args);
  	    });
  	};
  	exposeMethod('apply');
  
  	/**
  	 * Collects all values from a Stream into an Array and calls a function with
  	 * the result. This method consumes the stream.
  	 *
  	 * If an error from the Stream reaches the `toArray` call, it will emit an
  	 * error event (which will cause it to throw if unhandled).
  	 *
  	 * @id toArray
  	 * @section Consumption
  	 * @name Stream.toArray(f)
  	 * @param {Function} f - the callback to provide the completed Array to
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4]).toArray(function (x) {
  	 *     // parameter x will be [1,2,3,4]
  	 * });
  	 */
  
  	Stream.prototype.toArray = function (f) {
  	    var self = this;
  	    return this.collect().pull(function (err, x) {
  	        if (err) {
  	            self.emit('error', err);
  	        }
  	        else {
  	            f(x);
  	        }
  	    });
  	};
  
  	/**
  	 * Calls a function once the Stream has ended. This method consumes the stream.
  	 * If the Stream has already ended, the function is called immediately.
  	 *
  	 * If an error from the Stream reaches the `done` call, it will emit an
  	 * error event (which will cause it to throw if unhandled).
  	 *
  	 * As a special case, it is possible to chain `done` after a call to
  	 * [each](#each) even though both methods consume the stream.
  	 *
  	 * @id done
  	 * @section Consumption
  	 * @name Stream.done(f)
  	 * @param {Function} f - the callback
  	 * @api public
  	 *
  	 * var total = 0;
  	 * _([1, 2, 3, 4]).each(function (x) {
  	 *     total += x;
  	 * }).done(function () {
  	 *     // total will be 10
  	 * });
  	 */
  
  	Stream.prototype.done = function (f) {
  	    if (this.ended) {
  	        f();
  	        return null;
  	    }
  	    var self = this;
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            self.emit('error', err);
  	        }
  	        else if (x === nil) {
  	            f();
  	        }
  	        else {
  	            next();
  	        }
  	    }).resume();
  	};
  
  	/**
  	 * Creates a new Stream of transformed values by applying a function to each
  	 * value from the source. The transformation function can be replaced with
  	 * a non-function value for convenience, and it will emit that value
  	 * for every data event on the source Stream.
  	 *
  	 * *Deprecation warning:* The use of the convenience non-function argument for
  	 * `map` is deprecated and will be removed in the next major version.
  	 *
  	 * @id map
  	 * @section Transforms
  	 * @name Stream.map(f)
  	 * @param {Function} f - the transformation function or value to map to
  	 * @api public
  	 *
  	 * var doubled = _([1, 2, 3, 4]).map(function (x) {
  	 *     return x * 2;
  	 * });
  	 */
  
  	// Hack our way around the fact that util.deprecate is all-or-nothing for a
  	// function.
  	var warnMapWithValue = deprecate(function() {
  	}, 'Highland: Calling Stream.map() with a non-function argument is deprecated.');
  
  	Stream.prototype.map = function (f) {
  	    if (!_.isFunction(f)) {
  	        warnMapWithValue();
  	        var val = f;
  	        f = function () {
  	            return val;
  	        };
  	    }
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            push(err, x);
  	        }
  	        else {
  	            var fnVal, fnErr;
  	            try {
  	                fnVal = f(x);
  	            }
  	            catch (e) {
  	                fnErr = e;
  	            }
  	            push(fnErr, fnVal);
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('map');
  
  	/**
  	 * Creates a new Stream which applies a function to each value from the source
  	 * and re-emits the source value. Useful when you want to mutate the value or
  	 * perform side effects
  	 *
  	 * @id doto
  	 * @section Transforms
  	 * @name Stream.doto(f)
  	 * @param {Function} f - the function to apply
  	 * @api public
  	 *
  	 * var appended = _([[1], [2], [3], [4]]).doto(function (x) {
  	 *     x.push(1);
  	 * });
  	 *
  	 * _([1, 2, 3]).doto(console.log)
  	 * // 1
  	 * // 2
  	 * // 3
  	 * // => 1, 2, 3
  	 */
  
  	Stream.prototype.doto = function (f) {
  	    return this.map(function (x) {
  	        f(x);
  	        return x;
  	    });
  	};
  	exposeMethod('doto');
  
  	/**
  	 * An alias for the [doto](#doto) method.
  	 *
  	 * @id tap
  	 * @section Transforms
  	 * @name Stream.tap(f)
  	 * @param {Function} f - the function to apply
  	 * @api public
  	 *
  	 * _([1, 2, 3]).tap(console.log)
  	 */
  
  	Stream.prototype.tap = Stream.prototype.doto;
  	_.tap = _.doto;
  
  	/**
  	 * Limits number of values through the stream to a maximum of number of values
  	 * per window. Errors are not limited but allowed to pass through as soon as
  	 * they are read from the source.
  	 *
  	 * @id ratelimit
  	 * @section Transforms
  	 * @name Stream.ratelimit(num, ms)
  	 * @param {Number} num - the number of operations to perform per window
  	 * @param {Number} ms - the window of time to limit the operations in (in ms)
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4, 5]).ratelimit(2, 100);
  	 *
  	 * // after 0ms => 1, 2
  	 * // after 100ms => 1, 2, 3, 4
  	 * // after 200ms => 1, 2, 3, 4, 5
  	 */
  
  	Stream.prototype.ratelimit = function (num, ms) {
  	    if (num < 1) {
  	        throw new Error('Invalid number of operations per ms: ' + num);
  	    }
  	    var sent = 0;
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            push(null, nil);
  	        }
  	        else {
  	            if (sent < num) {
  	                sent++;
  	                push(null, x);
  	                next();
  	            }
  	            else {
  	                setTimeout(function () {
  	                    sent = 1;
  	                    push(null, x);
  	                    next();
  	                }, ms);
  	            }
  	        }
  	    });
  	};
  	exposeMethod('ratelimit');
  
  	/**
  	 * Creates a new Stream of values by applying each item in a Stream to an
  	 * iterator function which must return a (possibly empty) Stream. Each item on
  	 * these result Streams are then emitted on a single output Stream.
  	 *
  	 * This transform is functionally equivalent to `.map(f).sequence()`.
  	 *
  	 * @id flatMap
  	 * @section Higher-order Streams
  	 * @name Stream.flatMap(f)
  	 * @param {Function} f - the iterator function
  	 * @api public
  	 *
  	 * var readFile = _.wrapCallback(fs.readFile);
  	 * filenames.flatMap(readFile)
  	 */
  
  	Stream.prototype.flatMap = function (f) {
  	    return this.map(f).sequence();
  	};
  	exposeMethod('flatMap');
  
  	/**
  	 * Retrieves values associated with a given property from all elements in
  	 * the collection.
  	 *
  	 * @id pluck
  	 * @section Transforms
  	 * @name Stream.pluck(property)
  	 * @param {String} prop - the property to which values should be associated
  	 * @api public
  	 *
  	 * var docs = [
  	 *     {type: 'blogpost', title: 'foo'},
  	 *     {type: 'blogpost', title: 'bar'},
  	 *     {type: 'comment', title: 'baz'}
  	 * ];
  	 *
  	 * _(docs).pluck('title').toArray(function (xs) {
  	 *    // xs is now ['foo', 'bar', 'baz']
  	 * });
  	 */
  
  	Stream.prototype.pluck = function (prop) {
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            push(err, x);
  	        }
  	        else if (_.isObject(x)) {
  	            push(null, x[prop]);
  	            next();
  	        }
  	        else {
  	            push(new Error(
  	                'Expected Object, got ' + (typeof x)
  	            ));
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('pluck');
  
  	/**
  	 * Only applies the transformation strategy on Objects.
  	 * This helper is used in `pick` and `pickBy`
  	 **/
  
  	var objectOnly = _.curry(function(strategy, x) {
  	    if (_.isObject(x)) {
  	        return strategy(x);
  	    }
  	    else {
  	        throw new Error(
  	            'Expected Object, got ' + (typeof x)
  	        );
  	    }
  	});
  
  
  	/**
  	 *
  	 * Retrieves copies of all the elements in the collection
  	 * that satisfy a given predicate. Note: When using ES3,
  	 * only enumerable elements are selected. Both enumerable
  	 * and non-enumerable elements are selected when using ES5.
  	 *
  	 * @id pickBy
  	 * @section Transforms
  	 * @name Stream.pickBy(f)
  	 * @param {Function} f - the predicate function
  	 * @api public
  	 *
  	 *  var dogs = [
  	 *      {breed: 'chihuahua', name: 'Princess', age: 5},
  	 *      {breed: 'labrador', name: 'Rocky', age: 3},
  	 *      {breed: 'german-shepherd', name: 'Waffles', age: 9}
  	 *  ];
  
  	 *  _(dogs).pickBy(function (key, value) {
  	 *      return value > 4;
  	 *  }).toArray(function (xs) {
  	 *    // xs is now:
  	 *    [
  	 *      { age: 5 },
  	 *      {},
  	 *      { age: 9 }
  	 *    ]
  	 *  });
  	 */
  
  	Stream.prototype.pickBy = function (f) {
  	    return this.map(objectOnly(function (x) {
  	        var out = {};
  
  	        // prevents testing overridden properties multiple times.
  	        var seen = isES5 ? Object.create(null) : {};
  	        var obj = x;  // variable used to traverse prototype chain
  	        function testAndAdd (prop) {
  	            if (seen[prop] !== true && f(prop, x[prop])) {
  	                out[prop] = x[prop];
  	                seen[prop] = true;
  	            }
  	        }
  	        if (isES5) {
  	            do {
  	                Object.getOwnPropertyNames(obj).forEach(testAndAdd);
  	                obj = Object.getPrototypeOf(obj);
  	            } while (obj);
  	        }
  	        else {
  	            for (var k in x) {
  	                testAndAdd(k);
  	            }
  	        }
  	        return out;
  	    }));
  	};
  	exposeMethod('pickBy');
  
  	/**
  	 *
  	 * Retrieves copies of all elements in the collection,
  	 * with only the whitelisted keys. If one of the whitelisted
  	 * keys does not exist, it will be ignored.
  	 *
  	 * @id pick
  	 * @section Transforms
  	 * @name Stream.pick(properties)
  	 * @param {Array} properties - property names to white filter
  	 * @api public
  	 *
  	 * var dogs = [
  	 *      {breed: 'chihuahua', name: 'Princess', age: 5},
  	 *      {breed: 'labrador', name: 'Rocky', age: 3},
  	 *      {breed: 'german-shepherd', name: 'Waffles', age: 9}
  	 * ];
  	 *
  	 * _(dogs).pick(['breed', 'age']).toArray(function (xs) {
  	 *       // xs is now:
  	 *       [
  	 *           {breed: 'chihuahua', age: 5},
  	 *           {breed: 'labrador', age: 3},
  	 *           {breed: 'german-shepherd', age: 9}
  	 *       ]
  	 * });
  	 *
  	 * _(dogs).pick(['owner']).toArray(function (xs) {
  	 *      // xs is now:
  	 *      [
  	 *          {},
  	 *          {},
  	 *          {}
  	 *      ]
  	 * });*/
  
  	Stream.prototype.pick = function (properties) {
  	    return this.map(objectOnly(function(x) {
  	        var out = {};
  	        for (var i = 0, length = properties.length; i < length; i++) {
  	            var p = properties[i];
  	            if (p in x) {
  	                out[p] = x[p];
  	            }
  	        }
  	        return out;
  	    }));
  	};
  	exposeMethod('pick');
  
  	/**
  	 * Creates a new Stream that includes only the values that pass a truth test.
  	 *
  	 * @id filter
  	 * @section Transforms
  	 * @name Stream.filter(f)
  	 * @param {Function} f - the truth test function
  	 * @api public
  	 *
  	 * var evens = _([1, 2, 3, 4]).filter(function (x) {
  	 *     return x % 2 === 0;
  	 * });
  	 */
  
  	Stream.prototype.filter = function (f) {
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            push(err, x);
  	        }
  	        else {
  	            var fnVal, fnErr;
  	            try {
  	                fnVal = f(x);
  	            }
  	            catch (e) {
  	                fnErr = e;
  	            }
  
  	            if (fnErr) {
  	                push(fnErr);
  	            }
  	            else if (fnVal) {
  	                push(null, x);
  	            }
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('filter');
  
  	/**
  	 * Filters using a predicate which returns a Stream. If you need to check
  	 * against an asynchronous data source when filtering a Stream, this can
  	 * be convenient. The Stream returned from the filter function should have
  	 * a Boolean as its first value (all other values on the Stream will be
  	 * disregarded).
  	 *
  	 * @id flatFilter
  	 * @section Higher-order Streams
  	 * @name Stream.flatFilter(f)
  	 * @param {Function} f - the truth test function which returns a Stream
  	 * @api public
  	 *
  	 * var checkExists = _.wrapCallback(fs.access);
  	 *
  	 * filenames.flatFilter(checkExists)
  	 */
  
  	Stream.prototype.flatFilter = function (f) {
  	    return this.flatMap(function (x) {
  	        return f(x).take(1).otherwise(errorStream())
  	        .flatMap(function (bool) {
  	            return _(bool ? [x] : []);
  	        });
  	    });
  
  	    function errorStream() {
  	        return _(function (push) {
  	            push(new Error('Stream returned by function was empty.'));
  	            push(null, _.nil);
  	        });
  	    }
  	};
  	exposeMethod('flatFilter');
  
  	/**
  	 * The inverse of [filter](#filter).
  	 *
  	 * @id reject
  	 * @section Transforms
  	 * @name Stream.reject(f)
  	 * @param {Function} f - the truth test function
  	 * @api public
  	 *
  	 * var odds = _([1, 2, 3, 4]).reject(function (x) {
  	 *     return x % 2 === 0;
  	 * });
  	 */
  
  	Stream.prototype.reject = function (f) {
  	    return this.filter(_.compose(_.not, f));
  	};
  	exposeMethod('reject');
  
  	/**
  	 * A convenient form of [filter](#filter), which returns the first object from a
  	 * Stream that passes the provided truth test.
  	 *
  	 * @id find
  	 * @section Transforms
  	 * @name Stream.find(f)
  	 * @param {Function} f - the truth test function which returns a Stream
  	 * @api public
  	 *
  	 * var docs = [
  	 *     {type: 'blogpost', title: 'foo'},
  	 *     {type: 'blogpost', title: 'bar'},
  	 *     {type: 'comment', title: 'foo'}
  	 * ];
  	 *
  	 * var f = function (x) {
  	 *     return x.type == 'blogpost';
  	 * };
  	 *
  	 * _(docs).find(f);
  	 * // => {type: 'blogpost', title: 'foo'}
  	 *
  	 * // example with partial application
  	 * var firstBlogpost = _.find(f);
  	 *
  	 * firstBlogpost(docs)
  	 * // => {type: 'blogpost', title: 'foo'}
  	 */
  
  	Stream.prototype.find = function (f) {
  	    return this.filter(f).take(1);
  	};
  	exposeMethod('find');
  
  	/**
  	 * A convenient form of [where](#where), which returns the first object from a
  	 * Stream that matches a set of property values. findWhere is to [where](#where) as [find](#find) is to [filter](#filter).
  	 *
  	 * @id findWhere
  	 * @section Transforms
  	 * @name Stream.findWhere(props)
  	 * @param {Object} props - the properties to match against
  	 * @api public
  	 *
  	 * var docs = [
  	 *     {type: 'blogpost', title: 'foo'},
  	 *     {type: 'blogpost', title: 'bar'},
  	 *     {type: 'comment', title: 'foo'}
  	 * ];
  	 *
  	 * _(docs).findWhere({type: 'blogpost'})
  	 * // => {type: 'blogpost', title: 'foo'}
  	 *
  	 * // example with partial application
  	 * var firstBlogpost = _.findWhere({type: 'blogpost'});
  	 *
  	 * firstBlogpost(docs)
  	 * // => {type: 'blogpost', title: 'foo'}
  	 */
  
  	Stream.prototype.findWhere = function (props) {
  	    return this.where(props).take(1);
  	};
  	exposeMethod('findWhere');
  
  
  	/**
  	 * A convenient form of [reduce](#reduce), which groups items based on a function or property name
  	 *
  	 * @id group
  	 * @section Transforms
  	 * @name Stream.group(f)
  	 * @param {Function | String} f - the function or property name on which to group,
  	 *                              toString() is called on the result of a function.
  	 * @api public
  	 *
  	 * var docs = [
  	 *     {type: 'blogpost', title: 'foo'},
  	 *     {type: 'blogpost', title: 'bar'},
  	 *     {type: 'comment', title: 'foo'}
  	 * ];
  	 *
  	 * var f = function (x) {
  	 *     return x.type;
  	 * };
  	 *
  	 * _(docs).group(f); OR _(docs).group('type');
  	 * // => {
  	 * // =>    'blogpost': [{type: 'blogpost', title: 'foo'}, {type: 'blogpost', title: 'bar'}]
  	 * // =>    'comment': [{type: 'comment', title: 'foo'}]
  	 * // =>  }
  	 *
  	 */
  
  	Stream.prototype.group = function (f) {
  	    var lambda = _.isString(f) ? _.get(f) : f;
  	    return this.reduce({}, function (m, o) {
  	        var key = lambda(o);
  	        if (!hasOwn.call(m, key)) { m[key] = []; }
  	        m[key].push(o);
  	        return m;
  	    });
  	};
  	exposeMethod('group');
  
  	/**
  	 * Filters a Stream to drop all non-truthy values.
  	 *
  	 * @id compact
  	 * @section Transforms
  	 * @name Stream.compact()
  	 * @api public
  	 *
  	 * var compacted = _([0, 1, false, 3, null, undefined, 6]).compact();
  	 * // => 1, 3, 6
  	 */
  
  	Stream.prototype.compact = function () {
  	    return this.filter(function (x) {
  	        return x;
  	    });
  	};
  	exposeMethod('compact');
  
  	/**
  	 * A convenient form of [filter](#filter), which returns all objects from a Stream
  	 * which match a set of property values.
  	 *
  	 * @id where
  	 * @section Transforms
  	 * @name Stream.where(props)
  	 * @param {Object} props - the properties to match against
  	 * @api public
  	 *
  	 * var docs = [
  	 *     {type: 'blogpost', title: 'foo'},
  	 *     {type: 'blogpost', title: 'bar'},
  	 *     {type: 'comment', title: 'foo'}
  	 * ];
  	 *
  	 * _(docs).where({title: 'foo'})
  	 * // => {type: 'blogpost', title: 'foo'}
  	 * // => {type: 'comment', title: 'foo'}
  	 *
  	 * // example with partial application
  	 * var getBlogposts = _.where({type: 'blogpost'});
  	 *
  	 * getBlogposts(docs)
  	 * // => {type: 'blogpost', title: 'foo'}
  	 * // => {type: 'blogpost', title: 'bar'}
  	 */
  
  	Stream.prototype.where = function (props) {
  	    return this.filter(function (x) {
  	        for (var k in props) {
  	            if (x[k] !== props[k]) {
  	                return false;
  	            }
  	        }
  	        return true;
  	    });
  	};
  	exposeMethod('where');
  
  	/**
  	 * Filters out all duplicate values from the stream and keeps only the first
  	 * occurence of each value, using the provided function to define equality.
  	 *
  	 * Note:
  	 *
  	 * - Memory: In order to guarantee that each unique item is chosen only once,
  	 *   we need to keep an internal buffer of all unique values. This may outgrow
  	 *   the available memory if you are not cautious about the size of your stream
  	 *   and the number of unique objects you may receive on it.
  	 * - Errors: The comparison function should never throw an error. However, if
  	 *   it does, this transform will emit an error for each all that throws. This
  	 *   means that one value may turn into multiple errors.
  	 *
  	 * @id uniqBy
  	 * @section Transforms
  	 * @name Stream.uniqBy(compare)
  	 * @param {Function} compare - custom equality predicate
  	 * @api public
  	 *
  	 * var colors = [ 'blue', 'red', 'red', 'yellow', 'blue', 'red' ]
  	 *
  	 * _(colors).uniqBy(function(a, b) { return a[1] === b[1]; })
  	 * // => 'blue'
  	 * // => 'red'
  	 *
  	 */
  
  	Stream.prototype.uniqBy = function (compare) {
  	    var uniques = [];
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            push(err, x);
  	        }
  	        else {
  	            var seen = false;
  	            var hasErr;
  	            for (var i = 0, len = uniques.length; i < len; i++) {
  	                try {
  	                    seen = compare(x, uniques[i]);
  	                }
  	                catch (e) {
  	                    hasErr = e;
  	                    seen = true;
  	                }
  	                if (seen) {
  	                    break;
  	                }
  	            }
  	            if (!seen) {
  	                uniques.push(x);
  	                push(null, x);
  	            }
  	            if (hasErr) {
  	                push(hasErr);
  	            }
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('uniqBy');
  
  	/**
  	 * Filters out all duplicate values from the stream and keeps only the first
  	 * occurence of each value, using `===` to define equality.
  	 *
  	 * Like [uniqBy](#uniqBy), this transform needs to store a buffer containing
  	 * all unique values that has been encountered. Be careful about using this
  	 * transform on a stream that has many unique values.
  	 *
  	 * @id uniq
  	 * @section Transforms
  	 * @name Stream.uniq()
  	 * @api public
  	 *
  	 * var colors = [ 'blue', 'red', 'red', 'yellow', 'blue', 'red' ]
  	 *
  	 * _(colors).uniq()
  	 * // => 'blue'
  	 * // => 'red'
  	 * // => 'yellow'
  	 */
  
  	Stream.prototype.uniq = function () {
  	    if (!_.isUndefined(_global.Set)) {
  	        var uniques = new _global.Set(),
  	            size = uniques.size;
  
  	        return this.consume(function (err, x, push, next) {
  	            if (err) {
  	                push(err);
  	                next();
  	            }
  	            else if (x === nil) {
  	                push(err, x);
  	            }
  	            // pass NaN through as Set does not respect strict
  	            // equality in this case.
  	            else if (x !== x) {
  	                push(null, x);
  	                next();
  	            }
  	            else {
  	                uniques.add(x);
  	                if (uniques.size > size) {
  	                    size = uniques.size;
  	                    push(null, x);
  	                }
  	                next();
  	            }
  	        });
  	    }
  	    return this.uniqBy(function (a, b) {
  	        return a === b;
  	    });
  	};
  	exposeMethod('uniq');
  
  	/**
  	 * Takes a `finite` stream of streams and returns a stream where the first
  	 * element from each separate stream is combined into a single data event,
  	 * followed by the second elements of each stream and so on until the shortest
  	 * input stream is exhausted.
  	 *
  	 * *Note:* This transform will be renamed `zipAll` in the next major version
  	 * release.
  	 *
  	 * @id zipAll0
  	 * @section Higher-order Streams
  	 * @name Stream.zipAll0()
  	 * @api public
  	 *
  	 * _([
  	 *     _([1, 2, 3]),
  	 *     _([4, 5, 6]),
  	 *     _([7, 8, 9]),
  	 *     _([10, 11, 12])
  	 * ]).zipAll0()
  	 * // => [ [ 1, 4, 7, 10 ], [ 2, 5, 8, 11 ], [ 3, 6, 9, 12 ] ]
  	 *
  	 * // shortest stream determines length of output stream
  	 * _([
  	 *     _([1, 2, 3, 4]),
  	 *     _([5, 6, 7, 8]),
  	 *     _([9, 10, 11, 12]),
  	 *     _([13, 14])
  	 * ]).zipAll0()
  	 * // => [ [ 1, 5, 9, 13 ], [ 2, 6, 10, 14 ] ]
  	 */
  
  	Stream.prototype.zipAll0 = function () {
  	    var returned = 0;
  	    var z = [];
  	    var finished = false;
  
  	    function nextValue(index, max, src, push, next) {
  	        src.pull(function (err, x) {
  	            if (err) {
  	                push(err);
  	                nextValue(index, max, src, push, next);
  	            }
  	            else if (x === _.nil) {
  	                if (!finished) {
  	                    finished = true;
  	                    push(null, nil);
  	                }
  	            }
  	            else {
  	                returned++;
  	                z[index] = x;
  	                if (returned === max) {
  	                    push(null, z);
  	                    next();
  	                }
  	            }
  	        });
  	    }
  
  	    return this.collect().flatMap(function (array) {
  	        if (!array.length) {
  	            return _([]);
  	        }
  
  	        return _(function (push, next) {
  	            returned = 0;
  	            z = [];
  	            for (var i = 0, length = array.length; i < length; i++) {
  	                nextValue(i, length, array[i], push, next);
  	            }
  	        });
  	    });
  
  	};
  	exposeMethod('zipAll0');
  
  	/**
  	 * Takes a stream and a `finite` stream of `N` streams
  	 * and returns a stream of the corresponding `(N+1)`-tuples.
  	 *
  	 * *Note:* This transform will be renamed `zipEach` in the next major version
  	 * release.
  	 *
  	 * @id zipAll
  	 * @section Higher-order Streams
  	 * @name Stream.zipAll(ys)
  	 * @param {Array | Stream} ys - the array of streams to combine values with
  	 * @api public
  	 *
  	 * _([1,2,3]).zipAll([[4, 5, 6], [7, 8, 9], [10, 11, 12]])
  	 * // => [ [ 1, 4, 7, 10 ], [ 2, 5, 8, 11 ], [ 3, 6, 9, 12 ] ]
  	 *
  	 * // shortest stream determines length of output stream
  	 * _([1, 2, 3, 4]).zipAll([[5, 6, 7, 8], [9, 10, 11, 12], [13, 14]])
  	 * // => [ [ 1, 5, 9, 13 ], [ 2, 6, 10, 14 ] ]
  	 */
  
  	Stream.prototype.zipAll = function (ys) {
  	    return _([this]).concat(_(ys).map(_)).zipAll0();
  	};
  	exposeMethod('zipAll');
  
  	/**
  	 * Takes two Streams and returns a Stream of corresponding pairs. The size of
  	 * the resulting stream is the smaller of the two source streams.
  	 *
  	 * @id zip
  	 * @section Higher-order Streams
  	 * @name Stream.zip(ys)
  	 * @param {Array | Stream} ys - the other stream to combine values with
  	 * @api public
  	 *
  	 * _(['a', 'b', 'c']).zip([1, 2, 3])  // => ['a', 1], ['b', 2], ['c', 3]
  	 *
  	 * _(['a', 'b', 'c']).zip(_([1]))  // => ['a', 1]
  	 */
  
  	Stream.prototype.zip = function (ys) {
  	    return _([this, _(ys)]).zipAll0();
  	};
  	exposeMethod('zip');
  
  	/**
  	 * Takes one Stream and batches incoming data into arrays of given length
  	 *
  	 * @id batch
  	 * @section Transforms
  	 * @name Stream.batch(n)
  	 * @param {Number} n - length of the array to batch
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4, 5]).batch(2)  // => [1, 2], [3, 4], [5]
  	 */
  
  	Stream.prototype.batch = function (n) {
  	    return this.batchWithTimeOrCount(-1, n);
  	};
  	exposeMethod('batch');
  
  	/**
  	 * Takes one Stream and batches incoming data within a maximum time frame
  	 * into arrays of a maximum length.
  	 *
  	 * @id batchWithTimeOrCount
  	 * @section Transforms
  	 * @name Stream.batchWithTimeOrCount(ms, n)
  	 * @param {Number} ms - the maximum milliseconds to buffer a batch
  	 * @param {Number} n - the maximum length of the array to batch
  	 * @api public
  	 *
  	 * _(function (push) {
  	 *     push(1);
  	 *     push(2);
  	 *     push(3);
  	 *     setTimeout(push, 20, 4);
  	 * }).batchWithTimeOrCount(10, 2)
  	 *
  	 * // => [1, 2], [3], [4]
  	 */
  
  	Stream.prototype.batchWithTimeOrCount = function (ms, n) {
  	    var batched = [],
  	        timeout;
  
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            if (batched.length > 0) {
  	                push(null, batched);
  	                clearTimeout(timeout);
  	            }
  
  	            push(null, nil);
  	        }
  	        else {
  	            batched.push(x);
  
  	            if (batched.length === n) {
  	                push(null, batched);
  	                batched = [];
  	                clearTimeout(timeout);
  	            }
  	            else if (batched.length === 1 && ms >= 0) {
  	                timeout = setTimeout(function () {
  	                    push(null, batched);
  	                    batched = [];
  	                }, ms);
  	            }
  
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('batchWithTimeOrCount');
  
  	/**
  	 * Creates a new Stream with the separator interspersed between the elements of the source.
  	 *
  	 * `intersperse` is effectively the inverse of [splitBy](#splitBy).
  	 *
  	 * @id intersperse
  	 * @section Transforms
  	 * @name Stream.intersperse(sep)
  	 * @param {String} sep - the value to intersperse between the source elements
  	 * @api public
  	 *
  	 * _(['ba', 'a', 'a']).intersperse('n')  // => ba, n, a, n, a
  	 * _(['mississippi']).splitBy('ss').intersperse('ss')  // => mi, ss, i, ss, ippi
  	 * _(['foo']).intersperse('bar')  // => foo
  	 */
  
  	Stream.prototype.intersperse = function (separator) {
  	    var started = false;
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            push(null, nil);
  	        }
  	        else {
  	            if (started) {
  	                push(null, separator);
  	            }
  	            else {
  	                started = true;
  	            }
  	            push(null, x);
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('intersperse');
  
  	/**
  	 * Splits the source Stream by a separator and emits the pieces in between, much like splitting a string.
  	 *
  	 * `splitBy` is effectively the inverse of [intersperse](#intersperse).
  	 *
  	 * @id splitBy
  	 * @section Transforms
  	 * @name Stream.splitBy(sep)
  	 * @param {String | RegExp} sep - the separator to split on
  	 * @api public
  	 *
  	 * _(['mis', 'si', 's', 'sippi']).splitBy('ss')  // => mi, i, ippi
  	 * _(['ba', 'a', 'a']).intersperse('n').splitBy('n')  // => ba, a, a
  	 * _(['foo']).splitBy('bar')  // => foo
  	 */
  
  	Stream.prototype.splitBy = function (sep) {
  	    var decoder = new Decoder();
  	    var buffer = false;
  
  	    function drain(x, push) {
  	        buffer = (buffer || '') + decoder.write(x);
  	        var pieces = buffer.split(sep);
  	        buffer = pieces.pop();
  
  	        pieces.forEach(function (piece) {
  	            push(null, piece);
  	        });
  	    }
  
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            if (_.isString(buffer)) {
  	                drain(decoder.end(), push);
  	                push(null, buffer);
  	            }
  	            push(null, nil);
  	        }
  	        else {
  	            drain(x, push);
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('splitBy');
  
  	/**
  	 * [splitBy](#splitBy) over newlines.
  	 *
  	 * @id split
  	 * @section Transforms
  	 * @name Stream.split()
  	 * @api public
  	 *
  	 * _(['a\n', 'b\nc\n', 'd', '\ne']).split()  // => a, b, c, d, e
  	 * _(['a\r\nb\nc']]).split()  // => a, b, c
  	 */
  
  	Stream.prototype.split = function () {
  	    return this.splitBy(/\r?\n/);
  	};
  	exposeMethod('split');
  
  	/**
  	 * Creates a new Stream with the values from the source in the range of `start` (inclusive) to `end` (exclusive).
  	 * `start` and `end` must be of type `Number`, if `start` is not a `Number` it will default to `0`
  	 * and, likewise, `end` will default to `Infinity`: this could result in the whole stream being be
  	 * returned.
  	 *
  	 * @id slice
  	 * @section Transforms
  	 * @name Stream.slice(start, end)
  	 * @param {Number} start - integer representing index to start reading from source (inclusive)
  	 * @param {Number} stop - integer representing index to stop reading from source (exclusive)
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4]).slice(1, 3) // => 2, 3
  	 */
  
  	Stream.prototype.slice = function(start, end) {
  	    var index = 0;
  	    start = typeof start != 'number' || start < 0 ? 0 : start;
  	    end = typeof end != 'number' ? Infinity : end;
  
  	    if (start === 0 && end === Infinity) {
  	        return this;
  	    }
  	    else if (start >= end) {
  	        return _([]);
  	    }
  	    var s = this.consume(function (err, x, push, next) {
  	        var done = x === nil;
  	        if (err) {
  	            push(err);
  	        }
  	        else if (!done && index++ >= start) {
  	            push(null, x);
  	        }
  
  	        if (!done && index < end) {
  	            next();
  	        }
  	        else {
  	            push(null, nil);
  	        }
  	    });
  	    s.id = 'slice:' + s.id;
  	    return s;
  	};
  	exposeMethod('slice');
  
  	/**
  	 * Creates a new Stream with the first `n` values from the source. `n` must be of type `Number`,
  	 * if not the whole stream will be returned.
  	 *
  	 * @id take
  	 * @section Transforms
  	 * @name Stream.take(n)
  	 * @param {Number} n - integer representing number of values to read from source
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4]).take(2) // => 1, 2
  	 */
  
  	Stream.prototype.take = function (n) {
  	    var s = this.slice(0, n);
  	    s.id = 'take:' + s.id;
  	    return s;
  	};
  	exposeMethod('take');
  
  	/**
  	 * Acts as the inverse of [`take(n)`](#take) - instead of returning the first `n` values, it ignores the
  	 * first `n` values and then emits the rest. `n` must be of type `Number`, if not the whole stream will
  	 * be returned. All errors (even ones emitted before the nth value) will be emitted.
  	 *
  	 * @id drop
  	 * @section Transforms
  	 * @name Stream.drop(n)
  	 * @param {Number} n - integer representing number of values to read from source
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4]).drop(2) // => 3, 4
  	 */
  
  	Stream.prototype.drop = function (n) {
  	    return this.slice(n, Infinity);
  	};
  	exposeMethod('drop');
  
  	/**
  	 * Creates a new Stream with only the first value from the source.
  	 *
  	 * @id head
  	 * @section Transforms
  	 * @name Stream.head()
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4]).head() // => 1
  	 */
  
  	Stream.prototype.head = function () {
  	    return this.take(1);
  	};
  	exposeMethod('head');
  
  	/**
  	 * Drops all values from the Stream apart from the last one (if any).
  	 *
  	 * @id last
  	 * @section Transforms
  	 * @name Stream.last()
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4]).last()  // => 4
  	 */
  
  	Stream.prototype.last = function () {
  	    var nothing = {};
  	    var prev = nothing;
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            if (prev !== nothing) {
  	                push(null, prev);
  	            }
  	            push(null, nil);
  	        }
  	        else {
  	            prev = x;
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('last');
  
  	/**
  	 * Collects all values together then emits each value individually in sorted
  	 * order. The method for sorting the elements is defined by the comparator
  	 * function supplied as a parameter.
  	 *
  	 * The comparison function takes two arguments `a` and `b` and should return
  	 *
  	 * - a negative number if `a` should sort before `b`.
  	 * - a positive number if `a` should sort after `b`.
  	 * - zero if `a` and `b` may sort in any order (i.e., they are equal).
  	 *
  	 * This function must also define a [partial
  	 * order](https://en.wikipedia.org/wiki/Partially_ordered_set). If it does not,
  	 * the resulting ordering is undefined.
  	 *
  	 * @id sortBy
  	 * @section Transforms
  	 * @name Stream.sortBy(f)
  	 * @param {Function} f - the comparison function
  	 * @api public
  	 *
  	 * var sorts = _([3, 1, 4, 2]).sortBy(function (a, b) {
  	 *     return b - a;
  	 * }).toArray(_.log);
  	 *
  	 * //=> [4, 3, 2, 1]
  	 */
  
  	Stream.prototype.sortBy = function (f) {
  	    return this.collect().invoke('sort', [f]).sequence();
  	};
  	exposeMethod('sortBy');
  
  	/**
  	 * Collects all values together then emits each value individually but in sorted order.
  	 * The method for sorting the elements is ascending lexical.
  	 *
  	 * @id sort
  	 * @section Transforms
  	 * @name Stream.sort()
  	 * @api public
  	 *
  	 * var sorted = _(['b', 'z', 'g', 'r']).sort().toArray(_.log);
  	 * // => ['b', 'g', 'r', 'z']
  	 */
  
  	Stream.prototype.sort = function () {
  	    return this.sortBy();
  	};
  	exposeMethod('sort');
  
  
  	/**
  	 * Transforms a stream using an arbitrary target transform.
  	 *
  	 * If `target` is a function, this transform passes the current Stream to it,
  	 * returning the result.
  	 *
  	 * If `target` is a [Duplex
  	 * Stream](https://nodejs.org/api/stream.html#stream_class_stream_duplex_1),
  	 * this transform pipes the current Stream through it. It will always return a
  	 * Highland Stream (instead of the piped to target directly as in
  	 * [pipe](#pipe)). Any errors emitted will be propagated as Highland errors.
  	 *
  	 * @id through
  	 * @section Higher-order Streams
  	 * @name Stream.through(target)
  	 * @param {Function | Duplex Stream} target - the stream to pipe through or a
  	 * function to call.
  	 * @api public
  	 *
  	 * function oddDoubler(s) {
  	 *     return s.filter(function (x) {
  	 *         return x % 2; // odd numbers only
  	 *     })
  	 *     .map(function (x) {
  	 *         return x * 2;
  	 *     });
  	 * }
  	 *
  	 * _([1, 2, 3, 4]).through(oddDoubler).toArray(function (xs) {
  	 *     // xs will be [2, 6]
  	 * });
  	 *
  	 * // Can also be used with Node Through Streams
  	 * _(filenames).through(jsonParser).map(function (obj) {
  	 *     // ...
  	 * });
  	 *
  	 * // All errors will be propagated as Highland errors
  	 * _(['zz{"a": 1}']).through(jsonParser).errors(function (err) {
  	 *   console.log(err); // => SyntaxError: Unexpected token z
  	 * });
  	 */
  
  	Stream.prototype.through = function (target) {
  	    var output;
  
  	    if (_.isFunction(target)) {
  	        return target(this);
  	    }
  	    else {
  	        target.pause();
  	        output = _();
  	        this.on('error', writeErr);
  	        target.on('error', writeErr);
  	        return this.pipe(target).pipe(output);
  	    }
  
  	    function writeErr(err) {
  	        output.write(new StreamError(err));
  	    }
  	};
  	exposeMethod('through');
  
  	/**
  	 * Creates a 'Through Stream', which passes data through a pipeline
  	 * of functions or other through Streams. This is particularly useful
  	 * when combined with partial application of Highland functions to expose a
  	 * Node-compatible Through Stream.
  	 *
  	 * This is not a method on a Stream, and it only exposed at the top-level
  	 * as `_.pipeline`. It takes an arbitrary number of arguments.
  	 *
  	 * @id pipeline
  	 * @section Higher-order Streams
  	 * @name _.pipeline(...)
  	 * @api public
  	 *
  	 * var through = _.pipeline(
  	 *     _.map(parseJSON),
  	 *     _.filter(isBlogpost),
  	 *     _.reduce(collectCategories)
  	 *     _.through(otherPipeline)
  	 * );
  	 *
  	 * readStream.pipe(through).pipe(outStream);
  	 *
  	 * // Alternatively, you can use pipeline to manipulate a stream in
  	 * // the chained method call style:
  	 *
  	 * var through2 = _.pipeline(function (s) {
  	 *     return s.map(parseJSON).filter(isBlogpost); // etc.
  	 * });
  	 */
  
  	_.pipeline = function (/*through...*/) {
  	    if (!arguments.length) {
  	        return _();
  	    }
  	    var start = arguments[0], rest, startHighland;
  	    if (!_.isStream(start) && !_.isFunction(start.resume)) {
  	        // not a Highland stream or Node stream, start with empty stream
  	        start = _();
  	        startHighland = start;
  	        rest = slice.call(arguments);
  	    }
  	    else {
  	        // got a stream as first argument, co-erce to Highland stream
  	        startHighland = _(start);
  	        rest = slice.call(arguments, 1);
  	    }
  
  	    var end = rest.reduce(function (src, dest) {
  	        return src.through(dest);
  	    }, startHighland);
  
  	    var wrapper = _(function (push, next) {
  	        end.pull(function (err, x) {
  	            push(err, x);
  	            if (x !== nil) {
  	                next();
  	            }
  	        });
  	    });
  
  	    wrapper.write = function (x) {
  	        return start.write(x);
  	    };
  
  	    wrapper.end = function () {
  	        return start.end();
  	    };
  
  	    start.on('drain', function () {
  	        wrapper.emit('drain');
  	    });
  
  	    return wrapper;
  	};
  
  	/**
  	 * Reads values from a Stream of Streams or Arrays, emitting them on a single
  	 * output Stream. This can be thought of as a [flatten](#flatten), just one
  	 * level deep, often used for resolving asynchronous actions such as a HTTP
  	 * request or reading a file.
  	 *
  	 * @id sequence
  	 * @section Higher-order Streams
  	 * @name Stream.sequence()
  	 * @api public
  	 *
  	 * var nums = _([
  	 *     _([1, 2, 3]),
  	 *     _([4, 5, 6])
  	 * ]);
  	 *
  	 * nums.sequence()  // => 1, 2, 3, 4, 5, 6
  	 *
  	 * // using sequence to read from files in series
  	 * var readFile = _.wrapCallback(fs.readFile);
  	 * filenames.map(readFile).sequence()
  	 */
  
  	Stream.prototype.sequence = function () {
  	    var original = this;
  	    var curr = this;
  	    return _(function (push, next) {
  	        curr.pull(function (err, x) {
  	            if (err) {
  	                push(err);
  	                next();
  	            }
  	            else if (_.isArray(x)) {
  	                if (onOriginalStream()) {
  	                    // just send all values from array directly
  	                    x.forEach(function (y) {
  	                        push(null, y);
  	                    });
  	                }
  	                else {
  	                    push(null, x);
  	                }
  	                next();
  	            }
  	            else if (_.isStream(x)) {
  	                if (onOriginalStream()) {
  	                    // switch to reading new stream
  	                    curr = x;
  	                    next();
  	                }
  	                else {
  	                    // sequence only goes 1 level deep
  	                    push(null, x);
  	                    next();
  	                }
  	            }
  	            else if (x === nil) {
  	                if (onOriginalStream()) {
  	                    push(null, nil);
  	                }
  	                else {
  	                    // resume reading from original
  	                    curr = original;
  	                    next();
  	                }
  	            }
  	            else {
  	                if (onOriginalStream()) {
  	                    // we shouldn't be getting non-stream (or array)
  	                    // values from the top-level stream
  	                    push(new Error(
  	                        'Expected Stream, got ' + (typeof x)
  	                    ));
  	                    next();
  	                }
  	                else {
  	                    push(null, x);
  	                    next();
  	                }
  	            }
  	        });
  	    });
  
  	    function onOriginalStream() {
  	        return curr === original;
  	    }
  	};
  	exposeMethod('sequence');
  
  	/**
  	 * An alias for the [sequence](#sequence) method.
  	 *
  	 * @id series
  	 * @section Higher-order Streams
  	 * @name Stream.series()
  	 * @api public
  	 *
  	 * var readFile = _.wrapCallback(fs.readFile);
  	 * filenames.map(readFile).series()
  	 */
  
  	Stream.prototype.series = Stream.prototype.sequence;
  	_.series = _.sequence;
  
  	/**
  	 * Recursively reads values from a Stream which may contain nested Streams
  	 * or Arrays. As values or errors are encountered, they are emitted on a
  	 * single output Stream.
  	 *
  	 * @id flatten
  	 * @section Higher-order Streams
  	 * @name Stream.flatten()
  	 * @api public
  	 *
  	 * _([1, [2, 3], [[4]]]).flatten();  // => 1, 2, 3, 4
  	 *
  	 * var nums = _(
  	 *     _([1, 2, 3]),
  	 *     _([4, _([5, 6]) ])
  	 * );
  	 *
  	 * nums.flatten();  // => 1, 2, 3, 4, 5, 6
  	 */
  
  	Stream.prototype.flatten = function () {
  	    var curr = this;
  	    var stack = [];
  	    return _(function (push, next) {
  	        curr.pull(function (err, x) {
  	            if (err) {
  	                push(err);
  	                next();
  	                return;
  	            }
  	            if (_.isArray(x)) {
  	                x = _(x);
  	            }
  	            if (_.isStream(x)) {
  	                stack.push(curr);
  	                curr = x;
  	                next();
  	            }
  	            else if (x === nil) {
  	                if (stack.length) {
  	                    curr = stack.pop();
  	                    next();
  	                }
  	                else {
  	                    push(null, nil);
  	                }
  	            }
  	            else {
  	                push(null, x);
  	                next();
  	            }
  	        });
  	    });
  	};
  	exposeMethod('flatten');
  
  	/**
  	 * Takes a Stream of Streams and reads from them in parallel, buffering
  	 * the results until they can be returned to the consumer in their original
  	 * order.
  	 *
  	 * @id parallel
  	 * @section Higher-order Streams
  	 * @name Stream.parallel(n)
  	 * @param {Number} n - the maximum number of concurrent reads/buffers
  	 * @api public
  	 *
  	 * var readFile = _.wrapCallback(fs.readFile);
  	 * var filenames = _(['foo.txt', 'bar.txt', 'baz.txt']);
  	 *
  	 * // read from up to 10 files at once
  	 * filenames.map(readFile).parallel(10);
  	 */
  
  	Stream.prototype.parallel = function (n) {
  	    var source = this;
  	    var running = [];
  	    var ended = false;
  	    var reading_source = false;
  
  	    if (typeof n !== 'number') {
  	        throw new Error('Must specify a number to parallel().');
  	    }
  
  	    if (n <= 0) {
  	        throw new Error('The parallelism factor must be positive');
  	    }
  
  	    return _(function (push, next) {
  	        if (running.length < n && !ended && !reading_source) {
  	            // get another stream if not already waiting for one
  	            reading_source = true;
  	            source.pull(function (err, x) {
  	                reading_source = false;
  	                if (err) {
  	                    push(err);
  	                }
  	                else if (x === nil) {
  	                    ended = true;
  	                }
  	                else if (!_.isStream(x)) {
  	                    push(new Error('Expected Stream, got ' + (typeof x)));
  	                }
  	                else {
  	                    // got a new source, add it to the running array
  	                    var run = {stream: x, buffer: []};
  	                    running.push(run);
  	                    x.consume(function (_err, y, _push, _next) {
  	                        if (running[0] === run) {
  	                            // current output stream
  	                            if (y === nil) {
  	                                // remove self from running and check
  	                                // to see if we need to read from source again
  	                                running.shift();
  	                                flushBuffer();
  	                                next();
  
  	                            }
  	                            else {
  	                                // push directly onto parallel output stream
  	                                push(_err, y);
  	                            }
  	                        }
  	                        else {
  	                            // we're reading ahead, buffer the output
  	                            run.buffer.push([_err, y]);
  	                        }
  	                        if (y !== nil) {
  	                            // keep reading until we hit nil
  	                            _next();
  	                        }
  	                    }).resume();
  	                }
  	                // check if we need to get any more streams
  	                return next();
  	            });
  	        }
  	        else if (!running.length && ended) {
  	            // nothing more to do
  	            push(null, nil);
  	        }
  
  	        function flushBuffer() {
  	            while (running.length && running[0].buffer.length) {
  	                var buf = running[0].buffer;
  	                for (var i = 0; i < buf.length; i++) {
  	                    if (buf[i][1] === nil) {
  	                        // this stream has ended
  	                        running.shift();
  	                        break;
  	                    }
  	                    else {
  	                        // send the buffered output
  	                        push.apply(null, buf[i]);
  	                    }
  	                }
  	                buf.length = 0;
  	            }
  	        }
  	        // else wait for more data to arrive from running streams
  	    });
  	};
  	exposeMethod('parallel');
  
  	/**
  	 * Switches source to an alternate Stream if the current Stream is empty.
  	 *
  	 * @id otherwise
  	 * @section Higher-order Streams
  	 * @name Stream.otherwise(ys)
  	 * @param {Stream | Function} ys - alternate stream (or stream-returning function) to use if this stream is empty
  	 * @api public
  	 *
  	 * _([1,2,3]).otherwise(['foo'])  // => 1, 2, 3
  	 * _([]).otherwise(['foo'])       // => 'foo'
  	 *
  	 * _.otherwise(_(['foo']), _([1,2,3]))    // => 1, 2, 3
  	 * _.otherwise(_(['foo']), _([]))         // => 'foo'
  	 */
  
  	Stream.prototype.otherwise = function (ys) {
  	    var xs = this;
  	    return xs.consume(function (err, x, push, next) {
  	        if (err) {
  	            // got an error, just keep going
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            // hit the end without redirecting to xs, use alternative
  	            if (_.isFunction(ys)) {
  	                next(ys());
  	            }
  	            else {
  	                next(ys);
  	            }
  	        }
  	        else {
  	            // got a value, push it, then redirect to xs
  	            push(null, x);
  	            next(xs);
  	        }
  	    });
  	};
  	exposeMethod('otherwise');
  
  	/**
  	 * Adds a value to the end of a Stream.
  	 *
  	 * @id append
  	 * @section Transforms
  	 * @name Stream.append(y)
  	 * @param y - the value to append to the Stream
  	 * @api public
  	 *
  	 * _([1, 2, 3]).append(4)  // => 1, 2, 3, 4
  	 */
  
  	Stream.prototype.append = function (y) {
  	    return this.consume(function (err, x, push, next) {
  	        if (x === nil) {
  	            push(null, y);
  	            push(null, _.nil);
  	        }
  	        else {
  	            push(err, x);
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('append');
  
  	/**
  	 * Boils down a Stream to a single value. The memo is the initial state
  	 * of the reduction, and each successive step of it should be returned by
  	 * the iterator function. The iterator is passed two arguments:
  	 * the memo and the next value.
  	 *
  	 * If the iterator throws an error, the reduction stops and the resulting
  	 * stream will emit that error instead of a value.
  	 *
  	 * *Note:* The order of the `memo` and `iterator` arguments will be flipped in
  	 * the next major version release.
  	 *
  	 * @id reduce
  	 * @section Transforms
  	 * @name Stream.reduce(memo, iterator)
  	 * @param memo - the initial state of the reduction
  	 * @param {Function} iterator - the function which reduces the values
  	 * @api public
  	 *
  	 * var add = function (a, b) {
  	 *     return a + b;
  	 * };
  	 *
  	 * _([1, 2, 3, 4]).reduce(0, add)  // => 10
  	 */
  
  	Stream.prototype.reduce = function (z, f) {
  	    // This can't be implemented with scan(), because we don't know if the
  	    // errors that we see from the scan were thrown by the iterator or just
  	    // passed through from the source stream.
  	    return this.consume(function (err, x, push, next) {
  	        if (x === nil) {
  	            push(null, z);
  	            push(null, _.nil);
  	        }
  	        else if (err) {
  	            push(err);
  	            next();
  	        }
  	        else {
  	            try {
  	                z = f(z, x);
  	            }
  	            catch (e) {
  	                push(e);
  	                push(null, _.nil);
  	                return;
  	            }
  
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('reduce');
  
  	/**
  	 * Same as [reduce](#reduce), but uses the first element as the initial
  	 * state instead of passing in a `memo` value.
  	 *
  	 * @id reduce1
  	 * @section Transforms
  	 * @name Stream.reduce1(iterator)
  	 * @param {Function} iterator - the function which reduces the values
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4]).reduce1(add)  // => 10
  	 */
  
  	Stream.prototype.reduce1 = function (f) {
  	    var self = this;
  	    return _(function (push, next) {
  	        self.pull(function (err, x) {
  	            if (err) {
  	                push(err);
  	                next();
  	            }
  	            else if (x === nil) {
  	                push(null, nil);
  	            }
  	            else {
  	                next(self.reduce(x, f));
  	            }
  	        });
  	    });
  	};
  	exposeMethod('reduce1');
  
  	/**
  	 * Groups all values into an Array and passes down the stream as a single
  	 * data event. This is a bit like doing [toArray](#toArray), but instead
  	 * of accepting a callback and consuming the stream, it passes the value on.
  	 *
  	 * @id collect
  	 * @section Transforms
  	 * @name Stream.collect()
  	 * @api public
  	 *
  	 * _(['foo', 'bar']).collect().toArray(function (xs) {
  	 *     // xs will be [['foo', 'bar']]
  	 * });
  	 */
  
  	Stream.prototype.collect = function () {
  	    var xs = [];
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            push(null, xs);
  	            push(null, nil);
  	        }
  	        else {
  	            xs.push(x);
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('collect');
  
  	/**
  	 * Like [reduce](#reduce), but emits each intermediate value of the
  	 * reduction as it is calculated.
  	 *
  	 * If the iterator throws an error, the scan will stop and the stream will
  	 * emit that error. Any intermediate values that were produced before the
  	 * error will still be emitted.
  	 *
  	 * *Note:* The order of the `memo` and `iterator` arguments will be flipped in
  	 * the next major version release.
  	 *
  	 * @id scan
  	 * @section Transforms
  	 * @name Stream.scan(memo, iterator)
  	 * @param memo - the initial state of the reduction
  	 * @param {Function} iterator - the function which reduces the values
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4]).scan(0, add)  // => 0, 1, 3, 6, 10
  	 */
  
  	Stream.prototype.scan = function (z, f) {
  	    var self = this;
  	    return _([z]).concat(
  	        self.consume(function (err, x, push, next) {
  	            if (x === nil) {
  	                push(null, _.nil);
  	            }
  	            else if (err) {
  	                push(err);
  	                next();
  	            }
  	            else {
  	                try {
  	                    z = f(z, x);
  	                }
  	                catch (e) {
  	                    push(e);
  	                    push(null, _.nil);
  	                    return;
  	                }
  
  	                push(null, z);
  	                next();
  	            }
  	        })
  	    );
  	};
  	exposeMethod('scan');
  
  	/**
  	 * Same as [scan](#scan), but uses the first element as the initial
  	 * state instead of passing in a `memo` value.
  	 *
  	 * @id scan1
  	 * @section Transforms
  	 * @name Stream.scan1(iterator)
  	 * @param {Function} iterator - the function which reduces the values
  	 * @api public
  	 *
  	 * _([1, 2, 3, 4]).scan1(add)  // => 1, 3, 6, 10
  	 */
  
  	Stream.prototype.scan1 = function (f) {
  	    var self = this;
  	    return _(function (push, next) {
  	        self.pull(function (err, x) {
  	            if (err) {
  	                push(err);
  	                next();
  	            }
  	            else if (x === nil) {
  	                push(null, nil);
  	            }
  	            else {
  	                next(self.scan(x, f));
  	            }
  	        });
  	    });
  	};
  	exposeMethod('scan1');
  
  	function HighlandTransform(push) {
  	    this.push = push;
  	}
  
  	HighlandTransform.prototype['@@transducer/init'] = function () {
  	    return this.push;
  	};
  
  	HighlandTransform.prototype['@@transducer/result'] = function (push) {
  	    // Don't push nil here. Otherwise, we can't catch errors from `result`
  	    // and propagate them. The `transduce` implementation will do it.
  	    return push;
  	};
  
  	HighlandTransform.prototype['@@transducer/step'] = function (push, input) {
  	    push(null, input);
  	    return push;
  	};
  
  	/**
  	 * Applies the transformation defined by the the given *transducer* to the
  	 * stream. A transducer is any function that follows the
  	 * [Transducer Protocol](https://github.com/cognitect-labs/transducers-js#transformer-protocol).
  	 * See
  	 * [transduce-js](https://github.com/cognitect-labs/transducers-js#transducers-js)
  	 * for more details on what transducers actually are.
  	 *
  	 * The `result` object that is passed in through the
  	 * [Transformer Protocol](https://github.com/cognitect-labs/transducers-js#transformer-protocol)
  	 * will be the `push` function provided by the [consume](#consume) transform.
  	 *
  	 * Like [scan](#scan), if the transducer throws an exception, the transform
  	 * will stop and emit that error. Any intermediate values that were produced
  	 * before the error will still be emitted.
  	 *
  	 * @id transduce
  	 * @section Transforms
  	 * @name Stream.transduce(xf)
  	 * @param {Function} xf - The transducer.
  	 * @api public
  	 *
  	 * var xf = require('transducer-js').map(_.add(1));
  	 * _([1, 2, 3, 4]).transduce(xf);
  	 * // => [2, 3, 4, 5]
  	 */
  
  	Stream.prototype.transduce = function transduce(xf) {
  	    var transform = null,
  	        memo = null;
  
  	    return this.consume(function (err, x, push, next) {
  	        if (transform == null) {
  	            transform = xf(new HighlandTransform(push));
  	            memo = transform['@@transducer/init']();
  	        }
  
  	        if (err) {
  	            // Pass through errors, like we always do.
  	            push(err);
  	            next();
  	        }
  	        else if (x === _.nil) {
  	            // Push may be different from memo depending on the transducer that
  	            // we get.
  	            runResult(push, memo);
  	        }
  	        else {
  	            var res = runStep(push, memo, x);
  
  	            if (!res) {
  	                return;
  	            }
  
  	            memo = res;
  	            if (memo['@@transducer/reduced']) {
  	                runResult(memo['@@transducer/value']);
  	            }
  	            else {
  	                next();
  	            }
  	        }
  	    });
  
  	    function runResult(push, _memo) {
  	        try {
  	            transform['@@transducer/result'](_memo);
  	        }
  	        catch (e) {
  	            push(e);
  	        }
  	        push(null, _.nil);
  	    }
  
  	    function runStep(push, _memo, x) {
  	        try {
  	            return transform['@@transducer/step'](_memo, x);
  	        }
  	        catch (e) {
  	            push(e);
  	            push(null, _.nil);
  	            return null;
  	        }
  	    }
  	};
  	exposeMethod('transduce');
  
  	/**
  	 * Concatenates a Stream to the end of this Stream.
  	 *
  	 * Be aware that in the top-level export, the args may be in the reverse
  	 * order to what you'd expect `_([a], [b]) => b, a`, as this follows the
  	 * convention of other top-level exported functions which do `x` to `y`.
  	 *
  	 * @id concat
  	 * @section Higher-order Streams
  	 * @name Stream.concat(ys)
  	 * @param {Stream | Array} ys - the values to concatenate onto this Stream
  	 * @api public
  	 *
  	 * _([1, 2]).concat([3, 4])  // => 1, 2, 3, 4
  	 * _.concat([3, 4], [1, 2])  // => 1, 2, 3, 4
  	 */
  
  	Stream.prototype.concat = function (ys) {
  	    ys = _(ys);
  	    return this.consume(function (err, x, push, next) {
  	        if (x === nil) {
  	            next(ys);
  	        }
  	        else {
  	            push(err, x);
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('concat');
  
  	/**
  	 * Takes a Stream of Streams and merges their values and errors into a
  	 * single new Stream. The merged stream ends when all source streams have
  	 * ended.
  	 *
  	 * Note that no guarantee is made with respect to the order in which
  	 * values for each stream end up in the merged stream. Values in the
  	 * merged stream will, however, respect the order they were emitted from
  	 * their respective streams.
  	 *
  	 * @id merge
  	 * @section Higher-order Streams
  	 * @name Stream.merge()
  	 * @api public
  	 *
  	 * var readFile = _.wrapCallback(fs.readFile);
  	 *
  	 * var txt = _(['foo.txt', 'bar.txt']).map(readFile)
  	 * var md = _(['baz.md']).map(readFile)
  	 *
  	 * _([txt, md]).merge();
  	 * // => contents of foo.txt, bar.txt and baz.txt in the order they were read
  	 */
  
  	Stream.prototype.merge = function () {
  	    var self = this;
  	    var srcs = [];
  
  	    var srcsNeedPull = [],
  	        first = true,
  	        async = false;
  
  	    return _(function (push, next) {
  	        if (first) {
  	            first = false;
  	            getSourcesSync(push, next);
  	        }
  
  	        if (srcs.length === 0) {
  	            push(null, nil);
  	        }
  	        else if (srcsNeedPull.length) {
  	            pullFromAllSources(push, next);
  	            next();
  	        }
  	        else {
  	            async = true;
  	        }
  	    });
  
  	    // Make a handler for the main merge loop.
  	    function srcPullHandler(push, next, src) {
  	        return function (err, x) {
  	            if (err) {
  	                push(err);
  	                srcsNeedPull.push(src);
  	            }
  	            else if (x === nil) {
  	                srcs = srcs.filter(function (s) {
  	                    return s !== src;
  	                });
  	            }
  	            else {
  	                if (src === self) {
  	                    srcs.push(x);
  	                    srcsNeedPull.push(x);
  	                    srcsNeedPull.unshift(self);
  	                }
  	                else {
  	                    push(null, x);
  	                    srcsNeedPull.push(src);
  	                }
  	            }
  
  	            if (async) {
  	                async = false;
  	                next();
  	            }
  	        };
  	    }
  
  
  	    function pullFromAllSources(push, next) {
  	        var _srcs = srcsNeedPull;
  	        srcsNeedPull = [];
  	        _srcs.forEach(function (src) {
  	            src.pull(srcPullHandler(push, next, src));
  	        });
  	    }
  
  	    // Pulls as many sources as possible from self synchronously.
  	    function getSourcesSync(push, next) {
  	        // Shadows the outer async variable.
  	        var asynchronous;
  	        var done = false;
  
  	        var pull_cb = function(err, x) {
  	            asynchronous = false;
  	            if (done) {
  	                // This means the pull was async. Handle like
  	                // regular async.
  	                srcPullHandler(push, next, self)(err, x);
  	            }
  	            else {
  	                if (err) {
  	                    push(err);
  	                }
  	                else if (x === nil) {
  	                    done = true;
  	                }
  	                else {
  	                    srcs.push(x);
  	                    srcsNeedPull.push(x);
  	                }
  	            }
  	        };
  
  	        while (!done) {
  	            asynchronous = true;
  	            self.pull(pull_cb);
  
  	            // Async behavior, record self as a src and return.
  	            if (asynchronous) {
  	                done = true;
  	                srcs.unshift(self);
  	            }
  	        }
  	    }
  
  	};
  	exposeMethod('merge');
  
  	/**
  	 * Takes a Stream of Streams and merges their values and errors into a
  	 * single new Stream, limitting the number of unpaused streams that can
  	 * running at any one time.
  	 *
  	 * Note that no guarantee is made with respect to the order in which
  	 * values for each stream end up in the merged stream. Values in the
  	 * merged stream will, however, respect the order they were emitted from
  	 * their respective streams.
  	 *
  	 * @id mergeWithLimit
  	 * @section Higher-order Streams
  	 * @name Stream.mergeWithLimit(n)
  	 * @param {Number} n - the maximum number of streams to run in parallel
  	 * @api public
  	 *
  	 * var readFile = _.wrapCallback(fs.readFile);
  	 *
  	 * var txt = _(['foo.txt', 'bar.txt']).flatMap(readFile)
  	 * var md = _(['baz.md']).flatMap(readFile)
  	 * var js = _(['bosh.js']).flatMap(readFile)
  	 *
  	 * _([txt, md, js]).mergeWithLimit(2);
  	 * // => contents of foo.txt, bar.txt, baz.txt and bosh.js in the order
  	 * // they were read, but bosh.js is not read until either foo.txt and bar.txt
  	 * // has completely been read or baz.md has been read
  	 */
  
  
  	Stream.prototype.mergeWithLimit = function (n){
  	    var self = this;
  	    var processCount = 0;
  	    var waiting = false;
  	    if (typeof n !== 'number' || n < 1) {
  	        throw new Error('mergeWithLimit expects a positive number, but got: ' + n);
  	    }
  	    if (n === Infinity) {
  	        return this.merge();
  	    }
  	    return _(function(push, next){
  	        self.pull(function(err, x){
  	            var done = x === nil;
  	            if (err){
  	                push(err);
  	                next();
  	            }
  	            else if (x === nil) {
  	                push(null, nil);
  	            }
  	            else {
  	                processCount++;
  	                push(err, x);
  	                // console.log('start', x.id);
  	                x.once('end', function(){
  	                    processCount--;
  	                    // console.log('end', x.id);
  	                    if (waiting) {
  	                        // console.log('get more');
  	                        waiting = false;
  	                        next();
  	                    }
  	                });
  	                if (!done && processCount < n) {
  	                    next();
  	                }
  	                else {
  	                    // console.log('wait till something ends');
  	                    waiting = true;
  	                }
  	            }
  
  	        });
  	    }).merge();
  	};
  	exposeMethod('mergeWithLimit');
  
  	/**
  	 * Calls a named method on each object from the Stream - returning
  	 * a new stream with the result of those calls.
  	 *
  	 * @id invoke
  	 * @section Transforms
  	 * @name Stream.invoke(method, args)
  	 * @param {String} method - the method name to call
  	 * @param {Array} args - the arguments to call the method with
  	 * @api public
  	 *
  	 * _(['foo', 'bar']).invoke('toUpperCase', [])  // => FOO, BAR
  	 *
  	 * var readFile = _.wrapCallback(fs.readFile);
  	 * filenames.flatMap(readFile).invoke('toString', ['utf8']);
  	 */
  
  	Stream.prototype.invoke = function (method, args) {
  	    return this.map(function (x) {
  	        return x[method].apply(x, args);
  	    });
  	};
  	exposeMethod('invoke');
  
  	/**
  	 * Takes a Stream of callback-accepting node-style functions,
  	 * [wraps](#wrapCallback) each one into a stream-returning function,
  	 * calls them with the arguments provided, and returns the results
  	 * as a Stream.
  	 *
  	 * This can be used as a control flow shortcut and draws parallels
  	 * with some control flow functions from [async](https://github.com/caolan/async).
  	 * A few rough correspondences include:
  	 *
  	 * - `.nfcall([]).series()` to `async.series()`
  	 * - `.nfcall([]).parallel(n)` to `async.parallelLimit(n)`
  	 * - `.nfcall(args)` to `async.applyEach(..., args)`
  	 * - `.nfcall(args).series()` to `async.applyEachSeries(..., args)`
  	 *
  	 * @id nfcall
  	 * @section Transforms
  	 * @name Stream.nfcall(args)
  	 * @param {Array} args - the arguments to call each function with
  	 * @api public
  	 *
  	 * _([
  	 *   function (callback) {
  	 *     setTimeout(function () {
  	 *       callback(null, 'one');
  	 *     }, 200);
  	 *   },
  	 *   function (callback) {
  	 *     setTimeout(function () {
  	 *       callback(null, 'two');
  	 *     }, 100);
  	 *   }
  	 * ]).nfcall([]).parallel(2).toArray(function (xs) {
  	 *   // xs is ['one', 'two'] even though second function had a shorter timeout
  	 * });
  	 *
  	 * _([enableSearch, updateSchema]).nfcall(['bucket']).toArray(callback);
  	 * // does roughly the same as
  	 * async.applyEach([enableSearch, updateSchema], 'bucket', callback);
  	 *
  	 * _([
  	 *   fs.appendFile,
  	 *   fs.appendFile
  	 * ]).nfcall(['example.txt', 'hello']).series().toArray(function() {
  	 *   // example.txt now contains 'hellohello'
  	 * });
  	 *
  	 */
  
  	Stream.prototype.nfcall = function (args) {
  	    return this.map(function (x) {
  	        return _.wrapCallback(x).apply(x, args);
  	    });
  	};
  	exposeMethod('nfcall');
  
  	/**
  	 * Ensures that only one data event is push downstream (or into the buffer)
  	 * every `ms` milliseconds, any other values are dropped.
  	 *
  	 * @id throttle
  	 * @section Transforms
  	 * @name Stream.throttle(ms)
  	 * @param {Number} ms - the minimum milliseconds between each value
  	 * @api public
  	 *
  	 * _('mousemove', document).throttle(1000);
  	 */
  
  	Stream.prototype.throttle = function (ms) {
  	    var last = 0 - ms;
  	    return this.consume(function (err, x, push, next) {
  	        var now = new Date().getTime();
  	        if (err) {
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            push(null, nil);
  	        }
  	        else if (now - ms >= last) {
  	            last = now;
  	            push(null, x);
  	            next();
  	        }
  	        else {
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('throttle');
  
  	/**
  	 * Holds off pushing data events downstream until there has been no more
  	 * data for `ms` milliseconds. Sends the last value that occurred before
  	 * the delay, discarding all other values.
  	 *
  	 * @id debounce
  	 * @section Transforms
  	 * @name Stream.debounce(ms)
  	 * @param {Number} ms - the milliseconds to wait before sending data
  	 * @api public
  	 *
  	 * // sends last keyup event after user has stopped typing for 1 second
  	 * $('keyup', textbox).debounce(1000);
  	 */
  
  	Stream.prototype.debounce = function (ms) {
  	    var t = null;
  	    var nothing = {};
  	    var last = nothing;
  
  	    return this.consume(function (err, x, push, next) {
  	        if (err) {
  	            // let errors through regardless
  	            push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            if (t) {
  	                clearTimeout(t);
  	            }
  	            if (last !== nothing) {
  	                push(null, last);
  	            }
  	            push(null, nil);
  	        }
  	        else {
  	            last = x;
  	            if (t) {
  	                clearTimeout(t);
  	            }
  	            t = setTimeout(push.bind(this, null, x), ms);
  	            next();
  	        }
  	    });
  	};
  	exposeMethod('debounce');
  
  	/**
  	 * Creates a new Stream, which when read from, only returns the last
  	 * seen value from the source. The source stream does not experience
  	 * back-pressure. Useful if you're using a Stream to model a changing
  	 * property which you need to query periodically.
  	 *
  	 * @id latest
  	 * @section Transforms
  	 * @name Stream.latest()
  	 * @api public
  	 *
  	 * // slowThing will always get the last known mouse position
  	 * // when it asks for more data from the mousePosition stream
  	 * mousePosition.latest().map(slowThing)
  	 */
  
  	Stream.prototype.latest = function () {
  	    var nothing = {},
  	        latest = nothing,
  	        errors = [],
  	        ended = false,
  	        onValue = null;
  
  	    this.consume(function (err, x, push, next) {
  	        if (onValue != null) {
  	            var cb = onValue;
  	            onValue = null;
  	            cb(err, x);
  	        }
  
  	        if (err) {
  	            errors.push(err);
  	            next();
  	        }
  	        else if (x === nil) {
  	            ended = true;
  	        }
  	        else {
  	            latest = x;
  	            next();
  	        }
  	    }).resume();
  
  	    return _(function (push, next) {
  	        var oldErrors = errors;
  	        errors = [];
  
  	        if (!oldErrors.length && latest === nothing && !ended) {
  	            // We haven't gotten any data yet. We can't call next
  	            // because that might cause the stream to call the generator
  	            // again, resulting in an infinite loop. Thus, we stick a
  	            // a callback to be called whenever we get a value.
  	            onValue = function (err, x) {
  	                push(err, x);
  	                if (x !== nil) {
  	                    next();
  	                }
  	            };
  	        }
  	        else {
  	            oldErrors.forEach(push);
  	            if (latest !== nothing) {
  	                push(null, latest);
  	            }
  	            if (ended) {
  	                push(null, nil);
  	            }
  	            else {
  	                next();
  	            }
  	        }
  	    });
  	};
  	exposeMethod('latest');
  
  	/**
  	 * Returns values from an Object as a Stream. Reads properties
  	 * lazily, so if you don't read from all keys on an object, not
  	 * all properties will be read from (may have an effect where getters
  	 * are used).
  	 *
  	 * @id values
  	 * @section Objects
  	 * @name _.values(obj)
  	 * @param {Object} obj - the object to return values from
  	 * @api public
  	 *
  	 * _.values({foo: 1, bar: 2, baz: 3})  // => 1, 2, 3
  	 */
  
  	_.values = function (obj) {
  	    return _.keys(obj).map(function (k) {
  	        return obj[k];
  	    });
  	};
  
  	/**
  	 * Returns keys from an Object as a Stream.
  	 *
  	 * @id keys
  	 * @section Objects
  	 * @name _.keys(obj)
  	 * @param {Object} obj - the object to return keys from
  	 * @api public
  	 *
  	 * _.keys({foo: 1, bar: 2, baz: 3})  // => 'foo', 'bar', 'baz'
  	 */
  
  	function keys (obj) {
  	    var keysArray = [];
  	    for (var k in obj) {
  	        if (hasOwn.call(obj, k)) {
  	            keysArray.push(k);
  	        }
  	    }
  	    return keysArray;
  	}
  
  	_.keys = function (obj) {
  	    return _(keys(obj));
  	};
  
  	/**
  	 * Returns key/value pairs for an Object as a Stream. Reads properties
  	 * lazily, so if you don't read from all keys on an object, not
  	 * all properties will be read from (may have an effect where getters
  	 * are used).
  	 *
  	 * @id pairs
  	 * @section Objects
  	 * @name _.pairs(obj)
  	 * @param {Object} obj - the object to return key/value pairs from
  	 * @api public
  	 *
  	 * _.pairs({foo: 1, bar: 2})  // => ['foo', 1], ['bar', 2]
  	 */
  
  	_.pairs = function (obj) {
  	    return _.keys(obj).map(function (k) {
  	        return [k, obj[k]];
  	    });
  	};
  
  	/**
  	 * Extends one object with the properties of another. **Note:** The
  	 * arguments are in the reverse order of other libraries such as
  	 * underscore. This is so it follows the convention of other functions in
  	 * this library and so you can more meaningfully partially apply it.
  	 *
  	 * @id extend
  	 * @section Objects
  	 * @name _.extend(a, b)
  	 * @param {Object} a - the properties to extend b with
  	 * @param {Object} b - the original object to extend
  	 * @api public
  	 *
  	 * _.extend({name: 'bar'}, {name: 'foo', price: 20})
  	 * // => {name: 'bar', price: 20}
  	 *
  	 * // example of partial application
  	 * var publish = _.extend({published: true});
  	 *
  	 * publish({title: 'test post'})
  	 * // => {title: 'test post', published: true}
  	 */
  
  	_.extend = _.curry(function (extensions, target) {
  	    for (var k in extensions) {
  	        if (hasOwn.call(extensions, k)) {
  	            target[k] = extensions[k];
  	        }
  	    }
  	    return target;
  	});
  
  	/**
  	 * Returns a property from an object.
  	 *
  	 * @id get
  	 * @section Objects
  	 * @name _.get(prop, obj)
  	 * @param {String} prop - the property to return
  	 * @param {Object} obj - the object to read properties from
  	 * @api public
  	 *
  	 * var obj = {foo: 'bar', baz: 123};
  	 * _.get('foo', obj) // => 'bar'
  	 *
  	 * // making use of partial application
  	 * var posts = [
  	 *   {title: 'one'},
  	 *   {title: 'two'},
  	 *   {title: 'three'}
  	 * ];
  	 *
  	 * _(posts).map(_.get('title'))  // => 'one', 'two', 'three'
  	 */
  
  	_.get = _.curry(function (prop, obj) {
  	    return obj[prop];
  	});
  
  	/**
  	 * Updates a property on an object, returning the updated object.
  	 *
  	 * @id set
  	 * @section Objects
  	 * @name _.set(prop, value, obj)
  	 * @param {String} prop - the property to return
  	 * @param value - the value to set the property to
  	 * @param {Object} obj - the object to set properties on
  	 * @api public
  	 *
  	 * var obj = {foo: 'bar', baz: 123};
  	 * _.set('foo', 'wheeee', obj) // => {foo: 'wheeee', baz: 123}
  	 *
  	 * // making use of partial application
  	 * var publish = _.set('published', true);
  	 *
  	 * publish({title: 'example'})  // => {title: 'example', published: true}
  	 */
  
  	_.set = _.curry(function (prop, val, obj) {
  	    obj[prop] = val;
  	    return obj;
  	});
  
  	/**
  	 * Logs values to the console, a simple wrapper around `console.log` that
  	 * it suitable for passing to other functions by reference without having to
  	 * call `bind`.
  	 *
  	 * @id log
  	 * @section Utils
  	 * @name _.log(args..)
  	 * @api public
  	 *
  	 * _.log('Hello, world!');
  	 *
  	 * _([1, 2, 3, 4]).each(_.log);
  	 */
  
  	_.log = function () {
  	    console.log.apply(console, arguments);
  	};
  
  	/**
  	 * Wraps a node-style async function which accepts a callback, transforming
  	 * it to a function which accepts the same arguments minus the callback and
  	 * returns a Highland Stream instead. The wrapped function keeps its context,
  	 * so you can safely use it as a method without binding (see the second
  	 * example below).
  	 *
  	 * `wrapCallback` also accepts an optional `mappingHint`, which specifies how
  	 * callback arguments are pushed to the stream. This can be used to handle
  	 * non-standard callback protocols that pass back more than one value.
  	 *
  	 * `mappingHint` can be a function, number, or array. See the documentation on
  	 * [EventEmitter Stream Objects](#Stream Objects) for details on the mapping
  	 * hint. If `mappingHint` is a function, it will be called with all but the
  	 * first argument that is passed to the callback. The first is still assumed to
  	 * be the error argument.
  	 *
  	 * @id wrapCallback
  	 * @section Utils
  	 * @name _.wrapCallback(f)
  	 * @param {Function} f - the node-style function to wrap
  	 * @param {Array | Function | Number} mappingHint - (optional) how to pass the
  	 * arguments to the callback
  	 * @api public
  	 *
  	 * var fs = require('fs');
  	 *
  	 * var readFile = _.wrapCallback(fs.readFile);
  	 *
  	 * readFile('example.txt').apply(function (data) {
  	 *     // data is now the contents of example.txt
  	 * });
  	 *
  	 * function Reader(file) {
  	 *     this.file = file;
  	 * }
  	 *
  	 * Reader.prototype.read = function(cb) {
  	 *     fs.readFile(this.file, cb);
  	 * };
  	 *
  	 * Reader.prototype.readStream = _.wrapCallback(Reader.prototype.read);
  	 */
  
  	/*eslint-disable no-multi-spaces */
  	_.wrapCallback = function (f, /*optional*/mappingHint) {
  	    /*eslint-enable no-multi-spaces */
  	    var mapper = hintMapper(mappingHint);
  
  	    return function () {
  	        var self = this;
  	        var args = slice.call(arguments);
  	        return _(function (push) {
  	            var cb = function (err) {
  	                if (err) {
  	                    push(err);
  	                }
  	                else {
  	                    var cbArgs = slice.call(arguments, 1);
  	                    var v = mapper.apply(this, cbArgs);
  	                    push(null, v);
  	                }
  	                push(null, nil);
  	            };
  	            f.apply(self, args.concat([cb]));
  	        });
  	    };
  	};
  
  	/**
  	 * Takes an object or a constructor function and returns that object or
  	 * constructor with streamified versions of its function properties.
  	 * Passed constructors will also have their prototype functions
  	 * streamified.  This is useful for wrapping many node style async
  	 * functions at once, and for preserving those functions' context.
  	 *
  	 * @id streamifyAll
  	 * @section Utils
  	 * @name _.streamifyAll(source)
  	 * @param {Object | Function} source - the function or object with
  	 * node-style function properties.
  	 * @api public
  	 *
  	 * var fs = _.streamifyAll(require('fs'));
  	 *
  	 * fs.readFileStream('example.txt').apply(function (data) {
  	 *     // data is now the contents of example.txt
  	 * });
  	 */
  
  	function isClass (fn) {
  	    if (!(typeof fn === 'function' && fn.prototype)) { return false; }
  	    var getKeys = isES5 ? Object.getOwnPropertyNames : keys;
  	    var allKeys = getKeys(fn.prototype);
  	    return allKeys.length > 0 && !(allKeys.length === 1 &&
  	            allKeys[0] === 'constructor');
  	}
  
  	function inheritedKeys (obj) {
  	    var allProps = {};
  	    var curr = obj;
  	    var handleProp = function (prop) {
  	        allProps[prop] = true;
  	    };
  	    while (Object.getPrototypeOf(curr)) {
  	        var props = Object.getOwnPropertyNames(curr);
  	        props.forEach(handleProp);
  	        curr = Object.getPrototypeOf(curr);
  	    }
  	    return keys(allProps);
  	}
  
  	function streamifyAll (inp, suffix) {
  	    // will not streamify inherited functions in ES3
  	    var getKeys = isES5 ? inheritedKeys : keys;
  	    var allKeys = getKeys(inp);
  
  	    for (var i = 0, len = allKeys.length; i < len; i++) {
  	        var key = allKeys[i];
  	        var val;
  
  	        // will skip context aware getters
  	        try {
  	            val = inp[key];
  	        }
  	        catch (e) {
  	            // Ignore
  	        }
  
  	        if (val && typeof val === 'function' && !isClass(val) &&
  	                !val.__HighlandStreamifiedFunction__) {
  
  	            var streamified = _.wrapCallback(val);
  	            streamified.__HighlandStreamifiedFunction__ = true;
  	            inp[key + suffix] = streamified;
  	        }
  	    }
  	    return inp;
  	}
  
  	_.streamifyAll = function (arg) {
  	    if (typeof arg !== 'function' && typeof arg !== 'object') {
  	        throw new TypeError('takes an object or a constructor function');
  	    }
  	    var suffix = 'Stream';
  
  	    var ret = streamifyAll(arg, suffix);
  	    if (isClass(arg)) {
  	        ret.prototype = streamifyAll(arg.prototype, suffix);
  	    }
  	    return ret;
  	};
  
  	/**
  	 * Add two values. Can be partially applied.
  	 *
  	 * @id add
  	 * @section Operators
  	 * @name _.add(a, b)
  	 * @api public
  	 *
  	 * _.add(1, 2) === 3
  	 * _.add(1)(5) === 6
  	 */
  
  	_.add = _.curry(function (a, b) {
  	    return a + b;
  	});
  
  	/**
  	 * Perform logical negation on a value. If `x` is truthy then returns false,
  	 * otherwise returns true.
  	 *
  	 * @id not
  	 * @section Operators
  	 * @name _.not(x)
  	 * @param x - the value to negate
  	 * @api public
  	 *
  	 * _.not(true)   // => false
  	 * _.not(false)  // => true
  	 */
  
  	_.not = function (x) {
  	    return !x;
  	};
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(30).setImmediate, __webpack_require__(16), (function() { return this; }())))
  
  /***/ },
  /* 30 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(setImmediate, clearImmediate) {var nextTick = __webpack_require__(31).nextTick;
  	var apply = Function.prototype.apply;
  	var slice = Array.prototype.slice;
  	var immediateIds = {};
  	var nextImmediateId = 0;
  
  	// DOM APIs, for completeness
  
  	exports.setTimeout = function() {
  	  return new Timeout(apply.call(setTimeout, window, arguments), clearTimeout);
  	};
  	exports.setInterval = function() {
  	  return new Timeout(apply.call(setInterval, window, arguments), clearInterval);
  	};
  	exports.clearTimeout =
  	exports.clearInterval = function(timeout) { timeout.close(); };
  
  	function Timeout(id, clearFn) {
  	  this._id = id;
  	  this._clearFn = clearFn;
  	}
  	Timeout.prototype.unref = Timeout.prototype.ref = function() {};
  	Timeout.prototype.close = function() {
  	  this._clearFn.call(window, this._id);
  	};
  
  	// Does not start the time, just sets up the members needed.
  	exports.enroll = function(item, msecs) {
  	  clearTimeout(item._idleTimeoutId);
  	  item._idleTimeout = msecs;
  	};
  
  	exports.unenroll = function(item) {
  	  clearTimeout(item._idleTimeoutId);
  	  item._idleTimeout = -1;
  	};
  
  	exports._unrefActive = exports.active = function(item) {
  	  clearTimeout(item._idleTimeoutId);
  
  	  var msecs = item._idleTimeout;
  	  if (msecs >= 0) {
  	    item._idleTimeoutId = setTimeout(function onTimeout() {
  	      if (item._onTimeout)
  	        item._onTimeout();
  	    }, msecs);
  	  }
  	};
  
  	// That's not how node.js implements it but the exposed api is the same.
  	exports.setImmediate = typeof setImmediate === "function" ? setImmediate : function(fn) {
  	  var id = nextImmediateId++;
  	  var args = arguments.length < 2 ? false : slice.call(arguments, 1);
  
  	  immediateIds[id] = true;
  
  	  nextTick(function onNextTick() {
  	    if (immediateIds[id]) {
  	      // fn.call() is faster so we optimize for the common use-case
  	      // @see http://jsperf.com/call-apply-segu
  	      if (args) {
  	        fn.apply(null, args);
  	      } else {
  	        fn.call(null);
  	      }
  	      // Prevent ids from leaking
  	      exports.clearImmediate(id);
  	    }
  	  });
  
  	  return id;
  	};
  
  	exports.clearImmediate = typeof clearImmediate === "function" ? clearImmediate : function(id) {
  	  delete immediateIds[id];
  	};
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(30).setImmediate, __webpack_require__(30).clearImmediate))
  
  /***/ },
  /* 31 */
  /***/ function(module, exports) {
  
  	// shim for using process in browser
  
  	var process = module.exports = {};
  	var queue = [];
  	var draining = false;
  	var currentQueue;
  	var queueIndex = -1;
  
  	function cleanUpNextTick() {
  	    draining = false;
  	    if (currentQueue.length) {
  	        queue = currentQueue.concat(queue);
  	    } else {
  	        queueIndex = -1;
  	    }
  	    if (queue.length) {
  	        drainQueue();
  	    }
  	}
  
  	function drainQueue() {
  	    if (draining) {
  	        return;
  	    }
  	    var timeout = setTimeout(cleanUpNextTick);
  	    draining = true;
  
  	    var len = queue.length;
  	    while(len) {
  	        currentQueue = queue;
  	        queue = [];
  	        while (++queueIndex < len) {
  	            if (currentQueue) {
  	                currentQueue[queueIndex].run();
  	            }
  	        }
  	        queueIndex = -1;
  	        len = queue.length;
  	    }
  	    currentQueue = null;
  	    draining = false;
  	    clearTimeout(timeout);
  	}
  
  	process.nextTick = function (fun) {
  	    var args = new Array(arguments.length - 1);
  	    if (arguments.length > 1) {
  	        for (var i = 1; i < arguments.length; i++) {
  	            args[i - 1] = arguments[i];
  	        }
  	    }
  	    queue.push(new Item(fun, args));
  	    if (queue.length === 1 && !draining) {
  	        setTimeout(drainQueue, 0);
  	    }
  	};
  
  	// v8 likes predictible objects
  	function Item(fun, array) {
  	    this.fun = fun;
  	    this.array = array;
  	}
  	Item.prototype.run = function () {
  	    this.fun.apply(null, this.array);
  	};
  	process.title = 'browser';
  	process.browser = true;
  	process.env = {};
  	process.argv = [];
  	process.version = ''; // empty string to avoid regexp issues
  	process.versions = {};
  
  	function noop() {}
  
  	process.on = noop;
  	process.addListener = noop;
  	process.once = noop;
  	process.off = noop;
  	process.removeListener = noop;
  	process.removeAllListeners = noop;
  	process.emit = noop;
  
  	process.binding = function (name) {
  	    throw new Error('process.binding is not supported');
  	};
  
  	process.cwd = function () { return '/' };
  	process.chdir = function (dir) {
  	    throw new Error('process.chdir is not supported');
  	};
  	process.umask = function() { return 0; };
  
  
  /***/ },
  /* 32 */
  /***/ function(module, exports) {
  
  	/* WEBPACK VAR INJECTION */(function(global) {
  	/**
  	 * Module exports.
  	 */
  
  	module.exports = deprecate;
  
  	/**
  	 * Mark that a method should not be used.
  	 * Returns a modified function which warns once by default.
  	 *
  	 * If `localStorage.noDeprecation = true` is set, then it is a no-op.
  	 *
  	 * If `localStorage.throwDeprecation = true` is set, then deprecated functions
  	 * will throw an Error when invoked.
  	 *
  	 * If `localStorage.traceDeprecation = true` is set, then deprecated functions
  	 * will invoke `console.trace()` instead of `console.error()`.
  	 *
  	 * @param {Function} fn - the function to deprecate
  	 * @param {String} msg - the string to print to the console when `fn` is invoked
  	 * @returns {Function} a new "deprecated" version of `fn`
  	 * @api public
  	 */
  
  	function deprecate (fn, msg) {
  	  if (config('noDeprecation')) {
  	    return fn;
  	  }
  
  	  var warned = false;
  	  function deprecated() {
  	    if (!warned) {
  	      if (config('throwDeprecation')) {
  	        throw new Error(msg);
  	      } else if (config('traceDeprecation')) {
  	        console.trace(msg);
  	      } else {
  	        console.warn(msg);
  	      }
  	      warned = true;
  	    }
  	    return fn.apply(this, arguments);
  	  }
  
  	  return deprecated;
  	}
  
  	/**
  	 * Checks `localStorage` for boolean values for the given `name`.
  	 *
  	 * @param {String} name
  	 * @returns {Boolean}
  	 * @api private
  	 */
  
  	function config (name) {
  	  // accessing global.localStorage can trigger a DOMException in sandboxed iframes
  	  try {
  	    if (!global.localStorage) return false;
  	  } catch (_) {
  	    return false;
  	  }
  	  var val = global.localStorage[name];
  	  if (null == val) return false;
  	  return String(val).toLowerCase() === 'true';
  	}
  
  	/* WEBPACK VAR INJECTION */}.call(exports, (function() { return this; }())))
  
  /***/ },
  /* 33 */
  /***/ function(module, exports, __webpack_require__) {
  
  	// Copyright Joyent, Inc. and other Node contributors.
  	//
  	// Permission is hereby granted, free of charge, to any person obtaining a
  	// copy of this software and associated documentation files (the
  	// "Software"), to deal in the Software without restriction, including
  	// without limitation the rights to use, copy, modify, merge, publish,
  	// distribute, sublicense, and/or sell copies of the Software, and to permit
  	// persons to whom the Software is furnished to do so, subject to the
  	// following conditions:
  	//
  	// The above copyright notice and this permission notice shall be included
  	// in all copies or substantial portions of the Software.
  	//
  	// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  	// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  	// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
  	// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
  	// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  	// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  	// USE OR OTHER DEALINGS IN THE SOFTWARE.
  
  	var Buffer = __webpack_require__(2).Buffer;
  
  	var isBufferEncoding = Buffer.isEncoding
  	  || function(encoding) {
  	       switch (encoding && encoding.toLowerCase()) {
  	         case 'hex': case 'utf8': case 'utf-8': case 'ascii': case 'binary': case 'base64': case 'ucs2': case 'ucs-2': case 'utf16le': case 'utf-16le': case 'raw': return true;
  	         default: return false;
  	       }
  	     }
  
  
  	function assertEncoding(encoding) {
  	  if (encoding && !isBufferEncoding(encoding)) {
  	    throw new Error('Unknown encoding: ' + encoding);
  	  }
  	}
  
  	// StringDecoder provides an interface for efficiently splitting a series of
  	// buffers into a series of JS strings without breaking apart multi-byte
  	// characters. CESU-8 is handled as part of the UTF-8 encoding.
  	//
  	// @TODO Handling all encodings inside a single object makes it very difficult
  	// to reason about this code, so it should be split up in the future.
  	// @TODO There should be a utf8-strict encoding that rejects invalid UTF-8 code
  	// points as used by CESU-8.
  	var StringDecoder = exports.StringDecoder = function(encoding) {
  	  this.encoding = (encoding || 'utf8').toLowerCase().replace(/[-_]/, '');
  	  assertEncoding(encoding);
  	  switch (this.encoding) {
  	    case 'utf8':
  	      // CESU-8 represents each of Surrogate Pair by 3-bytes
  	      this.surrogateSize = 3;
  	      break;
  	    case 'ucs2':
  	    case 'utf16le':
  	      // UTF-16 represents each of Surrogate Pair by 2-bytes
  	      this.surrogateSize = 2;
  	      this.detectIncompleteChar = utf16DetectIncompleteChar;
  	      break;
  	    case 'base64':
  	      // Base-64 stores 3 bytes in 4 chars, and pads the remainder.
  	      this.surrogateSize = 3;
  	      this.detectIncompleteChar = base64DetectIncompleteChar;
  	      break;
  	    default:
  	      this.write = passThroughWrite;
  	      return;
  	  }
  
  	  // Enough space to store all bytes of a single character. UTF-8 needs 4
  	  // bytes, but CESU-8 may require up to 6 (3 bytes per surrogate).
  	  this.charBuffer = new Buffer(6);
  	  // Number of bytes received for the current incomplete multi-byte character.
  	  this.charReceived = 0;
  	  // Number of bytes expected for the current incomplete multi-byte character.
  	  this.charLength = 0;
  	};
  
  
  	// write decodes the given buffer and returns it as JS string that is
  	// guaranteed to not contain any partial multi-byte characters. Any partial
  	// character found at the end of the buffer is buffered up, and will be
  	// returned when calling write again with the remaining bytes.
  	//
  	// Note: Converting a Buffer containing an orphan surrogate to a String
  	// currently works, but converting a String to a Buffer (via `new Buffer`, or
  	// Buffer#write) will replace incomplete surrogates with the unicode
  	// replacement character. See https://codereview.chromium.org/121173009/ .
  	StringDecoder.prototype.write = function(buffer) {
  	  var charStr = '';
  	  // if our last write ended with an incomplete multibyte character
  	  while (this.charLength) {
  	    // determine how many remaining bytes this buffer has to offer for this char
  	    var available = (buffer.length >= this.charLength - this.charReceived) ?
  	        this.charLength - this.charReceived :
  	        buffer.length;
  
  	    // add the new bytes to the char buffer
  	    buffer.copy(this.charBuffer, this.charReceived, 0, available);
  	    this.charReceived += available;
  
  	    if (this.charReceived < this.charLength) {
  	      // still not enough chars in this buffer? wait for more ...
  	      return '';
  	    }
  
  	    // remove bytes belonging to the current character from the buffer
  	    buffer = buffer.slice(available, buffer.length);
  
  	    // get the character that was split
  	    charStr = this.charBuffer.slice(0, this.charLength).toString(this.encoding);
  
  	    // CESU-8: lead surrogate (D800-DBFF) is also the incomplete character
  	    var charCode = charStr.charCodeAt(charStr.length - 1);
  	    if (charCode >= 0xD800 && charCode <= 0xDBFF) {
  	      this.charLength += this.surrogateSize;
  	      charStr = '';
  	      continue;
  	    }
  	    this.charReceived = this.charLength = 0;
  
  	    // if there are no more bytes in this buffer, just emit our char
  	    if (buffer.length === 0) {
  	      return charStr;
  	    }
  	    break;
  	  }
  
  	  // determine and set charLength / charReceived
  	  this.detectIncompleteChar(buffer);
  
  	  var end = buffer.length;
  	  if (this.charLength) {
  	    // buffer the incomplete character bytes we got
  	    buffer.copy(this.charBuffer, 0, buffer.length - this.charReceived, end);
  	    end -= this.charReceived;
  	  }
  
  	  charStr += buffer.toString(this.encoding, 0, end);
  
  	  var end = charStr.length - 1;
  	  var charCode = charStr.charCodeAt(end);
  	  // CESU-8: lead surrogate (D800-DBFF) is also the incomplete character
  	  if (charCode >= 0xD800 && charCode <= 0xDBFF) {
  	    var size = this.surrogateSize;
  	    this.charLength += size;
  	    this.charReceived += size;
  	    this.charBuffer.copy(this.charBuffer, size, 0, size);
  	    buffer.copy(this.charBuffer, 0, 0, size);
  	    return charStr.substring(0, end);
  	  }
  
  	  // or just emit the charStr
  	  return charStr;
  	};
  
  	// detectIncompleteChar determines if there is an incomplete UTF-8 character at
  	// the end of the given buffer. If so, it sets this.charLength to the byte
  	// length that character, and sets this.charReceived to the number of bytes
  	// that are available for this character.
  	StringDecoder.prototype.detectIncompleteChar = function(buffer) {
  	  // determine how many bytes we have to check at the end of this buffer
  	  var i = (buffer.length >= 3) ? 3 : buffer.length;
  
  	  // Figure out if one of the last i bytes of our buffer announces an
  	  // incomplete char.
  	  for (; i > 0; i--) {
  	    var c = buffer[buffer.length - i];
  
  	    // See http://en.wikipedia.org/wiki/UTF-8#Description
  
  	    // 110XXXXX
  	    if (i == 1 && c >> 5 == 0x06) {
  	      this.charLength = 2;
  	      break;
  	    }
  
  	    // 1110XXXX
  	    if (i <= 2 && c >> 4 == 0x0E) {
  	      this.charLength = 3;
  	      break;
  	    }
  
  	    // 11110XXX
  	    if (i <= 3 && c >> 3 == 0x1E) {
  	      this.charLength = 4;
  	      break;
  	    }
  	  }
  	  this.charReceived = i;
  	};
  
  	StringDecoder.prototype.end = function(buffer) {
  	  var res = '';
  	  if (buffer && buffer.length)
  	    res = this.write(buffer);
  
  	  if (this.charReceived) {
  	    var cr = this.charReceived;
  	    var buf = this.charBuffer;
  	    var enc = this.encoding;
  	    res += buf.slice(0, cr).toString(enc);
  	  }
  
  	  return res;
  	};
  
  	function passThroughWrite(buffer) {
  	  return buffer.toString(this.encoding);
  	}
  
  	function utf16DetectIncompleteChar(buffer) {
  	  this.charReceived = buffer.length % 2;
  	  this.charLength = this.charReceived ? 2 : 0;
  	}
  
  	function base64DetectIncompleteChar(buffer) {
  	  this.charReceived = buffer.length % 3;
  	  this.charLength = this.charReceived ? 3 : 0;
  	}
  
  
  /***/ },
  /* 34 */
  /***/ function(module, exports, __webpack_require__) {
  
  	'use strict';
  
  	Object.defineProperty(exports, "__esModule", {
  	  value: true
  	});
  
  	var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();
  
  	var _events = __webpack_require__(6);
  
  	var _ws = __webpack_require__(35);
  
  	var _ws2 = _interopRequireDefault(_ws);
  
  	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
  
  	function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
  
  	function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; }
  
  	function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }
  
  	var WebSocketGremlinConnection = function (_EventEmitter) {
  	  _inherits(WebSocketGremlinConnection, _EventEmitter);
  
  	  function WebSocketGremlinConnection(_ref) {
  	    var port = _ref.port;
  	    var host = _ref.host;
  	    var path = _ref.path;
  
  	    _classCallCheck(this, WebSocketGremlinConnection);
  
  	    var _this = _possibleConstructorReturn(this, Object.getPrototypeOf(WebSocketGremlinConnection).call(this));
  
  	    _this.open = false;
  
  	    _this.ws = new _ws2.default('ws://' + host + ':' + port + path);
  
  	    _this.ws.onopen = function () {
  	      return _this.onOpen();
  	    };
  	    _this.ws.onerror = function (err) {
  	      return _this.handleError(err);
  	    };
  	    _this.ws.onmessage = function (message) {
  	      return _this.handleMessage(message);
  	    };
  	    _this.ws.onclose = function (event) {
  	      return _this.onClose(event);
  	    };
  	    _this.ws.binaryType = "arraybuffer";
  	    return _this;
  	  }
  
  	  _createClass(WebSocketGremlinConnection, [{
  	    key: 'onOpen',
  	    value: function onOpen() {
  	      this.open = true;
  	      this.emit('open');
  	    }
  	  }, {
  	    key: 'handleError',
  	    value: function handleError(err) {
  	      this.emit('error', err);
  	    }
  	  }, {
  	    key: 'handleMessage',
  	    value: function handleMessage(message) {
  	      this.emit('message', message);
  	    }
  	  }, {
  	    key: 'onClose',
  	    value: function onClose(event) {
  	      this.open = false;
  	      this.emit('close', event);
  	    }
  	  }, {
  	    key: 'sendMessage',
  	    value: function sendMessage(message) {
  	      var _this2 = this;
  
  	      this.ws.send(message, { mask: true, binary: true }, function (err) {
  	        if (err) {
  	          _this2.handleError(err);
  	        }
  	      });
  	    }
  	  }]);
  
  	  return WebSocketGremlinConnection;
  	}(_events.EventEmitter);
  
  	exports.default = WebSocketGremlinConnection;
  	//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbInNyYy9XZWJTb2NrZXRHcmVtbGluQ29ubmVjdGlvbi5qcyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7Ozs7OztBQUFBOztBQUVBOzs7Ozs7Ozs7Ozs7SUFHcUI7OztBQUNuQixXQURtQiwwQkFDbkIsT0FBa0M7UUFBcEIsaUJBQW9CO1FBQWQsaUJBQWM7UUFBUixpQkFBUTs7MEJBRGYsNEJBQ2U7O3VFQURmLHdDQUNlOztBQUdoQyxVQUFLLElBQUwsR0FBWSxLQUFaLENBSGdDOztBQUtoQyxVQUFLLEVBQUwsR0FBVSwyQkFBc0IsYUFBUSxPQUFPLElBQXJDLENBQVYsQ0FMZ0M7O0FBT2hDLFVBQUssRUFBTCxDQUFRLE1BQVIsR0FBaUI7YUFBTSxNQUFLLE1BQUw7S0FBTixDQVBlO0FBUWhDLFVBQUssRUFBTCxDQUFRLE9BQVIsR0FBa0IsVUFBQyxHQUFEO2FBQVMsTUFBSyxXQUFMLENBQWlCLEdBQWpCO0tBQVQsQ0FSYztBQVNoQyxVQUFLLEVBQUwsQ0FBUSxTQUFSLEdBQW9CLFVBQUMsT0FBRDthQUFhLE1BQUssYUFBTCxDQUFtQixPQUFuQjtLQUFiLENBVFk7QUFVaEMsVUFBSyxFQUFMLENBQVEsT0FBUixHQUFrQixVQUFDLEtBQUQ7YUFBVyxNQUFLLE9BQUwsQ0FBYSxLQUFiO0tBQVgsQ0FWYztBQVdoQyxVQUFLLEVBQUwsQ0FBUSxVQUFSLEdBQXFCLGFBQXJCLENBWGdDOztHQUFsQzs7ZUFEbUI7OzZCQWVWO0FBQ1AsV0FBSyxJQUFMLEdBQVksSUFBWixDQURPO0FBRVAsV0FBSyxJQUFMLENBQVUsTUFBVixFQUZPOzs7O2dDQUtHLEtBQUs7QUFDZixXQUFLLElBQUwsQ0FBVSxPQUFWLEVBQW1CLEdBQW5CLEVBRGU7Ozs7a0NBSUgsU0FBUztBQUNyQixXQUFLLElBQUwsQ0FBVSxTQUFWLEVBQXFCLE9BQXJCLEVBRHFCOzs7OzRCQUlmLE9BQU87QUFDYixXQUFLLElBQUwsR0FBWSxLQUFaLENBRGE7QUFFYixXQUFLLElBQUwsQ0FBVSxPQUFWLEVBQW1CLEtBQW5CLEVBRmE7Ozs7Z0NBS0gsU0FBUzs7O0FBQ25CLFdBQUssRUFBTCxDQUFRLElBQVIsQ0FBYSxPQUFiLEVBQXNCLEVBQUUsTUFBTSxJQUFOLEVBQVksUUFBUSxJQUFSLEVBQXBDLEVBQW9ELFVBQUMsR0FBRCxFQUFTO0FBQzNELFlBQUksR0FBSixFQUFTO0FBQ1AsaUJBQUssV0FBTCxDQUFpQixHQUFqQixFQURPO1NBQVQ7T0FEa0QsQ0FBcEQsQ0FEbUI7Ozs7U0FqQ0YiLCJmaWxlIjoiV2ViU29ja2V0R3JlbWxpbkNvbm5lY3Rpb24uanMiLCJzb3VyY2VSb290IjoiL1VzZXJzL3ZpY3Rvci9EZXNrdG9wL2dyZW1saW4tamF2YXNjcmlwdCIsInNvdXJjZXNDb250ZW50IjpbImltcG9ydCB7IEV2ZW50RW1pdHRlciB9IGZyb20gJ2V2ZW50cyc7XG5cbmltcG9ydCBXZWJTb2NrZXQgZnJvbSAnd3MnO1xuXG5cbmV4cG9ydCBkZWZhdWx0IGNsYXNzIFdlYlNvY2tldEdyZW1saW5Db25uZWN0aW9uIGV4dGVuZHMgRXZlbnRFbWl0dGVywqB7XG4gIGNvbnN0cnVjdG9yKHsgcG9ydCwgaG9zdCwgcGF0aCB9KSB7XG4gICAgc3VwZXIoKTtcblxuICAgIHRoaXMub3BlbiA9IGZhbHNlO1xuXG4gICAgdGhpcy53cyA9IG5ldyBXZWJTb2NrZXQoYHdzOi8vJHtob3N0fToke3BvcnR9JHtwYXRofWApO1xuXG4gICAgdGhpcy53cy5vbm9wZW4gPSAoKSA9PiB0aGlzLm9uT3BlbigpO1xuICAgIHRoaXMud3Mub25lcnJvciA9IChlcnIpID0+IHRoaXMuaGFuZGxlRXJyb3IoZXJyKTtcbiAgICB0aGlzLndzLm9ubWVzc2FnZSA9IChtZXNzYWdlKSA9PiB0aGlzLmhhbmRsZU1lc3NhZ2UobWVzc2FnZSk7XG4gICAgdGhpcy53cy5vbmNsb3NlID0gKGV2ZW50KSA9PiB0aGlzLm9uQ2xvc2UoZXZlbnQpO1xuICAgIHRoaXMud3MuYmluYXJ5VHlwZSA9IFwiYXJyYXlidWZmZXJcIjtcbiAgfVxuXG4gIG9uT3BlbigpIHtcbiAgICB0aGlzLm9wZW4gPSB0cnVlO1xuICAgIHRoaXMuZW1pdCgnb3BlbicpO1xuICB9XG5cbiAgaGFuZGxlRXJyb3IoZXJyKSB7XG4gICAgdGhpcy5lbWl0KCdlcnJvcicsIGVycik7XG4gIH1cblxuICBoYW5kbGVNZXNzYWdlKG1lc3NhZ2UpIHtcbiAgICB0aGlzLmVtaXQoJ21lc3NhZ2UnLCBtZXNzYWdlKTtcbiAgfVxuXG4gIG9uQ2xvc2UoZXZlbnQpIHtcbiAgICB0aGlzLm9wZW4gPSBmYWxzZTtcbiAgICB0aGlzLmVtaXQoJ2Nsb3NlJywgZXZlbnQpO1xuICB9XG5cbiAgc2VuZE1lc3NhZ2UobWVzc2FnZSkge1xuICAgIHRoaXMud3Muc2VuZChtZXNzYWdlLCB7IG1hc2s6IHRydWUsIGJpbmFyeTogdHJ1ZSB9LCAoZXJyKSA9PiB7XG4gICAgICBpZiAoZXJyKSB7XG4gICAgICAgIHRoaXMuaGFuZGxlRXJyb3IoZXJyKTtcbiAgICAgIH1cbiAgICB9KTtcbiAgfVxufVxuIl19
  
  /***/ },
  /* 35 */
  /***/ function(module, exports) {
  
  	
  	/**
  	 * Module dependencies.
  	 */
  
  	var global = (function() { return this; })();
  
  	/**
  	 * WebSocket constructor.
  	 */
  
  	var WebSocket = global.WebSocket || global.MozWebSocket;
  
  	/**
  	 * Module exports.
  	 */
  
  	module.exports = WebSocket ? ws : null;
  
  	/**
  	 * WebSocket constructor.
  	 *
  	 * The third `opts` options object gets ignored in web browsers, since it's
  	 * non-standard, and throws a TypeError if passed to the constructor.
  	 * See: https://github.com/einaros/ws/issues/227
  	 *
  	 * @param {String} uri
  	 * @param {Array} protocols (optional)
  	 * @param {Object) opts (optional)
  	 * @api public
  	 */
  
  	function ws(uri, protocols, opts) {
  	  var instance;
  	  if (protocols) {
  	    instance = new WebSocket(uri, protocols);
  	  } else {
  	    instance = new WebSocket(uri);
  	  }
  	  return instance;
  	}
  
  	if (WebSocket) ws.prototype = WebSocket.prototype;
  
  
  /***/ },
  /* 36 */
  /***/ function(module, exports, __webpack_require__) {
  
  	'use strict';
  
  	Object.defineProperty(exports, "__esModule", {
  	  value: true
  	});
  
  	var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();
  
  	var _readableStream = __webpack_require__(37);
  
  	var _readableStream2 = _interopRequireDefault(_readableStream);
  
  	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
  
  	function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
  
  	function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; }
  
  	function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }
  
  	var MessageStream = function (_ReadableStream) {
  	  _inherits(MessageStream, _ReadableStream);
  
  	  function MessageStream() {
  	    var _Object$getPrototypeO;
  
  	    _classCallCheck(this, MessageStream);
  
  	    for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {
  	      args[_key] = arguments[_key];
  	    }
  
  	    return _possibleConstructorReturn(this, (_Object$getPrototypeO = Object.getPrototypeOf(MessageStream)).call.apply(_Object$getPrototypeO, [this].concat(args)));
  	  }
  
  	  _createClass(MessageStream, [{
  	    key: '_read',
  	    value: function _read() {
  	      this._paused = false;
  	    }
  	  }]);
  
  	  return MessageStream;
  	}(_readableStream2.default);
  
  	exports.default = MessageStream;
  	//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbInNyYy9NZXNzYWdlU3RyZWFtLmpzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7Ozs7Ozs7O0FBQUE7Ozs7Ozs7Ozs7OztJQUdNOzs7QUFDSixXQURJLGFBQ0osR0FBcUI7OzswQkFEakIsZUFDaUI7O3NDQUFOOztLQUFNOzsyRkFEakIsZ0VBRU8sUUFEVTtHQUFyQjs7ZUFESTs7NEJBS0k7QUFDTixXQUFLLE9BQUwsR0FBZSxLQUFmLENBRE07Ozs7U0FMSjs7O2tCQVVTIiwiZmlsZSI6Ik1lc3NhZ2VTdHJlYW0uanMiLCJzb3VyY2VSb290IjoiL1VzZXJzL3ZpY3Rvci9EZXNrdG9wL2dyZW1saW4tamF2YXNjcmlwdCIsInNvdXJjZXNDb250ZW50IjpbImltcG9ydCBSZWFkYWJsZVN0cmVhbSBmcm9tICdyZWFkYWJsZS1zdHJlYW0nO1xuXG5cbmNsYXNzIE1lc3NhZ2VTdHJlYW0gZXh0ZW5kcyBSZWFkYWJsZVN0cmVhbSB7XG4gIGNvbnN0cnVjdG9yKC4uLmFyZ3MpIHtcbiAgICBzdXBlciguLi5hcmdzKVxuICB9XG5cbiAgX3JlYWQoKSB7XG4gICAgdGhpcy5fcGF1c2VkID0gZmFsc2U7XG4gIH1cbn1cblxuZXhwb3J0IGRlZmF1bHQgTWVzc2FnZVN0cmVhbTtcbiJdfQ==
  
  /***/ },
  /* 37 */
  /***/ function(module, exports, __webpack_require__) {
  
  	var Stream = (function (){
  	  try {
  	    return __webpack_require__(38); // hack to fix a circular dependency issue when used with browserify
  	  } catch(_){}
  	}());
  	exports = module.exports = __webpack_require__(52);
  	exports.Stream = Stream || exports;
  	exports.Readable = exports;
  	exports.Writable = __webpack_require__(56);
  	exports.Duplex = __webpack_require__(55);
  	exports.Transform = __webpack_require__(57);
  	exports.PassThrough = __webpack_require__(58);
  
  
  /***/ },
  /* 38 */
  /***/ function(module, exports, __webpack_require__) {
  
  	// Copyright Joyent, Inc. and other Node contributors.
  	//
  	// Permission is hereby granted, free of charge, to any person obtaining a
  	// copy of this software and associated documentation files (the
  	// "Software"), to deal in the Software without restriction, including
  	// without limitation the rights to use, copy, modify, merge, publish,
  	// distribute, sublicense, and/or sell copies of the Software, and to permit
  	// persons to whom the Software is furnished to do so, subject to the
  	// following conditions:
  	//
  	// The above copyright notice and this permission notice shall be included
  	// in all copies or substantial portions of the Software.
  	//
  	// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  	// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  	// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
  	// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
  	// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  	// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  	// USE OR OTHER DEALINGS IN THE SOFTWARE.
  
  	module.exports = Stream;
  
  	var EE = __webpack_require__(6).EventEmitter;
  	var inherits = __webpack_require__(18);
  
  	inherits(Stream, EE);
  	Stream.Readable = __webpack_require__(39);
  	Stream.Writable = __webpack_require__(48);
  	Stream.Duplex = __webpack_require__(49);
  	Stream.Transform = __webpack_require__(50);
  	Stream.PassThrough = __webpack_require__(51);
  
  	// Backwards-compat with node 0.4.x
  	Stream.Stream = Stream;
  
  
  
  	// old-style streams.  Note that the pipe method (the only relevant
  	// part of this class) is overridden in the Readable class.
  
  	function Stream() {
  	  EE.call(this);
  	}
  
  	Stream.prototype.pipe = function(dest, options) {
  	  var source = this;
  
  	  function ondata(chunk) {
  	    if (dest.writable) {
  	      if (false === dest.write(chunk) && source.pause) {
  	        source.pause();
  	      }
  	    }
  	  }
  
  	  source.on('data', ondata);
  
  	  function ondrain() {
  	    if (source.readable && source.resume) {
  	      source.resume();
  	    }
  	  }
  
  	  dest.on('drain', ondrain);
  
  	  // If the 'end' option is not supplied, dest.end() will be called when
  	  // source gets the 'end' or 'close' events.  Only dest.end() once.
  	  if (!dest._isStdio && (!options || options.end !== false)) {
  	    source.on('end', onend);
  	    source.on('close', onclose);
  	  }
  
  	  var didOnEnd = false;
  	  function onend() {
  	    if (didOnEnd) return;
  	    didOnEnd = true;
  
  	    dest.end();
  	  }
  
  
  	  function onclose() {
  	    if (didOnEnd) return;
  	    didOnEnd = true;
  
  	    if (typeof dest.destroy === 'function') dest.destroy();
  	  }
  
  	  // don't leave dangling pipes when there are errors.
  	  function onerror(er) {
  	    cleanup();
  	    if (EE.listenerCount(this, 'error') === 0) {
  	      throw er; // Unhandled stream error in pipe.
  	    }
  	  }
  
  	  source.on('error', onerror);
  	  dest.on('error', onerror);
  
  	  // remove all the event listeners that were added.
  	  function cleanup() {
  	    source.removeListener('data', ondata);
  	    dest.removeListener('drain', ondrain);
  
  	    source.removeListener('end', onend);
  	    source.removeListener('close', onclose);
  
  	    source.removeListener('error', onerror);
  	    dest.removeListener('error', onerror);
  
  	    source.removeListener('end', cleanup);
  	    source.removeListener('close', cleanup);
  
  	    dest.removeListener('close', cleanup);
  	  }
  
  	  source.on('end', cleanup);
  	  source.on('close', cleanup);
  
  	  dest.on('close', cleanup);
  
  	  dest.emit('pipe', source);
  
  	  // Allow for unix-like usage: A.pipe(B).pipe(C)
  	  return dest;
  	};
  
  
  /***/ },
  /* 39 */
  /***/ function(module, exports, __webpack_require__) {
  
  	exports = module.exports = __webpack_require__(40);
  	exports.Stream = __webpack_require__(38);
  	exports.Readable = exports;
  	exports.Writable = __webpack_require__(45);
  	exports.Duplex = __webpack_require__(44);
  	exports.Transform = __webpack_require__(46);
  	exports.PassThrough = __webpack_require__(47);
  
  
  /***/ },
  /* 40 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(process) {// Copyright Joyent, Inc. and other Node contributors.
  	//
  	// Permission is hereby granted, free of charge, to any person obtaining a
  	// copy of this software and associated documentation files (the
  	// "Software"), to deal in the Software without restriction, including
  	// without limitation the rights to use, copy, modify, merge, publish,
  	// distribute, sublicense, and/or sell copies of the Software, and to permit
  	// persons to whom the Software is furnished to do so, subject to the
  	// following conditions:
  	//
  	// The above copyright notice and this permission notice shall be included
  	// in all copies or substantial portions of the Software.
  	//
  	// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  	// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  	// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
  	// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
  	// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  	// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  	// USE OR OTHER DEALINGS IN THE SOFTWARE.
  
  	module.exports = Readable;
  
  	/*<replacement>*/
  	var isArray = __webpack_require__(41);
  	/*</replacement>*/
  
  
  	/*<replacement>*/
  	var Buffer = __webpack_require__(2).Buffer;
  	/*</replacement>*/
  
  	Readable.ReadableState = ReadableState;
  
  	var EE = __webpack_require__(6).EventEmitter;
  
  	/*<replacement>*/
  	if (!EE.listenerCount) EE.listenerCount = function(emitter, type) {
  	  return emitter.listeners(type).length;
  	};
  	/*</replacement>*/
  
  	var Stream = __webpack_require__(38);
  
  	/*<replacement>*/
  	var util = __webpack_require__(42);
  	util.inherits = __webpack_require__(18);
  	/*</replacement>*/
  
  	var StringDecoder;
  
  
  	/*<replacement>*/
  	var debug = __webpack_require__(43);
  	if (debug && debug.debuglog) {
  	  debug = debug.debuglog('stream');
  	} else {
  	  debug = function () {};
  	}
  	/*</replacement>*/
  
  
  	util.inherits(Readable, Stream);
  
  	function ReadableState(options, stream) {
  	  var Duplex = __webpack_require__(44);
  
  	  options = options || {};
  
  	  // the point at which it stops calling _read() to fill the buffer
  	  // Note: 0 is a valid value, means "don't call _read preemptively ever"
  	  var hwm = options.highWaterMark;
  	  var defaultHwm = options.objectMode ? 16 : 16 * 1024;
  	  this.highWaterMark = (hwm || hwm === 0) ? hwm : defaultHwm;
  
  	  // cast to ints.
  	  this.highWaterMark = ~~this.highWaterMark;
  
  	  this.buffer = [];
  	  this.length = 0;
  	  this.pipes = null;
  	  this.pipesCount = 0;
  	  this.flowing = null;
  	  this.ended = false;
  	  this.endEmitted = false;
  	  this.reading = false;
  
  	  // a flag to be able to tell if the onwrite cb is called immediately,
  	  // or on a later tick.  We set this to true at first, because any
  	  // actions that shouldn't happen until "later" should generally also
  	  // not happen before the first write call.
  	  this.sync = true;
  
  	  // whenever we return null, then we set a flag to say
  	  // that we're awaiting a 'readable' event emission.
  	  this.needReadable = false;
  	  this.emittedReadable = false;
  	  this.readableListening = false;
  
  
  	  // object stream flag. Used to make read(n) ignore n and to
  	  // make all the buffer merging and length checks go away
  	  this.objectMode = !!options.objectMode;
  
  	  if (stream instanceof Duplex)
  	    this.objectMode = this.objectMode || !!options.readableObjectMode;
  
  	  // Crypto is kind of old and crusty.  Historically, its default string
  	  // encoding is 'binary' so we have to make this configurable.
  	  // Everything else in the universe uses 'utf8', though.
  	  this.defaultEncoding = options.defaultEncoding || 'utf8';
  
  	  // when piping, we only care about 'readable' events that happen
  	  // after read()ing all the bytes and not getting any pushback.
  	  this.ranOut = false;
  
  	  // the number of writers that are awaiting a drain event in .pipe()s
  	  this.awaitDrain = 0;
  
  	  // if true, a maybeReadMore has been scheduled
  	  this.readingMore = false;
  
  	  this.decoder = null;
  	  this.encoding = null;
  	  if (options.encoding) {
  	    if (!StringDecoder)
  	      StringDecoder = __webpack_require__(33).StringDecoder;
  	    this.decoder = new StringDecoder(options.encoding);
  	    this.encoding = options.encoding;
  	  }
  	}
  
  	function Readable(options) {
  	  var Duplex = __webpack_require__(44);
  
  	  if (!(this instanceof Readable))
  	    return new Readable(options);
  
  	  this._readableState = new ReadableState(options, this);
  
  	  // legacy
  	  this.readable = true;
  
  	  Stream.call(this);
  	}
  
  	// Manually shove something into the read() buffer.
  	// This returns true if the highWaterMark has not been hit yet,
  	// similar to how Writable.write() returns true if you should
  	// write() some more.
  	Readable.prototype.push = function(chunk, encoding) {
  	  var state = this._readableState;
  
  	  if (util.isString(chunk) && !state.objectMode) {
  	    encoding = encoding || state.defaultEncoding;
  	    if (encoding !== state.encoding) {
  	      chunk = new Buffer(chunk, encoding);
  	      encoding = '';
  	    }
  	  }
  
  	  return readableAddChunk(this, state, chunk, encoding, false);
  	};
  
  	// Unshift should *always* be something directly out of read()
  	Readable.prototype.unshift = function(chunk) {
  	  var state = this._readableState;
  	  return readableAddChunk(this, state, chunk, '', true);
  	};
  
  	function readableAddChunk(stream, state, chunk, encoding, addToFront) {
  	  var er = chunkInvalid(state, chunk);
  	  if (er) {
  	    stream.emit('error', er);
  	  } else if (util.isNullOrUndefined(chunk)) {
  	    state.reading = false;
  	    if (!state.ended)
  	      onEofChunk(stream, state);
  	  } else if (state.objectMode || chunk && chunk.length > 0) {
  	    if (state.ended && !addToFront) {
  	      var e = new Error('stream.push() after EOF');
  	      stream.emit('error', e);
  	    } else if (state.endEmitted && addToFront) {
  	      var e = new Error('stream.unshift() after end event');
  	      stream.emit('error', e);
  	    } else {
  	      if (state.decoder && !addToFront && !encoding)
  	        chunk = state.decoder.write(chunk);
  
  	      if (!addToFront)
  	        state.reading = false;
  
  	      // if we want the data now, just emit it.
  	      if (state.flowing && state.length === 0 && !state.sync) {
  	        stream.emit('data', chunk);
  	        stream.read(0);
  	      } else {
  	        // update the buffer info.
  	        state.length += state.objectMode ? 1 : chunk.length;
  	        if (addToFront)
  	          state.buffer.unshift(chunk);
  	        else
  	          state.buffer.push(chunk);
  
  	        if (state.needReadable)
  	          emitReadable(stream);
  	      }
  
  	      maybeReadMore(stream, state);
  	    }
  	  } else if (!addToFront) {
  	    state.reading = false;
  	  }
  
  	  return needMoreData(state);
  	}
  
  
  
  	// if it's past the high water mark, we can push in some more.
  	// Also, if we have no data yet, we can stand some
  	// more bytes.  This is to work around cases where hwm=0,
  	// such as the repl.  Also, if the push() triggered a
  	// readable event, and the user called read(largeNumber) such that
  	// needReadable was set, then we ought to push more, so that another
  	// 'readable' event will be triggered.
  	function needMoreData(state) {
  	  return !state.ended &&
  	         (state.needReadable ||
  	          state.length < state.highWaterMark ||
  	          state.length === 0);
  	}
  
  	// backwards compatibility.
  	Readable.prototype.setEncoding = function(enc) {
  	  if (!StringDecoder)
  	    StringDecoder = __webpack_require__(33).StringDecoder;
  	  this._readableState.decoder = new StringDecoder(enc);
  	  this._readableState.encoding = enc;
  	  return this;
  	};
  
  	// Don't raise the hwm > 128MB
  	var MAX_HWM = 0x800000;
  	function roundUpToNextPowerOf2(n) {
  	  if (n >= MAX_HWM) {
  	    n = MAX_HWM;
  	  } else {
  	    // Get the next highest power of 2
  	    n--;
  	    for (var p = 1; p < 32; p <<= 1) n |= n >> p;
  	    n++;
  	  }
  	  return n;
  	}
  
  	function howMuchToRead(n, state) {
  	  if (state.length === 0 && state.ended)
  	    return 0;
  
  	  if (state.objectMode)
  	    return n === 0 ? 0 : 1;
  
  	  if (isNaN(n) || util.isNull(n)) {
  	    // only flow one buffer at a time
  	    if (state.flowing && state.buffer.length)
  	      return state.buffer[0].length;
  	    else
  	      return state.length;
  	  }
  
  	  if (n <= 0)
  	    return 0;
  
  	  // If we're asking for more than the target buffer level,
  	  // then raise the water mark.  Bump up to the next highest
  	  // power of 2, to prevent increasing it excessively in tiny
  	  // amounts.
  	  if (n > state.highWaterMark)
  	    state.highWaterMark = roundUpToNextPowerOf2(n);
  
  	  // don't have that much.  return null, unless we've ended.
  	  if (n > state.length) {
  	    if (!state.ended) {
  	      state.needReadable = true;
  	      return 0;
  	    } else
  	      return state.length;
  	  }
  
  	  return n;
  	}
  
  	// you can override either this method, or the async _read(n) below.
  	Readable.prototype.read = function(n) {
  	  debug('read', n);
  	  var state = this._readableState;
  	  var nOrig = n;
  
  	  if (!util.isNumber(n) || n > 0)
  	    state.emittedReadable = false;
  
  	  // if we're doing read(0) to trigger a readable event, but we
  	  // already have a bunch of data in the buffer, then just trigger
  	  // the 'readable' event and move on.
  	  if (n === 0 &&
  	      state.needReadable &&
  	      (state.length >= state.highWaterMark || state.ended)) {
  	    debug('read: emitReadable', state.length, state.ended);
  	    if (state.length === 0 && state.ended)
  	      endReadable(this);
  	    else
  	      emitReadable(this);
  	    return null;
  	  }
  
  	  n = howMuchToRead(n, state);
  
  	  // if we've ended, and we're now clear, then finish it up.
  	  if (n === 0 && state.ended) {
  	    if (state.length === 0)
  	      endReadable(this);
  	    return null;
  	  }
  
  	  // All the actual chunk generation logic needs to be
  	  // *below* the call to _read.  The reason is that in certain
  	  // synthetic stream cases, such as passthrough streams, _read
  	  // may be a completely synchronous operation which may change
  	  // the state of the read buffer, providing enough data when
  	  // before there was *not* enough.
  	  //
  	  // So, the steps are:
  	  // 1. Figure out what the state of things will be after we do
  	  // a read from the buffer.
  	  //
  	  // 2. If that resulting state will trigger a _read, then call _read.
  	  // Note that this may be asynchronous, or synchronous.  Yes, it is
  	  // deeply ugly to write APIs this way, but that still doesn't mean
  	  // that the Readable class should behave improperly, as streams are
  	  // designed to be sync/async agnostic.
  	  // Take note if the _read call is sync or async (ie, if the read call
  	  // has returned yet), so that we know whether or not it's safe to emit
  	  // 'readable' etc.
  	  //
  	  // 3. Actually pull the requested chunks out of the buffer and return.
  
  	  // if we need a readable event, then we need to do some reading.
  	  var doRead = state.needReadable;
  	  debug('need readable', doRead);
  
  	  // if we currently have less than the highWaterMark, then also read some
  	  if (state.length === 0 || state.length - n < state.highWaterMark) {
  	    doRead = true;
  	    debug('length less than watermark', doRead);
  	  }
  
  	  // however, if we've ended, then there's no point, and if we're already
  	  // reading, then it's unnecessary.
  	  if (state.ended || state.reading) {
  	    doRead = false;
  	    debug('reading or ended', doRead);
  	  }
  
  	  if (doRead) {
  	    debug('do read');
  	    state.reading = true;
  	    state.sync = true;
  	    // if the length is currently zero, then we *need* a readable event.
  	    if (state.length === 0)
  	      state.needReadable = true;
  	    // call internal read method
  	    this._read(state.highWaterMark);
  	    state.sync = false;
  	  }
  
  	  // If _read pushed data synchronously, then `reading` will be false,
  	  // and we need to re-evaluate how much data we can return to the user.
  	  if (doRead && !state.reading)
  	    n = howMuchToRead(nOrig, state);
  
  	  var ret;
  	  if (n > 0)
  	    ret = fromList(n, state);
  	  else
  	    ret = null;
  
  	  if (util.isNull(ret)) {
  	    state.needReadable = true;
  	    n = 0;
  	  }
  
  	  state.length -= n;
  
  	  // If we have nothing in the buffer, then we want to know
  	  // as soon as we *do* get something into the buffer.
  	  if (state.length === 0 && !state.ended)
  	    state.needReadable = true;
  
  	  // If we tried to read() past the EOF, then emit end on the next tick.
  	  if (nOrig !== n && state.ended && state.length === 0)
  	    endReadable(this);
  
  	  if (!util.isNull(ret))
  	    this.emit('data', ret);
  
  	  return ret;
  	};
  
  	function chunkInvalid(state, chunk) {
  	  var er = null;
  	  if (!util.isBuffer(chunk) &&
  	      !util.isString(chunk) &&
  	      !util.isNullOrUndefined(chunk) &&
  	      !state.objectMode) {
  	    er = new TypeError('Invalid non-string/buffer chunk');
  	  }
  	  return er;
  	}
  
  
  	function onEofChunk(stream, state) {
  	  if (state.decoder && !state.ended) {
  	    var chunk = state.decoder.end();
  	    if (chunk && chunk.length) {
  	      state.buffer.push(chunk);
  	      state.length += state.objectMode ? 1 : chunk.length;
  	    }
  	  }
  	  state.ended = true;
  
  	  // emit 'readable' now to make sure it gets picked up.
  	  emitReadable(stream);
  	}
  
  	// Don't emit readable right away in sync mode, because this can trigger
  	// another read() call => stack overflow.  This way, it might trigger
  	// a nextTick recursion warning, but that's not so bad.
  	function emitReadable(stream) {
  	  var state = stream._readableState;
  	  state.needReadable = false;
  	  if (!state.emittedReadable) {
  	    debug('emitReadable', state.flowing);
  	    state.emittedReadable = true;
  	    if (state.sync)
  	      process.nextTick(function() {
  	        emitReadable_(stream);
  	      });
  	    else
  	      emitReadable_(stream);
  	  }
  	}
  
  	function emitReadable_(stream) {
  	  debug('emit readable');
  	  stream.emit('readable');
  	  flow(stream);
  	}
  
  
  	// at this point, the user has presumably seen the 'readable' event,
  	// and called read() to consume some data.  that may have triggered
  	// in turn another _read(n) call, in which case reading = true if
  	// it's in progress.
  	// However, if we're not ended, or reading, and the length < hwm,
  	// then go ahead and try to read some more preemptively.
  	function maybeReadMore(stream, state) {
  	  if (!state.readingMore) {
  	    state.readingMore = true;
  	    process.nextTick(function() {
  	      maybeReadMore_(stream, state);
  	    });
  	  }
  	}
  
  	function maybeReadMore_(stream, state) {
  	  var len = state.length;
  	  while (!state.reading && !state.flowing && !state.ended &&
  	         state.length < state.highWaterMark) {
  	    debug('maybeReadMore read 0');
  	    stream.read(0);
  	    if (len === state.length)
  	      // didn't get any data, stop spinning.
  	      break;
  	    else
  	      len = state.length;
  	  }
  	  state.readingMore = false;
  	}
  
  	// abstract method.  to be overridden in specific implementation classes.
  	// call cb(er, data) where data is <= n in length.
  	// for virtual (non-string, non-buffer) streams, "length" is somewhat
  	// arbitrary, and perhaps not very meaningful.
  	Readable.prototype._read = function(n) {
  	  this.emit('error', new Error('not implemented'));
  	};
  
  	Readable.prototype.pipe = function(dest, pipeOpts) {
  	  var src = this;
  	  var state = this._readableState;
  
  	  switch (state.pipesCount) {
  	    case 0:
  	      state.pipes = dest;
  	      break;
  	    case 1:
  	      state.pipes = [state.pipes, dest];
  	      break;
  	    default:
  	      state.pipes.push(dest);
  	      break;
  	  }
  	  state.pipesCount += 1;
  	  debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);
  
  	  var doEnd = (!pipeOpts || pipeOpts.end !== false) &&
  	              dest !== process.stdout &&
  	              dest !== process.stderr;
  
  	  var endFn = doEnd ? onend : cleanup;
  	  if (state.endEmitted)
  	    process.nextTick(endFn);
  	  else
  	    src.once('end', endFn);
  
  	  dest.on('unpipe', onunpipe);
  	  function onunpipe(readable) {
  	    debug('onunpipe');
  	    if (readable === src) {
  	      cleanup();
  	    }
  	  }
  
  	  function onend() {
  	    debug('onend');
  	    dest.end();
  	  }
  
  	  // when the dest drains, it reduces the awaitDrain counter
  	  // on the source.  This would be more elegant with a .once()
  	  // handler in flow(), but adding and removing repeatedly is
  	  // too slow.
  	  var ondrain = pipeOnDrain(src);
  	  dest.on('drain', ondrain);
  
  	  function cleanup() {
  	    debug('cleanup');
  	    // cleanup event handlers once the pipe is broken
  	    dest.removeListener('close', onclose);
  	    dest.removeListener('finish', onfinish);
  	    dest.removeListener('drain', ondrain);
  	    dest.removeListener('error', onerror);
  	    dest.removeListener('unpipe', onunpipe);
  	    src.removeListener('end', onend);
  	    src.removeListener('end', cleanup);
  	    src.removeListener('data', ondata);
  
  	    // if the reader is waiting for a drain event from this
  	    // specific writer, then it would cause it to never start
  	    // flowing again.
  	    // So, if this is awaiting a drain, then we just call it now.
  	    // If we don't know, then assume that we are waiting for one.
  	    if (state.awaitDrain &&
  	        (!dest._writableState || dest._writableState.needDrain))
  	      ondrain();
  	  }
  
  	  src.on('data', ondata);
  	  function ondata(chunk) {
  	    debug('ondata');
  	    var ret = dest.write(chunk);
  	    if (false === ret) {
  	      debug('false write response, pause',
  	            src._readableState.awaitDrain);
  	      src._readableState.awaitDrain++;
  	      src.pause();
  	    }
  	  }
  
  	  // if the dest has an error, then stop piping into it.
  	  // however, don't suppress the throwing behavior for this.
  	  function onerror(er) {
  	    debug('onerror', er);
  	    unpipe();
  	    dest.removeListener('error', onerror);
  	    if (EE.listenerCount(dest, 'error') === 0)
  	      dest.emit('error', er);
  	  }
  	  // This is a brutally ugly hack to make sure that our error handler
  	  // is attached before any userland ones.  NEVER DO THIS.
  	  if (!dest._events || !dest._events.error)
  	    dest.on('error', onerror);
  	  else if (isArray(dest._events.error))
  	    dest._events.error.unshift(onerror);
  	  else
  	    dest._events.error = [onerror, dest._events.error];
  
  
  
  	  // Both close and finish should trigger unpipe, but only once.
  	  function onclose() {
  	    dest.removeListener('finish', onfinish);
  	    unpipe();
  	  }
  	  dest.once('close', onclose);
  	  function onfinish() {
  	    debug('onfinish');
  	    dest.removeListener('close', onclose);
  	    unpipe();
  	  }
  	  dest.once('finish', onfinish);
  
  	  function unpipe() {
  	    debug('unpipe');
  	    src.unpipe(dest);
  	  }
  
  	  // tell the dest that it's being piped to
  	  dest.emit('pipe', src);
  
  	  // start the flow if it hasn't been started already.
  	  if (!state.flowing) {
  	    debug('pipe resume');
  	    src.resume();
  	  }
  
  	  return dest;
  	};
  
  	function pipeOnDrain(src) {
  	  return function() {
  	    var state = src._readableState;
  	    debug('pipeOnDrain', state.awaitDrain);
  	    if (state.awaitDrain)
  	      state.awaitDrain--;
  	    if (state.awaitDrain === 0 && EE.listenerCount(src, 'data')) {
  	      state.flowing = true;
  	      flow(src);
  	    }
  	  };
  	}
  
  
  	Readable.prototype.unpipe = function(dest) {
  	  var state = this._readableState;
  
  	  // if we're not piping anywhere, then do nothing.
  	  if (state.pipesCount === 0)
  	    return this;
  
  	  // just one destination.  most common case.
  	  if (state.pipesCount === 1) {
  	    // passed in one, but it's not the right one.
  	    if (dest && dest !== state.pipes)
  	      return this;
  
  	    if (!dest)
  	      dest = state.pipes;
  
  	    // got a match.
  	    state.pipes = null;
  	    state.pipesCount = 0;
  	    state.flowing = false;
  	    if (dest)
  	      dest.emit('unpipe', this);
  	    return this;
  	  }
  
  	  // slow case. multiple pipe destinations.
  
  	  if (!dest) {
  	    // remove all.
  	    var dests = state.pipes;
  	    var len = state.pipesCount;
  	    state.pipes = null;
  	    state.pipesCount = 0;
  	    state.flowing = false;
  
  	    for (var i = 0; i < len; i++)
  	      dests[i].emit('unpipe', this);
  	    return this;
  	  }
  
  	  // try to find the right one.
  	  var i = indexOf(state.pipes, dest);
  	  if (i === -1)
  	    return this;
  
  	  state.pipes.splice(i, 1);
  	  state.pipesCount -= 1;
  	  if (state.pipesCount === 1)
  	    state.pipes = state.pipes[0];
  
  	  dest.emit('unpipe', this);
  
  	  return this;
  	};
  
  	// set up data events if they are asked for
  	// Ensure readable listeners eventually get something
  	Readable.prototype.on = function(ev, fn) {
  	  var res = Stream.prototype.on.call(this, ev, fn);
  
  	  // If listening to data, and it has not explicitly been paused,
  	  // then call resume to start the flow of data on the next tick.
  	  if (ev === 'data' && false !== this._readableState.flowing) {
  	    this.resume();
  	  }
  
  	  if (ev === 'readable' && this.readable) {
  	    var state = this._readableState;
  	    if (!state.readableListening) {
  	      state.readableListening = true;
  	      state.emittedReadable = false;
  	      state.needReadable = true;
  	      if (!state.reading) {
  	        var self = this;
  	        process.nextTick(function() {
  	          debug('readable nexttick read 0');
  	          self.read(0);
  	        });
  	      } else if (state.length) {
  	        emitReadable(this, state);
  	      }
  	    }
  	  }
  
  	  return res;
  	};
  	Readable.prototype.addListener = Readable.prototype.on;
  
  	// pause() and resume() are remnants of the legacy readable stream API
  	// If the user uses them, then switch into old mode.
  	Readable.prototype.resume = function() {
  	  var state = this._readableState;
  	  if (!state.flowing) {
  	    debug('resume');
  	    state.flowing = true;
  	    if (!state.reading) {
  	      debug('resume read 0');
  	      this.read(0);
  	    }
  	    resume(this, state);
  	  }
  	  return this;
  	};
  
  	function resume(stream, state) {
  	  if (!state.resumeScheduled) {
  	    state.resumeScheduled = true;
  	    process.nextTick(function() {
  	      resume_(stream, state);
  	    });
  	  }
  	}
  
  	function resume_(stream, state) {
  	  state.resumeScheduled = false;
  	  stream.emit('resume');
  	  flow(stream);
  	  if (state.flowing && !state.reading)
  	    stream.read(0);
  	}
  
  	Readable.prototype.pause = function() {
  	  debug('call pause flowing=%j', this._readableState.flowing);
  	  if (false !== this._readableState.flowing) {
  	    debug('pause');
  	    this._readableState.flowing = false;
  	    this.emit('pause');
  	  }
  	  return this;
  	};
  
  	function flow(stream) {
  	  var state = stream._readableState;
  	  debug('flow', state.flowing);
  	  if (state.flowing) {
  	    do {
  	      var chunk = stream.read();
  	    } while (null !== chunk && state.flowing);
  	  }
  	}
  
  	// wrap an old-style stream as the async data source.
  	// This is *not* part of the readable stream interface.
  	// It is an ugly unfortunate mess of history.
  	Readable.prototype.wrap = function(stream) {
  	  var state = this._readableState;
  	  var paused = false;
  
  	  var self = this;
  	  stream.on('end', function() {
  	    debug('wrapped end');
  	    if (state.decoder && !state.ended) {
  	      var chunk = state.decoder.end();
  	      if (chunk && chunk.length)
  	        self.push(chunk);
  	    }
  
  	    self.push(null);
  	  });
  
  	  stream.on('data', function(chunk) {
  	    debug('wrapped data');
  	    if (state.decoder)
  	      chunk = state.decoder.write(chunk);
  	    if (!chunk || !state.objectMode && !chunk.length)
  	      return;
  
  	    var ret = self.push(chunk);
  	    if (!ret) {
  	      paused = true;
  	      stream.pause();
  	    }
  	  });
  
  	  // proxy all the other methods.
  	  // important when wrapping filters and duplexes.
  	  for (var i in stream) {
  	    if (util.isFunction(stream[i]) && util.isUndefined(this[i])) {
  	      this[i] = function(method) { return function() {
  	        return stream[method].apply(stream, arguments);
  	      }}(i);
  	    }
  	  }
  
  	  // proxy certain important events.
  	  var events = ['error', 'close', 'destroy', 'pause', 'resume'];
  	  forEach(events, function(ev) {
  	    stream.on(ev, self.emit.bind(self, ev));
  	  });
  
  	  // when we try to consume some more bytes, simply unpause the
  	  // underlying stream.
  	  self._read = function(n) {
  	    debug('wrapped _read', n);
  	    if (paused) {
  	      paused = false;
  	      stream.resume();
  	    }
  	  };
  
  	  return self;
  	};
  
  
  
  	// exposed for testing purposes only.
  	Readable._fromList = fromList;
  
  	// Pluck off n bytes from an array of buffers.
  	// Length is the combined lengths of all the buffers in the list.
  	function fromList(n, state) {
  	  var list = state.buffer;
  	  var length = state.length;
  	  var stringMode = !!state.decoder;
  	  var objectMode = !!state.objectMode;
  	  var ret;
  
  	  // nothing in the list, definitely empty.
  	  if (list.length === 0)
  	    return null;
  
  	  if (length === 0)
  	    ret = null;
  	  else if (objectMode)
  	    ret = list.shift();
  	  else if (!n || n >= length) {
  	    // read it all, truncate the array.
  	    if (stringMode)
  	      ret = list.join('');
  	    else
  	      ret = Buffer.concat(list, length);
  	    list.length = 0;
  	  } else {
  	    // read just some of it.
  	    if (n < list[0].length) {
  	      // just take a part of the first list item.
  	      // slice is the same for buffers and strings.
  	      var buf = list[0];
  	      ret = buf.slice(0, n);
  	      list[0] = buf.slice(n);
  	    } else if (n === list[0].length) {
  	      // first list is a perfect match
  	      ret = list.shift();
  	    } else {
  	      // complex case.
  	      // we have enough to cover it, but it spans past the first buffer.
  	      if (stringMode)
  	        ret = '';
  	      else
  	        ret = new Buffer(n);
  
  	      var c = 0;
  	      for (var i = 0, l = list.length; i < l && c < n; i++) {
  	        var buf = list[0];
  	        var cpy = Math.min(n - c, buf.length);
  
  	        if (stringMode)
  	          ret += buf.slice(0, cpy);
  	        else
  	          buf.copy(ret, c, 0, cpy);
  
  	        if (cpy < buf.length)
  	          list[0] = buf.slice(cpy);
  	        else
  	          list.shift();
  
  	        c += cpy;
  	      }
  	    }
  	  }
  
  	  return ret;
  	}
  
  	function endReadable(stream) {
  	  var state = stream._readableState;
  
  	  // If we get here before consuming all the bytes, then that is a
  	  // bug in node.  Should never happen.
  	  if (state.length > 0)
  	    throw new Error('endReadable called on non-empty stream');
  
  	  if (!state.endEmitted) {
  	    state.ended = true;
  	    process.nextTick(function() {
  	      // Check that we didn't get one last unshift.
  	      if (!state.endEmitted && state.length === 0) {
  	        state.endEmitted = true;
  	        stream.readable = false;
  	        stream.emit('end');
  	      }
  	    });
  	  }
  	}
  
  	function forEach (xs, f) {
  	  for (var i = 0, l = xs.length; i < l; i++) {
  	    f(xs[i], i);
  	  }
  	}
  
  	function indexOf (xs, x) {
  	  for (var i = 0, l = xs.length; i < l; i++) {
  	    if (xs[i] === x) return i;
  	  }
  	  return -1;
  	}
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(16)))
  
  /***/ },
  /* 41 */
  /***/ function(module, exports) {
  
  	module.exports = Array.isArray || function (arr) {
  	  return Object.prototype.toString.call(arr) == '[object Array]';
  	};
  
  
  /***/ },
  /* 42 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(Buffer) {// Copyright Joyent, Inc. and other Node contributors.
  	//
  	// Permission is hereby granted, free of charge, to any person obtaining a
  	// copy of this software and associated documentation files (the
  	// "Software"), to deal in the Software without restriction, including
  	// without limitation the rights to use, copy, modify, merge, publish,
  	// distribute, sublicense, and/or sell copies of the Software, and to permit
  	// persons to whom the Software is furnished to do so, subject to the
  	// following conditions:
  	//
  	// The above copyright notice and this permission notice shall be included
  	// in all copies or substantial portions of the Software.
  	//
  	// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  	// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  	// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
  	// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
  	// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  	// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  	// USE OR OTHER DEALINGS IN THE SOFTWARE.
  
  	// NOTE: These type checking functions intentionally don't use `instanceof`
  	// because it is fragile and can be easily faked with `Object.create()`.
  
  	function isArray(arg) {
  	  if (Array.isArray) {
  	    return Array.isArray(arg);
  	  }
  	  return objectToString(arg) === '[object Array]';
  	}
  	exports.isArray = isArray;
  
  	function isBoolean(arg) {
  	  return typeof arg === 'boolean';
  	}
  	exports.isBoolean = isBoolean;
  
  	function isNull(arg) {
  	  return arg === null;
  	}
  	exports.isNull = isNull;
  
  	function isNullOrUndefined(arg) {
  	  return arg == null;
  	}
  	exports.isNullOrUndefined = isNullOrUndefined;
  
  	function isNumber(arg) {
  	  return typeof arg === 'number';
  	}
  	exports.isNumber = isNumber;
  
  	function isString(arg) {
  	  return typeof arg === 'string';
  	}
  	exports.isString = isString;
  
  	function isSymbol(arg) {
  	  return typeof arg === 'symbol';
  	}
  	exports.isSymbol = isSymbol;
  
  	function isUndefined(arg) {
  	  return arg === void 0;
  	}
  	exports.isUndefined = isUndefined;
  
  	function isRegExp(re) {
  	  return objectToString(re) === '[object RegExp]';
  	}
  	exports.isRegExp = isRegExp;
  
  	function isObject(arg) {
  	  return typeof arg === 'object' && arg !== null;
  	}
  	exports.isObject = isObject;
  
  	function isDate(d) {
  	  return objectToString(d) === '[object Date]';
  	}
  	exports.isDate = isDate;
  
  	function isError(e) {
  	  return (objectToString(e) === '[object Error]' || e instanceof Error);
  	}
  	exports.isError = isError;
  
  	function isFunction(arg) {
  	  return typeof arg === 'function';
  	}
  	exports.isFunction = isFunction;
  
  	function isPrimitive(arg) {
  	  return arg === null ||
  	         typeof arg === 'boolean' ||
  	         typeof arg === 'number' ||
  	         typeof arg === 'string' ||
  	         typeof arg === 'symbol' ||  // ES6 symbol
  	         typeof arg === 'undefined';
  	}
  	exports.isPrimitive = isPrimitive;
  
  	exports.isBuffer = Buffer.isBuffer;
  
  	function objectToString(o) {
  	  return Object.prototype.toString.call(o);
  	}
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2).Buffer))
  
  /***/ },
  /* 43 */
  /***/ function(module, exports) {
  
  	/* (ignored) */
  
  /***/ },
  /* 44 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(process) {// Copyright Joyent, Inc. and other Node contributors.
  	//
  	// Permission is hereby granted, free of charge, to any person obtaining a
  	// copy of this software and associated documentation files (the
  	// "Software"), to deal in the Software without restriction, including
  	// without limitation the rights to use, copy, modify, merge, publish,
  	// distribute, sublicense, and/or sell copies of the Software, and to permit
  	// persons to whom the Software is furnished to do so, subject to the
  	// following conditions:
  	//
  	// The above copyright notice and this permission notice shall be included
  	// in all copies or substantial portions of the Software.
  	//
  	// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  	// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  	// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
  	// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
  	// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  	// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  	// USE OR OTHER DEALINGS IN THE SOFTWARE.
  
  	// a duplex stream is just a stream that is both readable and writable.
  	// Since JS doesn't have multiple prototypal inheritance, this class
  	// prototypally inherits from Readable, and then parasitically from
  	// Writable.
  
  	module.exports = Duplex;
  
  	/*<replacement>*/
  	var objectKeys = Object.keys || function (obj) {
  	  var keys = [];
  	  for (var key in obj) keys.push(key);
  	  return keys;
  	}
  	/*</replacement>*/
  
  
  	/*<replacement>*/
  	var util = __webpack_require__(42);
  	util.inherits = __webpack_require__(18);
  	/*</replacement>*/
  
  	var Readable = __webpack_require__(40);
  	var Writable = __webpack_require__(45);
  
  	util.inherits(Duplex, Readable);
  
  	forEach(objectKeys(Writable.prototype), function(method) {
  	  if (!Duplex.prototype[method])
  	    Duplex.prototype[method] = Writable.prototype[method];
  	});
  
  	function Duplex(options) {
  	  if (!(this instanceof Duplex))
  	    return new Duplex(options);
  
  	  Readable.call(this, options);
  	  Writable.call(this, options);
  
  	  if (options && options.readable === false)
  	    this.readable = false;
  
  	  if (options && options.writable === false)
  	    this.writable = false;
  
  	  this.allowHalfOpen = true;
  	  if (options && options.allowHalfOpen === false)
  	    this.allowHalfOpen = false;
  
  	  this.once('end', onend);
  	}
  
  	// the no-half-open enforcer
  	function onend() {
  	  // if we allow half-open state, or if the writable side ended,
  	  // then we're ok.
  	  if (this.allowHalfOpen || this._writableState.ended)
  	    return;
  
  	  // no more data can be written.
  	  // But allow more writes to happen in this tick.
  	  process.nextTick(this.end.bind(this));
  	}
  
  	function forEach (xs, f) {
  	  for (var i = 0, l = xs.length; i < l; i++) {
  	    f(xs[i], i);
  	  }
  	}
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(16)))
  
  /***/ },
  /* 45 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(process) {// Copyright Joyent, Inc. and other Node contributors.
  	//
  	// Permission is hereby granted, free of charge, to any person obtaining a
  	// copy of this software and associated documentation files (the
  	// "Software"), to deal in the Software without restriction, including
  	// without limitation the rights to use, copy, modify, merge, publish,
  	// distribute, sublicense, and/or sell copies of the Software, and to permit
  	// persons to whom the Software is furnished to do so, subject to the
  	// following conditions:
  	//
  	// The above copyright notice and this permission notice shall be included
  	// in all copies or substantial portions of the Software.
  	//
  	// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  	// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  	// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
  	// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
  	// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  	// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  	// USE OR OTHER DEALINGS IN THE SOFTWARE.
  
  	// A bit simpler than readable streams.
  	// Implement an async ._write(chunk, cb), and it'll handle all
  	// the drain event emission and buffering.
  
  	module.exports = Writable;
  
  	/*<replacement>*/
  	var Buffer = __webpack_require__(2).Buffer;
  	/*</replacement>*/
  
  	Writable.WritableState = WritableState;
  
  
  	/*<replacement>*/
  	var util = __webpack_require__(42);
  	util.inherits = __webpack_require__(18);
  	/*</replacement>*/
  
  	var Stream = __webpack_require__(38);
  
  	util.inherits(Writable, Stream);
  
  	function WriteReq(chunk, encoding, cb) {
  	  this.chunk = chunk;
  	  this.encoding = encoding;
  	  this.callback = cb;
  	}
  
  	function WritableState(options, stream) {
  	  var Duplex = __webpack_require__(44);
  
  	  options = options || {};
  
  	  // the point at which write() starts returning false
  	  // Note: 0 is a valid value, means that we always return false if
  	  // the entire buffer is not flushed immediately on write()
  	  var hwm = options.highWaterMark;
  	  var defaultHwm = options.objectMode ? 16 : 16 * 1024;
  	  this.highWaterMark = (hwm || hwm === 0) ? hwm : defaultHwm;
  
  	  // object stream flag to indicate whether or not this stream
  	  // contains buffers or objects.
  	  this.objectMode = !!options.objectMode;
  
  	  if (stream instanceof Duplex)
  	    this.objectMode = this.objectMode || !!options.writableObjectMode;
  
  	  // cast to ints.
  	  this.highWaterMark = ~~this.highWaterMark;
  
  	  this.needDrain = false;
  	  // at the start of calling end()
  	  this.ending = false;
  	  // when end() has been called, and returned
  	  this.ended = false;
  	  // when 'finish' is emitted
  	  this.finished = false;
  
  	  // should we decode strings into buffers before passing to _write?
  	  // this is here so that some node-core streams can optimize string
  	  // handling at a lower level.
  	  var noDecode = options.decodeStrings === false;
  	  this.decodeStrings = !noDecode;
  
  	  // Crypto is kind of old and crusty.  Historically, its default string
  	  // encoding is 'binary' so we have to make this configurable.
  	  // Everything else in the universe uses 'utf8', though.
  	  this.defaultEncoding = options.defaultEncoding || 'utf8';
  
  	  // not an actual buffer we keep track of, but a measurement
  	  // of how much we're waiting to get pushed to some underlying
  	  // socket or file.
  	  this.length = 0;
  
  	  // a flag to see when we're in the middle of a write.
  	  this.writing = false;
  
  	  // when true all writes will be buffered until .uncork() call
  	  this.corked = 0;
  
  	  // a flag to be able to tell if the onwrite cb is called immediately,
  	  // or on a later tick.  We set this to true at first, because any
  	  // actions that shouldn't happen until "later" should generally also
  	  // not happen before the first write call.
  	  this.sync = true;
  
  	  // a flag to know if we're processing previously buffered items, which
  	  // may call the _write() callback in the same tick, so that we don't
  	  // end up in an overlapped onwrite situation.
  	  this.bufferProcessing = false;
  
  	  // the callback that's passed to _write(chunk,cb)
  	  this.onwrite = function(er) {
  	    onwrite(stream, er);
  	  };
  
  	  // the callback that the user supplies to write(chunk,encoding,cb)
  	  this.writecb = null;
  
  	  // the amount that is being written when _write is called.
  	  this.writelen = 0;
  
  	  this.buffer = [];
  
  	  // number of pending user-supplied write callbacks
  	  // this must be 0 before 'finish' can be emitted
  	  this.pendingcb = 0;
  
  	  // emit prefinish if the only thing we're waiting for is _write cbs
  	  // This is relevant for synchronous Transform streams
  	  this.prefinished = false;
  
  	  // True if the error was already emitted and should not be thrown again
  	  this.errorEmitted = false;
  	}
  
  	function Writable(options) {
  	  var Duplex = __webpack_require__(44);
  
  	  // Writable ctor is applied to Duplexes, though they're not
  	  // instanceof Writable, they're instanceof Readable.
  	  if (!(this instanceof Writable) && !(this instanceof Duplex))
  	    return new Writable(options);
  
  	  this._writableState = new WritableState(options, this);
  
  	  // legacy.
  	  this.writable = true;
  
  	  Stream.call(this);
  	}
  
  	// Otherwise people can pipe Writable streams, which is just wrong.
  	Writable.prototype.pipe = function() {
  	  this.emit('error', new Error('Cannot pipe. Not readable.'));
  	};
  
  
  	function writeAfterEnd(stream, state, cb) {
  	  var er = new Error('write after end');
  	  // TODO: defer error events consistently everywhere, not just the cb
  	  stream.emit('error', er);
  	  process.nextTick(function() {
  	    cb(er);
  	  });
  	}
  
  	// If we get something that is not a buffer, string, null, or undefined,
  	// and we're not in objectMode, then that's an error.
  	// Otherwise stream chunks are all considered to be of length=1, and the
  	// watermarks determine how many objects to keep in the buffer, rather than
  	// how many bytes or characters.
  	function validChunk(stream, state, chunk, cb) {
  	  var valid = true;
  	  if (!util.isBuffer(chunk) &&
  	      !util.isString(chunk) &&
  	      !util.isNullOrUndefined(chunk) &&
  	      !state.objectMode) {
  	    var er = new TypeError('Invalid non-string/buffer chunk');
  	    stream.emit('error', er);
  	    process.nextTick(function() {
  	      cb(er);
  	    });
  	    valid = false;
  	  }
  	  return valid;
  	}
  
  	Writable.prototype.write = function(chunk, encoding, cb) {
  	  var state = this._writableState;
  	  var ret = false;
  
  	  if (util.isFunction(encoding)) {
  	    cb = encoding;
  	    encoding = null;
  	  }
  
  	  if (util.isBuffer(chunk))
  	    encoding = 'buffer';
  	  else if (!encoding)
  	    encoding = state.defaultEncoding;
  
  	  if (!util.isFunction(cb))
  	    cb = function() {};
  
  	  if (state.ended)
  	    writeAfterEnd(this, state, cb);
  	  else if (validChunk(this, state, chunk, cb)) {
  	    state.pendingcb++;
  	    ret = writeOrBuffer(this, state, chunk, encoding, cb);
  	  }
  
  	  return ret;
  	};
  
  	Writable.prototype.cork = function() {
  	  var state = this._writableState;
  
  	  state.corked++;
  	};
  
  	Writable.prototype.uncork = function() {
  	  var state = this._writableState;
  
  	  if (state.corked) {
  	    state.corked--;
  
  	    if (!state.writing &&
  	        !state.corked &&
  	        !state.finished &&
  	        !state.bufferProcessing &&
  	        state.buffer.length)
  	      clearBuffer(this, state);
  	  }
  	};
  
  	function decodeChunk(state, chunk, encoding) {
  	  if (!state.objectMode &&
  	      state.decodeStrings !== false &&
  	      util.isString(chunk)) {
  	    chunk = new Buffer(chunk, encoding);
  	  }
  	  return chunk;
  	}
  
  	// if we're already writing something, then just put this
  	// in the queue, and wait our turn.  Otherwise, call _write
  	// If we return false, then we need a drain event, so set that flag.
  	function writeOrBuffer(stream, state, chunk, encoding, cb) {
  	  chunk = decodeChunk(state, chunk, encoding);
  	  if (util.isBuffer(chunk))
  	    encoding = 'buffer';
  	  var len = state.objectMode ? 1 : chunk.length;
  
  	  state.length += len;
  
  	  var ret = state.length < state.highWaterMark;
  	  // we must ensure that previous needDrain will not be reset to false.
  	  if (!ret)
  	    state.needDrain = true;
  
  	  if (state.writing || state.corked)
  	    state.buffer.push(new WriteReq(chunk, encoding, cb));
  	  else
  	    doWrite(stream, state, false, len, chunk, encoding, cb);
  
  	  return ret;
  	}
  
  	function doWrite(stream, state, writev, len, chunk, encoding, cb) {
  	  state.writelen = len;
  	  state.writecb = cb;
  	  state.writing = true;
  	  state.sync = true;
  	  if (writev)
  	    stream._writev(chunk, state.onwrite);
  	  else
  	    stream._write(chunk, encoding, state.onwrite);
  	  state.sync = false;
  	}
  
  	function onwriteError(stream, state, sync, er, cb) {
  	  if (sync)
  	    process.nextTick(function() {
  	      state.pendingcb--;
  	      cb(er);
  	    });
  	  else {
  	    state.pendingcb--;
  	    cb(er);
  	  }
  
  	  stream._writableState.errorEmitted = true;
  	  stream.emit('error', er);
  	}
  
  	function onwriteStateUpdate(state) {
  	  state.writing = false;
  	  state.writecb = null;
  	  state.length -= state.writelen;
  	  state.writelen = 0;
  	}
  
  	function onwrite(stream, er) {
  	  var state = stream._writableState;
  	  var sync = state.sync;
  	  var cb = state.writecb;
  
  	  onwriteStateUpdate(state);
  
  	  if (er)
  	    onwriteError(stream, state, sync, er, cb);
  	  else {
  	    // Check if we're actually ready to finish, but don't emit yet
  	    var finished = needFinish(stream, state);
  
  	    if (!finished &&
  	        !state.corked &&
  	        !state.bufferProcessing &&
  	        state.buffer.length) {
  	      clearBuffer(stream, state);
  	    }
  
  	    if (sync) {
  	      process.nextTick(function() {
  	        afterWrite(stream, state, finished, cb);
  	      });
  	    } else {
  	      afterWrite(stream, state, finished, cb);
  	    }
  	  }
  	}
  
  	function afterWrite(stream, state, finished, cb) {
  	  if (!finished)
  	    onwriteDrain(stream, state);
  	  state.pendingcb--;
  	  cb();
  	  finishMaybe(stream, state);
  	}
  
  	// Must force callback to be called on nextTick, so that we don't
  	// emit 'drain' before the write() consumer gets the 'false' return
  	// value, and has a chance to attach a 'drain' listener.
  	function onwriteDrain(stream, state) {
  	  if (state.length === 0 && state.needDrain) {
  	    state.needDrain = false;
  	    stream.emit('drain');
  	  }
  	}
  
  
  	// if there's something in the buffer waiting, then process it
  	function clearBuffer(stream, state) {
  	  state.bufferProcessing = true;
  
  	  if (stream._writev && state.buffer.length > 1) {
  	    // Fast case, write everything using _writev()
  	    var cbs = [];
  	    for (var c = 0; c < state.buffer.length; c++)
  	      cbs.push(state.buffer[c].callback);
  
  	    // count the one we are adding, as well.
  	    // TODO(isaacs) clean this up
  	    state.pendingcb++;
  	    doWrite(stream, state, true, state.length, state.buffer, '', function(err) {
  	      for (var i = 0; i < cbs.length; i++) {
  	        state.pendingcb--;
  	        cbs[i](err);
  	      }
  	    });
  
  	    // Clear buffer
  	    state.buffer = [];
  	  } else {
  	    // Slow case, write chunks one-by-one
  	    for (var c = 0; c < state.buffer.length; c++) {
  	      var entry = state.buffer[c];
  	      var chunk = entry.chunk;
  	      var encoding = entry.encoding;
  	      var cb = entry.callback;
  	      var len = state.objectMode ? 1 : chunk.length;
  
  	      doWrite(stream, state, false, len, chunk, encoding, cb);
  
  	      // if we didn't call the onwrite immediately, then
  	      // it means that we need to wait until it does.
  	      // also, that means that the chunk and cb are currently
  	      // being processed, so move the buffer counter past them.
  	      if (state.writing) {
  	        c++;
  	        break;
  	      }
  	    }
  
  	    if (c < state.buffer.length)
  	      state.buffer = state.buffer.slice(c);
  	    else
  	      state.buffer.length = 0;
  	  }
  
  	  state.bufferProcessing = false;
  	}
  
  	Writable.prototype._write = function(chunk, encoding, cb) {
  	  cb(new Error('not implemented'));
  
  	};
  
  	Writable.prototype._writev = null;
  
  	Writable.prototype.end = function(chunk, encoding, cb) {
  	  var state = this._writableState;
  
  	  if (util.isFunction(chunk)) {
  	    cb = chunk;
  	    chunk = null;
  	    encoding = null;
  	  } else if (util.isFunction(encoding)) {
  	    cb = encoding;
  	    encoding = null;
  	  }
  
  	  if (!util.isNullOrUndefined(chunk))
  	    this.write(chunk, encoding);
  
  	  // .end() fully uncorks
  	  if (state.corked) {
  	    state.corked = 1;
  	    this.uncork();
  	  }
  
  	  // ignore unnecessary end() calls.
  	  if (!state.ending && !state.finished)
  	    endWritable(this, state, cb);
  	};
  
  
  	function needFinish(stream, state) {
  	  return (state.ending &&
  	          state.length === 0 &&
  	          !state.finished &&
  	          !state.writing);
  	}
  
  	function prefinish(stream, state) {
  	  if (!state.prefinished) {
  	    state.prefinished = true;
  	    stream.emit('prefinish');
  	  }
  	}
  
  	function finishMaybe(stream, state) {
  	  var need = needFinish(stream, state);
  	  if (need) {
  	    if (state.pendingcb === 0) {
  	      prefinish(stream, state);
  	      state.finished = true;
  	      stream.emit('finish');
  	    } else
  	      prefinish(stream, state);
  	  }
  	  return need;
  	}
  
  	function endWritable(stream, state, cb) {
  	  state.ending = true;
  	  finishMaybe(stream, state);
  	  if (cb) {
  	    if (state.finished)
  	      process.nextTick(cb);
  	    else
  	      stream.once('finish', cb);
  	  }
  	  state.ended = true;
  	}
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(16)))
  
  /***/ },
  /* 46 */
  /***/ function(module, exports, __webpack_require__) {
  
  	// Copyright Joyent, Inc. and other Node contributors.
  	//
  	// Permission is hereby granted, free of charge, to any person obtaining a
  	// copy of this software and associated documentation files (the
  	// "Software"), to deal in the Software without restriction, including
  	// without limitation the rights to use, copy, modify, merge, publish,
  	// distribute, sublicense, and/or sell copies of the Software, and to permit
  	// persons to whom the Software is furnished to do so, subject to the
  	// following conditions:
  	//
  	// The above copyright notice and this permission notice shall be included
  	// in all copies or substantial portions of the Software.
  	//
  	// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  	// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  	// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
  	// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
  	// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  	// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  	// USE OR OTHER DEALINGS IN THE SOFTWARE.
  
  
  	// a transform stream is a readable/writable stream where you do
  	// something with the data.  Sometimes it's called a "filter",
  	// but that's not a great name for it, since that implies a thing where
  	// some bits pass through, and others are simply ignored.  (That would
  	// be a valid example of a transform, of course.)
  	//
  	// While the output is causally related to the input, it's not a
  	// necessarily symmetric or synchronous transformation.  For example,
  	// a zlib stream might take multiple plain-text writes(), and then
  	// emit a single compressed chunk some time in the future.
  	//
  	// Here's how this works:
  	//
  	// The Transform stream has all the aspects of the readable and writable
  	// stream classes.  When you write(chunk), that calls _write(chunk,cb)
  	// internally, and returns false if there's a lot of pending writes
  	// buffered up.  When you call read(), that calls _read(n) until
  	// there's enough pending readable data buffered up.
  	//
  	// In a transform stream, the written data is placed in a buffer.  When
  	// _read(n) is called, it transforms the queued up data, calling the
  	// buffered _write cb's as it consumes chunks.  If consuming a single
  	// written chunk would result in multiple output chunks, then the first
  	// outputted bit calls the readcb, and subsequent chunks just go into
  	// the read buffer, and will cause it to emit 'readable' if necessary.
  	//
  	// This way, back-pressure is actually determined by the reading side,
  	// since _read has to be called to start processing a new chunk.  However,
  	// a pathological inflate type of transform can cause excessive buffering
  	// here.  For example, imagine a stream where every byte of input is
  	// interpreted as an integer from 0-255, and then results in that many
  	// bytes of output.  Writing the 4 bytes {ff,ff,ff,ff} would result in
  	// 1kb of data being output.  In this case, you could write a very small
  	// amount of input, and end up with a very large amount of output.  In
  	// such a pathological inflating mechanism, there'd be no way to tell
  	// the system to stop doing the transform.  A single 4MB write could
  	// cause the system to run out of memory.
  	//
  	// However, even in such a pathological case, only a single written chunk
  	// would be consumed, and then the rest would wait (un-transformed) until
  	// the results of the previous transformed chunk were consumed.
  
  	module.exports = Transform;
  
  	var Duplex = __webpack_require__(44);
  
  	/*<replacement>*/
  	var util = __webpack_require__(42);
  	util.inherits = __webpack_require__(18);
  	/*</replacement>*/
  
  	util.inherits(Transform, Duplex);
  
  
  	function TransformState(options, stream) {
  	  this.afterTransform = function(er, data) {
  	    return afterTransform(stream, er, data);
  	  };
  
  	  this.needTransform = false;
  	  this.transforming = false;
  	  this.writecb = null;
  	  this.writechunk = null;
  	}
  
  	function afterTransform(stream, er, data) {
  	  var ts = stream._transformState;
  	  ts.transforming = false;
  
  	  var cb = ts.writecb;
  
  	  if (!cb)
  	    return stream.emit('error', new Error('no writecb in Transform class'));
  
  	  ts.writechunk = null;
  	  ts.writecb = null;
  
  	  if (!util.isNullOrUndefined(data))
  	    stream.push(data);
  
  	  if (cb)
  	    cb(er);
  
  	  var rs = stream._readableState;
  	  rs.reading = false;
  	  if (rs.needReadable || rs.length < rs.highWaterMark) {
  	    stream._read(rs.highWaterMark);
  	  }
  	}
  
  
  	function Transform(options) {
  	  if (!(this instanceof Transform))
  	    return new Transform(options);
  
  	  Duplex.call(this, options);
  
  	  this._transformState = new TransformState(options, this);
  
  	  // when the writable side finishes, then flush out anything remaining.
  	  var stream = this;
  
  	  // start out asking for a readable event once data is transformed.
  	  this._readableState.needReadable = true;
  
  	  // we have implemented the _read method, and done the other things
  	  // that Readable wants before the first _read call, so unset the
  	  // sync guard flag.
  	  this._readableState.sync = false;
  
  	  this.once('prefinish', function() {
  	    if (util.isFunction(this._flush))
  	      this._flush(function(er) {
  	        done(stream, er);
  	      });
  	    else
  	      done(stream);
  	  });
  	}
  
  	Transform.prototype.push = function(chunk, encoding) {
  	  this._transformState.needTransform = false;
  	  return Duplex.prototype.push.call(this, chunk, encoding);
  	};
  
  	// This is the part where you do stuff!
  	// override this function in implementation classes.
  	// 'chunk' is an input chunk.
  	//
  	// Call `push(newChunk)` to pass along transformed output
  	// to the readable side.  You may call 'push' zero or more times.
  	//
  	// Call `cb(err)` when you are done with this chunk.  If you pass
  	// an error, then that'll put the hurt on the whole operation.  If you
  	// never call cb(), then you'll never get another chunk.
  	Transform.prototype._transform = function(chunk, encoding, cb) {
  	  throw new Error('not implemented');
  	};
  
  	Transform.prototype._write = function(chunk, encoding, cb) {
  	  var ts = this._transformState;
  	  ts.writecb = cb;
  	  ts.writechunk = chunk;
  	  ts.writeencoding = encoding;
  	  if (!ts.transforming) {
  	    var rs = this._readableState;
  	    if (ts.needTransform ||
  	        rs.needReadable ||
  	        rs.length < rs.highWaterMark)
  	      this._read(rs.highWaterMark);
  	  }
  	};
  
  	// Doesn't matter what the args are here.
  	// _transform does all the work.
  	// That we got here means that the readable side wants more data.
  	Transform.prototype._read = function(n) {
  	  var ts = this._transformState;
  
  	  if (!util.isNull(ts.writechunk) && ts.writecb && !ts.transforming) {
  	    ts.transforming = true;
  	    this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);
  	  } else {
  	    // mark that we need a transform, so that any data that comes in
  	    // will get processed, now that we've asked for it.
  	    ts.needTransform = true;
  	  }
  	};
  
  
  	function done(stream, er) {
  	  if (er)
  	    return stream.emit('error', er);
  
  	  // if there's nothing in the write buffer, then that means
  	  // that nothing more will ever be provided
  	  var ws = stream._writableState;
  	  var ts = stream._transformState;
  
  	  if (ws.length)
  	    throw new Error('calling transform done when ws.length != 0');
  
  	  if (ts.transforming)
  	    throw new Error('calling transform done when still transforming');
  
  	  return stream.push(null);
  	}
  
  
  /***/ },
  /* 47 */
  /***/ function(module, exports, __webpack_require__) {
  
  	// Copyright Joyent, Inc. and other Node contributors.
  	//
  	// Permission is hereby granted, free of charge, to any person obtaining a
  	// copy of this software and associated documentation files (the
  	// "Software"), to deal in the Software without restriction, including
  	// without limitation the rights to use, copy, modify, merge, publish,
  	// distribute, sublicense, and/or sell copies of the Software, and to permit
  	// persons to whom the Software is furnished to do so, subject to the
  	// following conditions:
  	//
  	// The above copyright notice and this permission notice shall be included
  	// in all copies or substantial portions of the Software.
  	//
  	// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  	// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  	// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
  	// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
  	// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  	// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  	// USE OR OTHER DEALINGS IN THE SOFTWARE.
  
  	// a passthrough stream.
  	// basically just the most minimal sort of Transform stream.
  	// Every written chunk gets output as-is.
  
  	module.exports = PassThrough;
  
  	var Transform = __webpack_require__(46);
  
  	/*<replacement>*/
  	var util = __webpack_require__(42);
  	util.inherits = __webpack_require__(18);
  	/*</replacement>*/
  
  	util.inherits(PassThrough, Transform);
  
  	function PassThrough(options) {
  	  if (!(this instanceof PassThrough))
  	    return new PassThrough(options);
  
  	  Transform.call(this, options);
  	}
  
  	PassThrough.prototype._transform = function(chunk, encoding, cb) {
  	  cb(null, chunk);
  	};
  
  
  /***/ },
  /* 48 */
  /***/ function(module, exports, __webpack_require__) {
  
  	module.exports = __webpack_require__(45)
  
  
  /***/ },
  /* 49 */
  /***/ function(module, exports, __webpack_require__) {
  
  	module.exports = __webpack_require__(44)
  
  
  /***/ },
  /* 50 */
  /***/ function(module, exports, __webpack_require__) {
  
  	module.exports = __webpack_require__(46)
  
  
  /***/ },
  /* 51 */
  /***/ function(module, exports, __webpack_require__) {
  
  	module.exports = __webpack_require__(47)
  
  
  /***/ },
  /* 52 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(process) {'use strict';
  
  	module.exports = Readable;
  
  	/*<replacement>*/
  	var processNextTick = __webpack_require__(53);
  	/*</replacement>*/
  
  	/*<replacement>*/
  	var isArray = __webpack_require__(5);
  	/*</replacement>*/
  
  	/*<replacement>*/
  	var Buffer = __webpack_require__(2).Buffer;
  	/*</replacement>*/
  
  	Readable.ReadableState = ReadableState;
  
  	var EE = __webpack_require__(6);
  
  	/*<replacement>*/
  	var EElistenerCount = function (emitter, type) {
  	  return emitter.listeners(type).length;
  	};
  	/*</replacement>*/
  
  	/*<replacement>*/
  	var Stream;
  	(function () {
  	  try {
  	    Stream = __webpack_require__(38);
  	  } catch (_) {} finally {
  	    if (!Stream) Stream = __webpack_require__(6).EventEmitter;
  	  }
  	})();
  	/*</replacement>*/
  
  	var Buffer = __webpack_require__(2).Buffer;
  
  	/*<replacement>*/
  	var util = __webpack_require__(42);
  	util.inherits = __webpack_require__(18);
  	/*</replacement>*/
  
  	/*<replacement>*/
  	var debugUtil = __webpack_require__(54);
  	var debug = undefined;
  	if (debugUtil && debugUtil.debuglog) {
  	  debug = debugUtil.debuglog('stream');
  	} else {
  	  debug = function () {};
  	}
  	/*</replacement>*/
  
  	var StringDecoder;
  
  	util.inherits(Readable, Stream);
  
  	var Duplex;
  	function ReadableState(options, stream) {
  	  Duplex = Duplex || __webpack_require__(55);
  
  	  options = options || {};
  
  	  // object stream flag. Used to make read(n) ignore n and to
  	  // make all the buffer merging and length checks go away
  	  this.objectMode = !!options.objectMode;
  
  	  if (stream instanceof Duplex) this.objectMode = this.objectMode || !!options.readableObjectMode;
  
  	  // the point at which it stops calling _read() to fill the buffer
  	  // Note: 0 is a valid value, means "don't call _read preemptively ever"
  	  var hwm = options.highWaterMark;
  	  var defaultHwm = this.objectMode ? 16 : 16 * 1024;
  	  this.highWaterMark = hwm || hwm === 0 ? hwm : defaultHwm;
  
  	  // cast to ints.
  	  this.highWaterMark = ~ ~this.highWaterMark;
  
  	  this.buffer = [];
  	  this.length = 0;
  	  this.pipes = null;
  	  this.pipesCount = 0;
  	  this.flowing = null;
  	  this.ended = false;
  	  this.endEmitted = false;
  	  this.reading = false;
  
  	  // a flag to be able to tell if the onwrite cb is called immediately,
  	  // or on a later tick.  We set this to true at first, because any
  	  // actions that shouldn't happen until "later" should generally also
  	  // not happen before the first write call.
  	  this.sync = true;
  
  	  // whenever we return null, then we set a flag to say
  	  // that we're awaiting a 'readable' event emission.
  	  this.needReadable = false;
  	  this.emittedReadable = false;
  	  this.readableListening = false;
  	  this.resumeScheduled = false;
  
  	  // Crypto is kind of old and crusty.  Historically, its default string
  	  // encoding is 'binary' so we have to make this configurable.
  	  // Everything else in the universe uses 'utf8', though.
  	  this.defaultEncoding = options.defaultEncoding || 'utf8';
  
  	  // when piping, we only care about 'readable' events that happen
  	  // after read()ing all the bytes and not getting any pushback.
  	  this.ranOut = false;
  
  	  // the number of writers that are awaiting a drain event in .pipe()s
  	  this.awaitDrain = 0;
  
  	  // if true, a maybeReadMore has been scheduled
  	  this.readingMore = false;
  
  	  this.decoder = null;
  	  this.encoding = null;
  	  if (options.encoding) {
  	    if (!StringDecoder) StringDecoder = __webpack_require__(33).StringDecoder;
  	    this.decoder = new StringDecoder(options.encoding);
  	    this.encoding = options.encoding;
  	  }
  	}
  
  	var Duplex;
  	function Readable(options) {
  	  Duplex = Duplex || __webpack_require__(55);
  
  	  if (!(this instanceof Readable)) return new Readable(options);
  
  	  this._readableState = new ReadableState(options, this);
  
  	  // legacy
  	  this.readable = true;
  
  	  if (options && typeof options.read === 'function') this._read = options.read;
  
  	  Stream.call(this);
  	}
  
  	// Manually shove something into the read() buffer.
  	// This returns true if the highWaterMark has not been hit yet,
  	// similar to how Writable.write() returns true if you should
  	// write() some more.
  	Readable.prototype.push = function (chunk, encoding) {
  	  var state = this._readableState;
  
  	  if (!state.objectMode && typeof chunk === 'string') {
  	    encoding = encoding || state.defaultEncoding;
  	    if (encoding !== state.encoding) {
  	      chunk = new Buffer(chunk, encoding);
  	      encoding = '';
  	    }
  	  }
  
  	  return readableAddChunk(this, state, chunk, encoding, false);
  	};
  
  	// Unshift should *always* be something directly out of read()
  	Readable.prototype.unshift = function (chunk) {
  	  var state = this._readableState;
  	  return readableAddChunk(this, state, chunk, '', true);
  	};
  
  	Readable.prototype.isPaused = function () {
  	  return this._readableState.flowing === false;
  	};
  
  	function readableAddChunk(stream, state, chunk, encoding, addToFront) {
  	  var er = chunkInvalid(state, chunk);
  	  if (er) {
  	    stream.emit('error', er);
  	  } else if (chunk === null) {
  	    state.reading = false;
  	    onEofChunk(stream, state);
  	  } else if (state.objectMode || chunk && chunk.length > 0) {
  	    if (state.ended && !addToFront) {
  	      var e = new Error('stream.push() after EOF');
  	      stream.emit('error', e);
  	    } else if (state.endEmitted && addToFront) {
  	      var e = new Error('stream.unshift() after end event');
  	      stream.emit('error', e);
  	    } else {
  	      var skipAdd;
  	      if (state.decoder && !addToFront && !encoding) {
  	        chunk = state.decoder.write(chunk);
  	        skipAdd = !state.objectMode && chunk.length === 0;
  	      }
  
  	      if (!addToFront) state.reading = false;
  
  	      // Don't add to the buffer if we've decoded to an empty string chunk and
  	      // we're not in object mode
  	      if (!skipAdd) {
  	        // if we want the data now, just emit it.
  	        if (state.flowing && state.length === 0 && !state.sync) {
  	          stream.emit('data', chunk);
  	          stream.read(0);
  	        } else {
  	          // update the buffer info.
  	          state.length += state.objectMode ? 1 : chunk.length;
  	          if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);
  
  	          if (state.needReadable) emitReadable(stream);
  	        }
  	      }
  
  	      maybeReadMore(stream, state);
  	    }
  	  } else if (!addToFront) {
  	    state.reading = false;
  	  }
  
  	  return needMoreData(state);
  	}
  
  	// if it's past the high water mark, we can push in some more.
  	// Also, if we have no data yet, we can stand some
  	// more bytes.  This is to work around cases where hwm=0,
  	// such as the repl.  Also, if the push() triggered a
  	// readable event, and the user called read(largeNumber) such that
  	// needReadable was set, then we ought to push more, so that another
  	// 'readable' event will be triggered.
  	function needMoreData(state) {
  	  return !state.ended && (state.needReadable || state.length < state.highWaterMark || state.length === 0);
  	}
  
  	// backwards compatibility.
  	Readable.prototype.setEncoding = function (enc) {
  	  if (!StringDecoder) StringDecoder = __webpack_require__(33).StringDecoder;
  	  this._readableState.decoder = new StringDecoder(enc);
  	  this._readableState.encoding = enc;
  	  return this;
  	};
  
  	// Don't raise the hwm > 8MB
  	var MAX_HWM = 0x800000;
  	function computeNewHighWaterMark(n) {
  	  if (n >= MAX_HWM) {
  	    n = MAX_HWM;
  	  } else {
  	    // Get the next highest power of 2
  	    n--;
  	    n |= n >>> 1;
  	    n |= n >>> 2;
  	    n |= n >>> 4;
  	    n |= n >>> 8;
  	    n |= n >>> 16;
  	    n++;
  	  }
  	  return n;
  	}
  
  	function howMuchToRead(n, state) {
  	  if (state.length === 0 && state.ended) return 0;
  
  	  if (state.objectMode) return n === 0 ? 0 : 1;
  
  	  if (n === null || isNaN(n)) {
  	    // only flow one buffer at a time
  	    if (state.flowing && state.buffer.length) return state.buffer[0].length;else return state.length;
  	  }
  
  	  if (n <= 0) return 0;
  
  	  // If we're asking for more than the target buffer level,
  	  // then raise the water mark.  Bump up to the next highest
  	  // power of 2, to prevent increasing it excessively in tiny
  	  // amounts.
  	  if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);
  
  	  // don't have that much.  return null, unless we've ended.
  	  if (n > state.length) {
  	    if (!state.ended) {
  	      state.needReadable = true;
  	      return 0;
  	    } else {
  	      return state.length;
  	    }
  	  }
  
  	  return n;
  	}
  
  	// you can override either this method, or the async _read(n) below.
  	Readable.prototype.read = function (n) {
  	  debug('read', n);
  	  var state = this._readableState;
  	  var nOrig = n;
  
  	  if (typeof n !== 'number' || n > 0) state.emittedReadable = false;
  
  	  // if we're doing read(0) to trigger a readable event, but we
  	  // already have a bunch of data in the buffer, then just trigger
  	  // the 'readable' event and move on.
  	  if (n === 0 && state.needReadable && (state.length >= state.highWaterMark || state.ended)) {
  	    debug('read: emitReadable', state.length, state.ended);
  	    if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);
  	    return null;
  	  }
  
  	  n = howMuchToRead(n, state);
  
  	  // if we've ended, and we're now clear, then finish it up.
  	  if (n === 0 && state.ended) {
  	    if (state.length === 0) endReadable(this);
  	    return null;
  	  }
  
  	  // All the actual chunk generation logic needs to be
  	  // *below* the call to _read.  The reason is that in certain
  	  // synthetic stream cases, such as passthrough streams, _read
  	  // may be a completely synchronous operation which may change
  	  // the state of the read buffer, providing enough data when
  	  // before there was *not* enough.
  	  //
  	  // So, the steps are:
  	  // 1. Figure out what the state of things will be after we do
  	  // a read from the buffer.
  	  //
  	  // 2. If that resulting state will trigger a _read, then call _read.
  	  // Note that this may be asynchronous, or synchronous.  Yes, it is
  	  // deeply ugly to write APIs this way, but that still doesn't mean
  	  // that the Readable class should behave improperly, as streams are
  	  // designed to be sync/async agnostic.
  	  // Take note if the _read call is sync or async (ie, if the read call
  	  // has returned yet), so that we know whether or not it's safe to emit
  	  // 'readable' etc.
  	  //
  	  // 3. Actually pull the requested chunks out of the buffer and return.
  
  	  // if we need a readable event, then we need to do some reading.
  	  var doRead = state.needReadable;
  	  debug('need readable', doRead);
  
  	  // if we currently have less than the highWaterMark, then also read some
  	  if (state.length === 0 || state.length - n < state.highWaterMark) {
  	    doRead = true;
  	    debug('length less than watermark', doRead);
  	  }
  
  	  // however, if we've ended, then there's no point, and if we're already
  	  // reading, then it's unnecessary.
  	  if (state.ended || state.reading) {
  	    doRead = false;
  	    debug('reading or ended', doRead);
  	  }
  
  	  if (doRead) {
  	    debug('do read');
  	    state.reading = true;
  	    state.sync = true;
  	    // if the length is currently zero, then we *need* a readable event.
  	    if (state.length === 0) state.needReadable = true;
  	    // call internal read method
  	    this._read(state.highWaterMark);
  	    state.sync = false;
  	  }
  
  	  // If _read pushed data synchronously, then `reading` will be false,
  	  // and we need to re-evaluate how much data we can return to the user.
  	  if (doRead && !state.reading) n = howMuchToRead(nOrig, state);
  
  	  var ret;
  	  if (n > 0) ret = fromList(n, state);else ret = null;
  
  	  if (ret === null) {
  	    state.needReadable = true;
  	    n = 0;
  	  }
  
  	  state.length -= n;
  
  	  // If we have nothing in the buffer, then we want to know
  	  // as soon as we *do* get something into the buffer.
  	  if (state.length === 0 && !state.ended) state.needReadable = true;
  
  	  // If we tried to read() past the EOF, then emit end on the next tick.
  	  if (nOrig !== n && state.ended && state.length === 0) endReadable(this);
  
  	  if (ret !== null) this.emit('data', ret);
  
  	  return ret;
  	};
  
  	function chunkInvalid(state, chunk) {
  	  var er = null;
  	  if (!Buffer.isBuffer(chunk) && typeof chunk !== 'string' && chunk !== null && chunk !== undefined && !state.objectMode) {
  	    er = new TypeError('Invalid non-string/buffer chunk');
  	  }
  	  return er;
  	}
  
  	function onEofChunk(stream, state) {
  	  if (state.ended) return;
  	  if (state.decoder) {
  	    var chunk = state.decoder.end();
  	    if (chunk && chunk.length) {
  	      state.buffer.push(chunk);
  	      state.length += state.objectMode ? 1 : chunk.length;
  	    }
  	  }
  	  state.ended = true;
  
  	  // emit 'readable' now to make sure it gets picked up.
  	  emitReadable(stream);
  	}
  
  	// Don't emit readable right away in sync mode, because this can trigger
  	// another read() call => stack overflow.  This way, it might trigger
  	// a nextTick recursion warning, but that's not so bad.
  	function emitReadable(stream) {
  	  var state = stream._readableState;
  	  state.needReadable = false;
  	  if (!state.emittedReadable) {
  	    debug('emitReadable', state.flowing);
  	    state.emittedReadable = true;
  	    if (state.sync) processNextTick(emitReadable_, stream);else emitReadable_(stream);
  	  }
  	}
  
  	function emitReadable_(stream) {
  	  debug('emit readable');
  	  stream.emit('readable');
  	  flow(stream);
  	}
  
  	// at this point, the user has presumably seen the 'readable' event,
  	// and called read() to consume some data.  that may have triggered
  	// in turn another _read(n) call, in which case reading = true if
  	// it's in progress.
  	// However, if we're not ended, or reading, and the length < hwm,
  	// then go ahead and try to read some more preemptively.
  	function maybeReadMore(stream, state) {
  	  if (!state.readingMore) {
  	    state.readingMore = true;
  	    processNextTick(maybeReadMore_, stream, state);
  	  }
  	}
  
  	function maybeReadMore_(stream, state) {
  	  var len = state.length;
  	  while (!state.reading && !state.flowing && !state.ended && state.length < state.highWaterMark) {
  	    debug('maybeReadMore read 0');
  	    stream.read(0);
  	    if (len === state.length)
  	      // didn't get any data, stop spinning.
  	      break;else len = state.length;
  	  }
  	  state.readingMore = false;
  	}
  
  	// abstract method.  to be overridden in specific implementation classes.
  	// call cb(er, data) where data is <= n in length.
  	// for virtual (non-string, non-buffer) streams, "length" is somewhat
  	// arbitrary, and perhaps not very meaningful.
  	Readable.prototype._read = function (n) {
  	  this.emit('error', new Error('not implemented'));
  	};
  
  	Readable.prototype.pipe = function (dest, pipeOpts) {
  	  var src = this;
  	  var state = this._readableState;
  
  	  switch (state.pipesCount) {
  	    case 0:
  	      state.pipes = dest;
  	      break;
  	    case 1:
  	      state.pipes = [state.pipes, dest];
  	      break;
  	    default:
  	      state.pipes.push(dest);
  	      break;
  	  }
  	  state.pipesCount += 1;
  	  debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);
  
  	  var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;
  
  	  var endFn = doEnd ? onend : cleanup;
  	  if (state.endEmitted) processNextTick(endFn);else src.once('end', endFn);
  
  	  dest.on('unpipe', onunpipe);
  	  function onunpipe(readable) {
  	    debug('onunpipe');
  	    if (readable === src) {
  	      cleanup();
  	    }
  	  }
  
  	  function onend() {
  	    debug('onend');
  	    dest.end();
  	  }
  
  	  // when the dest drains, it reduces the awaitDrain counter
  	  // on the source.  This would be more elegant with a .once()
  	  // handler in flow(), but adding and removing repeatedly is
  	  // too slow.
  	  var ondrain = pipeOnDrain(src);
  	  dest.on('drain', ondrain);
  
  	  var cleanedUp = false;
  	  function cleanup() {
  	    debug('cleanup');
  	    // cleanup event handlers once the pipe is broken
  	    dest.removeListener('close', onclose);
  	    dest.removeListener('finish', onfinish);
  	    dest.removeListener('drain', ondrain);
  	    dest.removeListener('error', onerror);
  	    dest.removeListener('unpipe', onunpipe);
  	    src.removeListener('end', onend);
  	    src.removeListener('end', cleanup);
  	    src.removeListener('data', ondata);
  
  	    cleanedUp = true;
  
  	    // if the reader is waiting for a drain event from this
  	    // specific writer, then it would cause it to never start
  	    // flowing again.
  	    // So, if this is awaiting a drain, then we just call it now.
  	    // If we don't know, then assume that we are waiting for one.
  	    if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();
  	  }
  
  	  src.on('data', ondata);
  	  function ondata(chunk) {
  	    debug('ondata');
  	    var ret = dest.write(chunk);
  	    if (false === ret) {
  	      // If the user unpiped during `dest.write()`, it is possible
  	      // to get stuck in a permanently paused state if that write
  	      // also returned false.
  	      if (state.pipesCount === 1 && state.pipes[0] === dest && src.listenerCount('data') === 1 && !cleanedUp) {
  	        debug('false write response, pause', src._readableState.awaitDrain);
  	        src._readableState.awaitDrain++;
  	      }
  	      src.pause();
  	    }
  	  }
  
  	  // if the dest has an error, then stop piping into it.
  	  // however, don't suppress the throwing behavior for this.
  	  function onerror(er) {
  	    debug('onerror', er);
  	    unpipe();
  	    dest.removeListener('error', onerror);
  	    if (EElistenerCount(dest, 'error') === 0) dest.emit('error', er);
  	  }
  	  // This is a brutally ugly hack to make sure that our error handler
  	  // is attached before any userland ones.  NEVER DO THIS.
  	  if (!dest._events || !dest._events.error) dest.on('error', onerror);else if (isArray(dest._events.error)) dest._events.error.unshift(onerror);else dest._events.error = [onerror, dest._events.error];
  
  	  // Both close and finish should trigger unpipe, but only once.
  	  function onclose() {
  	    dest.removeListener('finish', onfinish);
  	    unpipe();
  	  }
  	  dest.once('close', onclose);
  	  function onfinish() {
  	    debug('onfinish');
  	    dest.removeListener('close', onclose);
  	    unpipe();
  	  }
  	  dest.once('finish', onfinish);
  
  	  function unpipe() {
  	    debug('unpipe');
  	    src.unpipe(dest);
  	  }
  
  	  // tell the dest that it's being piped to
  	  dest.emit('pipe', src);
  
  	  // start the flow if it hasn't been started already.
  	  if (!state.flowing) {
  	    debug('pipe resume');
  	    src.resume();
  	  }
  
  	  return dest;
  	};
  
  	function pipeOnDrain(src) {
  	  return function () {
  	    var state = src._readableState;
  	    debug('pipeOnDrain', state.awaitDrain);
  	    if (state.awaitDrain) state.awaitDrain--;
  	    if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {
  	      state.flowing = true;
  	      flow(src);
  	    }
  	  };
  	}
  
  	Readable.prototype.unpipe = function (dest) {
  	  var state = this._readableState;
  
  	  // if we're not piping anywhere, then do nothing.
  	  if (state.pipesCount === 0) return this;
  
  	  // just one destination.  most common case.
  	  if (state.pipesCount === 1) {
  	    // passed in one, but it's not the right one.
  	    if (dest && dest !== state.pipes) return this;
  
  	    if (!dest) dest = state.pipes;
  
  	    // got a match.
  	    state.pipes = null;
  	    state.pipesCount = 0;
  	    state.flowing = false;
  	    if (dest) dest.emit('unpipe', this);
  	    return this;
  	  }
  
  	  // slow case. multiple pipe destinations.
  
  	  if (!dest) {
  	    // remove all.
  	    var dests = state.pipes;
  	    var len = state.pipesCount;
  	    state.pipes = null;
  	    state.pipesCount = 0;
  	    state.flowing = false;
  
  	    for (var _i = 0; _i < len; _i++) {
  	      dests[_i].emit('unpipe', this);
  	    }return this;
  	  }
  
  	  // try to find the right one.
  	  var i = indexOf(state.pipes, dest);
  	  if (i === -1) return this;
  
  	  state.pipes.splice(i, 1);
  	  state.pipesCount -= 1;
  	  if (state.pipesCount === 1) state.pipes = state.pipes[0];
  
  	  dest.emit('unpipe', this);
  
  	  return this;
  	};
  
  	// set up data events if they are asked for
  	// Ensure readable listeners eventually get something
  	Readable.prototype.on = function (ev, fn) {
  	  var res = Stream.prototype.on.call(this, ev, fn);
  
  	  // If listening to data, and it has not explicitly been paused,
  	  // then call resume to start the flow of data on the next tick.
  	  if (ev === 'data' && false !== this._readableState.flowing) {
  	    this.resume();
  	  }
  
  	  if (ev === 'readable' && !this._readableState.endEmitted) {
  	    var state = this._readableState;
  	    if (!state.readableListening) {
  	      state.readableListening = true;
  	      state.emittedReadable = false;
  	      state.needReadable = true;
  	      if (!state.reading) {
  	        processNextTick(nReadingNextTick, this);
  	      } else if (state.length) {
  	        emitReadable(this, state);
  	      }
  	    }
  	  }
  
  	  return res;
  	};
  	Readable.prototype.addListener = Readable.prototype.on;
  
  	function nReadingNextTick(self) {
  	  debug('readable nexttick read 0');
  	  self.read(0);
  	}
  
  	// pause() and resume() are remnants of the legacy readable stream API
  	// If the user uses them, then switch into old mode.
  	Readable.prototype.resume = function () {
  	  var state = this._readableState;
  	  if (!state.flowing) {
  	    debug('resume');
  	    state.flowing = true;
  	    resume(this, state);
  	  }
  	  return this;
  	};
  
  	function resume(stream, state) {
  	  if (!state.resumeScheduled) {
  	    state.resumeScheduled = true;
  	    processNextTick(resume_, stream, state);
  	  }
  	}
  
  	function resume_(stream, state) {
  	  if (!state.reading) {
  	    debug('resume read 0');
  	    stream.read(0);
  	  }
  
  	  state.resumeScheduled = false;
  	  stream.emit('resume');
  	  flow(stream);
  	  if (state.flowing && !state.reading) stream.read(0);
  	}
  
  	Readable.prototype.pause = function () {
  	  debug('call pause flowing=%j', this._readableState.flowing);
  	  if (false !== this._readableState.flowing) {
  	    debug('pause');
  	    this._readableState.flowing = false;
  	    this.emit('pause');
  	  }
  	  return this;
  	};
  
  	function flow(stream) {
  	  var state = stream._readableState;
  	  debug('flow', state.flowing);
  	  if (state.flowing) {
  	    do {
  	      var chunk = stream.read();
  	    } while (null !== chunk && state.flowing);
  	  }
  	}
  
  	// wrap an old-style stream as the async data source.
  	// This is *not* part of the readable stream interface.
  	// It is an ugly unfortunate mess of history.
  	Readable.prototype.wrap = function (stream) {
  	  var state = this._readableState;
  	  var paused = false;
  
  	  var self = this;
  	  stream.on('end', function () {
  	    debug('wrapped end');
  	    if (state.decoder && !state.ended) {
  	      var chunk = state.decoder.end();
  	      if (chunk && chunk.length) self.push(chunk);
  	    }
  
  	    self.push(null);
  	  });
  
  	  stream.on('data', function (chunk) {
  	    debug('wrapped data');
  	    if (state.decoder) chunk = state.decoder.write(chunk);
  
  	    // don't skip over falsy values in objectMode
  	    if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;
  
  	    var ret = self.push(chunk);
  	    if (!ret) {
  	      paused = true;
  	      stream.pause();
  	    }
  	  });
  
  	  // proxy all the other methods.
  	  // important when wrapping filters and duplexes.
  	  for (var i in stream) {
  	    if (this[i] === undefined && typeof stream[i] === 'function') {
  	      this[i] = function (method) {
  	        return function () {
  	          return stream[method].apply(stream, arguments);
  	        };
  	      }(i);
  	    }
  	  }
  
  	  // proxy certain important events.
  	  var events = ['error', 'close', 'destroy', 'pause', 'resume'];
  	  forEach(events, function (ev) {
  	    stream.on(ev, self.emit.bind(self, ev));
  	  });
  
  	  // when we try to consume some more bytes, simply unpause the
  	  // underlying stream.
  	  self._read = function (n) {
  	    debug('wrapped _read', n);
  	    if (paused) {
  	      paused = false;
  	      stream.resume();
  	    }
  	  };
  
  	  return self;
  	};
  
  	// exposed for testing purposes only.
  	Readable._fromList = fromList;
  
  	// Pluck off n bytes from an array of buffers.
  	// Length is the combined lengths of all the buffers in the list.
  	function fromList(n, state) {
  	  var list = state.buffer;
  	  var length = state.length;
  	  var stringMode = !!state.decoder;
  	  var objectMode = !!state.objectMode;
  	  var ret;
  
  	  // nothing in the list, definitely empty.
  	  if (list.length === 0) return null;
  
  	  if (length === 0) ret = null;else if (objectMode) ret = list.shift();else if (!n || n >= length) {
  	    // read it all, truncate the array.
  	    if (stringMode) ret = list.join('');else if (list.length === 1) ret = list[0];else ret = Buffer.concat(list, length);
  	    list.length = 0;
  	  } else {
  	    // read just some of it.
  	    if (n < list[0].length) {
  	      // just take a part of the first list item.
  	      // slice is the same for buffers and strings.
  	      var buf = list[0];
  	      ret = buf.slice(0, n);
  	      list[0] = buf.slice(n);
  	    } else if (n === list[0].length) {
  	      // first list is a perfect match
  	      ret = list.shift();
  	    } else {
  	      // complex case.
  	      // we have enough to cover it, but it spans past the first buffer.
  	      if (stringMode) ret = '';else ret = new Buffer(n);
  
  	      var c = 0;
  	      for (var i = 0, l = list.length; i < l && c < n; i++) {
  	        var buf = list[0];
  	        var cpy = Math.min(n - c, buf.length);
  
  	        if (stringMode) ret += buf.slice(0, cpy);else buf.copy(ret, c, 0, cpy);
  
  	        if (cpy < buf.length) list[0] = buf.slice(cpy);else list.shift();
  
  	        c += cpy;
  	      }
  	    }
  	  }
  
  	  return ret;
  	}
  
  	function endReadable(stream) {
  	  var state = stream._readableState;
  
  	  // If we get here before consuming all the bytes, then that is a
  	  // bug in node.  Should never happen.
  	  if (state.length > 0) throw new Error('endReadable called on non-empty stream');
  
  	  if (!state.endEmitted) {
  	    state.ended = true;
  	    processNextTick(endReadableNT, state, stream);
  	  }
  	}
  
  	function endReadableNT(state, stream) {
  	  // Check that we didn't get one last unshift.
  	  if (!state.endEmitted && state.length === 0) {
  	    state.endEmitted = true;
  	    stream.readable = false;
  	    stream.emit('end');
  	  }
  	}
  
  	function forEach(xs, f) {
  	  for (var i = 0, l = xs.length; i < l; i++) {
  	    f(xs[i], i);
  	  }
  	}
  
  	function indexOf(xs, x) {
  	  for (var i = 0, l = xs.length; i < l; i++) {
  	    if (xs[i] === x) return i;
  	  }
  	  return -1;
  	}
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(16)))
  
  /***/ },
  /* 53 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(process) {'use strict';
  
  	if (!process.version ||
  	    process.version.indexOf('v0.') === 0 ||
  	    process.version.indexOf('v1.') === 0 && process.version.indexOf('v1.8.') !== 0) {
  	  module.exports = nextTick;
  	} else {
  	  module.exports = process.nextTick;
  	}
  
  	function nextTick(fn) {
  	  var args = new Array(arguments.length - 1);
  	  var i = 0;
  	  while (i < args.length) {
  	    args[i++] = arguments[i];
  	  }
  	  process.nextTick(function afterTick() {
  	    fn.apply(null, args);
  	  });
  	}
  
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(16)))
  
  /***/ },
  /* 54 */
  /***/ function(module, exports) {
  
  	/* (ignored) */
  
  /***/ },
  /* 55 */
  /***/ function(module, exports, __webpack_require__) {
  
  	// a duplex stream is just a stream that is both readable and writable.
  	// Since JS doesn't have multiple prototypal inheritance, this class
  	// prototypally inherits from Readable, and then parasitically from
  	// Writable.
  
  	'use strict';
  
  	/*<replacement>*/
  
  	var objectKeys = Object.keys || function (obj) {
  	  var keys = [];
  	  for (var key in obj) {
  	    keys.push(key);
  	  }return keys;
  	};
  	/*</replacement>*/
  
  	module.exports = Duplex;
  
  	/*<replacement>*/
  	var processNextTick = __webpack_require__(53);
  	/*</replacement>*/
  
  	/*<replacement>*/
  	var util = __webpack_require__(42);
  	util.inherits = __webpack_require__(18);
  	/*</replacement>*/
  
  	var Readable = __webpack_require__(52);
  	var Writable = __webpack_require__(56);
  
  	util.inherits(Duplex, Readable);
  
  	var keys = objectKeys(Writable.prototype);
  	for (var v = 0; v < keys.length; v++) {
  	  var method = keys[v];
  	  if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];
  	}
  
  	function Duplex(options) {
  	  if (!(this instanceof Duplex)) return new Duplex(options);
  
  	  Readable.call(this, options);
  	  Writable.call(this, options);
  
  	  if (options && options.readable === false) this.readable = false;
  
  	  if (options && options.writable === false) this.writable = false;
  
  	  this.allowHalfOpen = true;
  	  if (options && options.allowHalfOpen === false) this.allowHalfOpen = false;
  
  	  this.once('end', onend);
  	}
  
  	// the no-half-open enforcer
  	function onend() {
  	  // if we allow half-open state, or if the writable side ended,
  	  // then we're ok.
  	  if (this.allowHalfOpen || this._writableState.ended) return;
  
  	  // no more data can be written.
  	  // But allow more writes to happen in this tick.
  	  processNextTick(onEndNT, this);
  	}
  
  	function onEndNT(self) {
  	  self.end();
  	}
  
  	function forEach(xs, f) {
  	  for (var i = 0, l = xs.length; i < l; i++) {
  	    f(xs[i], i);
  	  }
  	}
  
  /***/ },
  /* 56 */
  /***/ function(module, exports, __webpack_require__) {
  
  	/* WEBPACK VAR INJECTION */(function(process, setImmediate) {// A bit simpler than readable streams.
  	// Implement an async ._write(chunk, encoding, cb), and it'll handle all
  	// the drain event emission and buffering.
  
  	'use strict';
  
  	module.exports = Writable;
  
  	/*<replacement>*/
  	var processNextTick = __webpack_require__(53);
  	/*</replacement>*/
  
  	/*<replacement>*/
  	var asyncWrite = !process.browser && ['v0.10', 'v0.9.'].indexOf(process.version.slice(0, 5)) > -1 ? setImmediate : processNextTick;
  	/*</replacement>*/
  
  	/*<replacement>*/
  	var Buffer = __webpack_require__(2).Buffer;
  	/*</replacement>*/
  
  	Writable.WritableState = WritableState;
  
  	/*<replacement>*/
  	var util = __webpack_require__(42);
  	util.inherits = __webpack_require__(18);
  	/*</replacement>*/
  
  	/*<replacement>*/
  	var internalUtil = {
  	  deprecate: __webpack_require__(32)
  	};
  	/*</replacement>*/
  
  	/*<replacement>*/
  	var Stream;
  	(function () {
  	  try {
  	    Stream = __webpack_require__(38);
  	  } catch (_) {} finally {
  	    if (!Stream) Stream = __webpack_require__(6).EventEmitter;
  	  }
  	})();
  	/*</replacement>*/
  
  	var Buffer = __webpack_require__(2).Buffer;
  
  	util.inherits(Writable, Stream);
  
  	function nop() {}
  
  	function WriteReq(chunk, encoding, cb) {
  	  this.chunk = chunk;
  	  this.encoding = encoding;
  	  this.callback = cb;
  	  this.next = null;
  	}
  
  	var Duplex;
  	function WritableState(options, stream) {
  	  Duplex = Duplex || __webpack_require__(55);
  
  	  options = options || {};
  
  	  // object stream flag to indicate whether or not this stream
  	  // contains buffers or objects.
  	  this.objectMode = !!options.objectMode;
  
  	  if (stream instanceof Duplex) this.objectMode = this.objectMode || !!options.writableObjectMode;
  
  	  // the point at which write() starts returning false
  	  // Note: 0 is a valid value, means that we always return false if
  	  // the entire buffer is not flushed immediately on write()
  	  var hwm = options.highWaterMark;
  	  var defaultHwm = this.objectMode ? 16 : 16 * 1024;
  	  this.highWaterMark = hwm || hwm === 0 ? hwm : defaultHwm;
  
  	  // cast to ints.
  	  this.highWaterMark = ~ ~this.highWaterMark;
  
  	  this.needDrain = false;
  	  // at the start of calling end()
  	  this.ending = false;
  	  // when end() has been called, and returned
  	  this.ended = false;
  	  // when 'finish' is emitted
  	  this.finished = false;
  
  	  // should we decode strings into buffers before passing to _write?
  	  // this is here so that some node-core streams can optimize string
  	  // handling at a lower level.
  	  var noDecode = options.decodeStrings === false;
  	  this.decodeStrings = !noDecode;
  
  	  // Crypto is kind of old and crusty.  Historically, its default string
  	  // encoding is 'binary' so we have to make this configurable.
  	  // Everything else in the universe uses 'utf8', though.
  	  this.defaultEncoding = options.defaultEncoding || 'utf8';
  
  	  // not an actual buffer we keep track of, but a measurement
  	  // of how much we're waiting to get pushed to some underlying
  	  // socket or file.
  	  this.length = 0;
  
  	  // a flag to see when we're in the middle of a write.
  	  this.writing = false;
  
  	  // when true all writes will be buffered until .uncork() call
  	  this.corked = 0;
  
  	  // a flag to be able to tell if the onwrite cb is called immediately,
  	  // or on a later tick.  We set this to true at first, because any
  	  // actions that shouldn't happen until "later" should generally also
  	  // not happen before the first write call.
  	  this.sync = true;
  
  	  // a flag to know if we're processing previously buffered items, which
  	  // may call the _write() callback in the same tick, so that we don't
  	  // end up in an overlapped onwrite situation.
  	  this.bufferProcessing = false;
  
  	  // the callback that's passed to _write(chunk,cb)
  	  this.onwrite = function (er) {
  	    onwrite(stream, er);
  	  };
  
  	  // the callback that the user supplies to write(chunk,encoding,cb)
  	  this.writecb = null;
  
  	  // the amount that is being written when _write is called.
  	  this.writelen = 0;
  
  	  this.bufferedRequest = null;
  	  this.lastBufferedRequest = null;
  
  	  // number of pending user-supplied write callbacks
  	  // this must be 0 before 'finish' can be emitted
  	  this.pendingcb = 0;
  
  	  // emit prefinish if the only thing we're waiting for is _write cbs
  	  // This is relevant for synchronous Transform streams
  	  this.prefinished = false;
  
  	  // True if the error was already emitted and should not be thrown again
  	  this.errorEmitted = false;
  
  	  // count buffered requests
  	  this.bufferedRequestCount = 0;
  
  	  // create the two objects needed to store the corked requests
  	  // they are not a linked list, as no new elements are inserted in there
  	  this.corkedRequestsFree = new CorkedRequest(this);
  	  this.corkedRequestsFree.next = new CorkedRequest(this);
  	}
  
  	WritableState.prototype.getBuffer = function writableStateGetBuffer() {
  	  var current = this.bufferedRequest;
  	  var out = [];
  	  while (current) {
  	    out.push(current);
  	    current = current.next;
  	  }
  	  return out;
  	};
  
  	(function () {
  	  try {
  	    Object.defineProperty(WritableState.prototype, 'buffer', {
  	      get: internalUtil.deprecate(function () {
  	        return this.getBuffer();
  	      }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.')
  	    });
  	  } catch (_) {}
  	})();
  
  	var Duplex;
  	function Writable(options) {
  	  Duplex = Duplex || __webpack_require__(55);
  
  	  // Writable ctor is applied to Duplexes, though they're not
  	  // instanceof Writable, they're instanceof Readable.
  	  if (!(this instanceof Writable) && !(this instanceof Duplex)) return new Writable(options);
  
  	  this._writableState = new WritableState(options, this);
  
  	  // legacy.
  	  this.writable = true;
  
  	  if (options) {
  	    if (typeof options.write === 'function') this._write = options.write;
  
  	    if (typeof options.writev === 'function') this._writev = options.writev;
  	  }
  
  	  Stream.call(this);
  	}
  
  	// Otherwise people can pipe Writable streams, which is just wrong.
  	Writable.prototype.pipe = function () {
  	  this.emit('error', new Error('Cannot pipe. Not readable.'));
  	};
  
  	function writeAfterEnd(stream, cb) {
  	  var er = new Error('write after end');
  	  // TODO: defer error events consistently everywhere, not just the cb
  	  stream.emit('error', er);
  	  processNextTick(cb, er);
  	}
  
  	// If we get something that is not a buffer, string, null, or undefined,
  	// and we're not in objectMode, then that's an error.
  	// Otherwise stream chunks are all considered to be of length=1, and the
  	// watermarks determine how many objects to keep in the buffer, rather than
  	// how many bytes or characters.
  	function validChunk(stream, state, chunk, cb) {
  	  var valid = true;
  
  	  if (!Buffer.isBuffer(chunk) && typeof chunk !== 'string' && chunk !== null && chunk !== undefined && !state.objectMode) {
  	    var er = new TypeError('Invalid non-string/buffer chunk');
  	    stream.emit('error', er);
  	    processNextTick(cb, er);
  	    valid = false;
  	  }
  	  return valid;
  	}
  
  	Writable.prototype.write = function (chunk, encoding, cb) {
  	  var state = this._writableState;
  	  var ret = false;
  
  	  if (typeof encoding === 'function') {
  	    cb = encoding;
  	    encoding = null;
  	  }
  
  	  if (Buffer.isBuffer(chunk)) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;
  
  	  if (typeof cb !== 'function') cb = nop;
  
  	  if (state.ended) writeAfterEnd(this, cb);else if (validChunk(this, state, chunk, cb)) {
  	    state.pendingcb++;
  	    ret = writeOrBuffer(this, state, chunk, encoding, cb);
  	  }
  
  	  return ret;
  	};
  
  	Writable.prototype.cork = function () {
  	  var state = this._writableState;
  
  	  state.corked++;
  	};
  
  	Writable.prototype.uncork = function () {
  	  var state = this._writableState;
  
  	  if (state.corked) {
  	    state.corked--;
  
  	    if (!state.writing && !state.corked && !state.finished && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);
  	  }
  	};
  
  	Writable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {
  	  // node::ParseEncoding() requires lower case.
  	  if (typeof encoding === 'string') encoding = encoding.toLowerCase();
  	  if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new TypeError('Unknown encoding: ' + encoding);
  	  this._writableState.defaultEncoding = encoding;
  	};
  
  	function decodeChunk(state, chunk, encoding) {
  	  if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {
  	    chunk = new Buffer(chunk, encoding);
  	  }
  	  return chunk;
  	}
  
  	// if we're already writing something, then just put this
  	// in the queue, and wait our turn.  Otherwise, call _write
  	// If we return false, then we need a drain event, so set that flag.
  	function writeOrBuffer(stream, state, chunk, encoding, cb) {
  	  chunk = decodeChunk(state, chunk, encoding);
  
  	  if (Buffer.isBuffer(chunk)) encoding = 'buffer';
  	  var len = state.objectMode ? 1 : chunk.length;
  
  	  state.length += len;
  
  	  var ret = state.length < state.highWaterMark;
  	  // we must ensure that previous needDrain will not be reset to false.
  	  if (!ret) state.needDrain = true;
  
  	  if (state.writing || state.corked) {
  	    var last = state.lastBufferedRequest;
  	    state.lastBufferedRequest = new WriteReq(chunk, encoding, cb);
  	    if (last) {
  	      last.next = state.lastBufferedRequest;
  	    } else {
  	      state.bufferedRequest = state.lastBufferedRequest;
  	    }
  	    state.bufferedRequestCount += 1;
  	  } else {
  	    doWrite(stream, state, false, len, chunk, encoding, cb);
  	  }
  
  	  return ret;
  	}
  
  	function doWrite(stream, state, writev, len, chunk, encoding, cb) {
  	  state.writelen = len;
  	  state.writecb = cb;
  	  state.writing = true;
  	  state.sync = true;
  	  if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);
  	  state.sync = false;
  	}
  
  	function onwriteError(stream, state, sync, er, cb) {
  	  --state.pendingcb;
  	  if (sync) processNextTick(cb, er);else cb(er);
  
  	  stream._writableState.errorEmitted = true;
  	  stream.emit('error', er);
  	}
  
  	function onwriteStateUpdate(state) {
  	  state.writing = false;
  	  state.writecb = null;
  	  state.length -= state.writelen;
  	  state.writelen = 0;
  	}
  
  	function onwrite(stream, er) {
  	  var state = stream._writableState;
  	  var sync = state.sync;
  	  var cb = state.writecb;
  
  	  onwriteStateUpdate(state);
  
  	  if (er) onwriteError(stream, state, sync, er, cb);else {
  	    // Check if we're actually ready to finish, but don't emit yet
  	    var finished = needFinish(state);
  
  	    if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {
  	      clearBuffer(stream, state);
  	    }
  
  	    if (sync) {
  	      /*<replacement>*/
  	      asyncWrite(afterWrite, stream, state, finished, cb);
  	      /*</replacement>*/
  	    } else {
  	        afterWrite(stream, state, finished, cb);
  	      }
  	  }
  	}
  
  	function afterWrite(stream, state, finished, cb) {
  	  if (!finished) onwriteDrain(stream, state);
  	  state.pendingcb--;
  	  cb();
  	  finishMaybe(stream, state);
  	}
  
  	// Must force callback to be called on nextTick, so that we don't
  	// emit 'drain' before the write() consumer gets the 'false' return
  	// value, and has a chance to attach a 'drain' listener.
  	function onwriteDrain(stream, state) {
  	  if (state.length === 0 && state.needDrain) {
  	    state.needDrain = false;
  	    stream.emit('drain');
  	  }
  	}
  
  	// if there's something in the buffer waiting, then process it
  	function clearBuffer(stream, state) {
  	  state.bufferProcessing = true;
  	  var entry = state.bufferedRequest;
  
  	  if (stream._writev && entry && entry.next) {
  	    // Fast case, write everything using _writev()
  	    var l = state.bufferedRequestCount;
  	    var buffer = new Array(l);
  	    var holder = state.corkedRequestsFree;
  	    holder.entry = entry;
  
  	    var count = 0;
  	    while (entry) {
  	      buffer[count] = entry;
  	      entry = entry.next;
  	      count += 1;
  	    }
  
  	    doWrite(stream, state, true, state.length, buffer, '', holder.finish);
  
  	    // doWrite is always async, defer these to save a bit of time
  	    // as the hot path ends with doWrite
  	    state.pendingcb++;
  	    state.lastBufferedRequest = null;
  	    state.corkedRequestsFree = holder.next;
  	    holder.next = null;
  	  } else {
  	    // Slow case, write chunks one-by-one
  	    while (entry) {
  	      var chunk = entry.chunk;
  	      var encoding = entry.encoding;
  	      var cb = entry.callback;
  	      var len = state.objectMode ? 1 : chunk.length;
  
  	      doWrite(stream, state, false, len, chunk, encoding, cb);
  	      entry = entry.next;
  	      // if we didn't call the onwrite immediately, then
  	      // it means that we need to wait until it does.
  	      // also, that means that the chunk and cb are currently
  	      // being processed, so move the buffer counter past them.
  	      if (state.writing) {
  	        break;
  	      }
  	    }
  
  	    if (entry === null) state.lastBufferedRequest = null;
  	  }
  
  	  state.bufferedRequestCount = 0;
  	  state.bufferedRequest = entry;
  	  state.bufferProcessing = false;
  	}
  
  	Writable.prototype._write = function (chunk, encoding, cb) {
  	  cb(new Error('not implemented'));
  	};
  
  	Writable.prototype._writev = null;
  
  	Writable.prototype.end = function (chunk, encoding, cb) {
  	  var state = this._writableState;
  
  	  if (typeof chunk === 'function') {
  	    cb = chunk;
  	    chunk = null;
  	    encoding = null;
  	  } else if (typeof encoding === 'function') {
  	    cb = encoding;
  	    encoding = null;
  	  }
  
  	  if (chunk !== null && chunk !== undefined) this.write(chunk, encoding);
  
  	  // .end() fully uncorks
  	  if (state.corked) {
  	    state.corked = 1;
  	    this.uncork();
  	  }
  
  	  // ignore unnecessary end() calls.
  	  if (!state.ending && !state.finished) endWritable(this, state, cb);
  	};
  
  	function needFinish(state) {
  	  return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;
  	}
  
  	function prefinish(stream, state) {
  	  if (!state.prefinished) {
  	    state.prefinished = true;
  	    stream.emit('prefinish');
  	  }
  	}
  
  	function finishMaybe(stream, state) {
  	  var need = needFinish(state);
  	  if (need) {
  	    if (state.pendingcb === 0) {
  	      prefinish(stream, state);
  	      state.finished = true;
  	      stream.emit('finish');
  	    } else {
  	      prefinish(stream, state);
  	    }
  	  }
  	  return need;
  	}
  
  	function endWritable(stream, state, cb) {
  	  state.ending = true;
  	  finishMaybe(stream, state);
  	  if (cb) {
  	    if (state.finished) processNextTick(cb);else stream.once('finish', cb);
  	  }
  	  state.ended = true;
  	  stream.writable = false;
  	}
  
  	// It seems a linked list but it is not
  	// there will be only 2 of these for each stream
  	function CorkedRequest(state) {
  	  var _this = this;
  
  	  this.next = null;
  	  this.entry = null;
  
  	  this.finish = function (err) {
  	    var entry = _this.entry;
  	    _this.entry = null;
  	    while (entry) {
  	      var cb = entry.callback;
  	      state.pendingcb--;
  	      cb(err);
  	      entry = entry.next;
  	    }
  	    if (state.corkedRequestsFree) {
  	      state.corkedRequestsFree.next = _this;
  	    } else {
  	      state.corkedRequestsFree = _this;
  	    }
  	  };
  	}
  	/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(16), __webpack_require__(30).setImmediate))
  
  /***/ },
  /* 57 */
  /***/ function(module, exports, __webpack_require__) {
  
  	// a transform stream is a readable/writable stream where you do
  	// something with the data.  Sometimes it's called a "filter",
  	// but that's not a great name for it, since that implies a thing where
  	// some bits pass through, and others are simply ignored.  (That would
  	// be a valid example of a transform, of course.)
  	//
  	// While the output is causally related to the input, it's not a
  	// necessarily symmetric or synchronous transformation.  For example,
  	// a zlib stream might take multiple plain-text writes(), and then
  	// emit a single compressed chunk some time in the future.
  	//
  	// Here's how this works:
  	//
  	// The Transform stream has all the aspects of the readable and writable
  	// stream classes.  When you write(chunk), that calls _write(chunk,cb)
  	// internally, and returns false if there's a lot of pending writes
  	// buffered up.  When you call read(), that calls _read(n) until
  	// there's enough pending readable data buffered up.
  	//
  	// In a transform stream, the written data is placed in a buffer.  When
  	// _read(n) is called, it transforms the queued up data, calling the
  	// buffered _write cb's as it consumes chunks.  If consuming a single
  	// written chunk would result in multiple output chunks, then the first
  	// outputted bit calls the readcb, and subsequent chunks just go into
  	// the read buffer, and will cause it to emit 'readable' if necessary.
  	//
  	// This way, back-pressure is actually determined by the reading side,
  	// since _read has to be called to start processing a new chunk.  However,
  	// a pathological inflate type of transform can cause excessive buffering
  	// here.  For example, imagine a stream where every byte of input is
  	// interpreted as an integer from 0-255, and then results in that many
  	// bytes of output.  Writing the 4 bytes {ff,ff,ff,ff} would result in
  	// 1kb of data being output.  In this case, you could write a very small
  	// amount of input, and end up with a very large amount of output.  In
  	// such a pathological inflating mechanism, there'd be no way to tell
  	// the system to stop doing the transform.  A single 4MB write could
  	// cause the system to run out of memory.
  	//
  	// However, even in such a pathological case, only a single written chunk
  	// would be consumed, and then the rest would wait (un-transformed) until
  	// the results of the previous transformed chunk were consumed.
  
  	'use strict';
  
  	module.exports = Transform;
  
  	var Duplex = __webpack_require__(55);
  
  	/*<replacement>*/
  	var util = __webpack_require__(42);
  	util.inherits = __webpack_require__(18);
  	/*</replacement>*/
  
  	util.inherits(Transform, Duplex);
  
  	function TransformState(stream) {
  	  this.afterTransform = function (er, data) {
  	    return afterTransform(stream, er, data);
  	  };
  
  	  this.needTransform = false;
  	  this.transforming = false;
  	  this.writecb = null;
  	  this.writechunk = null;
  	  this.writeencoding = null;
  	}
  
  	function afterTransform(stream, er, data) {
  	  var ts = stream._transformState;
  	  ts.transforming = false;
  
  	  var cb = ts.writecb;
  
  	  if (!cb) return stream.emit('error', new Error('no writecb in Transform class'));
  
  	  ts.writechunk = null;
  	  ts.writecb = null;
  
  	  if (data !== null && data !== undefined) stream.push(data);
  
  	  cb(er);
  
  	  var rs = stream._readableState;
  	  rs.reading = false;
  	  if (rs.needReadable || rs.length < rs.highWaterMark) {
  	    stream._read(rs.highWaterMark);
  	  }
  	}
  
  	function Transform(options) {
  	  if (!(this instanceof Transform)) return new Transform(options);
  
  	  Duplex.call(this, options);
  
  	  this._transformState = new TransformState(this);
  
  	  // when the writable side finishes, then flush out anything remaining.
  	  var stream = this;
  
  	  // start out asking for a readable event once data is transformed.
  	  this._readableState.needReadable = true;
  
  	  // we have implemented the _read method, and done the other things
  	  // that Readable wants before the first _read call, so unset the
  	  // sync guard flag.
  	  this._readableState.sync = false;
  
  	  if (options) {
  	    if (typeof options.transform === 'function') this._transform = options.transform;
  
  	    if (typeof options.flush === 'function') this._flush = options.flush;
  	  }
  
  	  this.once('prefinish', function () {
  	    if (typeof this._flush === 'function') this._flush(function (er) {
  	      done(stream, er);
  	    });else done(stream);
  	  });
  	}
  
  	Transform.prototype.push = function (chunk, encoding) {
  	  this._transformState.needTransform = false;
  	  return Duplex.prototype.push.call(this, chunk, encoding);
  	};
  
  	// This is the part where you do stuff!
  	// override this function in implementation classes.
  	// 'chunk' is an input chunk.
  	//
  	// Call `push(newChunk)` to pass along transformed output
  	// to the readable side.  You may call 'push' zero or more times.
  	//
  	// Call `cb(err)` when you are done with this chunk.  If you pass
  	// an error, then that'll put the hurt on the whole operation.  If you
  	// never call cb(), then you'll never get another chunk.
  	Transform.prototype._transform = function (chunk, encoding, cb) {
  	  throw new Error('not implemented');
  	};
  
  	Transform.prototype._write = function (chunk, encoding, cb) {
  	  var ts = this._transformState;
  	  ts.writecb = cb;
  	  ts.writechunk = chunk;
  	  ts.writeencoding = encoding;
  	  if (!ts.transforming) {
  	    var rs = this._readableState;
  	    if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);
  	  }
  	};
  
  	// Doesn't matter what the args are here.
  	// _transform does all the work.
  	// That we got here means that the readable side wants more data.
  	Transform.prototype._read = function (n) {
  	  var ts = this._transformState;
  
  	  if (ts.writechunk !== null && ts.writecb && !ts.transforming) {
  	    ts.transforming = true;
  	    this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);
  	  } else {
  	    // mark that we need a transform, so that any data that comes in
  	    // will get processed, now that we've asked for it.
  	    ts.needTransform = true;
  	  }
  	};
  
  	function done(stream, er) {
  	  if (er) return stream.emit('error', er);
  
  	  // if there's nothing in the write buffer, then that means
  	  // that nothing more will ever be provided
  	  var ws = stream._writableState;
  	  var ts = stream._transformState;
  
  	  if (ws.length) throw new Error('calling transform done when ws.length != 0');
  
  	  if (ts.transforming) throw new Error('calling transform done when still transforming');
  
  	  return stream.push(null);
  	}
  
  /***/ },
  /* 58 */
  /***/ function(module, exports, __webpack_require__) {
  
  	// a passthrough stream.
  	// basically just the most minimal sort of Transform stream.
  	// Every written chunk gets output as-is.
  
  	'use strict';
  
  	module.exports = PassThrough;
  
  	var Transform = __webpack_require__(57);
  
  	/*<replacement>*/
  	var util = __webpack_require__(42);
  	util.inherits = __webpack_require__(18);
  	/*</replacement>*/
  
  	util.inherits(PassThrough, Transform);
  
  	function PassThrough(options) {
  	  if (!(this instanceof PassThrough)) return new PassThrough(options);
  
  	  Transform.call(this, options);
  	}
  
  	PassThrough.prototype._transform = function (chunk, encoding, cb) {
  	  cb(null, chunk);
  	};
  
  /***/ },
  /* 59 */
  /***/ function(module, exports, __webpack_require__) {
  
  	'use strict';
  
  	Object.defineProperty(exports, "__esModule", {
  	  value: true
  	});
  
  	var _highland = __webpack_require__(29);
  
  	var _highland2 = _interopRequireDefault(_highland);
  
  	var _lodash = __webpack_require__(27);
  
  	var _lodash2 = _interopRequireDefault(_lodash);
  
  	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
  
  	function defaultExecuteHandler(messageStream, callback) {
  	  var errored = false;
  	  var objectMode = false;
  
  	  (0, _highland2.default)(messageStream).stopOnError(function (err) {
  	    // TODO: this does not seem to halt the stream properly, and make
  	    // the callback being fired twice. We need to get rid of the ugly
  	    // errored variable check.
  	    errored = true;
  	    callback(err);
  	  }).map(function (_ref) {
  	    var data = _ref.result.data;
  
  	    objectMode = !_lodash2.default.isArray(data);
  
  	    return data;
  	  }).sequence().toArray(function (results) {
  	    if (!errored) {
  	      callback(null, objectMode ? results[0] : results);
  	    }
  	  });
  	}
  
  	exports.default = defaultExecuteHandler;
  	//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbInNyYy9leGVjdXRlSGFuZGxlci5qcyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7Ozs7QUFBQTs7OztBQUNBOzs7Ozs7QUFHQSxTQUFTLHFCQUFULENBQStCLGFBQS9CLEVBQThDLFFBQTlDLEVBQXdEO0FBQ3RELE1BQUksVUFBVSxLQUFWLENBRGtEO0FBRXRELE1BQUksYUFBYSxLQUFiLENBRmtEOztBQUl0RCwwQkFBUyxhQUFULEVBQ0csV0FESCxDQUNlLFVBQUMsR0FBRCxFQUFTOzs7O0FBSXBCLGNBQVUsSUFBVixDQUpvQjtBQUtwQixhQUFTLEdBQVQsRUFMb0I7R0FBVCxDQURmLENBUUcsR0FSSCxDQVFPLGdCQUEwQjtRQUFiLFlBQVYsT0FBVSxLQUFhOztBQUM3QixpQkFBYSxDQUFDLGlCQUFFLE9BQUYsQ0FBVSxJQUFWLENBQUQsQ0FEZ0I7O0FBRzdCLFdBQU8sSUFBUCxDQUg2QjtHQUExQixDQVJQLENBYUcsUUFiSCxHQWNHLE9BZEgsQ0FjVyxVQUFDLE9BQUQsRUFBYTtBQUNwQixRQUFJLENBQUMsT0FBRCxFQUFVO0FBQ1osZUFBUyxJQUFULEVBQWUsYUFBYSxRQUFRLENBQVIsQ0FBYixHQUEwQixPQUExQixDQUFmLENBRFk7S0FBZDtHQURPLENBZFgsQ0FKc0Q7Q0FBeEQ7O2tCQXlCZSIsImZpbGUiOiJleGVjdXRlSGFuZGxlci5qcyIsInNvdXJjZVJvb3QiOiIvVXNlcnMvdmljdG9yL0Rlc2t0b3AvZ3JlbWxpbi1qYXZhc2NyaXB0Iiwic291cmNlc0NvbnRlbnQiOlsiaW1wb3J0IGhpZ2hsYW5kIGZyb20gJ2hpZ2hsYW5kJztcbmltcG9ydCBfIGZyb20gJ2xvZGFzaCc7XG5cblxuZnVuY3Rpb24gZGVmYXVsdEV4ZWN1dGVIYW5kbGVyKG1lc3NhZ2VTdHJlYW0sIGNhbGxiYWNrKSB7XG4gIGxldCBlcnJvcmVkID0gZmFsc2U7XG4gIGxldCBvYmplY3RNb2RlID0gZmFsc2U7XG5cbiAgaGlnaGxhbmQobWVzc2FnZVN0cmVhbSlcbiAgICAuc3RvcE9uRXJyb3IoKGVycikgPT4ge1xuICAgICAgLy8gVE9ETzogdGhpcyBkb2VzIG5vdCBzZWVtIHRvIGhhbHQgdGhlIHN0cmVhbSBwcm9wZXJseSwgYW5kIG1ha2VcbiAgICAgIC8vIHRoZSBjYWxsYmFjayBiZWluZyBmaXJlZCB0d2ljZS4gV2UgbmVlZCB0byBnZXQgcmlkIG9mIHRoZSB1Z2x5XG4gICAgICAvLyBlcnJvcmVkIHZhcmlhYmxlIGNoZWNrLlxuICAgICAgZXJyb3JlZCA9IHRydWU7XG4gICAgICBjYWxsYmFjayhlcnIpO1xuICAgIH0pXG4gICAgLm1hcCgoeyByZXN1bHQ6IHvCoGRhdGEgfSB9KSA9PiB7XG4gICAgICBvYmplY3RNb2RlID0gIV8uaXNBcnJheShkYXRhKTtcblxuICAgICAgcmV0dXJuIGRhdGE7XG4gICAgfSlcbiAgICAuc2VxdWVuY2UoKVxuICAgIC50b0FycmF5KChyZXN1bHRzKSA9PiB7XG4gICAgICBpZiAoIWVycm9yZWQpIHtcbiAgICAgICAgY2FsbGJhY2sobnVsbCwgb2JqZWN0TW9kZSA/IHJlc3VsdHNbMF0gOiByZXN1bHRzKTtcbiAgICAgIH1cbiAgICB9KTtcbn1cblxuZXhwb3J0IGRlZmF1bHQgZGVmYXVsdEV4ZWN1dGVIYW5kbGVyO1xuIl19
  
  /***/ },
  /* 60 */
  /***/ function(module, exports, __webpack_require__) {
  
  	'use strict';
  
  	Object.defineProperty(exports, "__esModule", {
  	  value: true
  	});
  
  	var _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };
  
  	exports.extractFunctionBody = extractFunctionBody;
  	exports.buildQueryFromSignature = buildQueryFromSignature;
  
  	var _lodash = __webpack_require__(27);
  
  	var _lodash2 = _interopRequireDefault(_lodash);
  
  	function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
  
  	/**
  	 * Get the inner function body from a function.toString() representation
  	 *
  	 * @param {Function}
  	 * @return {String}
  	 */
  	function extractFunctionBody(fn) {
  	  var body = fn.toString();
  	  var trimmedBody = body.substring(body.indexOf('{') + 1, body.lastIndexOf('}'));
  
  	  return trimmedBody;
  	};
  
  	/**
  	 * Given optional and polymorphic arguments, return an object with a raw
  	 * 'gremlin' string and optional 'bindings' object.
  	 * When supplying a query object as first parameter, any bindings supplied
  	 * as the last parameter will be shallow-merged.
  	 *
  	 * @param {String|Object|Function} rawScript
  	 * @param {Object} rawBindings
  	 * @return {Object}: { gremlin<String>, bindings<Object> }
  	 */
  	function buildQueryFromSignature() {
  	  var rawScript = arguments.length <= 0 || arguments[0] === undefined ? '' : arguments[0];
  	  var rawBindings = arguments[1];
  
  	  if (typeof rawScript === 'function') {
  	    return {
  	      gremlin: extractFunctionBody(rawScript),
  	      bindings: rawBindings
  	    };
  	  }
  
  	  var _rawScript$gremlin = rawScript.gremlin;
  	  var gremlin = _rawScript$gremlin === undefined ? rawScript : _rawScript$gremlin;
  	  var _rawScript$bindings = rawScript.bindings;
  	  var bindings = _rawScript$bindings === undefined ? rawBindings : _rawScript$bindings;
  
  
  	  return {
  	    gremlin: gremlin,
  	    // Remap 'undefined' bindings as 'null' values that would otherwise
  	    // result in missing/unbound variables in the Gremlin script execution
  	    // context.
  	    bindings: _lodash2.default.mapValues(_extends({}, bindings, rawBindings), function (value) {
  	      return _lodash2.default.isUndefined(value) ? null : value;
  	    })
  	  };
  	}
  	//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbInNyYy91dGlscy5qcyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7Ozs7OztRQVFnQjtRQWlCQTs7QUF6QmhCOzs7Ozs7Ozs7Ozs7QUFRTyxTQUFTLG1CQUFULENBQTZCLEVBQTdCLEVBQWlDO0FBQ3RDLE1BQU0sT0FBTyxHQUFHLFFBQUgsRUFBUCxDQURnQztBQUV0QyxNQUFNLGNBQWMsS0FBSyxTQUFMLENBQWUsS0FBSyxPQUFMLENBQWEsR0FBYixJQUFvQixDQUFwQixFQUF1QixLQUFLLFdBQUwsQ0FBaUIsR0FBakIsQ0FBdEMsQ0FBZCxDQUZnQzs7QUFJdEMsU0FBTyxXQUFQLENBSnNDO0NBQWpDOzs7Ozs7Ozs7Ozs7QUFpQkEsU0FBUyx1QkFBVCxHQUE4RDtNQUE3QixrRUFBWSxrQkFBaUI7TUFBYiwyQkFBYTs7QUFDbkUsTUFBSSxPQUFPLFNBQVAsS0FBcUIsVUFBckIsRUFBaUM7QUFDbkMsV0FBTztBQUNMLGVBQVMsb0JBQW9CLFNBQXBCLENBQVQ7QUFDQSxnQkFBVSxXQUFWO0tBRkYsQ0FEbUM7R0FBckM7OzJCQVVJLFVBRkYsUUFUaUU7TUFTakUsNkNBQVUsK0JBVHVEOzRCQVcvRCxVQURGLFNBVmlFO01BVWpFLCtDQUFXLGtDQVZzRDs7O0FBYW5FLFNBQU87QUFDTCxvQkFESzs7OztBQUtMLGNBQVUsaUJBQUUsU0FBRixjQUFpQixVQUFhLFlBQTlCLEVBQTZDLFVBQUMsS0FBRDthQUFXLGlCQUFFLFdBQUYsQ0FBYyxLQUFkLElBQXVCLElBQXZCLEdBQThCLEtBQTlCO0tBQVgsQ0FBdkQ7R0FMRixDQWJtRTtDQUE5RCIsImZpbGUiOiJ1dGlscy5qcyIsInNvdXJjZVJvb3QiOiIvVXNlcnMvdmljdG9yL0Rlc2t0b3AvZ3JlbWxpbi1qYXZhc2NyaXB0Iiwic291cmNlc0NvbnRlbnQiOlsiaW1wb3J0IF8gZnJvbSAnbG9kYXNoJztcblxuLyoqXG4gKiBHZXQgdGhlIGlubmVyIGZ1bmN0aW9uIGJvZHkgZnJvbSBhIGZ1bmN0aW9uLnRvU3RyaW5nKCkgcmVwcmVzZW50YXRpb25cbiAqXG4gKiBAcGFyYW0ge0Z1bmN0aW9ufVxuICogQHJldHVybiB7U3RyaW5nfVxuICovXG5leHBvcnQgZnVuY3Rpb24gZXh0cmFjdEZ1bmN0aW9uQm9keShmbikge1xuICBjb25zdCBib2R5ID0gZm4udG9TdHJpbmcoKTtcbiAgY29uc3QgdHJpbW1lZEJvZHkgPSBib2R5LnN1YnN0cmluZyhib2R5LmluZGV4T2YoJ3snKSArIDEsIGJvZHkubGFzdEluZGV4T2YoJ30nKSk7XG5cbiAgcmV0dXJuIHRyaW1tZWRCb2R5O1xufTtcblxuLyoqXG4gKiBHaXZlbiBvcHRpb25hbCBhbmQgcG9seW1vcnBoaWMgYXJndW1lbnRzLCByZXR1cm4gYW4gb2JqZWN0IHdpdGggYSByYXdcbiAqICdncmVtbGluJyBzdHJpbmcgYW5kIG9wdGlvbmFsICdiaW5kaW5ncycgb2JqZWN0LlxuICogV2hlbiBzdXBwbHlpbmcgYSBxdWVyeSBvYmplY3QgYXMgZmlyc3QgcGFyYW1ldGVyLCBhbnkgYmluZGluZ3Mgc3VwcGxpZWRcbiAqIGFzIHRoZSBsYXN0IHBhcmFtZXRlciB3aWxsIGJlIHNoYWxsb3ctbWVyZ2VkLlxuICpcbiAqIEBwYXJhbSB7U3RyaW5nfE9iamVjdHxGdW5jdGlvbn0gcmF3U2NyaXB0XG4gKiBAcGFyYW0ge09iamVjdH0gcmF3QmluZGluZ3NcbiAqIEByZXR1cm4ge09iamVjdH06IHsgZ3JlbWxpbjxTdHJpbmc+LCBiaW5kaW5nczxPYmplY3Q+IH1cbiAqL1xuZXhwb3J0IGZ1bmN0aW9uIGJ1aWxkUXVlcnlGcm9tU2lnbmF0dXJlKHJhd1NjcmlwdCA9ICcnLCByYXdCaW5kaW5ncykge1xuICBpZiAodHlwZW9mIHJhd1NjcmlwdCA9PT0gJ2Z1bmN0aW9uJykge1xuICAgIHJldHVybiB7XG4gICAgICBncmVtbGluOiBleHRyYWN0RnVuY3Rpb25Cb2R5KHJhd1NjcmlwdCksXG4gICAgICBiaW5kaW5nczogcmF3QmluZGluZ3NcbiAgICB9O1xuICB9XG5cbiAgY29uc3Qge1xuICAgIGdyZW1saW4gPSByYXdTY3JpcHQsXG4gICAgYmluZGluZ3MgPSByYXdCaW5kaW5nc1xuICB9ID0gcmF3U2NyaXB0O1xuXG4gIHJldHVybiB7XG4gICAgZ3JlbWxpbixcbiAgICAvLyBSZW1hcCAndW5kZWZpbmVkJyBiaW5kaW5ncyBhcyAnbnVsbCcgdmFsdWVzIHRoYXQgd291bGQgb3RoZXJ3aXNlXG4gICAgLy8gcmVzdWx0IGluIG1pc3NpbmcvdW5ib3VuZCB2YXJpYWJsZXMgaW4gdGhlIEdyZW1saW4gc2NyaXB0IGV4ZWN1dGlvblxuICAgIC8vIGNvbnRleHQuXG4gICAgYmluZGluZ3M6IF8ubWFwVmFsdWVzKHsgLi4uYmluZGluZ3MsIC4uLnJhd0JpbmRpbmdzIH0sICh2YWx1ZSkgPT4gXy5pc1VuZGVmaW5lZCh2YWx1ZSkgPyBudWxsIDogdmFsdWUpXG4gIH07XG59XG4iXX0=
  
  /***/ },
  /* 61 */
  /***/ function(module, exports) {
  
  	/**
  	 * A template function to be used with ES6 template strings.
  	 * This returns an object with an escaped `gremlin` (String) key and a
  	 * `bindings` (Object/map of bound parameters) key.
  	 *
  	 * @param {String} rawString - a raw Gremlin string
  	 * @return {Object}
  	 */
  	function createGremlinQuery(rawString) {
  	  var gremlin = '';
  	  var bindings = {};
  	  var inlineParams = [].slice.call(arguments, 1);
  	  var paramIdentifier;
  
  	  for (var i = 0; i < inlineParams.length; ++i) {
  	    paramIdentifier = 'p' + (i + 1);
  	    gremlin += rawString[i] + paramIdentifier;
  	    bindings[paramIdentifier] = inlineParams[i];
  	  }
  
  	  gremlin += rawString[inlineParams.length];
  
  	  return { gremlin: gremlin, bindings: bindings };
  	}
  
  	module.exports = createGremlinQuery;
  
  
  /***/ }
  /******/ ])
  });
  ;